Product
Help
Pricing
About
Jobs
Log in
Get started
Concept
Add to collection
Partial k-tree
OpenAlex ID:
C128764233
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
1996
·
Hans L. Bodlaender
·
SIAM Journal on Computing
·
1,896
A partial k-arboretum of graphs with bounded treewidth
1998
·
Hans L. Bodlaender
·
Theoretical Computer Science
·
1,414
A tourist guide through Treewidth
1992
·
Hans L. Bodlaender
·
Utrecht University Repository (Utrecht University)
·
839
Treewidth: Computations and Approximations
1994
·
Ton Kloks
·
830
Dynamic programming on graphs with bounded treewidth
1988
·
Hans L. Bodlaender
·
Lecture notes in computer science
·
438
PDF
Diameter and Treewidth in Minor-Closed Graph Families
2000
·
D. Eppstein
·
Algorithmica
·
381
PDF
Treewidth: Algorithmic techniques and results
1997
·
Hans L. Bodlaender
·
Lecture notes in computer science
·
339
A $c^k n$ 5-Approximation Algorithm for Treewidth
2016
·
Hans L. Bodlaender
, Pål Grǿnås Drange
, et al.
·
SIAM Journal on Computing
·
308
PDF
On the Relationship Between Clique-Width and Treewidth
2005
·
Derek G. Corneil
, Udi Rotics
·
SIAM Journal on Computing
·
239
Treewidth and Minimum Fill-in: Grouping the Minimal Separators
2001
·
Vincent Bouchitté
, Ioan Todinca
·
SIAM Journal on Computing
·
233
Discovering Treewidth
2005
·
Hans L. Bodlaender
·
Lecture notes in computer science
·
227
Cuts, Trees and ℓ1-Embeddings of Graphs*
2004
·
Anupam Gupta†
, Ilan Newman
, et al.
·
COMBINATORICA
·
217
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
2002
·
Víctor Dalmau
, Phokion G. Kolaitis
, et al.
·
Lecture notes in computer science
·
206
Precoloring extension. I. Interval graphs
1992
·
M. Biró
, M. Hujter
, et al.
·
Discrete Mathematics
·
196
Untitled
2010
·
Daniel Marx
·
Theory of Computing
·
192
PDF
Polynomial Bounds for the Grid-Minor Theorem
2016
·
Chandra Chekuri
, Julia Chuzhoy
·
Journal of the ACM
·
182
PDF
Planar Graphs Have Bounded Queue-Number
2020
·
Vida Dujmović
, Gwenaël Joret
, et al.
·
Journal of the ACM
·
180
PDF
A complete anytime algorithm for treewidth
2004
·
Vibhav Gogate
, Rina Dechter
·
Uncertainty in Artificial Intelligence
·
169
Linearity of grid minors in treewidth with applications through bidimensionality
2008
·
Erik D. Demaine
, Mohammadtaghi Hajiaghayi
·
COMBINATORICA
·
166
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
1998
·
Hans L. Bodlaender
, Torben Hagerup
·
SIAM Journal on Computing
·
165
Treewidth: Characterizations, Applications, and Computations
2006
·
Hans L. Bodlaender
·
Lecture notes in computer science
·
153
Learning Markov networks: maximum bounded tree-width graphs
2001
·
David R. Karger
, Nathan Srebro
·
Symposium on Discrete Algorithms
·
143
Algorithms for graphs of small treewidth
1997
·
Babette Fluiter
·
Utrecht University Repository (Utrecht University)
·
141
Can you beat treewidth?
2007
·
Daniel Marx
·
Annual Symposium on Foundations of Computer Science
·
139
NC-algorithms for graphs with small treewidth
1989
·
Hans L. Bodlaender
·
Lecture notes in computer science
·
139
Show more works
View as search
Works count:
1,100
Citation count:
24,750
Year
Topic
Type