Problem Kernels
Problem Kernels is a formal reduction technique in parameterized complexity theory that maps an instance of a parameterized problem to an equivalent instance whose size is bounded by a function of the parameter, preserving the answer while enabling efficient preprocessing.
15
Publications
873
Citations
38
Authors
19
Institutions
Publications per year
2017–2026
2
Parents
15
Invitation to data reduction and problem kernelization
Jiong Guo, Rolf Niedermeier · ACM SIGACT News · 2007 · 381 citations
Stefan Kratsch, Magnus Wahlström · ACM Transactions on Algorithms · 2014 · 87 citations
Gregory Gutin, Leo van Iersel, Matthias Mnich et al. · Journal of Computer and System Sciences · 2011 · 64 citations · Full text
Planar graph vertex partition for linear problem kernels
Jianxin Wang, Yongjie Yang, Jiong Guo et al. · Journal of Computer and System Sciences · 2012 · 55 citations
1–5 of 15
38
2
h-index
2
h-index
2
h-index
2
h-index
1
h-index
1–5 of 38
19
University of Bergen
Bergen, Norway
2 h-index
5 publications
99 citations
Technische Universität Berlin
Berlin, Germany
2 h-index
4 publications
117 citations
Utrecht University
Utrecht, The Netherlands
1 h-index
1 publications
33 citations

Saarland University
Saarbrücken, Germany
1 h-index
1 publications
55 citations

Universidad de Granada
Granada, Spain
1 h-index
5 publications
60 citations
Marymount University
Arlington, United States
1 h-index
1 publications
89 citations

Tel Aviv University
Tel Aviv, Israel
1 h-index
2 publications
56 citations
Eindhoven University of Technology
Eindhoven, The Netherlands
1 h-index
1 publications
64 citations
1–8 of 19
TALG · 3 publications · 118 citations
3
h-index
2 publications · 119 citations
2
h-index
Repository · 2 publications · 36 citations
2
h-index
JGAA · 1 publications · 28 citations
1
h-index
1 publications · 28 citations
1
h-index
1–5