Pages that link to "Item:Q383833"
From MaRDI portal
The following pages link to Fundamentals of parameterized complexity (Q383833):
Displaying 50 items.
- (Q5155667) (← links)
- A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs (Q5163509) (← links)
- Self-Verifying Pushdown and Queue Automata (Q5164866) (← links)
- A Parametrized Analysis of Algorithms on Hierarchical Graphs (Q5205039) (← links)
- Solving Partition Problems Almost Always Requires Pushing Many Vertices Around (Q5220192) (← links)
- Editing to Connected F-Degree Graph (Q5232130) (← links)
- Packing Cycles Faster Than Erdos--Posa (Q5232148) (← links)
- Rank Vertex Cover as a Natural Problem for Algebraic Compression (Q5232153) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q5234662) (← links)
- The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex (Q5241237) (← links)
- Induced Disjoint Paths in Claw-Free Graphs (Q5251566) (← links)
- Network-Based Vertex Dissolution (Q5254088) (← links)
- 3-Hitting set on bounded degree hypergraphs: Upper and lower bounds on the kernel size (Q5261045) (← links)
- Metric Dimension of Bounded Tree-length Graphs (Q5268001) (← links)
- Parameterized Complexity of Directed Steiner Tree on Sparse Graphs (Q5270408) (← links)
- Backdoors to Normality for Disjunctive Logic Programs (Q5277908) (← links)
- Parameterized Resiliency Problems via Integer Linear Programming (Q5283365) (← links)
- Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems (Q5283380) (← links)
- Perfect domination and small cycles (Q5367522) (← links)
- Completing Partial Schedules for Open Shop with Unit Processing Times and Routing (Q5740178) (← links)
- Graph Editing to a Given Degree Sequence (Q5740185) (← links)
- Tree Deletion Set Has a Polynomial Kernel but No $\text{OPT}^\mathcal{O}(1)$ Approximation) (Q5741082) (← links)
- (Q5743379) (← links)
- (Q5743380) (← links)
- (Q5743381) (← links)
- (Q5743512) (← links)
- (Q5743513) (← links)
- (Q5743514) (← links)
- Parameterized Traveling Salesman Problem: Beating the Average (Q5743554) (← links)
- Parameterized Pre-Coloring Extension and List Coloring Problems (Q5857010) (← links)
- On Covering Segments with Unit Intervals (Q5864214) (← links)
- A Polynomial Kernel for Line Graph Deletion (Q5874512) (← links)
- Kernelization of Whitney Switches (Q5874518) (← links)
- (Q5874519) (← links)
- Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537) (← links)
- On the pathwidth of hyperbolic 3-manifolds (Q5881542) (← links)
- On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT (Q5890956) (← links)
- NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs (Q5891702) (← links)
- The Parameterized Complexity of Graph Cyclability (Q5891809) (← links)
- Monitoring the edges of a graph using distances (Q5896103) (← links)
- Temporal graph classes: a view through temporal separators (Q5915590) (← links)
- On the relation of strong triadic closure and cluster deletion (Q5915591) (← links)
- Parameterized shifted combinatorial optimization (Q5915595) (← links)
- Efficient algorithms for measuring the funnel-likeness of DAGs (Q5915704) (← links)
- Parameterized aspects of triangle enumeration (Q5915757) (← links)
- Ruling out FPT algorithms for weighted coloring on forests (Q5916046) (← links)
- On the complexity of finding internally vertex-disjoint long directed paths (Q5918120) (← links)
- Parameterized complexity of min-power asymmetric connectivity (Q5918282) (← links)
- Complexity and algorithms for semipaired domination in graphs (Q5918285) (← links)
- Your rugby mates don't need to know your colleagues: triadic closure with edge colors (Q5918315) (← links)
