The following pages link to On treewidth approximations (Q2816043):
Displaying 26 items.
- On approximating tree spanners that are breadth first search trees (Q269500) (← links)
- On the approximability of two tree drawing conventions (Q294876) (← links)
- On the complexity of computing treelength (Q972342) (← links)
- On the maximum cardinality search lower bound for treewidth (Q997060) (← links)
- Approximating the treewidth of AT-free graphs. (Q1408810) (← links)
- On treewidth approximations. (Q1427177) (← links)
- Special issue: Treewidth (Q1578399) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- On sparsification for computing treewidth (Q2343087) (← links)
- Tree-decompositions with bags of small diameter (Q2370441) (← links)
- Boxicity and treewidth (Q2642011) (← links)
- Practical approximation algorithms for zero- and bounded-skew trees (Q2768326) (← links)
- A \(c^k n\) 5-approximation algorithm for treewidth (Q2799353) (← links)
- On exact algorithms for treewidth (Q2933641) (← links)
- Treewidth and the Computational Complexity of MAP Approximations (Q2938412) (← links)
- Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization (Q3012824) (← links)
- Approximate Tree Matching in the Presence of Variable Length Don′t Cares (Q4289840) (← links)
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree (Q4327821) (← links)
- (Q4407447) (← links)
- (Q4952701) (← links)
- Estimating the Size of Branch-and-Bound Trees (Q5085999) (← links)
- (Q5150424) (← links)
- Treewidth: Structure and Algorithms (Q5425956) (← links)
- Fast Counting with Bounded Treewidth (Q5505573) (← links)
- Approximate Turing Kernelization for Problems Parameterized by Treewidth (Q5874531) (← links)
- Graphs with at most two moplexes (Q6595515) (← links)
