Author of the publication

Recognizing Unit Multiple Intervals Is Hard.

, , , and . ISAAC, volume 283 of LIPIcs, page 8:1-8:18. 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 Longest Run Subsequence Problem: Further Complexity Results., and . CPM, volume 191 of LIPIcs, page 14:1-14:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Extension of Some Edge Graph Problems: Standard and Parameterized Complexity., , , , and . FCT, volume 11651 of Lecture Notes in Computer Science, page 185-200. Springer, (2019)Generalizing Roberts' characterization of unit interval graphs., , , , and . CoRR, (2024)On the Complexity of Broadcast Domination and Multipacking in Digraphs., , , and . IWOCA, volume 12126 of Lecture Notes in Computer Science, page 264-276. Springer, (2020)Token Sliding on Split Graphs., , , , , and . Theory Comput. Syst., 65 (4): 662-686 (2021)Neural Maximum Independent Set., , , and . PKDD/ECML Workshops (1), volume 1524 of Communications in Computer and Information Science, page 223-237. Springer, (2021)Graph Homomorphism Features: Why Not Sample?, , and . PKDD/ECML Workshops (1), volume 1524 of Communications in Computer and Information Science, page 216-222. Springer, (2021)Parity Permutation Pattern Matching., , and . WALCOM, volume 13973 of Lecture Notes in Computer Science, page 384-395. Springer, (2023)Recognizing Unit Multiple Intervals Is Hard., , , and . ISAAC, volume 283 of LIPIcs, page 8:1-8:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Token Sliding on Split Graphs., , , , , and . STACS, volume 126 of LIPIcs, page 13:1-13:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)