Bart M. P. Jansen
Cited by
Cited by
Kernelization lower bounds by cross-composition
HL Bodlaender, BMP Jansen, S Kratsch
SIAM Journal on Discrete Mathematics 28 (1), 277-305, 2014
Cross-composition: A new technique for kernelization lower bounds
HL Bodlaender, BMP Jansen, S Kratsch
arXiv preprint arXiv:1011.4224, 2010
Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity
MR Fellows, BMP Jansen, F Rosamond
European Journal of Combinatorics 34 (3), 541-566, 2013
Vertex cover kernelization revisited: Upper and lower bounds for a refined parameter
BMP Jansen, HL Bodlaender
Theory of Computing Systems 53 (2), 263-299, 2013
Preprocessing for treewidth: A combinatorial analysis through kernelization
HL Bodlaender, BMP Jansen, S Kratsch
SIAM Journal on Discrete Mathematics 27 (4), 2108-2142, 2013
A near-optimal planarization algorithm
BMP Jansen, D Lokshtanov, S Saurabh
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
Data reduction for graph coloring problems
BMP Jansen, S Kratsch
Information and Computation 231, 70-88, 2013
The first parameterized algorithms and computational experiments challenge
H Dell, T Husfeldt, BMP Jansen, P Kaski, C Komusiewicz, FA Rosamond
International Symposium on Parameterized and Exact Computation, 1-9, 2017
Parameterized complexity of vertex deletion into perfect graph classes
P Heggernes, P Van’t Hof, BMP Jansen, S Kratsch, Y Villanger
Theoretical Computer Science 511, 172-180, 2013
Kernel bounds for path and cycle problems
HL Bodlaender, BMP Jansen, S Kratsch
Theoretical Computer Science 511, 117-136, 2013
Approximation and kernelization for chordal vertex deletion
BMP Jansen, M Pilipczuk
SIAM Journal on Discrete Mathematics 32 (3), 2258-2301, 2018
The power of data reduction: Kernels for fundamental graph problems
BMP Jansen
Utrecht University, 2013
Turing kernelization for finding long paths and cycles in restricted graph classes
BMP Jansen
Journal of Computer and System Sciences 85, 18-37, 2017
Preprocessing subgraph and minor problems: When does a small vertex cover help?
FV Fomin, BMP Jansen, M Pilipczuk
Journal of Computer and System Sciences 80 (2), 468-495, 2014
Vertex deletion parameterized by elimination distance and even less
BMP Jansen, JJH De Kroon, M Włodarczyk
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
Fine-grained complexity analysis of two classic TSP variants
M Berg, K Buchin, BMP Jansen, G Woeginger
ACM Transactions on Algorithms (TALG) 17 (1), 1-29, 2020
Fine-grained parameterized complexity analysis of graph coloring problems
L Jaffke, BMP Jansen
International Conference on Algorithms and Complexity, 345-356, 2017
Uniform kernelization complexity of hitting forbidden minors
AC Giannopoulou, BMP Jansen, D Lokshtanov, S Saurabh
ACM Transactions on Algorithms (TALG) 13 (3), 1-35, 2017
Parameter ecology for feedback vertex set
BMP Jansen, V Raman, M Vatshelle
Tsinghua Science and Technology 19 (4), 387-409, 2014
Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels
BMP Jansen, D Marx
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2014
The system can't perform the operation now. Try again later.
Articles 1–20