Pages that link to "Item:Q5042444"
From MaRDI portal
The following pages link to Treewidth, Kernels, and Algorithms (Q5042444):
Displayed 18 items.
- Seeing Arboretum for the (partial k-) Trees (Q5042445) (← links)
- Collaborating with Hans: Some Remaining Wonderments (Q5042446) (← links)
- Hans Bodlaender and the Theory of Kernelization Lower Bounds (Q5042447) (← links)
- Algorithms, Complexity, and Hans (Q5042448) (← links)
- Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs (Q5042449) (← links)
- As Time Goes By: Reflections on Treewidth for Temporal Graphs (Q5042450) (← links)
- Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs (Q5042451) (← links)
- Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds (Q5042452) (← links)
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths (Q5042453) (← links)
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
- Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices (Q5042455) (← links)
- A Survey on Spanning Tree Congestion (Q5042456) (← links)
- Surprising Applications of Treewidth Bounds for Planar Graphs (Q5042457) (← links)
- Computing Tree Decompositions (Q5042458) (← links)
- Experimental Analysis of Treewidth (Q5042459) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- Games, Puzzles and Treewidth (Q5042461) (← links)
- Fast Algorithms for Join Operations on Tree Decompositions (Q5042462) (← links)