Author of the publication

Extending Partial 1-Planar Drawings.

, , , , and . ICALP, volume 168 of LIPIcs, page 43:1-43:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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

Complexity of the Steiner Network Problem with Respect to the Number of Terminals., , , and . CoRR, (2018)On the Complexity of Rainbow Coloring Problems., , and . IWOCA, volume 9538 of Lecture Notes in Computer Science, page 209-220. Springer, (2015)How to Navigate Through Obstacles?., and . ICALP, volume 107 of LIPIcs, page 48:1-48:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Valued Authorization Policy Existence Problem: Theory and Experiments., , , , and . ACM Trans. Priv. Secur., 25 (4): 28:1-28:32 (2022)Manipulating Districts to Win Elections: Fine-Grained Complexity., , , and . AAAI, page 1902-1909. AAAI Press, (2020)Symmetry properties of generalized graph truncations., , and . J. Comb. Theory B, (2019)A Polynomial Kernel for Paw-Free Editing., , and . IPEC, volume 180 of LIPIcs, page 10:1-10:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Component Order Connectivity in Directed Graphs., , , , and . IPEC, volume 180 of LIPIcs, page 2:1-2:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)A Polynomial Kernel for Line Graph Deletion., and . ESA, volume 173 of LIPIcs, page 42:1-42:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)The Complexity of Envy-Free Graph Cutting., , , , and . CoRR, (2023)