Edit Profile (opens in new tab) Jansen, Bart M. P. Co-Author Distance Author ID: jansen.bart-m-p Published as: Jansen, Bart M. P.; Jansen, Bart External Links: MGP Documents Indexed: 87 Publications since 2005 2 Contributions as Editor Co-Authors: 52 Co-Authors with 78 Joint Publications 1,770 Co-Co-Authors all top 5 Co-Authors 11 single-authored 13 Kratsch, Stefan 11 Pieterse, Astrid 9 Bodlaender, Hans L. 7 Donkers, Huib 6 de Kroon, Jari J. H. 6 Pilipczuk, Marcin L. 6 Włodarczyk, Michał 4 de Berg, Mark Theodoor 4 Fellows, Michael Ralph 4 Lokshtanov, Daniel 4 Saurabh, Saket 3 Chen, Hubie 3 Nederlof, Jesper 2 Buchin, Kevin 2 de Kroon, Arnoud A. W. M. 2 Dekker, David J. C. 2 Fomin, Fedor V. 2 Giannopoulou, Archontia C. 2 Heggernes, Pinar 2 Jaffke, Lars 2 Morel, Rolf 2 Mukherjee, Debankur 2 Pilipczuk, Michał 2 Rosamond, Frances A. 2 Telle, Jan Arne 2 van Geffen, Bas A. M. 2 Van Leeuwen, Erik Jan 2 van ’t Hof, Pim 2 Villanger, Yngve 2 Woeginger, Gerhard 2 Wrochna, Marcin 2 Wulms, Jules J. H. M. 1 Barri, Adriaan 1 Bonnet, Edouard 1 Bougeret, Marin 1 De Vylder, Bart 1 Dooms, Ann 1 Einarson, Carl 1 Gutin, Gregory Z. 1 Iwata, Yoichi 1 Kowalik, Łukasz 1 Kozma, Laszlo 1 Lenaerts, Tom 1 Majumdar, Diptapriyo 1 Marx, Dániel 1 Okrasa, Karolina 1 Roy, Shivesh Kumar 1 Rzążewski, Paweł 1 Sau, Ignasi 1 Schelkens, Peter 1 Tuyls, Karl 1 Wahlström, Magnus all top 5 Serials 7 Algorithmica 6 Journal of Computer and System Sciences 5 SIAM Journal on Discrete Mathematics 4 Discrete Applied Mathematics 4 Theoretical Computer Science 3 Journal of Graph Algorithms and Applications 2 ACM Transactions on Algorithms 2 ACM Transactions on Computation Theory 1 European Journal of Combinatorics 1 Information and Computation 1 Theory of Computing Systems 1 IEEE Transactions on Image Processing 1 LIPIcs – Leibniz International Proceedings in Informatics 1 Journal of Theoretical Biology all top 5 Fields 82 Computer science (68-XX) 57 Combinatorics (05-XX) 10 Operations research, mathematical programming (90-XX) 2 General and overarching topics; collections (00-XX) 2 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 1 Information and communication theory, circuits (94-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 71 Publications have been cited 659 times in 400 Documents Cited by ▼ Year ▼ Kernelization lower bounds by cross-composition. Zbl 1295.05222 Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan 125 2014 Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity. Zbl 1448.68465 Fellows, Michael R.; Jansen, Bart M. P.; Rosamond, Frances 55 2013 Cross-composition: a new technique for kernelization lower bounds. Zbl 1230.68085 Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan 46 2011 Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter. Zbl 1286.68196 Jansen, Bart M. P.; Bodlaender, Hans L. 30 2013 A near-optimal planarization algorithm. Zbl 1423.68341 Jansen, Bart M. P.; Lokshtanov, Daniel; Saurabh, Saket 27 2014 Data reduction for graph coloring problems. Zbl 1435.68124 Jansen, Bart M. P.; Kratsch, Stefan 22 2013 Parameterized complexity of vertex deletion into perfect graph classes. Zbl 1407.68223 Heggernes, Pinar; van ’t Hof, Pim; Jansen, Bart M. P.; Kratsch, Stefan; Villanger, Yngve 18 2013 Approximation and kernelization for chordal vertex deletion. Zbl 1394.05124 Jansen, Bart M. P.; Pilipczuk, Marcin 17 2018 Fine-grained parameterized complexity analysis of graph coloring problems. Zbl 1486.68083 Jaffke, Lars; Jansen, Bart M. P. 16 2017 Kernel bounds for path and cycle problems. Zbl 1407.68207 Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan 16 2013 Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels. Zbl 1371.68212 Jansen, Bart M. P.; Marx, Dániel 15 2015 Preprocessing subgraph and minor problems: when does a small vertex cover help? Zbl 1277.68095 Fomin, Fedor V.; Jansen, Bart M. P.; Pilipczuk, Michał 15 2014 Preprocessing for treewidth: a combinatorial analysis through kernelization. Zbl 1333.68204 Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan 14 2011 Preprocessing for treewidth: a combinatorial analysis through kernelization. Zbl 1290.05143 Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan 13 2013 Vertex cover kernelization revisited: upper and lower bounds for a refined parameter. Zbl 1230.68092 Jansen, Bart M. P.; Bodlaender, Hans L. 12 2011 Uniform kernelization complexity of hitting forbidden minors. Zbl 1440.68137 Giannopoulou, Archontia C.; Jansen, Bart M. P.; Lokshtanov, Daniel; Saurabh, Saket 12 2017 Approximation and kernelization for chordal vertex deletion. Zbl 1410.68300 Jansen, Bart M. P.; Pilipczuk, Marcin 11 2017 Kernel bounds for structural parameterizations of pathwidth. Zbl 1357.68078 Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan 9 2012 A structural approach to kernels for ILPs: treewidth and total unimodularity. Zbl 1466.68046 Jansen, Bart M. P.; Kratsch, Stefan 9 2015 Sparsification upper and lower bounds for graph problems and not-all-equal SAT. Zbl 1372.68129 Jansen, Bart M. P.; Pieterse, Astrid 9 2017 Fine-grained complexity analysis of two classic TSP variants. Zbl 1388.68139 de Berg, Mark; Buchin, Kevin; Jansen, Bart M. P.; Woeginger, Gerhard 9 2016 Data reduction for graph coloring problems. Zbl 1342.68167 Jansen, Bart M. P.; Kratsch, Stefan 8 2011 Parameterized complexity of vertex deletion into perfect graph classes. Zbl 1342.68165 Heggernes, Pinar; van’t Hof, Pim; Jansen, Bart M. P.; Kratsch, Stefan; Villanger, Yngve 8 2011 Uniform kernelization complexity of hitting forbidden minors. Zbl 1441.68107 Giannopoulou, Archontia C.; Jansen, Bart M. P.; Lokshtanov, Daniel; Saurabh, Saket 8 2015 Vertex deletion parameterized by elimination distance and even less. Zbl 07765285 Jansen, Bart M. P.; de Kroon, Jari J. H.; Włodarczyk, Michał 8 2021 Optimal sparsification for some binary CSPs using low-degree polynomials. Zbl 1398.68244 Jansen, Bart M. P.; Pieterse, Astrid 6 2016 Turing kernelization for finding long paths and cycles in restricted graph classes. Zbl 1425.68144 Jansen, Bart M. P. 6 2014 Optimal sparsification for some binary CSPs using low-degree polynomials. Zbl 1495.68100 Jansen, Bart M. P.; Pieterse, Astrid 6 2019 Polynomial kernels for hitting forbidden minors under structural parameterizations. Zbl 1455.68143 Jansen, Bart M. P.; Pieterse, Astrid 6 2020 Polynomial kernels for hard problems on disk graphs. Zbl 1285.68123 Jansen, Bart 5 2010 Kernel bounds for path and cycle problems. Zbl 1352.68092 Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan 5 2012 Turing kernelization for finding long paths and cycles in restricted graph classes. Zbl 1356.68099 Jansen, Bart M. P. 5 2017 On sparsification for computing treewidth. Zbl 1312.68103 Jansen, Bart 5 2015 Computing the chromatic number using graph decompositions via matrix rank. Zbl 1431.68053 Jansen, Bart M. P.; Nederlof, Jesper 5 2019 Best-case and worst-case sparsifiability of Boolean CSPs. Zbl 1452.68176 Chen, Hubie; Jansen, Bart M. P.; Pieterse, Astrid 5 2020 Optimal data reduction for graph coloring using low-degree polynomials. Zbl 1430.68128 Jansen, Bart M. P.; Pieterse, Astrid 5 2019 FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders. Zbl 1347.68167 Fellows, Michael R.; Jansen, Bart M. P. 4 2014 Sparsification upper and lower bounds for graphs problems and not-all-equal SAT. Zbl 1372.68128 Jansen, Bart M. P.; Pieterse, Astrid 4 2015 Optimal data reduction for graph coloring using low-degree polynomials. Zbl 1443.68132 Jansen, Bart M. P.; Pieterse, Astrid 4 2018 Best-case and worst-case sparsifiability of Boolean CSPs. Zbl 1520.68177 Chen, Hubie; Jansen, Bart M. P.; Pieterse, Astrid 4 2019 On polynomial kernels for structural parameterizations of odd cycle transversal. Zbl 1352.68112 Jansen, Bart M. P.; Kratsch, Stefan 3 2012 Kernelization for maximum leaf spanning tree with positive vertex weights. Zbl 1254.68126 Jansen, Bart M. P. 3 2012 Bridge-depth characterizes which minor-closed structural parameterizations of vertex cover admit a polynomial kernel. Zbl 1503.05095 Bougeret, Marin; Jansen, Bart M. P.; Sau, Ignasi 3 2022 Polynomial kernels for hitting forbidden minors under structural parameterizations. Zbl 1524.68233 Jansen, Bart M. P.; Pieterse, Astrid 3 2018 Turing kernelization for finding long paths in graph classes excluding a topological minor. Zbl 1430.68219 Jansen, Bart M. P.; Pilipczuk, Marcin; Wrochna, Marcin 3 2019 Determining the winner of a Dodgson election is hard. Zbl 1245.68091 Fellows, Michael; Jansen, Bart M. P.; Lokshtanov, Daniel; Rosamond, Frances A.; Saurabh, Saket 2 2010 Lower bounds for protrusion replacement by counting equivalence classes. Zbl 1398.05110 Jansen, Bart M. P.; Wulms, Jules J. H. M. 2 2017 On structural parameterizations of Hitting Set: hitting paths in graphs using 2-SAT. Zbl 1417.05213 Jansen, Bart M. P. 2 2016 Sparsification lower bounds for list \(H\)-coloring. Zbl 07765416 Chen, Hubie; Jansen, Bart M. P.; Okrasa, Karolina; Pieterse, Astrid; Rzążewski, Paweł 2 2020 FPT algorithms to compute the elimination distance to bipartite graphs and more. Zbl 07538568 Jansen, Bart M. P.; de Kroon, Jari J. H. 2 2021 FPT is characterized by useful obstruction sets. Zbl 1417.68051 Fellows, Michael R.; Jansen, Bart M. P. 2 2013 On sparsification for computing treewidth. Zbl 1309.68096 Jansen, Bart M. P. 2 2013 A deterministic polynomial kernel for odd cycle transversal and vertex multiway cut in planar graphs. Zbl 07559148 Jansen, Bart M. P.; Pilipczuk, Marcin; van Leeuwen, Erik Jan 2 2019 Hamiltonicity below Dirac’s condition. Zbl 07173288 Jansen, Bart M. P.; Kozma, László; Nederlof, Jesper 2 2019 Lower bounds for protrusion replacement by counting equivalence classes. Zbl 1437.05224 Jansen, Bart M. P.; Wulms, Jules J. H. M. 2 2020 Fine-grained complexity analysis of two classic TSP variants. Zbl 07471490 de Berg, Mark; Buchin, Kevin; Jansen, Bart M. P.; Woeginger, Gerhard 2 2020 Kernelization for maximum leaf spanning tree with positive vertex weights. Zbl 1284.68298 Jansen, Bart 1 2010 Independent-set reconfiguration thresholds of hereditary graph classes. Zbl 1391.05198 de Berg, Mark; Jansen, Bart M. P.; Mukherjee, Debankur 1 2016 On structural parameterizations of Hitting Set: hitting paths in graphs using 2-SAT. Zbl 1358.05281 Jansen, Bart M. P. 1 2017 Lower bounds for dynamic programming on planar graphs of bounded cutwidth. Zbl 1446.05087 van Geffen, Bas A. M.; Jansen, Bart M. P.; de Kroon, Arnoud A. W. M.; Morel, Rolf 1 2020 Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies. Zbl 07759295 Jansen, Bart M. P.; De Kroon, Jari J. H. 1 2020 Preprocessing to reduce the search space: antler structures for feedback vertex set. Zbl 07538563 Donkers, Huib; Jansen, Bart M. P. 1 2021 A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion. Zbl 1482.68110 Donkers, Huib; Jansen, Bart M. P. 1 2021 \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms. Zbl 07639162 Einarson, Carl; Gutin, Gregory; Jansen, Bart M. P.; Majumdar, Diptapriyo; Wahlström, Magnus 1 2023 A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F}\)-minor-free deletion. Zbl 1477.68131 Donkers, Huib; Jansen, Bart M. P. 1 2019 Turing kernelization for finding long paths in graphs excluding a topological minor. Zbl 1443.68133 Jansen, Bart M. P.; Pilipczuk, Marcin; Wrochna, Marcin 1 2018 Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size. Zbl 07608295 Donkers, Huib; Jansen, Bart M. P.; Włodarczyk, Michał 1 2022 Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies. Zbl 1483.68258 Jansen, Bart M. P.; de Kroon, Jari J. H. 1 2022 Computing the chromatic number using graph decompositions via matrix rank. Zbl 1524.68155 Jansen, Bart M. P.; Nederlof, Jesper 1 2018 Preprocessing subgraph and minor problems: When does a small vertex cover help? Zbl 1374.68241 Fomin, Fedor V.; Jansen, Bart M. P.; Pilipczuk, Michał 1 2012 Independent-set reconfiguration thresholds of hereditary graph classes. Zbl 1398.05155 de Berg, Mark; Jansen, Bart M. P.; Mukherjee, Debankur 1 2018 \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms. Zbl 07639162 Einarson, Carl; Gutin, Gregory; Jansen, Bart M. P.; Majumdar, Diptapriyo; Wahlström, Magnus 1 2023 Bridge-depth characterizes which minor-closed structural parameterizations of vertex cover admit a polynomial kernel. Zbl 1503.05095 Bougeret, Marin; Jansen, Bart M. P.; Sau, Ignasi 3 2022 Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size. Zbl 07608295 Donkers, Huib; Jansen, Bart M. P.; Włodarczyk, Michał 1 2022 Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies. Zbl 1483.68258 Jansen, Bart M. P.; de Kroon, Jari J. H. 1 2022 Vertex deletion parameterized by elimination distance and even less. Zbl 07765285 Jansen, Bart M. P.; de Kroon, Jari J. H.; Włodarczyk, Michał 8 2021 FPT algorithms to compute the elimination distance to bipartite graphs and more. Zbl 07538568 Jansen, Bart M. P.; de Kroon, Jari J. H. 2 2021 Preprocessing to reduce the search space: antler structures for feedback vertex set. Zbl 07538563 Donkers, Huib; Jansen, Bart M. P. 1 2021 A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion. Zbl 1482.68110 Donkers, Huib; Jansen, Bart M. P. 1 2021 Polynomial kernels for hitting forbidden minors under structural parameterizations. Zbl 1455.68143 Jansen, Bart M. P.; Pieterse, Astrid 6 2020 Best-case and worst-case sparsifiability of Boolean CSPs. Zbl 1452.68176 Chen, Hubie; Jansen, Bart M. P.; Pieterse, Astrid 5 2020 Sparsification lower bounds for list \(H\)-coloring. Zbl 07765416 Chen, Hubie; Jansen, Bart M. P.; Okrasa, Karolina; Pieterse, Astrid; Rzążewski, Paweł 2 2020 Lower bounds for protrusion replacement by counting equivalence classes. Zbl 1437.05224 Jansen, Bart M. P.; Wulms, Jules J. H. M. 2 2020 Fine-grained complexity analysis of two classic TSP variants. Zbl 07471490 de Berg, Mark; Buchin, Kevin; Jansen, Bart M. P.; Woeginger, Gerhard 2 2020 Lower bounds for dynamic programming on planar graphs of bounded cutwidth. Zbl 1446.05087 van Geffen, Bas A. M.; Jansen, Bart M. P.; de Kroon, Arnoud A. W. M.; Morel, Rolf 1 2020 Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies. Zbl 07759295 Jansen, Bart M. P.; De Kroon, Jari J. H. 1 2020 Optimal sparsification for some binary CSPs using low-degree polynomials. Zbl 1495.68100 Jansen, Bart M. P.; Pieterse, Astrid 6 2019 Computing the chromatic number using graph decompositions via matrix rank. Zbl 1431.68053 Jansen, Bart M. P.; Nederlof, Jesper 5 2019 Optimal data reduction for graph coloring using low-degree polynomials. Zbl 1430.68128 Jansen, Bart M. P.; Pieterse, Astrid 5 2019 Best-case and worst-case sparsifiability of Boolean CSPs. Zbl 1520.68177 Chen, Hubie; Jansen, Bart M. P.; Pieterse, Astrid 4 2019 Turing kernelization for finding long paths in graph classes excluding a topological minor. Zbl 1430.68219 Jansen, Bart M. P.; Pilipczuk, Marcin; Wrochna, Marcin 3 2019 A deterministic polynomial kernel for odd cycle transversal and vertex multiway cut in planar graphs. Zbl 07559148 Jansen, Bart M. P.; Pilipczuk, Marcin; van Leeuwen, Erik Jan 2 2019 Hamiltonicity below Dirac’s condition. Zbl 07173288 Jansen, Bart M. P.; Kozma, László; Nederlof, Jesper 2 2019 A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F}\)-minor-free deletion. Zbl 1477.68131 Donkers, Huib; Jansen, Bart M. P. 1 2019 Approximation and kernelization for chordal vertex deletion. Zbl 1394.05124 Jansen, Bart M. P.; Pilipczuk, Marcin 17 2018 Optimal data reduction for graph coloring using low-degree polynomials. Zbl 1443.68132 Jansen, Bart M. P.; Pieterse, Astrid 4 2018 Polynomial kernels for hitting forbidden minors under structural parameterizations. Zbl 1524.68233 Jansen, Bart M. P.; Pieterse, Astrid 3 2018 Turing kernelization for finding long paths in graphs excluding a topological minor. Zbl 1443.68133 Jansen, Bart M. P.; Pilipczuk, Marcin; Wrochna, Marcin 1 2018 Computing the chromatic number using graph decompositions via matrix rank. Zbl 1524.68155 Jansen, Bart M. P.; Nederlof, Jesper 1 2018 Independent-set reconfiguration thresholds of hereditary graph classes. Zbl 1398.05155 de Berg, Mark; Jansen, Bart M. P.; Mukherjee, Debankur 1 2018 Fine-grained parameterized complexity analysis of graph coloring problems. Zbl 1486.68083 Jaffke, Lars; Jansen, Bart M. P. 16 2017 Uniform kernelization complexity of hitting forbidden minors. Zbl 1440.68137 Giannopoulou, Archontia C.; Jansen, Bart M. P.; Lokshtanov, Daniel; Saurabh, Saket 12 2017 Approximation and kernelization for chordal vertex deletion. Zbl 1410.68300 Jansen, Bart M. P.; Pilipczuk, Marcin 11 2017 Sparsification upper and lower bounds for graph problems and not-all-equal SAT. Zbl 1372.68129 Jansen, Bart M. P.; Pieterse, Astrid 9 2017 Turing kernelization for finding long paths and cycles in restricted graph classes. Zbl 1356.68099 Jansen, Bart M. P. 5 2017 Lower bounds for protrusion replacement by counting equivalence classes. Zbl 1398.05110 Jansen, Bart M. P.; Wulms, Jules J. H. M. 2 2017 On structural parameterizations of Hitting Set: hitting paths in graphs using 2-SAT. Zbl 1358.05281 Jansen, Bart M. P. 1 2017 Fine-grained complexity analysis of two classic TSP variants. Zbl 1388.68139 de Berg, Mark; Buchin, Kevin; Jansen, Bart M. P.; Woeginger, Gerhard 9 2016 Optimal sparsification for some binary CSPs using low-degree polynomials. Zbl 1398.68244 Jansen, Bart M. P.; Pieterse, Astrid 6 2016 On structural parameterizations of Hitting Set: hitting paths in graphs using 2-SAT. Zbl 1417.05213 Jansen, Bart M. P. 2 2016 Independent-set reconfiguration thresholds of hereditary graph classes. Zbl 1391.05198 de Berg, Mark; Jansen, Bart M. P.; Mukherjee, Debankur 1 2016 Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels. Zbl 1371.68212 Jansen, Bart M. P.; Marx, Dániel 15 2015 A structural approach to kernels for ILPs: treewidth and total unimodularity. Zbl 1466.68046 Jansen, Bart M. P.; Kratsch, Stefan 9 2015 Uniform kernelization complexity of hitting forbidden minors. Zbl 1441.68107 Giannopoulou, Archontia C.; Jansen, Bart M. P.; Lokshtanov, Daniel; Saurabh, Saket 8 2015 On sparsification for computing treewidth. Zbl 1312.68103 Jansen, Bart 5 2015 Sparsification upper and lower bounds for graphs problems and not-all-equal SAT. Zbl 1372.68128 Jansen, Bart M. P.; Pieterse, Astrid 4 2015 Kernelization lower bounds by cross-composition. Zbl 1295.05222 Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan 125 2014 A near-optimal planarization algorithm. Zbl 1423.68341 Jansen, Bart M. P.; Lokshtanov, Daniel; Saurabh, Saket 27 2014 Preprocessing subgraph and minor problems: when does a small vertex cover help? Zbl 1277.68095 Fomin, Fedor V.; Jansen, Bart M. P.; Pilipczuk, Michał 15 2014 Turing kernelization for finding long paths and cycles in restricted graph classes. Zbl 1425.68144 Jansen, Bart M. P. 6 2014 FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders. Zbl 1347.68167 Fellows, Michael R.; Jansen, Bart M. P. 4 2014 Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity. Zbl 1448.68465 Fellows, Michael R.; Jansen, Bart M. P.; Rosamond, Frances 55 2013 Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter. Zbl 1286.68196 Jansen, Bart M. P.; Bodlaender, Hans L. 30 2013 Data reduction for graph coloring problems. Zbl 1435.68124 Jansen, Bart M. P.; Kratsch, Stefan 22 2013 Parameterized complexity of vertex deletion into perfect graph classes. Zbl 1407.68223 Heggernes, Pinar; van ’t Hof, Pim; Jansen, Bart M. P.; Kratsch, Stefan; Villanger, Yngve 18 2013 Kernel bounds for path and cycle problems. Zbl 1407.68207 Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan 16 2013 Preprocessing for treewidth: a combinatorial analysis through kernelization. Zbl 1290.05143 Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan 13 2013 FPT is characterized by useful obstruction sets. Zbl 1417.68051 Fellows, Michael R.; Jansen, Bart M. P. 2 2013 On sparsification for computing treewidth. Zbl 1309.68096 Jansen, Bart M. P. 2 2013 Kernel bounds for structural parameterizations of pathwidth. Zbl 1357.68078 Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan 9 2012 Kernel bounds for path and cycle problems. Zbl 1352.68092 Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan 5 2012 On polynomial kernels for structural parameterizations of odd cycle transversal. Zbl 1352.68112 Jansen, Bart M. P.; Kratsch, Stefan 3 2012 Kernelization for maximum leaf spanning tree with positive vertex weights. Zbl 1254.68126 Jansen, Bart M. P. 3 2012 Preprocessing subgraph and minor problems: When does a small vertex cover help? Zbl 1374.68241 Fomin, Fedor V.; Jansen, Bart M. P.; Pilipczuk, Michał 1 2012 Cross-composition: a new technique for kernelization lower bounds. Zbl 1230.68085 Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan 46 2011 Preprocessing for treewidth: a combinatorial analysis through kernelization. Zbl 1333.68204 Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan 14 2011 Vertex cover kernelization revisited: upper and lower bounds for a refined parameter. Zbl 1230.68092 Jansen, Bart M. P.; Bodlaender, Hans L. 12 2011 Data reduction for graph coloring problems. Zbl 1342.68167 Jansen, Bart M. P.; Kratsch, Stefan 8 2011 Parameterized complexity of vertex deletion into perfect graph classes. Zbl 1342.68165 Heggernes, Pinar; van’t Hof, Pim; Jansen, Bart M. P.; Kratsch, Stefan; Villanger, Yngve 8 2011 Polynomial kernels for hard problems on disk graphs. Zbl 1285.68123 Jansen, Bart 5 2010 Determining the winner of a Dodgson election is hard. Zbl 1245.68091 Fellows, Michael; Jansen, Bart M. P.; Lokshtanov, Daniel; Rosamond, Frances A.; Saurabh, Saket 2 2010 Kernelization for maximum leaf spanning tree with positive vertex weights. Zbl 1284.68298 Jansen, Bart 1 2010 all cited Publications top 5 cited Publications all top 5 Cited by 430 Authors 45 Jansen, Bart M. P. 37 Saurabh, Saket 23 Niedermeier, Rolf 22 Golovach, Petr A. 22 Kratsch, Stefan 21 Thilikos, Dimitrios M. 19 Sau, Ignasi 18 Pilipczuk, Marcin L. 18 Raman, Venkatesh 17 Fomin, Fedor V. 17 Lokshtanov, Daniel 15 Komusiewicz, Christian 14 Ganian, Robert 14 Nichterlein, André 13 Cygan, Marek 13 Eiben, Eduard 13 Pilipczuk, Michał 12 Majumdar, Diptapriyo 11 Pieterse, Astrid 11 Ramanujan, M. S. 11 Sorge, Manuel 11 Zehavi, Meirav 10 van Bevern, René 9 Agrawal, Akanksha 9 Bodlaender, Hans L. 9 Panolan, Fahad 9 Rai, Ashutosh 8 Fellows, Michael Ralph 8 Ordyniak, Sebastian 8 Suchý, Ondřej 8 Van Leeuwen, Erik Jan 7 Bougeret, Marin 7 Fluschnik, Till 7 Jacob, Ashwin 7 Philip, Geevarghese 7 Stamoulis, Giannos 6 Banik, Aritra 6 Bonnet, Edouard 6 Bredereck, Robert 6 Gutin, Gregory Z. 6 Hartung, Sepp 6 Hermelin, Danny 6 Knop, Dušan 6 Koutecký, Martin 6 Lampis, Michael 6 Mertzios, George B. 6 Mnich, Matthias 6 Otachi, Yota 6 Rosamond, Frances A. 6 Weller, Mathias 5 Araújo, Júlio César Silva 5 Baste, Julien 5 Campos, Victor A. 5 dos Santos, Vinícius Fernandes 5 Giannopoulou, Archontia C. 5 Heggernes, Pinar 5 Jaffke, Lars 5 Kolay, Sudeshna 5 Kwon, O. joung 5 Marx, Dániel 5 Misra, Pranabendu 5 Nederlof, Jesper 5 Okrasa, Karolina 5 Paul, Christophe 5 Szeider, Stefan 5 Tale, Prafullkumar 5 Thomassé, Stéphan 5 Wahlström, Magnus 4 Ahn, Jungho 4 Bulteau, Laurent 4 dos Santos Souza, Uéverton 4 Gomes, Guilherme C. M. 4 Hols, Eva-Maria C. 4 Kanesh, Lawqueen 4 Kim, Eunjung 4 Liedloff, Mathieu 4 Misra, Neeldhara 4 Molter, Hendrik 4 Paschos, Vangelis Th. 4 Paulusma, Daniël 4 Sikora, Florian 4 van ’t Hof, Pim 4 Watrigant, Rémi 3 Abu-Khzam, Faisal N. 3 Bandopadhyay, Susobhan 3 Bazgan, Cristina 3 Cai, Leizhen 3 Chen, Hubie 3 Chen, Jiehua 3 de Kroon, Jari J. H. 3 Dell, Holger 3 Derbisz, Jan 3 Dondi, Riccardo 3 Donkers, Huib 3 Dublois, Louis 3 Fernau, Henning 3 Giroudeau, Rodolphe 3 Hanaka, Tesshu 3 Himmel, Anne-Sophie 3 Kanj, Iyad A. ...and 330 more Authors all top 5 Cited in 40 Serials 64 Algorithmica 41 Theoretical Computer Science 30 Journal of Computer and System Sciences 29 SIAM Journal on Discrete Mathematics 22 Discrete Applied Mathematics 11 Theory of Computing Systems 7 Information and Computation 6 Journal of Graph Algorithms and Applications 5 Information Processing Letters 4 Artificial Intelligence 4 Journal of Scheduling 4 ACM Transactions on Computation Theory 3 ACM Transactions on Algorithms 2 Journal of Combinatorial Theory. Series B 2 Networks 2 SIAM Journal on Computing 2 Discrete & Computational Geometry 2 Computers & Operations Research 2 The Journal of Artificial Intelligence Research (JAIR) 2 Journal of Combinatorial Optimization 2 Discrete Optimization 2 Algorithms 2 Computer Science Review 1 Acta Informatica 1 Discrete Mathematics 1 European Journal of Combinatorics 1 Operations Research Letters 1 Graphs and Combinatorics 1 Journal of Automated Reasoning 1 Computational Geometry 1 International Journal of Foundations of Computer Science 1 European Journal of Operational Research 1 Mathematical Programming. Series A. Series B 1 Constraints 1 RAIRO. Operations Research 1 Quantum Information Processing 1 ACM Transactions on Computational Logic 1 Journal of Multiple-Valued Logic and Soft Computing 1 ACM Journal of Experimental Algorithmics 1 Optimization Letters all top 5 Cited in 13 Fields 368 Computer science (68-XX) 245 Combinatorics (05-XX) 42 Operations research, mathematical programming (90-XX) 12 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 6 Mathematical logic and foundations (03-XX) 3 Biology and other natural sciences (92-XX) 3 Information and communication theory, circuits (94-XX) 2 Order, lattices, ordered algebraic structures (06-XX) 1 History and biography (01-XX) 1 General algebraic systems (08-XX) 1 Linear and multilinear algebra; matrix theory (15-XX) 1 Numerical analysis (65-XX) 1 Quantum theory (81-XX) Citations by Year