{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:00:04Z","timestamp":1775815204099,"version":"3.50.1"},"reference-count":104,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5342,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,12]]},"DOI":"10.1016\/s0304-3975(97)00228-4","type":"journal-article","created":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T01:37:28Z","timestamp":1051753048000},"page":"1-45","source":"Crossref","is-referenced-by-count":676,"title":["A partial k-arboretum of graphs with bounded treewidth"],"prefix":"10.1016","volume":"209","author":[{"given":"Hans L.","family":"Bodlaender","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00228-4_BIB1","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01759044","article-title":"A lower bound on the area of permutation layouts","volume":"6","author":"Aggarwal","year":"1991","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01934985","article-title":"Efficient algorithms for combinatorial problems on graphs with bounded decomposability \u2014 a survey","volume":"25","author":"Arnborg","year":"1985","journal-title":"BIT"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB3","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","article-title":"Complexity of finding embeddings in a k-tree","volume":"8","author":"Arnborg","year":"1987","journal-title":"SIAM J. Algebra Discrete Methods"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB4","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/174147.169807","article-title":"An algebraic theory of graph reduction","volume":"40","author":"Arnborg","year":"1993","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB5","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0607033","article-title":"Characterization and recognition of partial 3-trees","volume":"7","author":"Arnborg","year":"1986","journal-title":"SIAM J. Algebra Discrete Methods"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(90)90292-P","article-title":"Forbidden minors characterization of partial 3-trees","volume":"80","author":"Arnborg","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(97)00228-4_BIB7","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/174644.174650","article-title":"Approximation algorithms for NP-complete problems on planar graphs","volume":"41","author":"Baker","year":"1994","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB8","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01692060","article-title":"Graph expressions and graph rewritings","volume":"20","author":"Bauderon","year":"1987","journal-title":"Mathematical Systems Theory"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB9","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0196-6774(87)90039-3","article-title":"Linear time computation of optimal subgraphs of decomposable graphs","volume":"8","author":"Bern","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB10","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1090\/dimacs\/005\/02","article-title":"Graph searching, path-width, tree-width and related problems (a survey)","volume":"vol. 5","author":"Bienstock","year":"1991","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB11","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1137\/0217004","article-title":"On the complexity of covering vertices by faces in a planar graph","volume":"17","author":"Bienstock","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00228-4_BIB12","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF01840379","article-title":"On the complexity of embedding planar graphs to minimize certain distance measures","volume":"5","author":"Bienstock","year":"1990","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB13","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0095-8956(91)90068-U","article-title":"Quickly excluding a forest","volume":"52","author":"Bienstock","year":"1991","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB14","article-title":"Classes of graphs with bounded treewidth","author":"Bodlaender","year":"1986"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB15","series-title":"Proc. 15th Internat. Coll. on Automata, Languages and Programming","first-page":"105","article-title":"Dynamic programming algorithms on graphs with bounded tree-width","volume":"vol. 317","author":"Bodlaender","year":"1988"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB16","article-title":"Planar graphs with bounded treewidth","author":"Bodlaender","year":"1988"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB17","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0304-3975(93)90357-Y","article-title":"Complexity of path-forming games","volume":"110","author":"Bodlaender","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00228-4_BIB18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jagm.1993.1001","article-title":"On linear time minor tests with depth first search","volume":"14","author":"Bodlaender","year":"1993","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB19","first-page":"1","article-title":"A tourist guide through treewidth","volume":"11","author":"Bodlaender","year":"1993","journal-title":"Acta Cybernet."},{"key":"10.1016\/S0304-3975(97)00228-4_BIB20","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1142\/S0129054194000049","article-title":"On disjoint cycles","volume":"5","author":"Bodlaender","year":"1994","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00228-4_BIB21","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1006\/jagm.1996.0854","article-title":"Domino treewidth","volume":"24","author":"Bodlaender","year":"1997","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB22","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1006\/jagm.1995.1009","article-title":"Approximating treewidth, pathwidth, and minimum elimination tree height","volume":"18","author":"Bodlaender","year":"1995","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB23","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1137\/0406014","article-title":"The pathwidth and treewidth of cographs","volume":"6","author":"Bodlaender","year":"1993","journal-title":"SIAM J. Discrete Methods"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB24","series-title":"Proc. 21th Internat. Workshop on Graph Theoretic Concepts in Computer Science WG'95","first-page":"181","article-title":"On interval routing schemes and treewidth","volume":"vol. 1017","author":"Bodlaender","year":"1995"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB25","first-page":"33","article-title":"Balanced decompositions for partial k-trees","volume":"98","author":"Borie","year":"1993"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB26","article-title":"Recursively constructed graph families","author":"Borie","year":"1988"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB27","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/BF01758777","article-title":"Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families","volume":"7","author":"Borie","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB28","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0020-0190(95)00190-5","article-title":"A simple linear-time algorithm for finding path-decompositions of small width, manuscript","volume":"57","author":"Cattell","year":"1996","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(97)00228-4_BIB29","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1137\/0606026","article-title":"On the cutwidth and topological bandwidth of a tree","volume":"6","author":"Chung","year":"1985","journal-title":"SIAM J. Algebr. Discrete Methods"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB30","first-page":"192","article-title":"Graph rewriting: an algebraic and logical approach","volume":"vol. B","author":"Courcelle","year":"1990"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB31","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","article-title":"The monadic second-order logic of graphs I: Recognizable sets of finite graphs","volume":"85","author":"Courcelle","year":"1990","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(97)00228-4_BIB32","first-page":"257","article-title":"The monadic second-order logic of graphs III: treewidth, forbidden minors and complexity issues","volume":"26","author":"Courcelle","year":"1992","journal-title":"Informatique Th\u00e9orique"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB33","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0304-3975(93)90064-Z","article-title":"Monadic second-order evaluations on tree-decomposable graphs","volume":"109","author":"Courcelle","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00228-4_BIB34","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/S0304-3975(96)00177-6","article-title":"Fugitive-search games on graphs and related parameters","volume":"172","author":"Dendris","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00228-4_BIB35","first-page":"53","article-title":"Planar embeddings of planar graphs","volume":"2","author":"Dolev","year":"1984","journal-title":"Adv. Comput. Res."},{"key":"10.1016\/S0304-3975(97)00228-4_BIB36","series-title":"Proc. 4th Internat. Workshop on Graph Grammars and their Application to Computer Science","first-page":"1","article-title":"A note on hyperedge replacement","volume":"vol. 532","author":"Drewes","year":"1994"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB37","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1006\/inco.1994.1064","article-title":"The vertex separation and search number of a graph","volume":"113","author":"Ellis","year":"1994","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(97)00228-4_BIB38","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0020-0190(87)90054-8","article-title":"Nonconstructive advances in polynomial-time complexity","volume":"26","author":"Fellows","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(97)00228-4_BIB39","series-title":"Proc. 21st Ann. Symp. on Theory of Computing","first-page":"501","article-title":"On search, decision and the efficiency of polynomial-time algorithms","author":"Fellows","year":"1989"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB40","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","article-title":"The intersection graphs of subtrees in trees are exactly the chordal graphs","volume":"16","author":"Gavril","year":"1974","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB41","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/0196-6774(84)90019-1","article-title":"A separator theorem for graphs of bounded genus","volume":"5","author":"Gilbert","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB42","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0605032","article-title":"A separator theorem for chordal graphs","volume":"5","author":"Gilbert","year":"1984","journal-title":"SIAM J. Algebras Discrete Methods"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB43","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB44","series-title":"An estimate of the tree-width of a graph which has not a given planar grid as a minor","author":"Gorbunov","year":"1993"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB45","article-title":"Hyperedge Replacement: Grammars and Languages","volume":"vol. 643","author":"Habel","year":"1992"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB46","series-title":"Proc. Graph-Grammars and their Applications to Computer Science '86","first-page":"15","article-title":"May we introduce to you: hyperedge replacement","volume":"vol. 291","author":"Habel","year":"1987"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB47","series-title":"Decomposition of graphs \u2014 a uniform approach for the design of fast sequential and parallel algorithms on graphs","author":"Hohberg","year":"1989"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB48","series-title":"A framework to design algorithms for optimization problems on graphs","author":"Hohberg","year":"1990"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB49","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1145\/322003.322015","article-title":"On time versus space","volume":"24","author":"Hopcroft","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB50","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1137\/S0097539793258143","article-title":"Pathwidth, bandwidth and completion problems to proper interval graphs with small cliques","volume":"25","author":"Kaplan","year":"1996","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00228-4_BIB51","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0020-0190(92)90234-M","article-title":"The vertex separation number of a graph equals its path width","volume":"42","author":"Kinnersley","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(97)00228-4_BIB52","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0166-218X(94)90021-3","article-title":"Obstruction set isolation for the gate matrix layout problem","volume":"54","author":"Kinnersley","year":"1994","journal-title":"Disc. Appl. Math."},{"key":"10.1016\/S0304-3975(97)00228-4_BIB53","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0012-365X(85)90046-9","article-title":"Interval graphs and searching","volume":"55","author":"Kirousis","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(97)00228-4_BIB54","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0304-3975(86)90146-5","article-title":"Searching and pebbling","volume":"47","author":"Kirousis","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00228-4_BIB55","unstructured":"T. Kloks, personal communication."},{"key":"10.1016\/S0304-3975(97)00228-4_BIB56","article-title":"Treewidth. Computations and Approximations","volume":"vol. 842","author":"Kloks","year":"1994"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB57","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0166-218X(94)90023-X","article-title":"The nonexistence of reduction rules giving an embedding into a k-tree","volume":"54","author":"Lagergren","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(97)00228-4_BIB58","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/151261.151263","article-title":"Recontamination does not help to search a graph","volume":"40","author":"LaPaugh","year":"1993","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB59","series-title":"Proc. CSSP'88","first-page":"28","article-title":"Decomposition trees: structured graph representation and efficient algorithms","volume":"vol. 299","author":"Lautemann","year":"1988"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB60","series-title":"Proc. 11th Workshop on Graph-Theoretic Concepts in Computer Science","first-page":"217","article-title":"Subgraph isomorphism for easily separable graphs with bounded valence","author":"Lingas","year":"1985"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB61","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0136016","article-title":"A separator theorem for planar graphs","volume":"36","author":"Lipton","year":"1979","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0304-3975(97)00228-4_BIB62","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1137\/0611010","article-title":"The role of elimination trees in sparse factorization","volume":"11","author":"Liu","year":"1990","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/S0304-3975(97)00228-4_BIB63","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1137\/0606044","article-title":"Topological bandwidth","volume":"6","author":"Makedon","year":"1985","journal-title":"SIAM J. Algebra Discrete Methods"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB64","first-page":"17","article-title":"Graph problems related to gate matrix layout and PLA folding","volume":"7","author":"M\u00f6hring","year":"1990"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB65","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0166-218X(95)00095-9","article-title":"Triangulating graphs without asteroidal triples","volume":"64","author":"M\u00f6hring","year":"1996","journal-title":"Disc. Appl. Math."},{"key":"10.1016\/S0304-3975(97)00228-4_BIB66","article-title":"Constructions d'Algorithmes Pour les Graphes Structur\u00e9s par des M\u00e9thodes Alg\u00e9briques et Logiques","author":"Mosbah","year":"1992"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB67","article-title":"Measuring the distance to series-parallel graphs by path expressions","author":"Naumann","year":"1994"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB68","article-title":"Algorithms for VLSI layout based on graph width metrics","author":"Ramachandramurthi","year":"1994"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB69","unstructured":"N. Robertson, P.D. Seymour, Graph minors. XX. Wagner's conjecture, in preparation."},{"key":"10.1016\/S0304-3975(97)00228-4_BIB70","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","article-title":"Graph minors. I. Excluding a forest","volume":"35","author":"Robertson","year":"1983","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB71","first-page":"129","article-title":"Generalizing Kuratowskis theorem","volume":"45","author":"Robertson","year":"1984"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB72","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","article-title":"Graph minors. III. Planar tree-width","volume":"36","author":"Robertson","year":"1984","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB73","series-title":"Progress in Graph Theory","first-page":"399","article-title":"Graph width and well-quasi ordering: a survey","author":"Robertson","year":"1984"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB74","series-title":"Surveys in Combinatorics","first-page":"153","article-title":"Graph minors \u2014 a survey","author":"Robertson","year":"1985"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB75","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","article-title":"Graph minors. II. Algorithmic aspects of tree-width","volume":"7","author":"Robertson","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB76","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/0095-8956(86)90030-4","article-title":"Graph minors. V. Excluding a planar graph","volume":"41","author":"Robertson","year":"1986","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB77","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0095-8956(86)90031-6","article-title":"Graph minors. VI. Disjoint paths across a disc","volume":"41","author":"Robertson","year":"1986","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB78","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/0095-8956(88)90070-6","article-title":"Graph minors. VII. Disjoint paths on a surface","volume":"45","author":"Robertson","year":"1988","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB79","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0095-8956(90)90120-O","article-title":"Graph minors. IV. Tree-width and well-quasi-ordering","volume":"48","author":"Robertson","year":"1990","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB80","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/0095-8956(90)90063-6","article-title":"Graph minors. IX. Disjoint crossed paths","volume":"49","author":"Robertson","year":"1990","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB81","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0095-8956(90)90121-F","article-title":"Graph minors. VIII. A Kuratowski theorem for general surfaces","volume":"48","author":"Robertson","year":"1990","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB82","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","article-title":"Graph minors. X. Obstructions to tree-decomposition","volume":"52","author":"Robertson","year":"1991","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB83","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1006\/jctb.1996.0059","article-title":"Graph minors, XV. Giant Steps","volume":"68","author":"Robertson","year":"1996","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB84","series-title":"Graph minors. XVI. Excluding a non-planar graph","author":"Robertson","year":"1991"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB85","series-title":"Graph minors. XVII. Taming a vortex","author":"Robertson","year":"1991"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB86","series-title":"Graph minors. XXII. Irrelevant vertices in linkage problems","author":"Robertson","year":"1992"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB87","series-title":"Graph Structure Theory, Proc. AMS-IMS-SIAM Joint Summer Research Conf.","first-page":"669","article-title":"Excluding a graph with one crossing","volume":"vol. 147","author":"Robertson","year":"1993"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB88","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1006\/jctb.1994.1007","article-title":"Graph minors. XI. Distance on a surface","volume":"60","author":"Robertson","year":"1994","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB89","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1006\/jctb.1995.1034","article-title":"Graph minors. XII. Excluding a non-planar graph","volume":"64","author":"Robertson","year":"1995","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB90","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1006\/jctb.1995.1006","article-title":"Graph minors. XIII. The disjoint paths problem","volume":"63","author":"Robertson","year":"1995","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB91","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1006\/jctb.1994.1073","article-title":"Quickly excluding a planar graph","volume":"62","author":"Robertson","year":"1994","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB92","series-title":"Graph Structure Theory, Proc. AMS-IMS-SIAM Joint Summer Research Conf.","first-page":"125","article-title":"A survey of linkless embeddings","volume":"vol. 147","author":"Robertson","year":"1993"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB93","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0012-365X(74)90042-9","article-title":"On simple characterization of k-trees","volume":"7","author":"Rose","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(97)00228-4_BIB94","article-title":"Die Baumweite von Graphen als ein Ma\u00df f\u00fcr die Kompliziertheit algorithmischer Probleme","author":"Scheffler","year":"1989"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB95","series-title":"Proc. Internat Conf. on Fundamentals of Computation Theory","first-page":"412","article-title":"Tree-partite graphs and the complexity of algorithms","volume":"vol. 199","author":"Seese","year":"1985"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB96","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1006\/jctb.1993.1027","article-title":"Graph searching and a minimax theorem for tree-width","volume":"58","author":"Seymour","year":"1993","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB97","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0012-365X(79)90060-8","article-title":"Characterisations of outerplanar graphs","volume":"26","author":"Syslo","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(97)00228-4_BIB98","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0012-365X(94)90092-2","article-title":"Minimal acyclic forbidden minors for the family of graphs with bounded path-width","volume":"127","author":"Takahashi","year":"1994","journal-title":"Disc. Math."},{"key":"10.1016\/S0304-3975(97)00228-4_BIB99","unstructured":"A. Takahashi, S. Ueno, Y. Kajitani, Mixed-searching and proper-path-width."},{"key":"10.1016\/S0304-3975(97)00228-4_BIB100","series-title":"Proc. 23rd Internat. Workshop on Graph Theoretic Concepts in Computer Science WG'97","first-page":"318","article-title":"Structured programs have small tree-width and good register allocation","volume":"vol. 1335","author":"Thorup","year":"1997"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB101","first-page":"527","article-title":"Graph algorithms","author":"van Leeuwen","year":"1990"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB102","series-title":"Proc. 1st Colloquium on Structural Information and Communication Complexity SIROCCO'94, Carleton University","first-page":"71","article-title":"Compact routing methods: A survey","author":"van Leeuwen","year":"1994"},{"key":"10.1016\/S0304-3975(97)00228-4_BIB103","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0166-218X(93)90106-X","article-title":"On hyperedge replacement and BNLC graph grammars","volume":"46","author":"Vogler","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(97)00228-4_BIB104","article-title":"Linear algorithms on k-terminal graphs","author":"Wimer","year":"1987"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597002284?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597002284?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T07:27:10Z","timestamp":1556522830000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597002284"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":104,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["S0304397597002284"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00228-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}