Bart M. P. Jansen

Citado por

	Total	Desde 2020
Citas	1977	983
Índice h	23	18
Índice i10	44	34

220

110

165

20102011201220132014201520162017201820192020202120222023202420255 15 53 106 118 109 85 146 163 165 202 142 189 203 208 34

Acceso público

Ver todo

47 artículos

0 artículos

disponibles

no disponibles

Basado en requisitos de financiación

Coautores

Stefan KratschProfessor at Humboldt University BerlinDirección de correo verificada de informatik.hu-berlin.de
Hans L. BodlaenderProfessor Computer Science, Utrecht UniversityDirección de correo verificada de uu.nl
Astrid PieterseDirección de correo verificada de alumnus.tue.nl
Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiDirección de correo verificada de mimuw.edu.pl
Saket SaurabhProfessor at Institute of Mathematical SciencesDirección de correo verificada de imsc.res.in
Daniel LokshtanovProfessor of Computer Science, UCSBDirección de correo verificada de ucsb.edu
Frances RosamondLebanese American University, Beirut and Western Sydney University, AustraliaDirección de correo verificada de lau.edu.lb
Kevin BuchinProfessor of Computer Science, Technical University DortmundDirección de correo verificada de tu-dortmund.de
Fedor V. FominProfessor of Computer Science, University of BergenDirección de correo verificada de uib.no
Michał PilipczukUniversity of WarsawDirección de correo verificada de mimuw.edu.pl
Dániel MarxCISPA Helmholtz Center for Information SecurityDirección de correo verificada de cispa.saarland
Pinar HeggernesProfessor of computer science, University of BergenDirección de correo verificada de ii.uib.no
Yngve VillangerUniversity of BergenDirección de correo verificada de uib.no
Pim van 't HofUniversity of TwenteDirección de correo verificada de utwente.nl

Seguir

Bart M. P. Jansen

Associate Professor, Eindhoven University of Technology

Dirección de correo verificada de tue.nl - Página principal

Parameterized complexity Kernelization Parameter ecology Kernel lower bounds


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
Kernelization lower bounds by cross-composition HL Bodlaender, BMP Jansen, S Kratsch SIAM Journal on Discrete Mathematics 28 (1), 277-305, 2014	256	2014
Cross-composition: A new technique for kernelization lower bounds HL Bodlaender, BMP Jansen, S Kratsch arXiv preprint arXiv:1011.4224, 2010	132	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	122	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	97	2013
A near-optimal planarization algorithm BMP Jansen, D Lokshtanov, S Saurabh Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014	88	2014
Preprocessing for treewidth: A combinatorial analysis through kernelization HL Bodlaender, BMP Jansen, S Kratsch SIAM Journal on Discrete Mathematics 27 (4), 2108-2142, 2013	81	2013
Data reduction for graph coloring problems BMP Jansen, S Kratsch Information and Computation 231, 70-88, 2013	71	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	67	2017
Kernel bounds for path and cycle problems HL Bodlaender, BMP Jansen, S Kratsch Theoretical Computer Science 511, 117-136, 2013	56	2013
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	55	2013
Approximation and kernelization for chordal vertex deletion BMP Jansen, M Pilipczuk SIAM Journal on Discrete Mathematics 32 (3), 2258-2301, 2018	51	2018
The power of data reduction: Kernels for fundamental graph problems BMP Jansen Utrecht University, 2013	46	2013
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	44	2021
Turing kernelization for finding long paths and cycles in restricted graph classes BMP Jansen Journal of Computer and System Sciences 85, 18-37, 2017	39	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	39	2014
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	38	2020
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	38	2017
Fine-grained parameterized complexity analysis of graph coloring problems L Jaffke, BMP Jansen International Conference on Algorithms and Complexity, 345-356, 2017	37	2017
Parameter ecology for feedback vertex set BMP Jansen, V Raman, M Vatshelle Tsinghua Science and Technology 19 (4), 387-409, 2014	37	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	35	2014

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Seguir

Citado por

Coautores