On problem kernels for possible winner determination under the k-approval protocol
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Measuring indifference: unit interval vertex deletion
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring
Journal of Discrete Algorithms
On making a distinguished vertex minimum degree by vertex deletion
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Average parameterization and partial kernelization for computing medians
Journal of Computer and System Sciences
An improved kernel for planar connected dominating set
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Kernel bounds for disjoint cycles and disjoint paths
Theoretical Computer Science
A generalization of Nemhauser and Trotter's local optimization theorem
Journal of Computer and System Sciences
On parameterized independent feedback vertex set
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Pattern-guided data anonymization and clustering
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Conflict packing yields linear vertex-kernels for k-FAST, k-dense RTI and a related problem
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Linear problem kernels for planar graph problems with small distance property
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Polynomial kernels for proper interval completion and related problems
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
On Bounded-Degree Vertex Deletion parameterized by treewidth
Discrete Applied Mathematics
Journal of Computer and System Sciences
A More Relaxed Model for Graph-Based Data Clustering: $s$-Plex Cluster Editing
SIAM Journal on Discrete Mathematics
Weak compositions and their applications to polynomial lower bounds for kernelization
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On making directed graphs transitive
Journal of Computer and System Sciences
Two-Layer planarization parameterized by feedback edge set
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Kernelization for maximum leaf spanning tree with positive vertex weights
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
The parameterized complexity of local search for TSP, more refined
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Improved parameterized algorithms for above average constraint satisfaction
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Linear-Time computation of a linear problem kernel for dominating set on planar graphs
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Graph-based data clustering with overlaps
Discrete Optimization
Studies in computational aspects of voting: open problems of downey and fellows
The Multivariate Algorithmic Revolution and Beyond
What's next? future directions in parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
Kernel(s) for problems with no kernel: On out-trees with many leaves
ACM Transactions on Algorithms (TALG)
Clique cover and graph separation: new incompressibility results
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Confluence in data reduction: bridging graph transformation and kernelization
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Exploiting a hypergraph model for finding golomb rulers
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Reducing a target interval to a few exact queries
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Exact combinatorial algorithms and experiments for finding maximum k-plexes
Journal of Combinatorial Optimization
On Parameterized Independent Feedback Vertex Set
Theoretical Computer Science
European Journal of Combinatorics
Preprocessing subgraph and minor problems: when does a small vertex cover help?
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Constant thresholds can make target set selection tractable
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Planar graph vertex partition for linear problem kernels
Journal of Computer and System Sciences
Incremental list coloring of graphs, parameterized by conservation
Theoretical Computer Science
Two-Layer Planarization parameterized by feedback edge set
Theoretical Computer Science
A refined complexity analysis of degree anonymization in graphs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Data reduction for graph coloring problems
Information and Computation
Polynomial kernels for Proper Interval Completion and related problems
Information and Computation
Preprocessing subgraph and minor problems: When does a small vertex cover help?
Journal of Computer and System Sciences
Improved linear problem kernel for planar connected dominating set
Theoretical Computer Science
Towards optimal kernel for edge-disjoint triangle packing
Information Processing Letters
| Hi-index | 0.00 |
In this survey, we look at kernelization: algorithms that transform in polynomial time an input to a problem to an equivalent input, whose size is bounded by a function of a parameter. Several results of recent research on kernelization are mentioned. This survey looks at some recent results where a general technique shows the existence of kernelization algorithms for large classes of problems, in particular for planar graphs and generalizations of planar graphs, and recent lower bound techniques that give evidence that certain types of kernelization algorithms do not exist.