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

A characterization of König-Egerváry graphs with extendable vertex covers., , and . Inf. Process. Lett., (2020)Faster fixed parameter tractable algorithms for finding feedback vertex sets., , and . ACM Trans. Algorithms, 2 (3): 403-415 (2006)Parameterized Complexity of Directed Steiner Tree on Sparse Graphs., , , , and . SIAM J. Discret. Math., 31 (2): 1294-1327 (2017)Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems., , , , and . SIAM J. Discret. Math., 37 (4): 2626-2669 (December 2023)Parameterized complexity of MaxSat Above Average., , , , and . Theor. Comput. Sci., (2013)Balanced stable marriage: How close is close enough?, , , and . Theor. Comput. Sci., (2021)On the complexity of singly connected vertex deletion., , , , , and . Theor. Comput. Sci., (2022)Local search: Is brute-force avoidable?, , , , , and . J. Comput. Syst. Sci., 78 (3): 707-719 (2012)Parameterized complexity of multi-node hubs., and . J. Comput. Syst. Sci., (2023)Almost optimal query algorithm for hitting set using a subset query., , , , and . J. Comput. Syst. Sci., (November 2023)