{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T05:08:59Z","timestamp":1736140139676,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540556312"},{"type":"electronic","value":"9783540472650"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/bfb0021088","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T05:35:18Z","timestamp":1132637718000},"page":"150-158","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Constructivity issues in graph algorithms"],"prefix":"10.1007","author":[{"given":"Michael R.","family":"Fellows","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael A.","family":"Langston","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"key":"10_CR1","unstructured":"K. Abrahamson, M. R. Fellows, M. A. Langston and B. Moret, \u201cConstructive Complexity,\u201d Discrete Applied Mathematics, to appear."},{"key":"10_CR2","unstructured":"H. H. Bodlaender, \u201cImproved Self-Reduction Algorithms for Graphs with Bounded Treewidth,\u201d to appear."},{"key":"10_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/00207168908803783","volume":"31","author":"D. J. Brown","year":"1989","unstructured":"D. J. Brown, M. R. Fellows and M. A. Langsten, \u201cPolynomial-Time Self-Reducibility: Theoretical Motivations and Practical Results,\u201d Int'l J. of Computer Mathematics 31 (1989), 1\u20139.","journal-title":"Int'l J. of Computer Mathematics"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0020-0190(87)90054-8","volume":"26","author":"M. R. Fellows","year":"1987","unstructured":"M. R. Fellows and M. A. Langston, \u201cNonconstructive Advances in Polynomial-Time Complexity,\u201d Information Processing Letters 26 (1987), 157\u2013162.","journal-title":"Information Processing Letters"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1145\/44483.44491","volume":"35","author":"M. R. Fellows","year":"1988","unstructured":"-, \u201cNonconstructive Tools for Proving Polynomial-Time Decidability,\u201d J. of the ACM 35 (1988), 727\u2013739.","journal-title":"J. of the ACM"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"-\u201cLayout Permutation Problems and Well-Partially-Ordered Sets,\u201d Proc. 5th MIT Conf. on Advanced Research in VLSI (1988), 315\u2013327.","DOI":"10.7551\/mitpress\/1102.003.0025"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"-\u201cOn Search, Decision and the Efficiency of Polynomial-Time Algorithms,\u201d Proc. 21st ACM Symp. on Theory of Computing (1989), 501\u2013512.","DOI":"10.1145\/73007.73055"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"-\u201cAn Analogue of the Myhill-Nerode Theorem and Its Use in Computing Finite-Basis Characterizations,\u201d Proc. 30th IEEE Symposium on Foundations of Computer Science, (1989), 520\u2013525.","DOI":"10.1109\/SFCS.1989.63528"},{"key":"10_CR9","unstructured":"H. Friedman, N. Robertson and P. D. Seymour, \u201cThe Metamathematics of the Graph Minor Theorem,\u201d in Applications of Logic to Combinatorics, American Math. Soc., Providence, RI, to appear."},{"key":"10_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979."},{"key":"10_CR11","unstructured":"A. Gupta, Ph.d. dissertation, University of Toronto, Department of Computer Science, 1991."},{"key":"10_CR12","unstructured":"N. G. Kinnersley, \u201cObstruction Set Isolation for Layout Permutation Problems,\u201d Ph.D. Thesis, Department of Computer Science, Washington State University, 1989."},{"key":"10_CR13","unstructured":"C. Murthy, \u201cExtracting Constructive Content from Classical Proofs,\u201d Ph.D. Thesis, Department of Computer Science, Cornell University, 1990."},{"key":"10_CR14","unstructured":"B. Reed, to appear. (Presented at the AMS Summer Workshop on Graph Minors, Seattle, June 1991.)"},{"key":"10_CR15","unstructured":"N. Robertson and P. D. Seymour, \u201cGraph Minors IV. Tree-Width and Well-Quasi-Ordering,\u201d J. Combinatorial Theory Series B, to appear."},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(86)90030-4","volume":"41","author":"N. Robertson","year":"1986","unstructured":"-, \u201cGraph Minors V. Excluding a Planar Graph,\u201d J. Combinatorial Theory Series B 41 (1986), 92\u2013114.","journal-title":"J. Combinatorial Theory Series B"},{"key":"10_CR17","unstructured":"-\u201cGraph Minors X. Obstructions to Tree-Decomposition,\u201d to appear."},{"key":"10_CR18","unstructured":"-\u201cGraph Minors XIII. The Disjoint Paths Problem,\u201d to appear."},{"key":"10_CR19","unstructured":"-\u201cGraph Minors XVI. Wagner's Conjecture,\u201d to appear."},{"key":"10_CR20","unstructured":"K. Winklmann, private communication."}],"container-title":["Lecture Notes in Computer Science","Constructivity in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0021088","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T19:51:25Z","timestamp":1736106685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0021088"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540556312","9783540472650"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0021088","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]},"assertion":[{"value":"16 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}