%0 Conference Paper %1 DBLP:journals/corr/FleszarMS16 %A Fleszar, Krzysztof %A Mnich, Matthias %A Spoerhase, Joachim %B 24th Europ. Symp. Algorithms (ESA'16) %D 2016 %E Sankowski, Piotr %E Zaroliagis, Christos %I Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik %K algorithms disjoint edge feedback graph myown node paths set vertex %P 42:1--42:17 %T New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness %U http://drops.dagstuhl.de/opus/volltexte/2016/6354 %V 57

@inproceedings{DBLP:journals/corr/FleszarMS16, added-at = {2016-06-01T00:36:00.000+0200}, author = {Fleszar, Krzysztof and Mnich, Matthias and Spoerhase, Joachim}, bibsource = {dblp computer science bibliography, http://dblp.org}, biburl = {https://www.bibsonomy.org/bibtex/270f01694f108984890532e72a55225d6/fleszark}, booktitle = {24th Europ. Symp. Algorithms (ESA'16)}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, interhash = {21bb734babf190f41f2736a188e8dc26}, intrahash = {70f01694f108984890532e72a55225d6}, keywords = {algorithms disjoint edge feedback graph myown node paths set vertex}, pages = {42:1--42:17}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, timestamp = {2017-06-20T17:19:06.000+0200}, title = {New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness}, url = {http://drops.dagstuhl.de/opus/volltexte/2016/6354}, volume = 57, year = 2016 }