Bart M. P. Jansen
Bart M. P. Jansen
Geverifieerd e-mailadres voor tue.nl - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
Kernelization lower bounds by cross-composition
HL Bodlaender, BMP Jansen, S Kratsch
SIAM Journal on Discrete Mathematics 28 (1), 277-305, 2014
1682014
Cross-composition: A new technique for kernelization lower bounds
HL Bodlaender, BMP Jansen, S Kratsch
arXiv preprint arXiv:1011.4224, 2010
1152010
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
852013
Vertex cover kernelization revisited
BMP Jansen, HL Bodlaender
Theory of Computing Systems 53 (2), 263-299, 2013
722013
Preprocessing for treewidth: A combinatorial analysis through kernelization
HL Bodlaender, BMP Jansen, S Kratsch
SIAM Journal on Discrete Mathematics 27 (4), 2108-2142, 2013
632013
Data reduction for graph coloring problems
BMP Jansen, S Kratsch
Information and Computation 231, 70-88, 2013
492013
A near-optimal planarization algorithm
BMP Jansen, D Lokshtanov, S Saurabh
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
402014
The first parameterized algorithms and computational experiments challenge
H Dell, T Husfeldt, BMP Jansen, P Kaski, C Komusiewicz, FA Rosamond
11th International Symposium on Parameterized and Exact Computation (IPEC 2016), 2017
392017
Kernel bounds for path and cycle problems
HL Bodlaender, BMP Jansen, S Kratsch
Theoretical Computer Science 511, 117-136, 2013
392013
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
372013
Turing kernelization for finding long paths and cycles in restricted graph classes
BMP Jansen
Journal of Computer and System Sciences 85, 18-37, 2017
252017
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
252014
The power of data reduction: Kernels for fundamental graph problems
BMP Jansen
Utrecht University, 2013
252013
Fine-grained complexity analysis of two classic TSP variants
M de Berg, K Buchin, BMP Jansen, G Woeginger
arXiv preprint arXiv:1607.02725, 2016
242016
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
242014
A structural approach to kernels for ILPs: Treewidth and total unimodularity
BMP Jansen, S Kratsch
Algorithms-ESA 2015, 779-791, 2015
232015
Parameter ecology for feedback vertex set
BMP Jansen, V Raman, M Vatshelle
Tsinghua Science and Technology 19 (4), 387-409, 2014
232014
Kernel bounds for structural parameterizations of pathwidth
HL Bodlaender, BMP Jansen, S Kratsch
Scandinavian Workshop on Algorithm Theory, 352-363, 2012
222012
On polynomial kernels for structural parameterizations of odd cycle transversal
BMP Jansen, S Kratsch
International Symposium on Parameterized and Exact Computation, 132-144, 2011
212011
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
192017
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20