{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:03:00Z","timestamp":1725552180707},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540314257"},{"type":"electronic","value":"9783540316671"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11618058_41","type":"book-chapter","created":{"date-parts":[[2006,1,20]],"date-time":"2006-01-20T09:56:50Z","timestamp":1137751010000},"page":"458-467","source":"Crossref","is-referenced-by-count":2,"title":["An Application of Well-Orderly Trees in Graph Drawing"],"prefix":"10.1007","author":[{"given":"Huaming","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Xin","family":"He","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"41_CR1","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G. Battista di","year":"1998","unstructured":"di Battista, G., Eades, P., Tammassia, R., Tollis, I.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Englewood Cliffs (1998)"},{"key":"41_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1007\/3-540-45465-9_89","volume-title":"Automata, Languages and Programming","author":"N. Bonichon","year":"2002","unstructured":"Bonichon, N., Le Sa\u00ebc, B., Mosbah, M.: Wagner\u2019s Theorem on Realizers. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 1043\u20131053. Springer, Heidelberg (2002)"},{"key":"41_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/3-540-36494-3_44","volume-title":"STACS 2003","author":"N. Bonichon","year":"2003","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N.: An information-theoretic upper bound of planar graphs using triangulation. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 499\u2013510. Springer, Heidelberg (2003)"},{"key":"41_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-540-39890-5_8","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"N. Bonichon","year":"2003","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N.: Canonical decomposition of outerplanar maps and application to enumeration, coding and generation. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 81\u201392. Springer, Heidelberg (2003)"},{"key":"41_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/3-540-36151-0_31","volume-title":"Graph Drawing","author":"H.-L. Chen","year":"2002","unstructured":"Chen, H.-L., Liao, C.-C., Lu, H.-I., Yen, H.-C.: Some applications of orderly spanning trees in graph drawing. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 332\u2013343. Springer, Heidelberg (2002)"},{"key":"41_CR6","first-page":"506","volume-title":"Proc. of the 12th Annual ACM-SIAM SODA","author":"Y.-T. Chiang","year":"2001","unstructured":"Chiang, Y.-T., Lin, C.-C., Lu, H.-I.: Orderly spanning trees with applications to graph encoding and graph drawing. In: Proc. of the 12th Annual ACM-SIAM SODA, pp. 506\u2013515. ACM Press, New York (2001)"},{"key":"41_CR7","unstructured":"Chrobak, M., Kant, G.: Convex grid drawings of 3-connected planar graphs, Technical Report RUU-CS-93-45, Department of Computer Science, Utrecht University, Holland (1993)"},{"key":"41_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/3-540-62495-3_45","volume-title":"Graph Drawing","author":"U. F\u00f6\u00dfmeier","year":"1997","unstructured":"F\u00f6\u00dfmeier, U., Kant, G., Kaufmann, M.: 2-Visibility drawings of planar graphs. In: North, S.C. (ed.) GD 1996. LNCS, vol.\u00a01190, pp. 155\u2013168. Springer, Heidelberg (1997)"},{"key":"41_CR9","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":"41_CR10","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1109\/SFCS.1992.267814","volume-title":"Proc. 33rd Symposium on Foundations of Computer Science","author":"G. Kant","year":"1992","unstructured":"Kant, G.: Drawing planar graphs using the lmc-ordering. In: Proc. 33rd Symposium on Foundations of Computer Science, pp. 101\u2013110. IEEE, Pittsburgh (1992)"},{"key":"41_CR11","unstructured":"Kant, G.: Algorithms for drawing planar graphs, Ph.D. Dissertation, Department of Computer Science, University of Utrecht, Holland (1993)"},{"key":"41_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":"41_CR13","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1142\/S0218195997000132","volume":"7","author":"G. Kant","year":"1997","unstructured":"Kant, G.: A more compact visibility representation. International Journal of Computational Geometry and Applications\u00a07, 197\u2013210 (1997)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"41_CR14","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0304-3975(95)00257-X","volume":"172","author":"G. Kant","year":"1997","unstructured":"Kant, G., He, X.: Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. Theoretical Computer Science\u00a0172, 175\u2013193 (1997)","journal-title":"Theoretical Computer Science"},{"key":"41_CR15","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 (1967)"},{"key":"41_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/3-540-45848-4_29","volume-title":"Graph Drawing","author":"C.-C. Liao","year":"2002","unstructured":"Liao, C.-C., Lu, H.-I., Yen, H.-C.: Floor-planning via orderly spanning trees. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol.\u00a02265, pp. 367\u2013377. Springer, Heidelberg (2002)"},{"key":"41_CR17","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1137\/S0895480103420744","volume":"18","author":"C.-C. Lin","year":"2004","unstructured":"Lin, C.-C., Lu, H.-I., Sun, I.-F.: Improved compact visibility representation of planar graph via Schnyder\u2019s realizer. SIAM Journal on Discrete Mathematics\u00a018, 19\u201329 (2004)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"41_CR18","unstructured":"Ossona de Mendez, P.: Orientations bipolaires. PhD thesis, Ecole des Hautes Etudes en Sciences Sociales, Paris (1994)"},{"key":"41_CR19","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":"41_CR20","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":"41_CR21","first-page":"138","volume-title":"Proc. of the First Annual ACM-SIAM Symposium on Discrete Algorithms","author":"W. Schnyder","year":"1990","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Proc. of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 138\u2013148. SIAM, Philadelphia (1990)"},{"key":"41_CR22","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":"41_CR23","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":"41_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-540-24749-4_42","volume-title":"STACS 2004","author":"H. Zhang","year":"2004","unstructured":"Zhang, H., He, X.: On Visibility Representation of Plane Graphs. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 477\u2013488. Springer, Heidelberg (2004)"},{"key":"41_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-540-31843-9_43","volume-title":"Graph Drawing","author":"H. Zhang","year":"2005","unstructured":"Zhang, H., He, X.: New Theoretical Bounds of Visibility Representation of Plane Graphs. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 425\u2013430. Springer, Heidelberg (2005)"},{"key":"41_CR26","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.comgeo.2004.08.002","volume":"30","author":"H. Zhang","year":"2005","unstructured":"Zhang, H., He, X.: Improved Visibility Representation of Plane Graphs. Discrete Comput. Geom.\u00a030, 29\u201329 (2005)","journal-title":"Discrete Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11618058_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:12:20Z","timestamp":1619507540000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11618058_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540314257","9783540316671"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11618058_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}