The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Maxim A. Babenko" ( http://dblp.L3S.de/Authors/Maxim_A._Babenko )

  Author page on DBLP  Author page in RDF  Community of Maxim A. Babenko in ASPL-2

Publication years (Num. hits)
2006-2011 (16)
Publication types (Num. hits)
article(6) inproceedings(10)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 16 publication records. Showing 16 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Maxim A. Babenko An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem. Search on Bibsonomy Algorithmica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Maxim A. Babenko, Alexey Gusakov New Exact and Approximation Algorithms for the Star Packing Problem in Undirected Graphs. Search on Bibsonomy STACS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Maxim A. Babenko A Faster Algorithm for the Maximum Even Factor Problem Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Maxim A. Babenko, Ignat I. Kolesnichenko, Ilya P. Razenshteyn A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Maxim A. Babenko A Fast Algorithm for the Path 2-Packing Problem. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Maxim A. Babenko, Alexey Gusakov, Ilya P. Razenshteyn Triangle-Free 2-Matchings Revisited. Search on Bibsonomy COCOON The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Maxim A. Babenko, Ignat I. Kolesnichenko, Ilya P. Razenshteyn A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks. Search on Bibsonomy SOFSEM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Maxim A. Babenko A Faster Algorithm for the Maximum Even Factor Problem. Search on Bibsonomy ISAAC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Maxim A. Babenko, Alexander V. Karzanov Minimum mean cycle problem in bidirected and skew-symmetric graphs. Search on Bibsonomy Discrete Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Maxim A. Babenko, Tatiana A. Starikovskaya Computing Longest Common Substrings Via Suffix Arrays. Search on Bibsonomy CSR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Maxim A. Babenko, Alexander V. Karzanov A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem. Search on Bibsonomy ESA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Maxim A. Babenko An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem. Search on Bibsonomy ISAAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Maxim A. Babenko, Alexander V. Karzanov Free multiflows in bidirected and skew-symmetric graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Maxim A. Babenko A Fast Algorithm for Path 2-Packing Problem. Search on Bibsonomy CSR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Maxim A. Babenko, Jonathan Derryberry, Andrew V. Goldberg, Robert Endre Tarjan, Yunhong Zhou Experimental Evaluation of Parametric Max-Flow Algorithms. Search on Bibsonomy WEA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Maxim A. Babenko Acyclic Bidirected and Skew-Symmetric Graphs: Algorithms and Structure. Search on Bibsonomy CSR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #16 of 16 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.