Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Babenko, Maxim A."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An improved algorithm for packing
T
-paths in inner Eulerian networks
Maxim A. Babenko
,
Kamil Salikhov
,
Stepan Artamonov
Lecture Notes in Computer Science
7434
, 2012, pp. 109-120
Improved algorithms for even factors and square-free simple
b
-matchings
Maxim A. Babenko
Algorithmica
64
(3), 2012, pp. 362-383
An efficient scaling algorithm for the minimum weight bibranching problem
Maxim A. Babenko
Algorithmica
61
(4), 2011, pp. 898-922
A faster algorithm for the maximum even factor problem
Maxim A. Babenko
Lecture Notes in Computer Science
6506
, 2010, pp. 451-462
A fast algorithm for the path 2-packing problem
Maxim A. Babenko
Theory of Computing Systems
46
(1), 2010, pp. 59-79
A scaling algorithm for the maximum node-capacitated multiflow problem
Maxim A. Babenko
,
Alexander V. Karzanov
Lecture Notes in Computer Science
5193
, 2008, pp. 124-135
An efficient scaling algorithm for the minimum weight bibranching problem
Maxim A. Babenko
Lecture Notes in Computer Science
5369
, 2008, pp. 232-245