Author of the publication

Treewidth Is NP-Complete on Cubic Graphs.

, , , , , , , , and . IPEC, volume 285 of LIPIcs, page 7:1-7:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

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

Solving Multicut Faster Than 2 n., , and . ESA, volume 8737 of Lecture Notes in Computer Science, page 666-676. Springer, (2014)Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound., , , and . FSTTCS, volume 18 of LIPIcs, page 412-423. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)Tree Deletion Set Has a Polynomial Kernel but No OPTO(1) Approximation., , , and . SIAM J. Discret. Math., 30 (3): 1371-1384 (2016)On Kernels for d-Path Vertex Cover., , and . CoRR, (2021)Treewidth Is NP-Complete on Cubic Graphs., , , , , , , , and . IPEC, volume 285 of LIPIcs, page 7:1-7:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)A Parameterized Complexity View on Collapsing k-Cores., , and . IPEC, volume 115 of LIPIcs, page 7:1-7:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Predictive control of PMSM using improved model of the drive., , , and . IECON, page 1-5. IEEE, (2021)Treewidth is NP-Complete on Cubic Graphs (and related results)., , , , , , , , and . CoRR, (2023)Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation)., , , and . FSTTCS, volume 29 of LIPIcs, page 85-96. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)On explaining integer vectors by few homogeneous segments., , , , , and . J. Comput. Syst. Sci., 81 (4): 766-782 (2015)