From post

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.

 

Другие публикации лиц с тем же именем

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