Pages that link to "Item:Q4979840"
From MaRDI portal
The following pages link to Kernelization Lower Bounds by Cross-Composition (Q4979840):
Displaying 50 items.
- Polynomial kernels for vertex cover parameterized by small degree modulators (Q2322700) (← links)
- The parameterized complexity of the minimum shared edges problem (Q2323342) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? (Q2324243) (← links)
- Two edge-disjoint paths with length constraints (Q2330117) (← links)
- A completeness theory for polynomial (Turing) kernelization (Q2343083) (← links)
- On sparsification for computing treewidth (Q2343087) (← links)
- Incompressibility of \(H\)-free edge modification problems (Q2343091) (← links)
- On the kernelization of ranking \(r\)-CSPs: linear vertex-kernels for generalizations of feedback arc set and betweenness in tournaments (Q2345613) (← links)
- A complete parameterized complexity analysis of bounded planning (Q2353405) (← links)
- Editing to a graph of given degrees (Q2354405) (← links)
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725) (← links)
- The graph motif problem parameterized by the structure of the input graph (Q2403795) (← links)
- On the complexity of various parameterizations of common induced subgraph isomorphism (Q2405897) (← links)
- Sparsification upper and lower bounds for graph problems and not-all-equal SAT (Q2408194) (← links)
- On kernelization and approximation for the vector connectivity problem (Q2408198) (← links)
- Parameterized complexity of secluded connectivity problems (Q2408560) (← links)
- Meta-kernelization using well-structured modulators (Q2413976) (← links)
- On the complexity of restoring corrupted colorings (Q2424718) (← links)
- Edge-disjoint packing of stars and cycles (Q2629232) (← links)
- Preprocessing to reduce the search space: antler structures for feedback vertex set (Q2672419) (← links)
- The structural complexity landscape of finding balance-fair shortest paths (Q2676473) (← links)
- On 2-clubs in graph-based data clustering: theory and algorithm engineering (Q2692726) (← links)
- On the Complexity of Computing the k-restricted Edge-connectivity of a Graph (Q2827813) (← links)
- FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders (Q2828222) (← links)
- Kernel lower bounds using co-nondeterminism: finding induced hereditary subgraphs (Q2828227) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations (Q2947879) (← links)
- Cross-composition: a new technique for kernelization lower bounds (Q3113681) (← links)
- Finding Two Edge-Disjoint Paths with Length Constraints (Q3181047) (← links)
- Edge-Disjoint Packing of Stars and Cycles (Q3467879) (← links)
- Fractals for Kernelization Lower Bounds (Q4609787) (← links)
- Parameterized Complexity of Conflict-Free Graph Coloring (Q4959657) (← links)
- Consensus strings with small maximum distance and small distance sum (Q5005095) (← links)
- (Q5009469) (← links)
- Dual parameterization of Weighted Coloring (Q5009474) (← links)
- Exploring the Kernelization Borders for Hitting Cycles (Q5009476) (← links)
- (Q5009477) (← links)
- (Q5009615) (← links)
- Hans Bodlaender and the Theory of Kernelization Lower Bounds (Q5042447) (← links)
- Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds (Q5042452) (← links)
- On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering (Q5084692) (← links)
- (Q5090486) (← links)
- (Q5091010) (← links)
- Elimination Distances, Blocking Sets, and Kernels for Vertex Cover (Q5099101) (← links)
- The Power of Linear-Time Data Reduction for Maximum Matching (Q5111261) (← links)
- Smaller Parameters for Vertex Cover Kernelization (Q5111879) (← links)
- Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor (Q5111882) (← links)
- Graph Motif Problems Parameterized by Dual (Q5119384) (← links)
- The Parameterized Complexity of Motion Planning for Snake-Like Robots (Q5130004) (← links)
- Solving Partition Problems Almost Always Requires Pushing Many Vertices Around (Q5220192) (← links)