Author of the publication

A Contraction Tree SAT Encoding for Computing Twin-Width.

, , , , , , , and . PAKDD (2), volume 14646 of Lecture Notes in Computer Science, page 444-456. Springer, (2024)

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

Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs., , , , and . CoRR, (2022)Balanced Crown Decomposition for Connectivity Constraints., , , , and . CoRR, (2020)Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs., , , , and . WG, volume 14093 of Lecture Notes in Computer Science, page 143-156. Springer, (2023)Balanced Crown Decomposition for Connectivity Constraints., , , , and . ESA, volume 204 of LIPIcs, page 26:1-26:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Connected k-Partition of k-Connected Graphs and c-Claw-Free Graphs., , , , , and . APPROX-RANDOM, volume 207 of LIPIcs, page 27:1-27:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)A Contraction Tree SAT Encoding for Computing Twin-Width., , , , , , , and . PAKDD (2), volume 14646 of Lecture Notes in Computer Science, page 444-456. Springer, (2024)