Pages that link to "Item:Q383833"
From MaRDI portal
The following pages link to Fundamentals of parameterized complexity (Q383833):
Displaying 50 items.
- On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs (Q2958335) (← links)
- On the Parameterized Parallel Complexity and the Vertex Cover Problem (Q2958339) (← links)
- Track Layout Is Hard (Q2961541) (← links)
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth (Q2968151) (← links)
- Parameterized and Exact Algorithms for Class Domination Coloring (Q2971145) (← links)
- Cameo of a Consummate Computabilist (Q2973714) (← links)
- On the Computational Complexity of Variants of Combinatorial Voter Control in Elections (Q2988834) (← links)
- Basic Terminology, Notation and Results (Q3120433) (← links)
- A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter (Q3177162) (← links)
- On Directed Steiner Trees with Multiple Roots (Q3181063) (← links)
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
- On Compiling Structured CNFs to OBDDs (Q3194709) (← links)
- Editing to a Planar Graph of Given Degrees (Q3194713) (← links)
- Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets (Q3195130) (← links)
- Bivariate Complexity Analysis of Almost Forest Deletion (Q3196379) (← links)
- A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion (Q3196407) (← links)
- Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs (Q3297773) (← links)
- Parameterized (approximate) defective coloring (Q3304104) (← links)
- Small Resolution Proofs for QBF using Dependency Treewidth (Q3304126) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q3304128) (← links)
- On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem (Q3304132) (← links)
- Dominator and Total Dominator Colorings in Graphs (Q3384111) (← links)
- Bidimensionality and Kernels (Q3387764) (← links)
- Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (Q3448810) (← links)
- Uniform Kernelization Complexity of Hitting Forbidden Minors (Q3448821) (← links)
- Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs (Q3449507) (← links)
- New Limits to Classical and Quantum Instance Compression (Q3449566) (← links)
- A New Approach for Contact Graph Representations and Its Applications (Q3449814) (← links)
- Solving Problems on Graphs of High Rank-Width (Q3449829) (← links)
- Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes (Q3449838) (← links)
- On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids (Q3449854) (← links)
- Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints (Q3452559) (← links)
- Consensus Patterns (Probably) Has no EPTAS (Q3452789) (← links)
- Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints (Q3452817) (← links)
- Structural Parameterizations of the Mixed Chinese Postman Problem (Q3452829) (← links)
- A Multivariate Approach for Weighted FPT Algorithms (Q3452855) (← links)
- On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs (Q3467860) (← links)
- Computation Models for Parameterized Complexity (Q4336699) (← links)
- (Q4474097) (← links)
- (Q4553282) (← links)
- Covering Vectors by Spaces: Regular Matroids (Q4555045) (← links)
- Structured Connectivity Augmentation (Q4555048) (← links)
- Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q4588848) (← links)
- Finding Points in General Position (Q4605338) (← links)
- Fractals for Kernelization Lower Bounds (Q4609787) (← links)
- Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth (Q4611385) (← links)
- Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (Q4619482) (← links)
- The Constant Inapproximability of the Parameterized Dominating Set Problem (Q4634028) (← links)
- Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel (Q4637327) (← links)
- Multi-clique-width (Q4638063) (← links)
