Author of the publication

Clique-Width of Point Configurations.

, , , and . WG, volume 12301 of Lecture Notes in Computer Science, page 54-66. Springer, (2020)

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

FO Model Checking of Interval Graphs, , , , , and . Logical Methods in Computer Science, (2015)Computing the Tutte Polynomial on Graphs of Bounded Clique-Width., , and . WG, volume 3787 of Lecture Notes in Computer Science, page 59-68. Springer, (2005)Preface., and . Theor. Comput. Sci., (2012)Crossing Number Is Hard for Cubic Graphs.. MFCS, volume 3153 of Lecture Notes in Computer Science, page 772-782. Springer, (2004)When Trees Grow Low: Shrubs and Fast MSO1., , , , , and . MFCS, volume 7464 of Lecture Notes in Computer Science, page 419-430. Springer, (2012)Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width., , and . FSTTCS, volume 8 of LIPIcs, page 73-83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width., , , , , and . ISAAC, volume 283 of LIPIcs, page 11:1-11:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Isomorphism Problem for S_d-Graphs., and . MFCS, volume 170 of LIPIcs, page 4:1-4:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Recognizing H-Graphs - Beyond Circular-Arc Graphs., , , , , , , and . MFCS, volume 272 of LIPIcs, page 8:1-8:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases., , , , and . MFCS, volume 202 of LIPIcs, page 21:1-21:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)