{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:04:51Z","timestamp":1743055491490,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319445427"},{"type":"electronic","value":"9783319445434"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","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":[[2016]]},"DOI":"10.1007\/978-3-319-44543-4_1","type":"book-chapter","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T07:49:58Z","timestamp":1470642598000},"page":"3-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the Complexity of Computing Treebreadth"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Ducoffe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvain","family":"Legay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Nisse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,9]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1002\/net.21631","volume":"67","author":"M Abu-Ata","year":"2016","unstructured":"Abu-Ata, M., Dragan, F.: Metric tree-like structures in real-world networks: an empirical study. Networks 67, 49\u201368 (2016)","journal-title":"Networks"},{"issue":"2","key":"1_CR2","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D., Proskurowski, A.: Complexity of finding embeddings in a \n                      \n                        \n                      \n                      $$k$$\n                    -tree. SIAM J. Algebraic Discrete Methods 8(2), 277\u2013284 (1987)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"2","key":"1_CR3","doi-asserted-by":"publisher","first-page":"197","DOI":"10.3390\/a3020197","volume":"3","author":"A Berry","year":"2010","unstructured":"Berry, A., Pogorelcnik, R., Simonet, G.: An introduction to clique minimal separator decomposition. Algorithms 3(2), 197\u2013215 (2010)","journal-title":"Algorithms"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.: Treewidth: Characterizations, applications, and computations (2006)","DOI":"10.1007\/11917496_1"},{"issue":"6","key":"1_CR5","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H Bodlaender","year":"1996","unstructured":"Bodlaender, H.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Bodlaender, H., Fellows, M., Warnow, T.: Two strikes against perfect phylogeny. In: ICALP 1992, Vienna, Austria, pp. 273\u2013283 (1992)","DOI":"10.1007\/3-540-55719-9_80"},{"issue":"3","key":"1_CR7","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1137\/S0895480193253415","volume":"11","author":"A Brandst\u00e4dt","year":"1998","unstructured":"Brandst\u00e4dt, A., Dragan, F., Chepoi, V., Voloshin, V.: Dually chordal graphs. SIAM J. Discrete Math. 11(3), 437\u2013455 (1998)","journal-title":"SIAM J. Discrete Math."},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Chechik, S., Larkin, D., Roditty, L., Schoenebeck, G., Tarjan, R., Williams, V.V.: Better approximation algorithms for the graph diameter. In: ACM SODA 2014, pp. 1041\u20131052. SIAM (2014)","DOI":"10.1137\/1.9781611973402.78"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Chepoi, V., Dragan, F., Estellon, B., Habib, M., Vax\u00e8s, Y.: Diameters, centers, and approximating trees of \n                      \n                        \n                      \n                      $$\\delta $$\n                    -hyperbolic geodesic spaces and graphs. In: SCG 2008, New York, NY, USA, pp. 59\u201368. ACM (2008)","DOI":"10.1145\/1377676.1377687"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Coudert, D., Ducoffe, G., Nisse, N.: To approximate treewidth, use treelength! SIAM J. Discrete Math. (to appear, 2016)","DOI":"10.1137\/15M1034039"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"de Montgolfier, F., Soto, M., Viennot, L.: Treewidth and hyperbolicity of the internet. In: 2011 10th IEEE International Symposium on Network Computing and Applications (NCA), pp. 25\u201332, August 2011","DOI":"10.1109\/NCA.2011.11"},{"issue":"1","key":"1_CR12","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.tcs.2007.03.058","volume":"383","author":"Y Dourisboure","year":"2007","unstructured":"Dourisboure, Y., Dragan, F., Gavoille, C., Chenyu, Y.: Spanners for bounded tree-length graphs. Theor. Comput. Sci. 383(1), 34\u201344 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"16","key":"1_CR13","doi-asserted-by":"publisher","first-page":"2008","DOI":"10.1016\/j.disc.2005.12.060","volume":"307","author":"Y Dourisboure","year":"2007","unstructured":"Dourisboure, Y., Gavoille, C.: Tree-decompositions with bags of small diameter. Discrete Math. 307(16), 2008\u20132029 (2007)","journal-title":"Discrete Math."},{"issue":"4","key":"1_CR14","doi-asserted-by":"publisher","first-page":"884","DOI":"10.1007\/s00453-013-9765-4","volume":"69","author":"F Dragan","year":"2014","unstructured":"Dragan, F., K\u00f6hler, E.: An approximation algorithm for the tree t-spanner problem on unweighted graphs via generalized chordal graphs. Algorithmica 69(4), 884\u2013905 (2014)","journal-title":"Algorithmica"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-319-08404-6_14","volume-title":"Algorithm Theory \u2013 SWAT 2014","author":"FF Dragan","year":"2014","unstructured":"Dragan, F.F., K\u00f6hler, E., Leitert, A.: Line-distortion, bandwidth and path-length of a graph. In: Ravi, R., G\u00f8rtz, I.L. (eds.) SWAT 2014. LNCS, vol. 8503, pp. 158\u2013169. Springer, Heidelberg (2014)"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-319-21840-3_23","volume-title":"Algorithms and Data Structures","author":"FF Dragan","year":"2015","unstructured":"Dragan, F.F., Leitert, A.: On the minimum eccentricity shortest path problem. In: Dehne, F., Sack, J.-R., Stege, U. (eds.) WADS 2015. LNCS, vol. 9214, pp. 276\u2013288. Springer, Heidelberg (2015)"},{"key":"1_CR17","unstructured":"Ducoffe, G., Legay, S., Nisse, N.: On computing tree and path decompositions with metric constraints on the bags. Technical Report RR-8842 (2016)"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Krauthgamer, R., Lee, J.: Algorithms on negatively curved spaces. In: FOCS 2006, pp. 119\u2013132. IEEE (2006)","DOI":"10.1109\/FOCS.2006.9"},{"issue":"7","key":"1_CR19","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1016\/j.dam.2009.10.007","volume":"158","author":"D Lokshtanov","year":"2010","unstructured":"Lokshtanov, D.: On the complexity of computing treelength. Discrete Appl. Math. 158(7), 820\u2013827 (2010)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"1_CR20","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.: Graph minors. II: algorithmic aspects of tree-width. J. Algorithms 7(3), 309\u2013322 (1986)","journal-title":"J. Algorithms"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-31770-5_9","volume-title":"Combinatorial Optimization and Applications","author":"C Wang","year":"2012","unstructured":"Wang, C., Liu, T., Jiang, W., Xu, K.: Feedback vertex sets on tree convex bipartite graphs. In: Lin, G. (ed.) COCOA 2012. LNCS, vol. 7402, pp. 95\u2013102. Springer, Heidelberg (2012)"},{"key":"1_CR22","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1613\/jair.4030","volume":"49","author":"Y Wu","year":"2014","unstructured":"Wu, Y., Austrin, P., Pitassi, T., Liu, D.: Inapproximability of treewidth and related problems. J. Artif. Intell. Res. (JAIR) 49, 569\u2013600 (2014)","journal-title":"J. Artif. Intell. Res. (JAIR)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44543-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:51:45Z","timestamp":1558313505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44543-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319445427","9783319445434"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44543-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"9 August 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Helsinki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Finland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}