{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:33:10Z","timestamp":1725557590799},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540406716"},{"type":"electronic","value":"9783540451389"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45138-9_18","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T18:41:48Z","timestamp":1277232108000},"page":"239-248","source":"Crossref","is-referenced-by-count":0,"title":["Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms"],"prefix":"10.1007","author":[{"given":"Hans L.","family":"Bodlaender","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael R.","family":"Fellows","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitrios M.","family":"Thilikos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","first-page":"539","volume-title":"Proc. of the AMS Summer Workshop on Graph Minors, Graph Structure Theory, Contemporary Mathematics","author":"K.R. Abrahamson","year":"1993","unstructured":"Abrahamson, K.R., Fellows, M.R.: Finite automata, bounded treewidth and well-quasiordering. In: Proc. of the AMS Summer Workshop on Graph Minors, Graph Structure Theory, Contemporary Mathematics, vol.\u00a0147, pp. 539\u2013564. American Mathematical Society, Providence (1993)"},{"key":"18_CR2","first-page":"574","volume-title":"Proc. of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"H. Bodlaender","year":"1998","unstructured":"Bodlaender, H., Gustedt, J., Telle, J.A.: Linear-time register allocation for a fixed number of registers. In: Proc. of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 574\u2013583. ACM, New York (1998)"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BFb0029946","volume-title":"Mathematical Foundations of Computer Science 1997","author":"H.L. Bodlaender","year":"1997","unstructured":"Bodlaender, H.L.: Treewidth: Algorithmic techniques and results. In: Privara, I., Ru\u017ei\u010dka, P. (eds.) MFCS 1997. LNCS, vol.\u00a01295, pp. 19\u201336. Springer, Heidelberg (1997)"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theor. Comp. Sc.\u00a0209, 1\u201345 (1998)","journal-title":"Theor. Comp. Sc."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., Fellows, M.R., Evans, P.A.: Finite-state computability of annotations of strings and trees. In: Proc. Conference on Pattern Matching, pp. 384\u2013391 (1996)","DOI":"10.1007\/3-540-61258-0_28"},{"key":"18_CR6","unstructured":"Bodlaender, H.L., Fellows, M.R., Thilikos, D.M.: Derivation of algorithms for cutwidth and related graph layout problems. Technical Report UU-CS-2002-032, Inst. of Inform. and Comp. Sc., Utrecht Univ., Utrecht, the Netherlands (2002)"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1006\/jagm.1996.0049","volume":"21","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L., Kloks, T.: Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms\u00a021, 358\u2013402 (1996)","journal-title":"J. Algorithms"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1007\/3-540-63165-8_217","volume-title":"Automata, Languages and Programming","author":"H.L. Bodlaender","year":"1997","unstructured":"Bodlaender, H.L., Thilikos, D.M.: Constructive linear time algorithms for branchwidth. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol.\u00a01256, pp. 627\u2013637. Springer, Heidelberg (1997)"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/3-540-45294-X_11","volume-title":"FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science","author":"J. Chen","year":"2001","unstructured":"Chen, J., Friesen, D.K., Jia, W., Kanj, I.: Using nondeterminism to design deterministic algorithms. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol.\u00a02245, pp. 120\u2013131. Springer, Heidelberg (2001)"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","first-page":"21","volume-title":"Algorithms and Computation","author":"M.-H. Chen","year":"1992","unstructured":"Chen, M.-H., Lee, S.-L.: Linear time algorithms for k-cutwidth problem. In: Ibaraki, T., Iwama, K., Yamashita, M., Inagaki, Y., Nishizeki, T. (eds.) ISAAC 1992. LNCS, vol.\u00a0650, pp. 21\u201330. Springer, Heidelberg (1992)"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539792228228","volume":"24","author":"R.G. Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness I: Basic results. SIAM J. Comput.\u00a024, 873\u2013921 (1995)","journal-title":"SIAM J. Comput."},{"key":"18_CR12","first-page":"129","volume":"104","author":"N.G. Kinnersley","year":"1994","unstructured":"Kinnersley, N.G., Kinnersley, W.M.: Tree automata for cutwidth recognition. Congressus Numerantium\u00a0104, 129\u2013142 (1994)","journal-title":"Congressus Numerantium"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1007\/3-540-54233-7_161","volume-title":"Automata, Languages and Programming","author":"J. Lagergren","year":"1991","unstructured":"Lagergren, J., Arnborg, S.: Finding minimal forbidden minors using a finite congruence. In: Leach Albert, J., Monien, B., Rodr\u00edguez-Artalejo, M. (eds.) ICALP 1991. LNCS, vol.\u00a0510, pp. 532\u2013543. Springer, Heidelberg (1991)"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0304-3975(88)90028-X","volume":"58","author":"B. Monien","year":"1988","unstructured":"Monien, B., Sudborough, I.H.: Min cut is NP-complete for edge weighted trees. Theor. Comp. Sc.\u00a058, 209\u2013229 (1988)","journal-title":"Theor. Comp. Sc."},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Thilikos, D.M., Serna, M.J., Bodlaender, H.L.: A constructive linear time algorithm for small cutwidth. Technical Report LSI-00-48-R, Departament de Llenguatges i Sistemes Informatics, Univ. Politecnica de Catalunya, Barcelona, Spain (2000)","DOI":"10.1007\/3-540-40996-3_17"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/3-540-40996-3_17","volume-title":"Algorithms and Computation","author":"D.M. Thilikos","year":"2000","unstructured":"Thilikos, D.M., Serna, M.J., Bodlaender, H.L.: Constructive linear time algorithms for small cutwidth and carving-width. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol.\u00a01969, pp. 192\u2013203. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45138-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T05:54:17Z","timestamp":1559195657000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45138-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406716","9783540451389"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45138-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}