From post

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.

 

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

Computing the Chromatic Number Using Graph Decompositions via Matrix Rank., и . ESA, том 112 из LIPIcs, стр. 47:1-47:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations., и . ESA, том 112 из LIPIcs, стр. 48:1-48:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Finding k-secluded trees faster., , и . J. Comput. Syst. Sci., (декабря 2023)p-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms., , , , и . J. Comput. Syst. Sci., (мая 2023)Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set., и . WG, том 12911 из Lecture Notes in Computer Science, стр. 1-14. Springer, (2021)Search-Space Reduction via Essential Vertices Revisited: Vertex Multicut and Cograph Deletion., и . SWAT, том 294 из LIPIcs, стр. 28:1-28:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels., и . SODA, стр. 616-629. SIAM, (2015)Approximation and Kernelization for Chordal Vertex Deletion., и . SODA, стр. 1399-1418. SIAM, (2017)Single-exponential FPT algorithms for enumerating secluded F-free subgraphs and deleting to scattered graph classes., , и . J. Comput. Syst. Sci., (2025)Search-Space Reduction via Essential Vertices., , и . ESA, том 244 из LIPIcs, стр. 30:1-30:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)