{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:44:45Z","timestamp":1725795885761},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439470"},{"type":"electronic","value":"9783662439487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_88","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T12:10:36Z","timestamp":1402488636000},"page":"1063-1074","source":"Crossref","is-referenced-by-count":0,"title":["Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles"],"prefix":"10.1007","author":[{"given":"Christian","family":"Wulff-Nilsen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"88_CR1","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1090\/S0894-0347-1990-1065053-0","volume":"3","author":"N. Alon","year":"1990","unstructured":"Alon, N., Seymour, P.D., Thomas, R.: A separator theorem for nonplanar graphs. J. Amer. Math. Soc.\u00a03(4), 801\u2013808 (1990)","journal-title":"J. Amer. Math. Soc."},{"key":"88_CR2","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/PL00009250","volume":"23","author":"H.N. Djidjev","year":"1999","unstructured":"Djidjev, H.N., Gilbert, J.R.: Separators in Graphs with Negative and Multiple Vertex Weights. Algorithmica\u00a023, 57\u201371 (1999)","journal-title":"Algorithmica"},{"issue":"4","key":"88_CR3","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF02579141","volume":"4","author":"A.V. Kostochka","year":"1984","unstructured":"Kostochka, A.V.: Lower bound of the Hadwiger number of graphs by their average degree. Combinatorica\u00a04(4), 307\u2013316 (1984)","journal-title":"Combinatorica"},{"key":"88_CR4","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R.J. Lipton","year":"1979","unstructured":"Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM Journal on Applied Mathematics\u00a036, 177\u2013189 (1979)","journal-title":"SIAM Journal on Applied Mathematics"},{"unstructured":"Nesetril, J., de Mendez, P.O.: Sparsity \u2013 Graphs, Structures, and Algorithms. In: Algorithms and Combinatorics vol. 28, pp. I-XXIII, 1\u2013457 (2012) ISBN 978-3-642-27874-7","key":"88_CR5"},{"unstructured":"Plotkin, S., Rao, S., Smith, W.D.: Shallow excluded minors and improved graph decompositions. In: Proc. of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 462\u2013470 (1994)","key":"88_CR6"},{"key":"88_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/11523468_22","volume-title":"Automata, Languages and Programming","author":"L. Roditty","year":"2005","unstructured":"Roditty, L., Thorup, M., Zwick, U.: Deterministic Constructions of Approximate Distance Oracles and Spanners. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 261\u2013272. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Roditty, L., Zwick, U.: Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs. SIAM J.\u00a0Comput.\u00a041(3), 670\u2013683 (2012); See also FOCS 2004","key":"88_CR8","DOI":"10.1137\/090776573"},{"issue":"2","key":"88_CR9","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1017\/S0305004100061521","volume":"95","author":"A. Thomason","year":"1984","unstructured":"Thomason, A.: An extremal function for contractions of graphs. Math. Proc. Cambridge Philos. Soc.\u00a095(2), 261\u2013265 (1984)","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"88_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1044731.1044732","volume":"52","author":"M. Thorup","year":"2005","unstructured":"Thorup, M., Zwick, U.: Approximate Distance Oracles. J. Assoc. Comput. Mach.\u00a052, 1\u201324 (2005)","journal-title":"J. Assoc. Comput. Mach."},{"doi-asserted-by":"crossref","unstructured":"Wulff-Nilsen, C.: Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications. In: Proc.\u00a0FOCS, pp. 37\u201346 (2011); See extended version on arXiv","key":"88_CR11","DOI":"10.1109\/FOCS.2011.15"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43948-7_88","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T22:11:14Z","timestamp":1558908674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_88"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_88","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}