( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
FPT is characterized by useful obstruction sets: Connecting algorithms, kernels, and quasi-orders.

, и . TOCT, 6 (4): 16:1-16:26 (2014)

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.

Gregor M Jansen

Patrick M P Prokopczuk

Constantin P M Kahn

Constantin P M Kahn

Berry P M Dongelmans

 

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

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)Approximation and Kernelization for Chordal Vertex Deletion., и . SIAM J. Discret. Math., 32 (3): 2258-2301 (2018)Fine-grained Complexity Analysis of Two Classic TSP Variants., , , и . ACM Trans. Algorithms, 17 (1): 5:1-5:29 (2021)A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs., , и . SIAM J. Discret. Math., 35 (4): 2387-2429 (2021)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)Special Issue Dedicated to the 14th International Symposium on Parameterized and Exact Computation., и . Algorithmica, 83 (8): 2469-2470 (2021)Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size., , и . Algorithmica, 84 (11): 3407-3458 (2022)Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor., , и . Algorithmica, 81 (10): 3936-3967 (2019)