{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T08:54:27Z","timestamp":1782723267103,"version":"3.54.5"},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1994,6,1]],"date-time":"1994-06-01T00:00:00Z","timestamp":770428800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1994,6]]},"DOI":"10.1007\/bf01215352","type":"journal-article","created":{"date-parts":[[2005,2,25]],"date-time":"2005-02-25T15:10:17Z","timestamp":1109344217000},"page":"217-241","source":"Crossref","is-referenced-by-count":223,"title":["Call routing and the ratcatcher"],"prefix":"10.1007","volume":"14","author":[{"given":"P. D.","family":"Seymour","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R.","family":"Thomas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0095-8956(91)90068-U","volume":"52","author":"D. Bienstock","year":"1991","unstructured":"D. Bienstock, N. Robertson, P. D. Seymour andR. Thomas: Quickly excluding a forest,J. Combinatorial Theory, Ser. B,52 (1991), 274?283.","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1137\/0216064","volume":"16","author":"G. N. Frederickson","year":"1987","unstructured":"G. N. Frederickson: Fast algorithms for shortest paths in planar graphs, with applications,SIAM J. Comput. 16 (1987), 1004?1022.","journal-title":"SIAM J. Comput."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M. R. Garey","year":"1976","unstructured":"M. R. Garey, D. S. Johnson andL. Stockmeyer: Some simplified NP-complete problems,Theor. Comput. Sci. 1 (1976), 237?267.","journal-title":"Theor. Comput. Sci."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","volume":"59","author":"N. Robertson","year":"1991","unstructured":"N. Robertson andP. D. Seymour: Graph minors. X. Obstructions to treedecomposition,J. Combinatorial Theory, Ser B 59 (1991), 153?190.","journal-title":"J. Combinatorial Theory, Ser B"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1006\/jctb.1994.1007","volume":"60","author":"N. Robertson","year":"1994","unstructured":"N. Robertson andP. D. Seymour: Graph minors. XI. Circuits on a surface,J. Combinatorial Theory, Ser. B 60 (1994), 72?106.","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1145\/4221.4228","volume":"32","author":"M. Yannakakis","year":"1985","unstructured":"M. Yannakakis: A polynomial algorithm for the min cut linear arrangement of trees,J. Assoc. Comp. Mach. 32 (1985), 950?988.","journal-title":"J. Assoc. Comp. Mach."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01215352.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01215352\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01215352","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T09:55:48Z","timestamp":1556790948000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01215352"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,6]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,6]]}},"alternative-id":["BF01215352"],"URL":"https:\/\/doi.org\/10.1007\/bf01215352","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,6]]}}}