( en | de | ru )

 

Disambiguation of "de Kroon, Jari J. H."

Author of the publication

copydeleteadd this publication to your clipboard
Finding k-secluded trees faster.

, , and . J. Comput. Syst. Sci., (December 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.

Hans Jaritz

Peter Jaritz

Volker Jaritz

Jörk Jarick

Peter Jaritz

 

Other publications of authors with the same name

Search-Space Reduction via Essential Vertices., , and . ESA, volume 244 of LIPIcs, page 30:1-30:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Deletion to Scattered Graph Classes I -- case of finite number of graph classes., , , and . CoRR, (2021)Finding k-secluded trees faster., , and . J. Comput. Syst. Sci., (December 2023)Preprocessing Vertex-Deletion Problems: Characterizing Graph Properties by Low-Rank Adjacencies., and . SWAT, volume 162 of LIPIcs, page 27:1-27:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Vertex deletion parameterized by elimination distance and even less., , and . STOC, page 1757-1769. ACM, (2021)Finding k-Secluded Trees Faster., , and . WG, volume 13453 of Lecture Notes in Computer Science, page 173-186. Springer, (2022)FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More., and . WG, volume 12911 of Lecture Notes in Computer Science, page 80-93. Springer, (2021)Deletion to scattered graph classes I - Case of finite number of graph classes., , , and . J. Comput. Syst. Sci., (December 2023)Single-Exponential FPT Algorithms for Enumerating Secluded ℱ-Free Subgraphs and Deleting to Scattered Graph Classes., , and . ISAAC, volume 283 of LIPIcs, page 42:1-42:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)5-Approximation for ℋ-Treewidth Essentially as Fast as ℋ-Deletion Parameterized by Solution Size., , and . ESA, volume 274 of LIPIcs, page 66:1-66:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)