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

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)Waypoint Routing on Bounded Treewidth Graphs., and . CoRR, (2020)Solving Multicut Faster Than 2 n., , and . ESA, volume 8737 of Lecture Notes in Computer Science, page 666-676. Springer, (2014)Parameterized Problems Related to Seidel's Switching., , , and . Discret. Math. Theor. Comput. Sci., 13 (2): 19-44 (2011)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)Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters., and . Algorithmica, 85 (3): 762-782 (March 2023)Maximizing Social Welfare in Score-Based Social Distance Games., , , , , and . TARK, volume 379 of EPTCS, page 272-286. (2023)Predictive control of PMSM using improved model of the drive., , , and . IECON, page 1-5. IEEE, (2021)