{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T09:56:27Z","timestamp":1768643787445,"version":"3.49.0"},"reference-count":47,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"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":7443,"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":[[1993,3]]},"DOI":"10.1016\/0304-3975(93)90357-y","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"215-245","source":"Crossref","is-referenced-by-count":21,"title":["Complexity of path-forming games"],"prefix":"10.1016","volume":"110","author":[{"given":"Hans L.","family":"Bodlaender","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90357-Y_BIB1","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1145\/62.322433","article-title":"Some combinatorial game problems require \u03a9(nk) time","volume":"31","author":"Adachi","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01934985","article-title":"Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey","volume":"25","author":"Arnborg","year":"1985","journal-title":"BIT"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB3","author":"Arnborg","year":"1991","journal-title":"Some PSPACE-complete logic decision problems that become linear-time-solvable on formula graphs of bounded treewidth"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB4","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. Algebraic Discrete Methods"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB5","series-title":"Proc. 4th Workshop on Graph Grammars and Their Applications to Computer Science","first-page":"70","article-title":"An algebraic theory of graph reduction","volume":"Vol. 532","author":"Arnborg","year":"1991"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB6","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","article-title":"Easy problems for tree decomposable graphs","volume":"12","author":"Arnborg","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB7","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. Algebraic Discrete Methods"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB8","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","article-title":"Linear-time algorithms for NP-hard problems restricted to partial k-trees","volume":"23","author":"Arnborg","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0304-3975(93)90357-Y_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\/0304-3975(93)90357-Y_BIB10","series-title":"Tech. Report RUU-CS-86-22","article-title":"Classes of graphs with bounded treewidth","author":"Bodlaender","year":"1986"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB11","series-title":"Proc. 15th Internat. Colloq. 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\/0304-3975(93)90357-Y_BIB12","series-title":"Proc. Workshop on Graph-Theoretic Concepts in Computer Science WG'88","first-page":"1","article-title":"NC-algorithms for graphs with small treewidth","volume":"Vol. 344","author":"Bodlaender","year":"1988"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB13","series-title":"Tech. Report RUU-CS-88-14","article-title":"Planar graphs with bounded treewidth","author":"Bodlaender","year":"1988"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB14","series-title":"Proc. 15th Internat. Workshop on Graph-Theoretic Concepts in Computer Science, WG'89","first-page":"232","article-title":"Improved self-reduction algorithms for graphs with bounded treewidth","volume":"Vol. 411","author":"Bodlaender","year":"1990"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB47","unstructured":"Ann. Discrete Math., to appear."},{"key":"10.1016\/0304-3975(93)90357-Y_BIB15","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1016\/0196-6774(90)90013-5","article-title":"Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees","volume":"11","author":"Bodlaender","year":"1990","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB16","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1142\/S0129054191000091","article-title":"On the complexity of some coloring games","volume":"2","author":"Bodlaender","year":"1991","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90357-Y_BIB17","series-title":"Tech. Report RUU-CS-90-11","article-title":"Fast algorithms for the TRON game on trees","author":"Bodlaender","year":"1990"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB18","series-title":"Proc. 18th Internat. Colloq. on Automata, Languages and Programming","first-page":"544","article-title":"Better algorithms for the pathwidth and treewidth of graphs","volume":"Vol. 510","author":"Bodlaender","year":"1991"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB19","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB20","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/BF01758777","article-title":"Automatic generation of linear algorithms from predicate calculus descriptions of problems on recursively constructed graph families","volume":"7","author":"Borie","year":"1992","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB21","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. and Comput."},{"key":"10.1016\/0304-3975(93)90357-Y_BIB22","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1145\/321978.321989","article-title":"A combinatorial problem which is complete in polynomial space","volume":"23","author":"Even","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB23","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1109\/SFCS.1989.63528","article-title":"An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations","author":"Fellows","year":"1989","journal-title":"Proc. 30th Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB24","first-page":"55","article-title":"The complexity of checkers on an n \u00d7 n board - preliminary version","author":"Fraenkel","year":"1978","journal-title":"Proc. 19th Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB25","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0097-3165(87)90074-4","article-title":"Pspace-hardness of some combinatorial games","volume":"46","author":"Fraenkel","year":"1987","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB26","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0097-3165(81)90016-9","article-title":"Computing a perfect strategy for n by n chess requires time exponential in n","volume":"31","author":"Fraenkel","year":"1981","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB27","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0304-3975(93)90356-X","article-title":"Geography","volume":"110","author":"Fraenkel","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90357-Y_BIB28","series-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB29","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/0196-6774(83)90019-6","article-title":"The NP-completeness column: an ongoing guide","volume":"4","author":"Johnson","year":"1983","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB30","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/0196-6774(85)90012-4","article-title":"The NP-completeness column: an ongoing guide","volume":"6","author":"Johnson","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB31","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1109\/FSCS.1990.89536","article-title":"Efficient parallel algorithms for tree decomposition and related problems","author":"Lagergren","year":"1990","journal-title":"Proc. 31st Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB32","series-title":"Proc. 15th Internat. Colloq. on Automata, Languages and Programming","first-page":"362","article-title":"Efficient algorithms on context-free graph languages","volume":"Vol. 317","author":"Lautemann","year":"1988"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB33","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/0196-6774(87)90042-3","article-title":"Efficient algorithms for finding minimum spanning forests in hierarchically defined graphs","volume":"8","author":"Lengauer","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB34","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1137\/0217068","article-title":"Efficient solutions of connectivity problems on hierarchically defined graphs","volume":"17","author":"Lengauer","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90357-Y_BIB35","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1145\/322186.322201","article-title":"Go is polynomial-space hard","volume":"27","author":"Lichtenstein","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0196-6774(91)90020-Y","article-title":"Algorithms finding tree decompositions of graphs","volume":"12","author":"Matous\u011bk","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB37","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1109\/SFCS.1989.63532","article-title":"On the complexity of a game related to the dictionary problem","author":"Mehlhorn","year":"1989","journal-title":"Proc. 30th Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB38","first-page":"221","article-title":"Finding approximate separators and computing treewidth quickly","author":"Reed","year":"1992","journal-title":"Proc. Symp. on Theory of Computation"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB39","author":"Robertson","year":"1986","journal-title":"Graph minors. XIII. The disjoint paths problem"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB40","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1137\/0213018","article-title":"N by N checkers is exptime complete","volume":"13","author":"Robson","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90357-Y_BIB41","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80023-1","article-title":"Alternation with restrictions on looping","volume":"67","author":"Robson","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB42","first-page":"216","article-title":"The complexity of satisfiability problems","author":"Schaefer","year":"1978","journal-title":"Proc. 10th Symp. on Theory of Computation"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB43","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0022-0000(78)90045-4","article-title":"On the complexity of some two-person perfect-information games","volume":"16","author":"Schaefer","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(93)90357-Y_BIB44","series-title":"Ph.D Thesis","article-title":"Die Baumweite von Graphen als ein Ma\u03b2 f\u00fcr die Komplizierheit algorithmischer Probleme","author":"Scheffler","year":"1989"},{"key":"10.1016\/0304-3975(93)90357-Y_BIB45","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1137\/0208013","article-title":"Provably difficult combinatorial games","volume":"8","author":"Stockmeyer","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90357-Y_BIB46","series-title":"Ph.D Thesis","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:030439759390357Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390357Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T14:18:19Z","timestamp":1580912299000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390357Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["030439759390357Y"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90357-y","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}