{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T23:46:38Z","timestamp":1773704798341,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662534250","type":"print"},{"value":"9783662534267","type":"electronic"}],"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-662-53426-7_12","type":"book-chapter","created":{"date-parts":[[2016,9,3]],"date-time":"2016-09-03T04:49:15Z","timestamp":1472878155000},"page":"158-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Near-Optimal Low-Congestion Shortcuts on Bounded Parameter Graphs"],"prefix":"10.1007","author":[{"given":"Bernhard","family":"Haeupler","sequence":"first","affiliation":[]},{"given":"Taisuke","family":"Izumi","sequence":"additional","affiliation":[]},{"given":"Goran","family":"Zuzic","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,4]]},"reference":[{"issue":"6","key":"12_CR1","doi-asserted-by":"publisher","first-page":"1725","DOI":"10.1137\/S0097539795289859","volume":"27","author":"HL Bodlaender","year":"1998","unstructured":"Bodlaender, H.L., Hagerup, T.: Parallel algorithms with optimal speedup for bounded treewidth. SIAM J. Comput. 27(6), 1725\u20131746 (1998)","journal-title":"SIAM J. Comput."},{"key":"12_CR2","unstructured":"Eppstein, D.: Dynamic generators of topologically embedded graphs. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 599\u2013608 (2003)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Haeupler, B.: Distributed algorithms for planar networks I: Planar embedding. Manuscript (2015)","DOI":"10.1145\/2933057.2933109"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Haeupler, B.: Distributed algorithms for planar networks II: Low-congestion shortcuts, mst, and min-cut. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 202\u2013219. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch16"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Karrenbauer, A., Kuhn, F., Lenzen, C., Patt-Shamir, B.: Near-optimal distributed maximum flow: Extended abstract. In: The Proceedings of the Int\u2019l Symposium on Prince of District Company (PODC), pp. 81\u201390 (2015)","DOI":"10.1145\/2767386.2767440"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Haeupler, B., Izumi, T., Zuzic, G.: Low-congestion shortcuts without embedding. In: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing. ACM (2016)","DOI":"10.1145\/2933057.2933112"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: On the locality of bounded growth. In: The Proceedings of the Int\u2019l Symposium on Prince of District Company (PODC), pp. 60\u201368 (2005)","DOI":"10.1145\/1073814.1073826"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Kutten, S., Peleg, D.: Fast distributed construction of k-dominating sets and applications. In: The Proceedings of the Int\u2019l Symposium on Prince of District Company (PODC), pp. 238\u2013251 (1995)","DOI":"10.1145\/224964.224990"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Lenzen, C., Oswald, Y.A., Wattenhofer, R.: What can be approximated locally?: case study: dominating sets in planar graphs. In: The Proceedings of the Symposium on Parallel Algorithms and Architectures, pp. 46\u201354 (2008)","DOI":"10.1145\/1378533.1378540"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Lenzen, C., Patt-Shamir, B.: Fast partial distance estimation and applications. In: The Proceedings of the Int\u2019l Symposium on Prince of District Company (PODC), pp. 153\u2013162 (2015)","DOI":"10.1145\/2767386.2767398"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/978-3-662-45174-8_30","volume-title":"Distributed Computing","author":"D Nanongkai","year":"2014","unstructured":"Nanongkai, D., Su, H.-H.: Almost-tight distributed minimum cut algorithms. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol. 8784, pp. 439\u2013453. Springer, Heidelberg (2014)"},{"key":"12_CR12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed Computing: A Locality-sensitive Approach","author":"D Peleg","year":"2000","unstructured":"Peleg, D.: Distributed Computing: A Locality-sensitive Approach. Society for Industrial and Applied Mathematics, Philadelphia (2000)"},{"issue":"5","key":"12_CR13","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1137\/11085178X","volume":"41","author":"AD Sarma","year":"2012","unstructured":"Sarma, A.D., Holzer, S., Kor, L., Korman, A., Nanongkai, D., Pandurangan, G., Peleg, D., Wattenhofer, R.: Distributed verification and hardness of distributed approximation. SIAM J. Comput. 41(5), 1235\u20131265 (2012)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53426-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:10:47Z","timestamp":1558314647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53426-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662534250","9783662534267"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53426-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"4 September 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Distributed Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"27 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wdag2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}