Author of the publication

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

Surjective H-colouring: New hardness results., , , , and . Comput., 8 (1): 27-42 (2019)Constraint Satisfaction with Counting Quantifiers 2., and . CoRR, (2013)QCSP on Reflexive Tournaments., , , , , and . ACM Trans. Comput. Log., 23 (3): 14:1-14:22 (2022)Disjoint paths and connected subgraphs for H-free graphs., , , , and . Theor. Comput. Sci., (2022)Hard Problems That Quickly Become Very Easy., , and . CoRR, (2020)Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs., , , , , and . CoRR, (2022)Depth lower bounds in Stabbing Planes for combinatorial principles., , , and . CoRR, (2021)Few Induced Disjoint Paths for H-Free Graphs., , , and . ISCO, volume 13526 of Lecture Notes in Computer Science, page 89-101. Springer, (2022)Colouring Graphs of Bounded Diameter in the Absence of Small Cycles., , and . CIAC, volume 12701 of Lecture Notes in Computer Science, page 367-380. Springer, (2021)Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs., , , , , and . SWAT, volume 294 of LIPIcs, page 29:1-29:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)