Author of the publication

Classes of Intersection Digraphs with Good Algorithmic Properties.

, , and . STACS, volume 219 of LIPIcs, page 38:1-38:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

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

Sim-width and induced minors., , , and . CoRR, (2016)A Polynomial Kernel for Distance-Hereditary Vertex Deletion., and . CoRR, (2016)Erdős-Pósa property of chordless cycles and its applications., and . CoRR, (2017)Polynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-Width., , and . IPEC, volume 89 of LIPIcs, page 21:1-21:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Excluded vertex-minors for graphs of linear rank-width at most k., , and . STACS, volume 20 of LIPIcs, page 221-232. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)Computing pivot-minors., , , , , , and . CoRR, (2023)Erdős-Pósa property of chordless cycles and its applications., and . SODA, page 1665-1684. SIAM, (2018)Directed Tangle Tree-Decompositions and Applications., , , and . SODA, page 377-405. SIAM, (2022)Unified Almost Linear Kernels for Generalized Covering and Packing Problems on Nowhere Dense Classes., , and . ISAAC, volume 283 of LIPIcs, page 5:1-5:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Branch-depth: Generalizing tree-depth of graphs., , and . Eur. J. Comb., (2020)