DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Kernelization
Kernelization
Introduction to Parameterized Complexity
Exploiting C-Closure in Kernelization Algorithms for Graph Problems
FPT Algorithms and Kernelization?
Experimental Evaluation of Parameterized Algorithms for Feedback Vertex Set
Propagation Via Kernelization: the Vertex Cover Constraint
Kernelization: New Upper and Lower Bound Techniques
Linear-Time Kernelization for Feedback Vertex Set∗
Bidimensionality: New Connections Between FPT Algorithms and Ptass
Kernelization Dimitrios M
Fixed Parameter Algorithms and Kernelization
A 2K-Kernelization Algorithm for Vertex Cover Based on Crown
Introduction + Bidimensionality Theory
An Exponential Time Parameterized Algorithm for Planar Disjoint Paths∗
Parameterized Tractability and Kernelization of Problems on Unit Disk Graphs
Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments∗
Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments∗
1 Kernelization Methods for Fixed-Parameter Tractability
Parameterized Complexity, Postive Techniques, Kernelization
Top View
Lower Bounds for Polynomial Kernelization
What Is Known About Vertex Cover Kernelization?∗
Bidimensionality and Kernels Name: Daniel Lokshtanov1 Affil./Addr
6. Kernelization COMP6741: Parameterized and Exact Computation
5. Kernelization COMP6741: Parameterized and Exact Computation
Kernelization Algorithms for Graph and Constraint Modification Problems
Sebastian Ordyniak Introduction
A Quadratic Kernel for FEEDBACK VERTEX SET Which Reduces the Input Graph G to a Graph G0 with Size at Most 4K2
Kernelization Lower Bounds: a Brief History
Bidimensionality and Kernels | SIAM Journal on Computing | Vol. 49, No
Excluded Grid Minors and EPTAS
Parameterized Distributed Complexity Theory: a Logical Approach
Nonblocker in H-Minor Free Graphs: Kernelization Meets Discharging
Bidimensionality and Kernels Fedor Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M
Vertex Cover
Kernelization – Preprocessing with a Guarantee (For the 60Th Birthday of Prof
Bidimensionality Theory and Applications
Parameterized Algorithms of Fundamental NP-Hard Problems: a Survey
KERNELIZATION Polynomial Time Preprocessing
Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter∗
Kernelization Lower Bounds for Finding Constant-Size Subgraphs
A Cubic Kernel for Feedback Vertex Set Hans L. Bodlaender
A Quadratic Kernel for Feedback Vertex Set Stéphan Thomassé
Bidimensionality and Parameterized Algorithms∗
Linear-Time Kernelization for Feedback Vertex Set
The Computational Complexity Column by V