{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:54:17Z","timestamp":1725558857967},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245285"},{"type":"electronic","value":"9783540318439"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31843-9_8","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T16:54:14Z","timestamp":1278348854000},"page":"60-70","source":"Crossref","is-referenced-by-count":9,"title":["Convex Drawings of 3-Connected Plane Graphs"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Bonichon","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Felsner","sequence":"additional","affiliation":[]},{"given":"Mohamed","family":"Mosbah","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Rote, G.: Strictly convex drawings of planar graphs (2004)"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF02187706","volume":"1","author":"P. Rosenstiehl","year":"1986","unstructured":"Rosenstiehl, P., Tarjan, R.E.: Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete Comput. Geom.\u00a01, 343\u2013353 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/BF00353652","volume":"5","author":"W. Schnyder","year":"1989","unstructured":"Schnyder, W.: Planar graphs and poset dimension. Order\u00a05, 323\u2013343 (1989)","journal-title":"Order"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: Small sets supporting Fary embeddings of planar graphs. In: Proc. 20th Annu. ACM Sympos. Theory Comput., pp. 426\u2013433 (1988)","DOI":"10.1145\/62212.62254"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix de","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica\u00a010, 41\u201351 (1990)","journal-title":"Combinatorica"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/PL00009290","volume":"17","author":"X. He","year":"1997","unstructured":"He, X.: Grid embeddings of 4-connected plane graphs. Discrete Comput. Geom.\u00a017, 339\u2013358 (1997)","journal-title":"Discrete Comput. Geom."},{"key":"8_CR7","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s00454-001-0004-4","volume":"26","author":"K. Miura","year":"2001","unstructured":"Miura, K., Nakano, S., Nishizeki, T.: Grid drawings of 4-connected plane graphs. Discrete Comput. Geom.\u00a026, 73\u201387 (2001)","journal-title":"Discrete Comput. Geom."},{"key":"8_CR8","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Proc. 1st ACM-SIAM Sympos. Discrete Algorithms, pp. 138\u2013148 (1990)"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/978-3-540-45078-8_43","volume-title":"Algorithms and Data Structures","author":"H. Zhang","year":"2003","unstructured":"Zhang, H., He, X.: Compact visibility representation and straight-line grid embedding of plane graphs. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol.\u00a02748, pp. 493\u2013504. Springer, Heidelberg (2003)"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1112\/plms\/s3-10.1.304","volume":"10","author":"W.T. Tutte","year":"1960","unstructured":"Tutte, W.T.: Convex representations of graphs. Proceedings London Mathematical Society\u00a010, 304\u2013320 (1960)","journal-title":"Proceedings London Mathematical Society"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"W.T. Tutte","year":"1963","unstructured":"Tutte, W.T.: How to draw a graph. Proceedings London Mathematical Society\u00a013, 743\u2013768 (1963)","journal-title":"Proceedings London Mathematical Society"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/BF02086606","volume":"16","author":"G. Kant","year":"1996","unstructured":"Kant, G.: Drawing planar graphs using the canonical ordering. Algorithmica\u00a016, 4\u201332 (1996)","journal-title":"Algorithmica"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1142\/S0218195997000144","volume":"7","author":"M. Chrobak","year":"1997","unstructured":"Chrobak, M., Kant, G.: Convex grid drawings of 3-connected planar graphs. Internat. J. Comput. Geom. Appl.\u00a07, 211\u2013223 (1997)","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"8_CR14","first-page":"502","volume":"13","author":"W. Schnyder","year":"1992","unstructured":"Schnyder, W., Trotter, W.T.: Convex embeddings of 3-connected plane graphs. Abstracts of the AMS\u00a013, 502 (1992)","journal-title":"Abstracts of the AMS"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/PL00009264","volume":"23","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Tamassia, R., Vismara, L.: Output-sensitive reporting of disjoint paths. Algorithmica\u00a023, 302\u2013340 (1999)","journal-title":"Algorithmica"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Felsner, S.: Convex drawings of planar graphs and the order dimension of 3-polytopes. Order, 19\u201337 (2001)","DOI":"10.1023\/A:1010604726900"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Felsner, S.: Geometric Graphs and Arrangements. Vieweg Verlag (2004)","DOI":"10.1007\/978-3-322-80303-0"},{"key":"8_CR18","first-page":"24","volume":"11 R15","author":"S. Felsner","year":"2004","unstructured":"Felsner, S.: Lattice structures from planar graphs. Electron. J. Comb.\u00a011 R15, 24p. (2004)","journal-title":"Electron. J. Comb."},{"key":"8_CR19","unstructured":"Fusy, E., Poulalhon, D., Schaeffer, G.: Coding, counting and sampling 3-connected planar graphs. In: 16th ACM-SIAM Sympos. Discrete Algorithms (2005) (to appear)"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-540-30559-0_23","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"N. Bonichon","year":"2004","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N., Poulalhon, D., Schaeffer, G.: Planar graphs, via well-orderly maps and trees. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 270\u2013284. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31843-9_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:28:23Z","timestamp":1605742103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31843-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245285","9783540318439"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31843-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}