Pages that link to "Item:Q5501928"
From MaRDI portal
The following pages link to Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses (Q5501928):
Displaying 26 items.
- Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems (Q5048305) (← links)
- (Q5090486) (← links)
- A deterministic polynomial kernel for odd cycle transversal and vertex multiway cut in planar graphs (Q5090489) (← links)
- (Q5092393) (← links)
- Elimination Distances, Blocking Sets, and Kernels for Vertex Cover (Q5099101) (← links)
- Data Reduction for Maximum Matching on Real-World Graphs (Q5102046) (← links)
- Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials (Q5111881) (← links)
- Graph Motif Problems Parameterized by Dual (Q5119384) (← links)
- Why Is Maximum Clique Often Easy in Practice? (Q5144801) (← links)
- A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs (Q5163509) (← links)
- Rank Vertex Cover as a Natural Problem for Algebraic Compression (Q5232153) (← links)
- Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537) (← links)
- On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT (Q5890956) (← links)
- On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT (Q5892359) (← links)
- Quadratic vertex kernel for split vertex deletion (Q5896158) (← links)
- Lower bounds for the happy coloring problems (Q5918935) (← links)
- Subset feedback vertex set in chordal and split graphs (Q5919404) (← links)
- (Q6065467) (← links)
- Polynomial Kernel for Interval Vertex Deletion (Q6075746) (← links)
- Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU (Q6078297) (← links)
- Kernelization for feedback vertex set via elimination distance to a forest (Q6153475) (← links)
- What Is Known About Vertex Cover Kernelization? (Q6163635) (← links)
- Preprocessing to reduce the search space: antler structures for feedback vertex set (Q6564613) (← links)
- Search-space reduction via essential vertices (Q6606914) (← links)
- Parameterized complexity of streaming diameter and connectivity problems (Q6614110) (← links)
- Minimum separator reconfiguration (Q6615312) (← links)
