|
1
|
Solving Problems on Recursively Constructed Graphs
– Richard B. Borie, R. Gary Parker, Craig A. Tovey
|
|
4
|
Bounded Combinatorial Width and Forbidden Substructures
– Michael John Dinneen
- 1995
|
|
11
|
Combinatorial Optimization on Graphs of Bounded Treewidth
– Hans L. Bodlaender, Arie M. C. A. Koster
- 2007
|
|
15
|
Width parameters beyond tree-width and their applications
– Petr Hliněny, Sang-il Oum, Detlef Seese, Georg Gottlob
- 2007
|
|
37
|
The Structure of the Models of Decidable Monadic Theories of Graphs
– D. Seese, Communicated Y. Gurevich
- 1991
|
|
113
|
Treewidth: Algorithmic techniques and results
– Hans Bodlaender
- 1998
|
|
211
|
A Partial K-Arboretum of Graphs With Bounded Treewidth
– Hans L. Bodlaender
- 1998
|
|
38
|
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
– Hans L. Bodlaender, Ton Kloks
- 1993
|
|
3
|
A Simple Linear-Time Algorithm for Finding Path-Decompositions of Small Width
– Kevin Cattell, Michael J. Dinneen, Michael R. Fellows
- 1996
|
|
5
|
The maximum subforest problem: Approximation and exact algorithms
– Ron Shamir , Dekel Tsur
- 1998
|
|
39
|
On the Treewidth and Pathwidth of Permutation Graphs
– T. Kloks, H. Bodlaender
- 1992
|
|
2
|
Canonical Representations of Partial 2- and 3-Trees
– Stefan Arnborg, Andrzej Proskurowski
- 1998
|
|
164
|
The NP-completeness column: an ongoing guide
– David S. Johnson
- 1985
|
|
|
Algorithmic issues of the . . .
– J. A. Makowsky
- 2004
|
|
4
|
Partitioning Problems: Characterization, Complexity and Algorithms on Partial k-Trees
– Jan Arne Telle
- 1994
|
|
2
|
Combine and Conquer
– Robert F. Cohen, Robert F. Cohen, Roberto Tamassia, Roberto Tamassia
- 1992
|
|
38
|
Algorithms For Vertex Partitioning Problems On Partial k-Trees
– Jan Arne Telle, andrzej Proskurowski
- 1997
|
|
24
|
On Disjoint Cycles
– Hans L. Bodlaender, Hans L. Bodlaender, Hans L. Bodlaender
- 1990
|
|
8
|
Weighted Multidimensional Search and its Application to Convex Optimization
– Richa Agarwala, David Fernandez-Baca
- 1992
|
