Author of the publication

Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number.

, , , and . Algorithmica, 85 (7): 2065-2086 (July 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

Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number., , , and . FSTTCS, volume 122 of LIPIcs, page 35:1-35:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms., , , , and . SODA, page 2785-2800. SIAM, (2018)Domination and Cut Problems on Chordal Graphs with Bounded Leafage., , , , and . Algorithmica, 86 (5): 1428-1474 (May 2024)Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity., , , and . IPEC, volume 285 of LIPIcs, page 5:1-5:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs., , and . Algorithmica, 83 (6): 1861-1884 (2021)Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number., , , and . Algorithmica, 85 (7): 2065-2086 (July 2023)On weighted graph separation problems and flow-augmentation., , , and . CoRR, (2022)b-Coloring Parameterized by Pathwidth is XNLP-complete., , and . CoRR, (2022)Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations., , , , and . SODA, page 314-345. SIAM, (2024)Balanced Substructures in Bicolored Graphs., , , and . SOFSEM, volume 13878 of Lecture Notes in Computer Science, page 177-191. Springer, (2023)