Author of the publication

On Routing Disjoint Paths in Bounded Treewidth Graphs.

, , , and . SWAT, volume 53 of LIPIcs, page 15:1-15:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

META-STORM: Generalized Fully-Adaptive Variance Reduced SGD for Unbounded Functions., , , , and . CoRR, (2022)Submodular Cost Allocation Problem and Applications., and . ICALP (1), volume 6755 of Lecture Notes in Computer Science, page 354-366. Springer, (2011)Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems., , and . SODA, page 306-325. SIAM, (2013)Mining Tours and Paths in Activity Networks., , , and . WWW, page 459-468. ACM, (2018)From Graph to Hypergraph Multiway Partition: Is the Single Threshold the Only Route?, and . ESA, volume 8737 of Lecture Notes in Computer Science, page 382-393. Springer, (2014)Adaptive Gradient Methods for Constrained Convex Optimization and Variational Inequalities., , and . AAAI, page 7314-7321. AAAI Press, (2021)Improved Approximation Algorithms for Connected Domatic Partitions and Related Problems, , and . CoRR, (2013)Approximation Algorithms for Submodular Multiway Partition., and . FOCS, page 807-816. IEEE Computer Society, (2011)Approximation algorithms and hardness of integral concurrent flow., , , and . STOC, page 689-708. ACM, (2012)Prize-Collecting Survivable Network Design in Node-Weighted Graphs., , and . APPROX-RANDOM, volume 7408 of Lecture Notes in Computer Science, page 98-109. Springer, (2012)