Pages that link to "Item:Q3519389"
From MaRDI portal
The following pages link to Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size (Q3519389):
Displaying 50 items.
- A \(13k\)-kernel for planar feedback vertex set via region decomposition (Q306250) (← links)
- A \(9k\) kernel for nonseparating independent set in planar graphs (Q385964) (← links)
- Improved linear problem kernel for planar connected dominating set (Q392013) (← links)
- Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs (Q411223) (← links)
- Lower bounds on kernelization (Q456702) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Combinatorics for smaller kernels: the differential of a graph (Q476877) (← links)
- A linear kernel for planar red-blue dominating set (Q516887) (← links)
- A kernel of order \(2k - c\) for Vertex Cover (Q534063) (← links)
- A linear kernel for a planar connected dominating set (Q534569) (← links)
- Quadratic kernelization for convex recoloring of trees (Q639283) (← links)
- Compactors for parameterized counting problems (Q826317) (← links)
- A parameterized perspective on packing paths of length two (Q849135) (← links)
- Linear kernelizations for restricted 3-Hitting Set problems (Q989471) (← links)
- A bounded search tree algorithm for parameterized face cover (Q1002098) (← links)
- A more effective linear kernelization for cluster editing (Q1006044) (← links)
- The parameterized complexity of the induced matching problem (Q1028465) (← links)
- On parameterized exponential time complexity (Q1029333) (← links)
- The many facets of upper domination (Q1704853) (← links)
- A kernel of order \(2k-c\log k\) for vertex cover (Q1944208) (← links)
- Towards optimal kernel for connected vertex cover in planar graphs (Q1949125) (← links)
- On some FPT problems without polynomial Turing compressions (Q2072079) (← links)
- Twin-width and polynomial kernels (Q2093574) (← links)
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds (Q2093577) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- Kernels for packing and covering problems (Q2272393) (← links)
- Capacitated domination: problem complexity and approximation algorithms (Q2345937) (← links)
- Towards optimal kernel for edge-disjoint triangle packing (Q2446590) (← links)
- On the kernelization of split graph problems (Q2636501) (← links)
- On the Complexity Landscape of the Domination Chain (Q2795935) (← links)
- Algorithmic Aspects of Upper Domination: A Parameterised Perspective (Q2830063) (← links)
- Safe Approximation and Its Relation to Kernelization (Q2891346) (← links)
- Simpler Linear-Time Kernelization for Planar Dominating Set (Q2891347) (← links)
- Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs (Q2891348) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- An Improved Kernel for Planar Connected Dominating Set (Q3010387) (← links)
- Fixed-parameter tractability results for full-degree spanning tree and its dual (Q3057174) (← links)
- On the Independence Number of Graphs with Maximum Degree 3 (Q3104780) (← links)
- Bidimensionality and Kernels (Q3387764) (← links)
- Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061) (← links)
- A Problem Kernelization for Graph Packing (Q3599088) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor (Q3656866) (← links)
- Fractals for Kernelization Lower Bounds (Q4609787) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- Truncation in Duality and Intertwining Kernels (Q5124157) (← links)
- Why Is Maximum Clique Often Easy in Practice? (Q5144801) (← links)
- Rank Vertex Cover as a Natural Problem for Algebraic Compression (Q5232153) (← links)
- 3-Hitting set on bounded degree hypergraphs: Upper and lower bounds on the kernel size (Q5261045) (← links)
- A Parameterized Perspective on Packing Paths of Length Two (Q5505643) (← links)
