{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:59:23Z","timestamp":1725515963607},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540688655"},{"type":"electronic","value":"9783540688808"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68880-8_29","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T06:37:59Z","timestamp":1217486279000},"page":"304-315","source":"Crossref","is-referenced-by-count":1,"title":["On Representation of Planar Graphs by Segments"],"prefix":"10.1007","author":[{"given":"Sadish","family":"Sadasivam","sequence":"first","affiliation":[]},{"given":"Huaming","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"29_CR1","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(4), 302\u2013340 (1999)","journal-title":"Algorithmica"},{"key":"29_CR2","first-page":"109","volume":"63","author":"H.D. Fraysseix","year":"1991","unstructured":"Fraysseix, H.D., de Mendez, P.O., Pach, J.: Representation of planar graphs by segments. Intuitive Geometry\u00a063, 109\u2013117 (1991)","journal-title":"Intuitive Geometry"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/BF02574056","volume":"13","author":"H.D. Fraysseix","year":"1995","unstructured":"Fraysseix, H.D., de Mendez, P.O., Pach, J.: A Left-First Search Algorithm for Planar Graphs. Discrete & Computational Geometry\u00a013, 459\u2013468 (1995)","journal-title":"Discrete & Computational Geometry"},{"key":"29_CR4","unstructured":"Lempel, A., Even, S., Cederbaum, I.: An algorithm for planarity testing of graphs. In: Theory of Graphs Proc. of an International Symposium, Rome, July 1966, pp. 215\u2013232 (1966)"},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1023\/A:1010604726900","volume":"18","author":"S. Felsner","year":"2001","unstructured":"Felsner, S.: Convex drawings of Planar Graphs and the Order Dimension of 3-Polytopes. Order\u00a018, 19\u201337 (2001)","journal-title":"Order"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1142\/S0129054105002905","volume":"16","author":"K. Miura","year":"2005","unstructured":"Miura, K., Azuma, M., Nishizeki, T.: Canonical decomposition, realizer, Schnyder Labelling and orderly spanning trees of plane graphs. International Journal of Foundations of Computer Science\u00a016, 117\u2013141 (2005)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"29_CR7","unstructured":"Ossona de Mendez, P.: Orientations bipolaires, PhD thesis, Ecole des Hautes Etudes en Sciences Sociales, Paris (1994)"},{"key":"29_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/11618058_32","volume-title":"Graph Drawing","author":"C. Papamanthou","year":"2006","unstructured":"Papamanthou, C., Tollis, I.G.: Applications of parameterized st-orientations in graph drawings. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 355\u2013367. Springer, Heidelberg (2006)"},{"key":"29_CR9","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":"29_CR10","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R. Tamassia","year":"1986","unstructured":"Tamassia, R., Tollis, I.G.: An unified approach to visibility representations of planar graphs. Discrete Comput. Geom.\u00a01, 321\u2013341 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"29_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/11786986_36","volume-title":"Automata, Languages and Programming","author":"X. He","year":"2006","unstructured":"He, X., Zhang, H.: Nearly Optimal Visibility Representations of Plane Graphs. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 407\u2013418. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68880-8_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:17:07Z","timestamp":1620015427000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68880-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540688655","9783540688808"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68880-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}