home	education	contact	library	calendar	search
	about us	research	people	archive	services	jobs

publications by B.M.P. Jansen, MSc

• Metis is a dutch, academic research information database
• see also: Metis for Departement Informatica
• please send notifications, questions, remarks etc to metis@cs.uu.nl
• see also : research -> Metis overviews

B.M.P. Jansen, MSc

• contact information
• my technical reports
• group algorithmic systems

some publications

Aronov, B., Buchin, K., Buchin, M., Jansen, B.M.P., Jong, T de, Kreveld, M.J. van, Loeffler, M., Luo, J., Silveira, R.I. & Speckmann, B. (2011). Connect the dot: computing feed-links for network extension. Journal of Spatial Information Science, 3, 3-31.

Bodlaender, H.L., Jansen, B.M.P. & Kratsch, S. (2011). Cross-Composition: A New Technique for Kernelization Lower Bounds. In C. Dürr & T. Schwentick (Eds.), Proceedings 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011 (pp. 165-176). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.

Jansen, B.M.P. & Kratsch, S. (2011). Data Reduction for Graph Coloring Problems. In O. Owe, M. Steffen & J..A. Telle (Eds.), Proceedings 18th International Symposium on Fundamentals of Computation Theory, FCT 2011 Vol. 6914. Lecture Notes in Computer Science (pp. 90-101). Springer.

Bodlaender, H.L., Jansen, B.M.P. & Kratsch, S. (2011). Parameterized Complexity of Vertex Deletion into Perfect Graph Classes. In O. Owe, M. Steffen & J..A. Telle (Eds.), Proceedings 18th International Symposium on Fundamentals of Computation Theory, FCT 2011 Vol. 6914. Lecture Notes in Computer Science (pp. 240-251). Springer.

Bodlaender, H.L., Jansen, B.M.P. & Kratsch, S. (2011). Preprocessing for Treewidth: A combinatorial analysis through kernelization. In L. Aceto, M. Henzinger & J. Sgall (Eds.), Proceedings of the 38th International Colloquium on Automata, Languages, and Programming ICALP 2011 Vol. 6755. Lecture Notes in Computer Science (pp. 437-448). Springer.

Jansen, B.M.P. & Bodlaender, H.L. Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter. In T Schwentick & C Dürr (Eds.), 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011 (pp. 177-188). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.

Fellows, M.R., Jansen, B.M.P., Lokshtanov, D., Rosamond, F.A. & Saurabh, S. (2010). Determining the Winner of a Dodgson Election is Hard. In K. Lodaya & M. Mahajan (Eds.), Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010) (pp. 459-468). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.

Jansen, B.M.P. (2010). Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights. In T. Calamoneri & J. Diaz (Eds.), Proceedings of the 7th International Conference on Algorithms and Complexity, CIAC 2010, Rome, Italy, May 26-28, 2010 Vol. 6078. Lecture Notes in Computer Science (pp. 192-203). Berlin / Heidelberg: Springer.

Jansen, B.M.P. (2010). Polynomial Kernels for Hard Problems on Disk Graphs. In H. Kaplan (Ed.), Proceedings of the 12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2010), Bergen, Norway Vol. 6139. Lecture Notes in Computer Science (pp. 310-321). Berlin / Heidelberg: Springer.

Jansen, B.M.P. (2009). Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights. onbekend: UU BETA ICS Departement Informatica.