Author of the publication

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)

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

Target Set Selection Parameterized by Clique-Width and Maximum Threshold.. SOFSEM, volume 10706 of Lecture Notes in Computer Science, page 137-149. Springer, (2018)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)Dispersing Obnoxious Facilities on Graphs by Rounding Distances., and . MFCS, volume 241 of LIPIcs, page 55:1-55:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Make a Graph Singly Connected by Edge Orientations., and . IWOCA, volume 13889 of Lecture Notes in Computer Science, page 221-232. Springer, (2023)Recognizing Proper Tree-Graphs., , , and . IPEC, volume 180 of LIPIcs, page 8:1-8:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)The Complexity of Packing Edge-Disjoint Paths., , , , , , and . IPEC, volume 148 of LIPIcs, page 10:1-10:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Dispersing Obnoxious Facilities on a Graph., , , and . Algorithmica, 83 (6): 1734-1749 (2021)Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs., , , and . IWOCA, volume 12757 of Lecture Notes in Computer Science, page 92-106. Springer, (2021)An Investigation of the Recoverable Robust Assignment Problem., , , and . IPEC, volume 214 of LIPIcs, page 19:1-19:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Dispersing obnoxious facilities on a graph., , , and . CoRR, (2018)