( en | de | ru )

 

Disambiguation of "Jansen, Bart M. P."

Author of the publication

copydeleteadd this publication to your clipboard
Determining the Winner of a Dodgson Election is Hard.

, , , , and . FSTTCS, volume 8 of LIPIcs, page 459-468. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)

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

Finding k-secluded trees faster., , and . J. Comput. Syst. Sci., (December 2023)p-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms., , , , and . J. Comput. Syst. Sci., (May 2023)Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels., and . SODA, page 616-629. SIAM, (2015)Approximation and Kernelization for Chordal Vertex Deletion., and . SODA, page 1399-1418. SIAM, (2017)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)Computing the Chromatic Number Using Graph Decompositions via Matrix Rank., and . ESA, volume 112 of LIPIcs, page 47:1-47:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)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)Uniform Kernelization Complexity of Hitting Forbidden Minors., , , and . ICALP (1), volume 9134 of Lecture Notes in Computer Science, page 629-641. Springer, (2015)Search-Space Reduction via Essential Vertices Revisited: Vertex Multicut and Cograph Deletion., and . SWAT, volume 294 of LIPIcs, page 28:1-28:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set., and . WG, volume 12911 of Lecture Notes in Computer Science, page 1-14. Springer, (2021)