Author of the publication

Eliminating Crossings in Ordered Graphs

, , , , , , and . Proc. 19th Scand. Symp. Algorithm Theory (SWAT'24), volume of LIPIcs, Schloss Dagstuhl -- Leibniz-Institut für Informatik, (2024)To appear..

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

Recognizing well-dominated graphs is coNP-complete., , , , and . Inf. Process. Lett., (January 2024)Odd Cycle Transversal on P5-free Graphs in Quasi-polynomial Time., , , , and . SODA, page 5276-5290. SIAM, (2024)Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent., , , , , , and . SODA, page 1976-2004. SIAM, (2022)Distance from Triviality 2.0: Hybrid Parameterizations., and . IWOCA, volume 13270 of Lecture Notes in Computer Science, page 3-20. Springer, (2022)Erdös-Pósa Property of Obstructions to Interval Graphs., , , , and . STACS, volume 96 of LIPIcs, page 7:1-7:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Conflict Free Feedback Vertex Set: A Parameterized Dichotomy., , , , and . MFCS, volume 117 of LIPIcs, page 53:1-53:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Exploring the Kernelization Borders for Hitting Cycles., , , , and . IPEC, volume 115 of LIPIcs, page 14:1-14:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set., , , and . IPEC, volume 63 of LIPIcs, page 2:1-2:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion., , , and . LATIN, volume 9644 of Lecture Notes in Computer Science, page 1-13. Springer, (2016)Parameterized Complexity of Perfectly Matched Sets., , , and . IPEC, volume 249 of LIPIcs, page 2:1-2:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)