Pages that link to "Item:Q3521947"
From MaRDI portal
The following pages link to On Problems without Polynomial Kernels (Extended Abstract) (Q3521947):
Displaying 28 items.
- The kernelization complexity of connected domination in graphs with (no) small cycles (Q476436) (← links)
- Lower bounds for kernelizations and other preprocessing procedures (Q538466) (← links)
- On the small cycle transversal of planar graphs (Q551170) (← links)
- Polynomial kernels for 3-leaf power graph modification problems (Q602747) (← links)
- Infeasibility of instance compression and succinct PCPs for NP (Q619903) (← links)
- FPT algorithms for connected feedback vertex set (Q695322) (← links)
- An improved kernelization algorithm for \(r\)-set packing (Q765496) (← links)
- FPT algorithms and kernels for the directed \(k\)-leaf problem (Q847265) (← links)
- A cubic kernel for feedback vertex set and loop cutset (Q968273) (← links)
- Linear kernelizations for restricted 3-Hitting Set problems (Q989471) (← links)
- Minimum leaf out-branching and related problems (Q1035689) (← links)
- Betweenness parameterized above tight lower bound (Q1959433) (← links)
- A linear kernel for the complementary maximal strip recovery problem (Q2453554) (← links)
- Finding a Forest in a Tree (Q2811922) (← links)
- Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems (Q2839214) (← links)
- The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- Surfing with Rod (Q2973715) (← links)
- Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs (Q3057621) (← links)
- On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems (Q3058699) (← links)
- Parameterized Complexity of Vertex Deletion into Perfect Graph Classes (Q3088287) (← links)
- Lower Bounds for Kernelizations and Other Preprocessing Procedures (Q3576044) (← links)
- A Problem Kernelization for Graph Packing (Q3599088) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- On Finding Directed Trees with Many Leaves (Q3656853) (← links)
- Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms (Q3656863) (← links)
- Two Edge Modification Problems without Polynomial Kernels (Q3656868) (← links)
- Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds (Q5042452) (← links)
