{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:07:43Z","timestamp":1725538063686},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642034084"},{"type":"electronic","value":"9783642034091"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03409-1_14","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T10:05:18Z","timestamp":1252922718000},"page":"145-156","source":"Crossref","is-referenced-by-count":4,"title":["On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs"],"prefix":"10.1007","author":[{"given":"Subhas Kumar","family":"Ghosh","sequence":"first","affiliation":[]},{"given":"Koushik","family":"Sinha","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2005.06.022","volume":"344","author":"C.H. Papadimitriou","year":"2005","unstructured":"Papadimitriou, C.H., Ratajczak, D.: On a conjecture related to geometric routing. Theor. Comput. Sci.\u00a0344(1), 3\u201314 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"14_CR2","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1112\/plms\/s3-10.1.304","volume":"s3-10","author":"W.T. Tutte","year":"1960","unstructured":"Tutte, W.T.: Convex Representations of Graphs. Proc. London Math. Soc.\u00a0s3-10(1), 304\u2013320 (1960)","journal-title":"Proc. London Math. Soc."},{"issue":"4","key":"14_CR3","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1002\/jgt.10163","volume":"45","author":"C. Thomassen","year":"2004","unstructured":"Thomassen, C.: Tutte\u2019s spring theorem. J. Graph Theory\u00a045(4), 275\u2013280 (2004)","journal-title":"J. Graph Theory"},{"key":"14_CR4","volume-title":"FOCS 2008: Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2008)","author":"T. Leighton","year":"2008","unstructured":"Leighton, T., Moitra, A.: Some results on greedy embeddings in metric spaces. In: FOCS 2008: Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2008), Washington, DC, USA. IEEE Computer Society Press, Los Alamitos (2008)"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"Graph Drawing","author":"P. Angelini","year":"2009","unstructured":"Angelini, P., Frati, F., Grilli, L.: An algorithm to construct greedy drawings of triangulations. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol.\u00a05417. Springer, Heidelberg (2009)"},{"key":"14_CR6","unstructured":"Dhandapani, R.: Greedy drawings of triangulations. In: SODA 2008: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, pp. 102\u2013111. Society for Industrial and Applied Mathematics (2008)"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/3-540-46632-0_12","volume-title":"Algorithms and Computations","author":"P. Bose","year":"1999","unstructured":"Bose, P., Morin, P.: Online routing in triangulations. In: Aggarwal, A.K., Pandu Rangan, C. (eds.) ISAAC 1999. LNCS, vol.\u00a01741, pp. 113\u2013122. Springer, Heidelberg (1999)"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-40996-3_5","volume-title":"Algorithms and Computation","author":"P. Bose","year":"2000","unstructured":"Bose, P., Morin, P., Brodnik, A., Carlsson, S., Demaine, E.D., Fleischer, R., Munro, J.I., L\u00f3pez-Ortiz, A.: Online routing in convex subdivisions. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol.\u00a01969, pp. 47\u201359. Springer, Heidelberg (2000)"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Frati, F.: Private communication (2009)","DOI":"10.1136\/bcr.03.2009.1713"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/872035.872044","volume-title":"PODC 2003: Proceedings of the twenty-second annual symposium on Principles of distributed computing","author":"F. Kuhn","year":"2003","unstructured":"Kuhn, F., Wattenhofer, R., Zhang, Y., Zollinger, A.: Geometric ad-hoc routing: of theory and practice. In: PODC 2003: Proceedings of the twenty-second annual symposium on Principles of distributed computing, pp. 63\u201372. ACM, New York (2003)"},{"key":"14_CR11","first-page":"96","volume-title":"MobiCom 2003: Proceedings of the 9th annual international conference on Mobile computing and networking","author":"A. Rao","year":"2003","unstructured":"Rao, A., Papadimitriou, C., Shenker, S., Stoica, I.: Geographic routing without location information. In: MobiCom 2003: Proceedings of the 9th annual international conference on Mobile computing and networking, pp. 96\u2013108. ACM Press, New York (2003)"},{"key":"14_CR12","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"J.A. Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Graduate Texts in Mathematics, vol.\u00a0244. Springer, Heidelberg (2008)"},{"issue":"3","key":"14_CR13","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF02293049","volume":"8","author":"C. Monma","year":"1992","unstructured":"Monma, C., Suri, S.: Transitions in geometric minimum spanning trees. Discrete Comput. Geom.\u00a08(3), 265\u2013293 (1992)","journal-title":"Discrete Comput. Geom."},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-44693-1_11","volume-title":"STACS 2001","author":"A.E.F. Clementi","year":"2001","unstructured":"Clementi, A.E.F., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: On the complexity of computing minimum energy consumption broadcast subgraphs. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol.\u00a02010, pp. 121\u2013131. Springer, Heidelberg (2001)"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Ghosh, S.K., Sinha, K.: Some results on convex greedy embedding conjecture for 3-connected planar graphs. CoRR abs\/0905.3812v1 (2009)","DOI":"10.1007\/978-3-642-03409-1_14"},{"key":"14_CR16","first-page":"345","volume-title":"Algebraic Methods in Graph Theory, Colloq. Math. Soc. Janos Bolyai","author":"A. Kelmans","year":"1978","unstructured":"Kelmans, A.: The concept of a vertex in a matroid, the non-separating cycles, and a new criterion for graph planarity. In: Algebraic Methods in Graph Theory, Colloq. Math. Soc. Janos Bolyai, Szeged, Hungary, vol.\u00a01, pp. 345\u2013388. North-Holland, Amsterdam (1978)"},{"issue":"2","key":"14_CR17","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1002\/(SICI)1097-0118(200002)33:2<120::AID-JGT6>3.0.CO;2-0","volume":"33","author":"A. Kelmans","year":"2000","unstructured":"Kelmans, A.: On convex embeddings of planar 3-connected graphs. J. Graph Theory\u00a033(2), 120\u2013124 (2000)","journal-title":"J. Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03409-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,16]],"date-time":"2024-03-16T09:35:18Z","timestamp":1710581718000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03409-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642034084","9783642034091"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03409-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}