Concepedia
Journal of Combinatorial Theory Series B · 2005 · 35 citations · 14 references
14
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
Hans L. Bodlaender · SIAM Journal on Computing · 1996 · 1.6K citations
Computing, Computer Science, Algorithms +11
Graph minors. II. Algorithmic aspects of tree-width
Neil Robertson, Paul Seymour · Journal of Algorithms · 1986 · 1.5K citations
Computing, Computer Science, Mathematics +14
Linear time algorithms for NP-hard problems restricted to partial k-trees
Stefan Arnborg, Andrzej Proskurowski · Discrete Applied Mathematics · 1989 · 579 citations
Computing, Computer Science, Mathematics +8
Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey
Stefan Arnborg · BIT Numerical Mathematics · 1985 · 368 citations
Natural Sciences, Computer Science, Mathematics +16
An extremal function for contractions of graphs
Andrew Thomason · Mathematical Proceedings of the Cambridge Philosophical Society · 1984 · 330 citations
Natural Sciences, Mathematics, Combinatorics +6