Author of the publication

Linear-Time Kernelization for Feedback Vertex Set.

. ICALP, volume 80 of LIPIcs, page 68:1-68:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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

Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction., , and . CIKM, page 909-918. ACM, (2013)Linear-Time Kernelization for Feedback Vertex Set.. ICALP, volume 80 of LIPIcs, page 68:1-68:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)On the Power of Tree-Depth for Fully Polynomial FPT Algorithms., , and . STACS, volume 96 of LIPIcs, page 41:1-41:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)A Faster Algorithm for Dominating Set Analyzed by the Potential Method.. IPEC, volume 7112 of Lecture Notes in Computer Science, page 41-54. Springer, (2011)Branch-and-Reduce Exponential/FPT Algorithms in Practice: A Case Study of Vertex Cover., and . ALENEX, page 70-81. SIAM, (2015)Computing Personalized PageRank Quickly by Exploiting Graph Structures., , , and . Proc. VLDB Endow., 7 (12): 1023-1034 (2014)Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover., and . Theor. Comput. Sci., (2016)Improved Analysis of Highest-Degree Branching for Feedback Vertex Set., and . Algorithmica, 83 (8): 2503-2520 (2021)On the Equivalence among Problems of Bounded Width., and . ESA, volume 9294 of Lecture Notes in Computer Science, page 754-765. Springer, (2015)An Exact Algorithm for Diameters of Large Real Directed Graphs., , and . SEA, volume 9125 of Lecture Notes in Computer Science, page 56-67. Springer, (2015)