Publications

My DBLP Record and Google Scholar Profile. Due to copyright restrictions, some journal articles contain improvements that are not present in the corresponding arXiv entries.

Ph.D. Thesis

Conference publications

[1]

Hans L. Bodlaender, Bart M. P. Jansen, and Stefan Kratsch. “Kernel Bounds for Structural Parameterizations of Pathwidth”. In: Proceedings of the 13th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2012. Volume 7357. LNCS. 2012, pages 352–363. doi: 10.1007/ 978-3-642-31155-0_31. arXiv:1207.4900.

[2]

Fedor V. Fomin, Bart M. P. Jansen, and Michal Pilipczuk. “Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help?” In: Proceedings of the 7th International Symposium on Parameterized and Exact Computation, IPEC 2012. Volume 7535. LNCS. 2012, pages 97–108. doi: 10.1007/978-3-642-33293-7_11. arXiv:1206.4912.

[3]

Hans L. Bodlaender, Bart M. P. Jansen, and Stefan Kratsch. “Cross-Composition: A New Technique for Kernelization Lower Bounds”. In: Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011. Volume 9. LIPIcs. Extended abstract of [21]. 2011, pages 165–176. doi: 10.4230/LIPIcs.STACS.2011. 165. arXiv:1011.4224.

[4]

Hans L. Bodlaender, Bart M. P. Jansen, and Stefan Kratsch. “Kernel Bounds for Path and Cycle Problems”. In: Proceedings of the 6th International Symposium on Parameterized and Exact Computation, IPEC 2011. Volume 7112. LNCS. Extended abstract of [16]. 2011, pages 145–158. doi: 10.1007/978-3-642-28050-4_12. arXiv:1106.4141.

[5]

Hans L. Bodlaender, Bart M. P. Jansen, and Stefan Kratsch. “Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization”. In: Proceedings of the 38th International Colloquium on Automata, Languages and Programming, ICALP 2011. Volume 6755. LNCS. 2011, pages 437–448. doi: 10.1007/978-3-642-22006-7_37. arXiv:1104.4217.

[6]

Pinar Heggernes, Pim van ’t Hof, Bart M. P. Jansen, Stefan Kratsch, and Yngve Villanger. “Parameterized Complexity of Vertex Deletion into Perfect Graph Classes”. In: Proceedings of the 18th International Symposium on Fundamentals of Computation Theory, FCT 2011. Volume 6914. LNCS. Extended abstract of [17]. 2011, pages 240–251. doi: 10.1007/978-3-642-22953-4_21.

[7]

Bart M. P. Jansen and Hans L. Bodlaender. “Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter”. In: Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011. Volume 9. LIPIcs. Extended abstract of [19]. 2011, pages 177–188. doi: 10.4230/LIPIcs.STACS.2011.177. arXiv:1012.4701.

[8]

Bart M. P. Jansen and Stefan Kratsch. “Data Reduction for Graph Coloring Problems”. In: Proceedings of the 18th International Symposium on Fundamentals of Computation Theory, FCT 2011. Volume 6914. LNCS. Extended Abstract of [23]. 2011, pages 90–101. doi: 10.1007/978- 3-642-22953-4_8. arXiv:1104.4229.

[9]

Bart M. P. Jansen and Stefan Kratsch. “On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal”. In: Proceedings of the 6th International Symposium on Parameterized and Exact Computation, IPEC 2011. Volume 7112. LNCS. 2011, pages 132–144. doi: 10.1007/978-3-642-28050-4_11. arXiv:1107.3658.

[10]

Michael R. Fellows, Bart M. P. Jansen, Daniel Lokshtanov, Frances A. Rosamond, and Saket Saurabh. “Determining the Winner of a Dodgson Election is Hard”. In: Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010. Volume 8. LIPIcs. 2010, pages 459–468. doi: 10.4230/ LIPIcs.FSTTCS.2010.459.

[11]

Bart M. P. Jansen. “Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights”. In: Proceedings of the 7th International Conference on Algorithms and Complexity, CIAC 2010. Volume 6078. LNCS. Extended abstract of [18]. 2010, pages 192–203. doi: 10.1007/978- 3-642-13073-1_18.

[12]

Bart M. P. Jansen. “Polynomial Kernels for Hard Problems on Disk Graphs”. In: Proceedings of the 12th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2010. Volume 6139. LNCS. 2010, pages 310–321. doi: 10.1007/978-3-642-13731-0_30.

[13]

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, and Bettina Speckmann. “Feed-links for network extensions”. In: Proceedings of the 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, ACM-GIS 2008. Extended abstract of [20]. 2008, page 35. doi: 10.1145/1463434.1463478.

Conference submissions

[14]

Michael R. Fellows and Bart M. P. Jansen. FPT is Characterized by Useful Obstruction Sets. To appear in the Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2013. 2013. arXiv:1305.3102.

Journal publications

[15]

Michael R. Fellows, Bart M. P. Jansen, and Frances Rosamond. “Towards Fully Multivariate Algorithmics: Parameter Ecology and the Deconstruction of Computational Complexity”. In: European Journal of Combinatorics 34.3 (2013). IWOCA 2009 Special Issue, pages 541 –566. doi: 10.1016/j.ejc.2012.04.008.

[16]

Hans L. Bodlaender, Bart M. P. Jansen, and Stefan Kratsch. “Kernel Bounds for Path and Cycle Problems”. In: Theoretical Computer Science Special Issue on Parameterized and Exact Computation (2012). Online First. doi: 10.1016/j.tcs.2012.09.006. arXiv:1106.4141.

[17]

Pinar Heggernes, Pim van ’t Hof, Bart M. P. Jansen, Stefan Kratsch, and Yngve Villanger. “Parameterized Complexity of Vertex Deletion into Perfect Graph Classes”. In: Theoretical Computer Science Special Issue on Parameterized and Exact Computation (2012). Online First. doi: 10. 1016/j.tcs.2012.03.013.

[18]

Bart M. P. Jansen. “Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights”. In: Journal of Graph Algorithms and Applications 16 (4 2012), pages 811–846. doi: 10.7155/jgaa.00279.

[19]

Bart M. P. Jansen and Hans L. Bodlaender. “Vertex Cover Kernelization Revisited”. In: STACS 2011 Special Issue of Theory of Computing Systems (2012). Online First. doi: 10.1007/s00224-012-9393-4. arXiv:1012. 4701.

[20]

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, and Bettina Speckmann. “Connect the dot: Computing feed-links for network extension”. In: J. Spatial Information Science 3.1 (2011), pages 3–31. doi: 10.5311/JOSIS.2011.3.47.

Journal submissions

[21]

Hans L. Bodlaender, Bart M. P. Jansen, and Stefan Kratsch. Kernelization Lower Bounds By Cross-Composition. Submitted to the SIAM Journal on Discrete Mathematics. 29 pages. 2012. arXiv:1206.5941.

[22]

Hans L. Bodlaender, Bart M. P. Jansen, and Stefan Kratsch. Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. Submitted to the SIAM Journal on Discrete Mathematics. 35 pages. 2012. arXiv:1104.4217.

[23]

Bart M. P. Jansen and Stefan Kratsch. Data Reduction for Graph Coloring Problems. Submitted to the FCT 2011 Special Issue of Information and Computation. 34 pages. 2011. arXiv:1104.4229.

Technical Reports

Master's Thesis

Other events