( en | de | ru )

 

Disambiguation of "Jansen, Bart M. P."

Author of the publication

copydeleteadd this publication to your clipboard
Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations.

, and . ESA, volume 112 of LIPIcs, page 48:1-48:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

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.

Gregor M Jansen

Patrick M P Prokopczuk

Constantin P M Kahn

Constantin P M Kahn

Berry P M Dongelmans

 

Other publications of authors with the same name

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)Lower bounds for protrusion replacement by counting equivalence classes., and . Discret. Appl. Math., (2020)Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials., and . MFCS, volume 58 of LIPIcs, page 71:1-71:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT., and . IPEC, volume 43 of LIPIcs, page 163-174. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Constrained Bipartite Vertex Cover: The Easy Kernel is Essentially Tight.. STACS, volume 47 of LIPIcs, page 45:1-45:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Independent-set reconfiguration thresholds of hereditary graph classes., , and . Discret. Appl. Math., (2018)Finding k-Secluded Trees Faster., , and . WG, volume 13453 of Lecture Notes in Computer Science, page 173-186. Springer, (2022)Vertex deletion parameterized by elimination distance and even less., , and . STOC, page 1757-1769. ACM, (2021)FPT Is Characterized by Useful Obstruction Sets., and . WG, volume 8165 of Lecture Notes in Computer Science, page 261-273. Springer, (2013)On Sparsification for Computing Treewidth.. IPEC, volume 8246 of Lecture Notes in Computer Science, page 216-229. Springer, (2013)