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

The inverse Voronoi problem in graphs., , , and . CoRR, (2018)Metric Dimension Parameterized By Treewidth., and . Algorithmica, 83 (8): 2606-2633 (2021)Parameterized Intractability of Even Set and Shortest Vector Problem., , , , , , , and . Electron. Colloquium Comput. Complex., (2019)Twin-width II: small classes., , , , and . SODA, page 1977-1996. SIAM, (2021)Tight bounds on adjacency labels for monotone graph classes., , , , and . CoRR, (2023)Maximum Independent Set when excluding an induced minor: K1 + tK2 and tC3 ⊎ C4., , , , and . CoRR, (2023)Twin-Width V: Linear Minors, Modular Counting, and Matrix Multiplication., , , and . STACS, volume 254 of LIPIcs, page 15:1-15:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width., , , and . STACS, volume 254 of LIPIcs, page 10:1-10:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Stretch-Width., and . IPEC, volume 285 of LIPIcs, page 8:1-8:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Twin-Width VIII: Delineation and Win-Wins., , , , , and . IPEC, volume 249 of LIPIcs, page 9:1-9:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)