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

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 Directed Steiner Tree on Sparse Graphs., , , , and . SIAM J. Discret. Math., 31 (2): 1294-1327 (2017)Faster algorithms for feedback vertex set., , and . Electron. Notes Discret. Math., (2005)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)Simultaneous Feedback Edge Set: A Parameterized Perspective., , , and . Algorithmica, 83 (2): 753-774 (2021)A Polynomial Kernel for Bipartite Permutation Vertex Deletion., , , , , and . Algorithmica, 84 (11): 3246-3275 (2022)Fast Exact Algorithms for Survivable Network Design with Uniform Requirements., , , and . Algorithmica, 84 (9): 2622-2641 (2022)Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules., , , and . Algorithmica, 85 (12): 3717-3740 (December 2023)Sharp Separation and Applications to Exact and Parameterized Algorithms., , , and . Algorithmica, 63 (3): 692-706 (2012)