Pages that link to "Item:Q1854433"
From MaRDI portal
The following pages link to Reduction algorithms for graphs of small treewidth (Q1854433):
Displayed 25 items.
- Confronting intractability via parameters (Q465686) (← links)
- A generalization of Nemhauser and Trotter's local optimization theorem (Q657921) (← links)
- On bounded-degree vertex deletion parameterized by treewidth (Q765338) (← links)
- On the parameterized complexity of maximum degree contraction problem (Q832521) (← links)
- A faster parameterized algorithm for pseudoforest deletion (Q1693129) (← links)
- Explicit linear kernels for packing problems (Q1739112) (← links)
- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width (Q1764811) (← links)
- Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
- Lower bounds for protrusion replacement by counting equivalence classes (Q2174552) (← links)
- Sparse obstructions for minor-covering parameters (Q2174553) (← links)
- On structural parameterizations of the bounded-degree vertex deletion problem (Q2223699) (← links)
- Noetherianity up to conjugation of locally diagonal inverse limits (Q2332384) (← links)
- Hitting Forbidden Minors: Approximation and Kernelization (Q2790404) (← links)
- Kernelization – Preprocessing with a Guarantee (Q2908537) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Finite Integer Index of Pathwidth and Treewidth (Q2946024) (← links)
- On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem (Q3304132) (← links)
- Bidimensionality and Kernels (Q3387764) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- (Q5091010) (← links)
- Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. (Q5092404) (← links)
- Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds (Q5130572) (← links)
- Problems hard for treewidth but easy for stable gonality (Q6039413) (← links)
- On the Parameterized Complexity of Maximum Degree Contraction Problem. (Q6089673) (← links)