{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T23:45:59Z","timestamp":1725839159439},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662489703"},{"type":"electronic","value":"9783662489710"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48971-0_54","type":"book-chapter","created":{"date-parts":[[2015,11,26]],"date-time":"2015-11-26T04:00:57Z","timestamp":1448510457000},"page":"637-649","source":"Crossref","is-referenced-by-count":0,"title":["Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions"],"prefix":"10.1007","author":[{"given":"Martin","family":"N\u00f6llenburg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roman","family":"Prutkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,27]]},"reference":[{"key":"54_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-36763-2_23","volume-title":"Graph Drawing","author":"S Alamdari","year":"2013","unstructured":"Alamdari, S., Chan, T.M., Grant, E., Lubiw, A., Pathak, V.: Self-approaching graphs. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 260\u2013271. Springer, Heidelberg (2013)"},{"issue":"6","key":"54_CR2","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1023\/A:1012319418150","volume":"7","author":"P Bose","year":"2001","unstructured":"Bose, P., Morin, P., Stojmenovi\u0107, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. Wireless Netw. 7(6), 609\u2013616 (2001)","journal-title":"Wireless Netw."},{"issue":"2","key":"54_CR3","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/S0196-6774(03)00073-7","volume":"48","author":"G Calinescu","year":"2003","unstructured":"Calinescu, G., Fernandes, C.G., Reed, B.: Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. J. Algorithms 48(2), 333\u2013359 (2003)","journal-title":"J. Algorithms"},{"key":"54_CR4","doi-asserted-by":"crossref","unstructured":"Chazelle, B., Dobkin, D.: Optimal convex decompositions. In: Computational Geometry, pp. 63\u2013133 (1985)","DOI":"10.1016\/B978-0-444-87806-9.50009-8"},{"issue":"1","key":"54_CR5","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/COMST.2007.358971","volume":"9","author":"D Chen","year":"2007","unstructured":"Chen, D., Varshney, P.K.: A survey of void handling techniques for geographic routing in wireless networks. Commun. Surv. Tutor. 9(1), 50\u201367 (2007)","journal-title":"Commun. Surv. Tutor."},{"issue":"1","key":"54_CR6","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0167-6377(02)00184-0","volume":"31","author":"M Costa","year":"2003","unstructured":"Costa, M., L\u00e9tocart, L., Roupin, F.: A greedy algorithm for multicut and integral multiflow in rooted trees. Oper. Res. Lett. 31(1), 21\u201327 (2003)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"54_CR7","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.ejor.2003.10.037","volume":"162","author":"MC Costa","year":"2005","unstructured":"Costa, M.C., L\u00e9tocart, L., Roupin, F.: Minimal multicut and maximal integer multiflow: A survey. Eur. J. Oper. Res. 162(1), 55\u201369 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"54_CR8","doi-asserted-by":"publisher","unstructured":"Dehkordi, H.R., Frati, F., Gudmundsson, J.: Increasing-chord graphs on point sets. J. Graph Algorithms Appl. (2015, to appear). doi:\n                      10.7155\/jgaa.00348","DOI":"10.7155\/jgaa.00348"},{"key":"54_CR9","unstructured":"Fang, Q., Gao, J., Guibas, L., de Silva, V., Zhang, L.: Glider: gradient landmark-based distributed routing for sensor networks. In: INFOCOM 2005, pp. 339\u2013350. IEEE (2005)"},{"issue":"1","key":"54_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02523685","volume":"18","author":"N Garg","year":"1997","unstructured":"Garg, N., Vazirani, V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18(1), 3\u201320 (1997)","journal-title":"Algorithmica"},{"key":"54_CR11","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1017\/S0305004198003016","volume":"125","author":"C Icking","year":"1999","unstructured":"Icking, C., Klein, R., Langetepe, E.: Self-approaching curves. Math. Proc. Camb. Phil. Soc. 125, 441\u2013453 (1999)","journal-title":"Math. Proc. Camb. Phil. Soc."},{"issue":"4","key":"54_CR12","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1137\/0214056","volume":"14","author":"JM Keil","year":"1985","unstructured":"Keil, J.M.: Decomposing a polygon into simpler components. SIAM J. Comput. 14(4), 799\u2013817 (1985)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"54_CR13","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1137\/0405033","volume":"5","author":"DE Knuth","year":"1992","unstructured":"Knuth, D.E., Raghunathan, A.: The problem of compatible representatives. SIAM J. Discrete Math. 5(3), 422\u2013427 (1992)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"54_CR14","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput. 11(2), 329\u2013343 (1982)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"54_CR15","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/65.967595","volume":"15","author":"M Mauve","year":"2001","unstructured":"Mauve, M., Widmer, J., Hartenstein, H.: A survey on position-based routing in mobile ad hoc networks. IEEE Netw. 15(6), 30\u201339 (2001)","journal-title":"IEEE Netw."},{"key":"54_CR16","unstructured":"N\u00f6llenburg, M., Prutkin, R., Rutter, I.: Partitioning graph drawings and triangulated simple polygons into greedily routable regions (2015). CoRR \n                      arXiv:1509.05635"},{"key":"54_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1007\/978-3-662-45803-7_40","volume-title":"Graph Drawing","author":"M N\u00f6llenburg","year":"2014","unstructured":"N\u00f6llenburg, M., Prutkin, R., Rutter, I.: On self-approaching and increasing-chord drawings of 3-connected planar graphs. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 476\u2013487. Springer, Heidelberg (2014)"},{"key":"54_CR18","doi-asserted-by":"crossref","unstructured":"Tan, G., Bertier, M., Kermarrec, A.M.: Convex partition of sensor networks and its use in virtual coordinate geographic routing. In: INFOCOM 2009, pp. 1746\u20131754. IEEE (2009)","DOI":"10.1109\/INFCOM.2009.5062094"},{"issue":"3","key":"54_CR19","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1109\/TNET.2011.2167758","volume":"20","author":"G Tan","year":"2012","unstructured":"Tan, G., Kermarrec, A.M.: Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach. IEEE\/ACM Trans. Netw. 20(3), 864\u2013877 (2012)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"54_CR20","doi-asserted-by":"crossref","unstructured":"Zhu, X., Sarkar, R., Gao, J.: Shape segmentation and applications in sensor networks. In: INFOCOM 2007, pp. 1838\u20131846. IEEE (2007)","DOI":"10.1109\/INFCOM.2007.214"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48971-0_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T18:03:13Z","timestamp":1559325793000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48971-0_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662489703","9783662489710"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48971-0_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}