{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:31:53Z","timestamp":1743057113094,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319621265"},{"type":"electronic","value":"9783319621272"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-62127-2_34","type":"book-chapter","created":{"date-parts":[[2017,7,4]],"date-time":"2017-07-04T02:47:31Z","timestamp":1499136451000},"page":"397-408","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["When Can Graph Hyperbolicity Be Computed in Linear Time?"],"prefix":"10.1007","author":[{"given":"Till","family":"Fluschnik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Komusiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George B.","family":"Mertzios","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Nichterlein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nimrod","family":"Talmon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,5]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Abboud, A., Vassilevska Williams, V., Wang, J.R.: Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs. In: Proc. 27th SODA, pp. 377\u2013391. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch28"},{"issue":"1","key":"34_CR2","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.F.: Metric tree-like structures in real-world networks: an empirical study. Networks 67(1), 49\u201368 (2016)","journal-title":"Networks"},{"key":"34_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-662-48350-3_19","volume-title":"Algorithms \u2013 ESA 2015","author":"M Borassi","year":"2015","unstructured":"Borassi, M., Coudert, D., Crescenzi, P., Marino, A.: On computing the hyperbolicity of real-world graphs. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 215\u2013226. Springer, Heidelberg (2015). doi:10.1007\/978-3-662-48350-3_19"},{"key":"34_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.entcs.2016.03.005","volume":"322","author":"M Borassi","year":"2016","unstructured":"Borassi, M., Crescenzi, P., Habib, M.: Into the square: On the complexity of some quadratic-time solvable problems. Electronic Notes in Theoretical Computer Science 322, 51\u201367 (2016)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications, vol. 3. SIAM (1999)","DOI":"10.1137\/1.9780898719796"},{"issue":"1","key":"34_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s00026-001-8007-7","volume":"5","author":"G Brinkmann","year":"2001","unstructured":"Brinkmann, G., Koolen, J.H., Moulton, V.: On the hyperbolicity of chordal graphs. Annals of Combinatorics 5(1), 61\u201369 (2001)","journal-title":"Annals of Combinatorics"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Cohen, N., Coudert, D., Lancin, A.: On computing the Gromov hyperbolicity. ACM Journal of Experimental Algorithmics 20, 1.6:1\u20131.6:18 (2015)","DOI":"10.1145\/2780652"},{"issue":"4","key":"34_CR8","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"DG Corneil","year":"1985","unstructured":"Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM Journal on Computing 14(4), 926\u2013934 (1985)","journal-title":"SIAM Journal on Computing"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Damaschke P.: Induced subraph isomorphism for cographs is NP-complete. In: M\u00f6hring R.H. (eds) WG 1990. LNCS, vol 484, pp. 72\u201378. Springer, Heidelberg (1991)","DOI":"10.1007\/3-540-53832-1_32"},{"key":"34_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-642-32589-2_32","volume-title":"Mathematical Foundations of Computer Science 2012","author":"M Doucha","year":"2012","unstructured":"Doucha, M., Kratochv\u00edl, J.: Cluster vertex deletion: A parameterization between vertex cover and clique-width. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 348\u2013359. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-32589-2_32"},{"issue":"1\u20133","key":"34_CR11","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2004.05.009","volume":"326","author":"F Eisenbrand","year":"2004","unstructured":"Eisenbrand, F., Grandoni, F.: On the complexity of fixed parameter clique and dominating set. Theoretical Computer Science 326(1\u20133), 57\u201367 (2004)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"34_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2008.09.065","volume":"410","author":"M Fellows","year":"2009","unstructured":"Fellows, M., Hermelin, D., Rosamond, F., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theoretical Computer Science 410(1), 53\u201361 (2009)","journal-title":"Theoretical Computer Science"},{"issue":"6\u20138","key":"34_CR13","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1016\/j.ipl.2015.02.002","volume":"115","author":"H Fournier","year":"2015","unstructured":"Fournier, H., Ismail, A., Vigneron, A.: Computing the Gromov hyperbolicity of a discrete metric space. Information Processing Letters 115(6\u20138), 576\u2013579 (2015)","journal-title":"Information Processing Letters"},{"key":"34_CR14","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman (1979)"},{"key":"34_CR15","unstructured":"Giannopoulou, A.C., Mertzios, G.B., Niedermeier, R.: Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs. In: Proc. 10th IPEC, vol. 43 of LIPIcs, pp. 102\u2013113. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015)"},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"Gromov, M.: Hyperbolic groups. In: Essays in Group Theory, vol. 8, pp. 75\u2013263. MSRI Publ., Springer New York (1987)","DOI":"10.1007\/978-1-4613-9586-7_3"},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"Mitsche, D., Pralat, P.: On the hyperbolicity of random graphs. The Electronic Journal of Combinatorics 21(2), P2.39 (2014)","DOI":"10.37236\/4053"},{"key":"34_CR18","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall (1982)"},{"key":"34_CR19","doi-asserted-by":"crossref","unstructured":"Williams, R., Yu, H.: Finding orthogonal vectors in discrete structures. In: Proc. 25th SODA, pp. 1867\u20131877. SIAM (2014)","DOI":"10.1137\/1.9781611973402.135"},{"key":"34_CR20","doi-asserted-by":"crossref","unstructured":"Williams, V.V., Wang, J.R., Williams, R., Yu, H.: Finding four-node subgraphs in triangle time. In: Proc. 26th SODA, pp. 1671\u20131680. SIAM (2015)","DOI":"10.1137\/1.9781611973730.111"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62127-2_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:18:06Z","timestamp":1709828286000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-62127-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319621265","9783319621272"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62127-2_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"5 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. John's","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}