{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:08Z","timestamp":1725488948370},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744559"},{"type":"electronic","value":"9783540744566"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74456-6_26","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T07:29:48Z","timestamp":1187076588000},"page":"276-287","source":"Crossref","is-referenced-by-count":3,"title":["On the Complexity of Computing Treelength"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Lokshtanov","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing\u00a025, 1305\u20131317 (1996)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"26_CR2","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1137\/S0097539799359683","volume":"31","author":"V. Bouchitte","year":"2001","unstructured":"Bouchitte, V., Todinca, I.: Treewidth and minimum fill-in: Grouping the minimal separators. SIAM Journal on Computing\u00a031(1), 212\u2013232 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0012-365X(74)90002-8","volume":"9","author":"P. Buneman","year":"1974","unstructured":"Buneman, P.: A characterization of rigid circuit graphs. Discrete Mathematics\u00a09, 205\u2013212 (1974)","journal-title":"Discrete Mathematics"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/978-3-540-30186-8_26","volume-title":"Proceedings DISC 2004","author":"Y. Dourisboure","year":"2004","unstructured":"Dourisboure, Y.: Compact routing schemes for bounded tree-length graphs and for k-chordal graphs. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol.\u00a03274, pp. 365\u2013378. Springer, Heidelberg (2004)"},{"key":"26_CR5","unstructured":"Dourisboure, Y., Dragan, F.F., Gavoille, C., Yan, C.: Sparse additive spanners for bounded tree-length graphs. Theoretical Computer Science (to appear)"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Dourisboure, Y., Gavoille, C.: Tree-decompositions with bags of small diameter. Discrete Mathematics (to appear)","DOI":"10.1016\/j.disc.2005.12.060"},{"key":"26_CR7","volume-title":"37 th Annual ACM Symposium on Theory of Computing (STOC)","author":"U. Feige","year":"2005","unstructured":"Feige, U., Hajiaghayi, M.T., Lee, J.R.: Improved approximation algorithms for minimum-weight vertex separators. In: 37 th Annual ACM Symposium on Theory of Computing (STOC), ACM, New York (2005)"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Kratsch, D., Todinca, I., Villanger, Y.: Exact algorithms for treewidth and minimum fill-in. SIAM Journal on Computing (submitted), first appearance at ICALP (2004)","DOI":"10.1007\/978-3-540-27836-8_49"},{"key":"26_CR9","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D.R. Fulkerson","year":"1965","unstructured":"Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pacific Journal of Mathematics\u00a015, 835\u2013855 (1965)","journal-title":"Pacific Journal of Mathematics"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F. Gavril","year":"1974","unstructured":"Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graps. Journal of Combinatorial Theory B\u00a016, 47\u201356 (1974)","journal-title":"Journal of Combinatorial Theory B"},{"issue":"3","key":"26_CR11","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1006\/jagm.1995.1047","volume":"19","author":"M.C. Golumbic","year":"1995","unstructured":"Golumbic, M.C., Kaplan, H., Shamir, R.: Graph sandwich problems. J. Algorithms\u00a019(3), 449\u2013473 (1995)","journal-title":"J. Algorithms"},{"issue":"3","key":"26_CR12","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/j.disc.2005.12.003","volume":"306","author":"P. Heggernes","year":"2006","unstructured":"Heggernes, P.: Minimal triangulations of graphs: A survey. Discrete Mathematics\u00a0306(3), 297\u2013317 (2006)","journal-title":"Discrete Mathematics"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques, pp. 260\u2013272 (2004)","DOI":"10.1007\/978-3-540-27810-8_23"},{"key":"26_CR14","unstructured":"Walter, J.: Representation of rigid cycle graphs. PhD thesis (1972)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:28:50Z","timestamp":1619519330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744559","9783540744566"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}