Author of the publication

A Planar Linear Arboricity Conjecture.

, , and . CIAC, volume 6078 of Lecture Notes in Computer Science, page 204-216. Springer, (2010)

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

Fast branching algorithm for Cluster Vertex Deletion., , , and . CoRR, (2013)On Problems Equivalent to (min, +)-Convolution., , , and . ACM Trans. Algorithms, 15 (1): 14:1-14:25 (2019)On the Hardness of Losing Width., , , , and . Theory Comput. Syst., 54 (1): 73-82 (2014)Decoupled Actor-Critic., and . CoRR, (2023)Approximation and Parameterized Complexity of Minimax Approval Voting., , , and . AAAI, page 459-465. AAAI Press, (2017)Approximating Upper Degree-Constrained Partial Orientations., and . APPROX-RANDOM, volume 40 of LIPIcs, page 212-224. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Hardness of Approximation for H-Free Edge Modification Problems., , , and . APPROX-RANDOM, volume 60 of LIPIcs, page 3:1-3:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)On Multiway Cut Parameterized above Lower Bounds., , , and . IPEC, volume 7112 of Lecture Notes in Computer Science, page 1-12. Springer, (2011)Lower Bounds for Approximation Schemes for Closest String., , , , and . SWAT, volume 53 of LIPIcs, page 12:1-12:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Constant Factor Approximation for Capacitated k-Center with Outliers., and . STACS, volume 25 of LIPIcs, page 251-262. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)