From post

Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs.

, , , и . MFCS, том 58 из LIPIcs, стр. 75:1-75:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

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.

 

Другие публикации лиц с тем же именем

Lossy Kernelization., , , и . CoRR, (2016)Representative Families of Product Families., , , и . ACM Trans. Algorithms, 13 (3): 36:1-36:29 (2017)Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms., , , и . J. ACM, 63 (4): 29:1-29:60 (2016)On the Parameterized Complexity of Edge-Linked Paths., , и . CSR, том 11532 из Lecture Notes in Computer Science, стр. 286-298. Springer, (2019)Fast Exact Algorithms for Survivable Network Design with Uniform Requirements., , , и . Algorithmica, 84 (9): 2622-2641 (2022)Simultaneous Feedback Edge Set: A Parameterized Perspective., , , и . Algorithmica, 83 (2): 753-774 (2021)Elimination Distance to Topological-minor-free Graphs is FPT., , , , , и . CoRR, (2021)Parameterized Computational Geometry via Decomposition Theorems., , и . WALCOM, том 11355 из Lecture Notes in Computer Science, стр. 15-27. Springer, (2019)On MAX-SAT with Cardinality Constraint., и . WALCOM, том 14549 из Lecture Notes in Computer Science, стр. 118-133. Springer, (2024)A Framework for Approximation Schemes on Disk Graphs., , , , и . SODA, стр. 2228-2241. SIAM, (2023)