Pages that link to "Item:Q5425956"
From MaRDI portal
The following pages link to Treewidth: Structure and Algorithms (Q5425956):
Displaying 24 items.
- On the algorithmic effectiveness of digraph decompositions and complexity measures (Q456704) (← links)
- The complexity of minimum-length path decompositions (Q494076) (← links)
- Compact labelings for efficient first-order model-checking (Q626458) (← links)
- Safe separators for treewidth (Q819825) (← links)
- Minimal interval completion through graph exploration (Q1001896) (← links)
- Special issue: Treewidth (Q1578399) (← links)
- Secluded connectivity problems (Q1679225) (← links)
- Improved Steiner tree algorithms for bounded treewidth (Q1932355) (← links)
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
- Depth-first layout algorithm for trees. (Q2583560) (← links)
- Boxicity and treewidth (Q2642011) (← links)
- Introducing directed tree width (Q2741376) (← links)
- The algorithmic theory of treewidth (Q2816059) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Parameters Tied to Treewidth (Q2978180) (← links)
- (Q4407447) (← links)
- Graph Bisection with Pareto Optimization (Q4577953) (← links)
- (Q4691905) (← links)
- Properties of Large 2-Crossing-Critical Graphs (Q5084710) (← links)
- Threshold Treewidth and Hypertree Width (Q5101317) (← links)
- Customizable Contraction Hierarchies (Q5266613) (← links)
- SOFSEM 2005: Theory and Practice of Computer Science (Q5711519) (← links)
- Polynomial-time algorithms for multimarginal optimal transport problems with structure (Q6038667) (← links)
- Directed ear anonymity (Q6547947) (← links)
