Fellows, M.R., Jansen, B.M.P. & Rosamond, F.A. (2013). Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity. European Journal of Combinatorics, 34(3), 541-566.
|
Bodlaender, H.L., Jansen, B.M.P. & Kratsch, S. (2012). Kernel Bounds for Path and Cycle Problems. In Dániel Marx & Peter Rossmanith (Eds.), Parameterized and Exact Computation - 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers (pp. 145-158). Springer.
|
Bodlaender, H.L., Jansen, B.M.P. & Kratsch, S. (2012). Kernel Bounds for Structural Parameterizations of Pathwidth. In F..V. Fomin & P. Kaski (Eds.), Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012 Vol. 7357. Lecture Notes in Computer Science (pp. 352-363). Springer.
|
Jansen, B.M.P. (2012). Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights. Journal of Graph Algorithms and Applications, 16, 811-846.
|
Jansen, B.M.P. & Kratsch, S. (2012). On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal. In Dániel Marx & Peter Rossmanith (Eds.), Parameterized and Exact Computation - 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers (pp. 132-144). Springer.
|
Fomin, F.V., Jansen, B.M.P. & Pilipczuk, M. (2012). Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? In D.M Thilikos & G.J Woeginger (Eds.), 7th International Symposium on Parameterized and Exact Computation, IPEC 2012 Vol. 7535. Lecture Notes in Computer Science (pp. 97-108). Berlin/Heidelberg: Springer.
|
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). Kernel Bounds for Path and Cycle Problems. In D. Marx & P. Rossmanith (Eds.), Parameterized and Exact Computation - 6th International Symposium, IPEC 2011 Vol. 7112. Lecture Notes in Computer Science (pp. 145-158). Springer.
|
Jansen, B.M.P. & Kratsch, S. (2012). On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal. In D. Marx & P. Rossmanith (Eds.), Parameterized and Exact Computation - 6th International Symposium, IPEC 2011 Vol. 7112. Lecture Notes in Computer Science (pp. 132-144). 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.
|
webmaster@cs.uu.nl,
Thu, 20 Jun 2013 14:12:30 +0200
←
Departement Informatica, Universiteit Utrecht