{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:24:01Z","timestamp":1725456241749},"publisher-location":"Berlin\/Heidelberg","reference-count":11,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354051516X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0015934","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T01:25:05Z","timestamp":1132709105000},"page":"136-145","source":"Crossref","is-referenced-by-count":0,"title":["A note on the computational complexity of bracketing and related problems"],"prefix":"10.1007","author":[{"given":"Mirko","family":"K\u0159iv\u00e1nek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-010-2196-8","volume-title":"Advanced combinatorics","author":"L. COMTET","year":"1974","unstructured":"L. COMTET: Advanced combinatorics. D Reidel, Boston 1974."},{"key":"12_CR2","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0020-0190(82)90083-7","volume":"15","author":"K. Culik II","year":"1982","unstructured":"K. CULIK II, D. WOOD: A note on some tree similarity measures, Information Processing Letters, 15(1982), 39\u201342.","journal-title":"Information Processing Letters"},{"key":"12_CR3","volume-title":"Computers and Intractability","author":"M. R. GAREY","year":"1979","unstructured":"M. R. GAREY, D. S. JOHNSON: Computers and Intractability. W. H. Freeman, San Francisco, 1979."},{"key":"12_CR4","unstructured":"M. A. HARRISON: Introduction to formal language theory. Addison-Wesley, 1978."},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"M. HOFRI: Probabilistic analysis of algorithms. Springer, 1987.","DOI":"10.1007\/978-1-4612-4800-2"},{"key":"12_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-12191-6","volume-title":"Fundamentals of the average case analysis of particular algorithms","author":"R. Kemp","year":"1984","unstructured":"R. KEMP: Fundamentals of the average case analysis of particular algorithms. Willey-Teubner, Stuttgart, 1984."},{"key":"12_CR7","unstructured":"M. KRIVANEK: The computational complexity of the consensus between hierarchical trees. Proc IMYCS'84, Smolenice, 119\u2013125."},{"key":"12_CR8","first-page":"52","volume":"113","author":"M. Krivanek","year":"1988","unstructured":"M. KRIVANEK: A note on the computational complexity of computing the edge rotation distance between graphs. Cas.pest.mat. 113(1988),52\u201355.","journal-title":"Cas.pest.mat."},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"K. MEHLHORN: Data structures and algorithms, Vol. 1 and 3, Springer, 1984.","DOI":"10.1007\/978-3-642-69900-9_1"},{"key":"12_CR10","first-page":"361","volume":"15","author":"Schroder","year":"1870","unstructured":"SCHRODER: Vier ccombinatorische Probleme, Z. fur M. Phys., 15(1870), 361\u2013376.","journal-title":"Z. fur M. Phys."},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"D. D. SLEATOR, R. E. TARJAN, W. P. THURSTON: Rotation distance, triangulations, and hyperbolic geometry. Proc ACM STOC(1986), 122\u2013135.","DOI":"10.1145\/12130.12143"}],"container-title":["Lecture Notes in Computer Science","Machines, Languages, and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0015934","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T00:25:36Z","timestamp":1586564736000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0015934"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354051516X"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0015934","relation":{},"subject":[]}}