Bart M. P. Jansen

Michael R. Fellows, Bart M. P. Jansen, Frances A. Rosamond: Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity. Eur. J. Comb. 34(3): 541-566 (2013)

Bart M. P. Jansen: Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights. J. Graph Algorithms Appl. 16(4): 811-846 (2012)

Fedor V. Fomin, Bart M. P. Jansen, Michal Pilipczuk: Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? IPEC 2012: 97-108

Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Kernel Bounds for Structural Parameterizations of Pathwidth. SWAT 2012: 352-363

Fedor V. Fomin, Bart M. P. Jansen, Michal Pilipczuk: Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? CoRR abs/1206.4912 (2012)

Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Kernelization Lower Bounds By Cross-Composition. CoRR abs/1206.5941 (2012)

Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Kernel Bounds for Structural Parameterizations of Pathwidth. CoRR abs/1207.4900 (2012)

Boris Aronov, Kevin Buchin, Maike Buchin, Bart M. P. Jansen, Tom de Jong, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Rodrigo I. Silveira, Bettina Speckmann: Connect the dot: Computing feed-links for network extension. J. Spatial Information Science 3(1): 3-31 (2011)

Bart M. P. Jansen, Stefan Kratsch: Data Reduction for Graph Coloring Problems. FCT 2011: 90-101

Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger: Parameterized Complexity of Vertex Deletion into Perfect Graph Classes. FCT 2011: 240-251

Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. ICALP (1) 2011: 437-448

Bart M. P. Jansen, Stefan Kratsch: On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal. IPEC 2011: 132-144

Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Kernel Bounds for Path and Cycle Problems. IPEC 2011: 145-158

Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Cross-Composition: A New Technique for Kernelization Lower Bounds. STACS 2011: 165-176

Bart M. P. Jansen, Hans L. Bodlaender: Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter. STACS 2011: 177-188

Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. CoRR abs/1104.4217 (2011)

Bart M. P. Jansen, Stefan Kratsch: Data Reduction for Graph Coloring Problems. CoRR abs/1104.4229 (2011)

Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Kernel Bounds for Path and Cycle Problems. CoRR abs/1106.4141 (2011)

Bart M. P. Jansen, Stefan Kratsch: On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal. CoRR abs/1107.3658 (2011)

Bart M. P. Jansen: Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights. CIAC 2010: 192-203

Michael R. Fellows, Bart M. P. Jansen, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh: Determining the Winner of a Dodgson Election is Hard. FSTTCS 2010: 459-468

Bart M. P. Jansen: Polynomial Kernels for Hard Problems on Disk Graphs. SWAT 2010: 310-321

Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Cross-Composition: A New Technique for Kernelization Lower Bounds. CoRR abs/1011.4224 (2010)

Bart M. P. Jansen, Hans L. Bodlaender: Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter. CoRR abs/1012.4701 (2010)

Boris Aronov, Kevin Buchin, Maike Buchin, Bart M. P. Jansen, T. de Jong, Marc J. van Kreveld, Maarten Löffler, Jin Luo, Rodrigo I. Silveira, Bettina Speckmann: Feed-links for network extensions. GIS 2008: 35