The following pages link to (Q5365078):
Displaying 26 items.
- Complexity of metric dimension on planar graphs (Q314819) (← links)
- Data reduction for graph coloring problems (Q393081) (← links)
- Contraction bidimensionality of geometric intersection graphs (Q832527) (← links)
- On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability (Q1680511) (← links)
- An FPT 2-approximation for tree-cut decomposition (Q1702123) (← links)
- Explicit linear kernels for packing problems (Q1739112) (← links)
- Structurally parameterized \(d\)-scattered set (Q2064293) (← links)
- An improved approximation bound for minimum weight dominating set on graphs of bounded arboricity (Q2085734) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- Local search is a PTAS for feedback vertex set in minor-free graphs (Q2197532) (← links)
- Contraction obstructions for treewidth (Q2275894) (← links)
- Finding, hitting and packing cycles in subexponential time on unit disk graphs (Q2334507) (← links)
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters (Q2453563) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- Bidimensionality and Kernels (Q3387764) (← links)
- (Q4972036) (← links)
- (Q5009491) (← links)
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths (Q5042453) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- Hitting Weighted Even Cycles in Planar Graphs (Q5048307) (← links)
- (Q5090497) (← links)
- Contraction-Bidimensionality of Geometric Intersection Graphs (Q5111864) (← links)
- Maximum Cut Parameterized by Crossing Number (Q5119374) (← links)
- Packing Cycles Faster Than Erdos--Posa (Q5232148) (← links)
- (Q5743379) (← links)
- Improved (In-)Approximability Bounds for d-Scattered Set (Q6107026) (← links)
