The following pages link to (Q3113681):
Displaying 45 items.
- The Flood-It game parameterized by the vertex cover number (Q324714) (← links)
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
- Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← links)
- Kernel bounds for path and cycle problems (Q392032) (← links)
- Data reduction for graph coloring problems (Q393081) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- On cutwidth parameterized by vertex cover (Q476444) (← links)
- Restricted and swap common superstring: a multivariate algorithmic perspective (Q494787) (← links)
- Kernel bounds for disjoint cycles and disjoint paths (Q638521) (← links)
- Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308) (← links)
- Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique (Q896028) (← links)
- Two edge modification problems without polynomial kernels (Q1662097) (← links)
- Fixing improper colorings of graphs (Q1698729) (← links)
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems (Q1949740) (← links)
- Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization (Q2032346) (← links)
- Parameterized complexity of a coupled-task scheduling problem (Q2283295) (← links)
- A multivariate analysis of the strict terminal connection problem (Q2306846) (← links)
- Kernelization lower bound for permutation pattern matching (Q2339595) (← links)
- Editing to a graph of given degrees (Q2354405) (← links)
- On the hardness of losing width (Q2441542) (← links)
- Parameterized complexity of Eulerian deletion problems (Q2441593) (← links)
- Parameterized algorithms for load coloring problem (Q2448120) (← links)
- Parameterized complexity of firefighting (Q2453548) (← links)
- Satisfying more than half of a system of linear equations over GF(2): a multivariate approach (Q2637641) (← links)
- FPT and kernelization algorithms for the induced tree problem (Q2692722) (← links)
- Perfectly matched sets in graphs: parameterized and exact computation (Q2697539) (← links)
- FPT is characterized by useful obstruction sets (Q2828222) (← links)
- Parameterized Complexity of Firefighting Revisited (Q2891334) (← links)
- On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal (Q2891343) (← links)
- Kernel Bounds for Path and Cycle Problems (Q2891344) (← links)
- On the Hardness of Losing Width (Q2891345) (← links)
- On Cutwidth Parameterized by Vertex Cover (Q2891354) (← links)
- Kernelization – Preprocessing with a Guarantee (Q2908537) (← links)
- On Structural Parameterizations of Graph Motif and Chromatic Number (Q2971640) (← links)
- Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization (Q3012824) (← links)
- Data Reduction for Graph Coloring Problems (Q3088272) (← links)
- Parameterized Complexity of Eulerian Deletion Problems (Q3104771) (← links)
- New Limits to Classical and Quantum Instance Compression (Q3449566) (← links)
- Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds (Q5042452) (← links)
- (Q5075825) (← links)
- (Q5743378) (← links)
- (Q5743381) (← links)
- (Q5743382) (← links)
- Disconnected matchings (Q5972267) (← links)
- Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization (Q6107887) (← links)
