{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:09:08Z","timestamp":1725548948627},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642118043"},{"type":"electronic","value":"9783642118050"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11805-0_16","type":"book-chapter","created":{"date-parts":[[2010,3,5]],"date-time":"2010-03-05T02:45:33Z","timestamp":1267757133000},"page":"159-170","source":"Crossref","is-referenced-by-count":1,"title":["Leftist Canonical Ordering"],"prefix":"10.1007","author":[{"given":"Melanie","family":"Badent","sequence":"first","affiliation":[]},{"given":"Michael","family":"Baur","sequence":"additional","affiliation":[]},{"given":"Ulrik","family":"Brandes","sequence":"additional","affiliation":[]},{"given":"Sabine","family":"Cornelsen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-540-77120-3_29","volume-title":"Algorithms and Computation","author":"J. Barbay","year":"2007","unstructured":"Barbay, J., Aleardi, L.C., He, M., Munro, I.: Succinct Representation of Labeled Graphs. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol.\u00a04835, pp. 316\u2013328. Springer, Heidelberg (2007)"},{"issue":"1","key":"16_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.7155\/jgaa.00078","volume":"8","author":"G. Barequet","year":"2004","unstructured":"Barequet, G., Goodrich, M.T., Riley, C.: Drawing Planar Graphs with Large Vertices and Thick Edges. J. of Graph Algorithms and Applications\u00a08(1), 3\u201320 (2004)","journal-title":"J. of Graph Algorithms and Applications"},{"key":"16_CR3","first-page":"287","volume-title":"Proc. 14th Symp. on Computational Geometry","author":"T.C. Biedl","year":"1998","unstructured":"Biedl, T.C.: Drawing Planar Partitions I: LL-Drawings and LH-Drawings. In: Proc. 14th Symp. on Computational Geometry, pp. 287\u2013296. ACM Press, New York (1998)"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/3-540-63397-9_4","volume-title":"Algorithms - ESA \u201997","author":"T.C. Biedl","year":"1997","unstructured":"Biedl, T.C., Kaufmann, M.: Area-Efficient Static and Incremental Graph Drawings. In: Burkard, R.E., Woeginger, G.J. (eds.) ESA 1997. LNCS, vol.\u00a01284, pp. 37\u201352. Springer, Heidelberg (1997)"},{"issue":"3-4","key":"16_CR5","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00453-005-1168-8","volume":"42","author":"P. Bose","year":"2005","unstructured":"Bose, P., Gudmundsson, J., Smid, M.: Constructing Plane Spanners of Bounded Degree and Low Weight. Algorithmica\u00a042(3-4), 249\u2013264 (2005)","journal-title":"Algorithmica"},{"key":"16_CR6","unstructured":"Brehm, E.: 3-Orientations and Schnyder 3-Tree-Decompositions. Master\u2019s thesis, FU Berlin (2000)"},{"key":"16_CR7","unstructured":"Chiang, Y.-T., Lin, C.-C., Lu, H.-I.: Orderly Spanning Trees with Applications to Graph Encoding and Graph Drawing. In: Proc. 12th ACM\u2013SIAM Symp. on Discrete Algorithms (SODA 2001), pp. 506\u2013515 (2001)"},{"issue":"3","key":"16_CR8","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. Int. J. of Computational Geometry and Applications\u00a07(3), 211\u2013223 (1997)","journal-title":"Int. J. of Computational Geometry and Applications"},{"issue":"1","key":"16_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0925-7721(98)00016-9","volume":"11","author":"M. Chrobak","year":"1998","unstructured":"Chrobak, M., Nakano, S.-I.: Minimum-Width Grid Drawings of Plane Graphs. Computational Geometry\u00a011(1), 29\u201354 (1998)","journal-title":"Computational Geometry"},{"issue":"4","key":"16_CR10","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0020-0190(95)00020-D","volume":"54","author":"M. Chrobak","year":"1995","unstructured":"Chrobak, M., Payne, T.H.: A Linear-Time Algorithm for Drawing a Planar Graph on a Grid. Information Processing Letters\u00a054(4), 241\u2013246 (1995)","journal-title":"Information Processing Letters"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/BFb0055046","volume-title":"Automata, Languages and Programming","author":"R.C.-N. Chuang","year":"1998","unstructured":"Chuang, R.C.-N., Garg, A., He, X., Kao, M.-Y., Lu, H.-I.: Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 118\u2013129. Springer, Heidelberg (1998)"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/3-540-58950-3_362","volume-title":"Graph Drawing","author":"H. Fraysseix de","year":"1995","unstructured":"de Fraysseix, H., Mendez, P.O.: Regular Orientations, Arboricity, and Augmentation. In: Tamassia, R., Tollis, I.G. (eds.) GD 1994. LNCS, vol.\u00a0894, pp. 111\u2013118. Springer, Heidelberg (1995)"},{"key":"16_CR13","first-page":"426","volume-title":"Proc. 20th ACM Symp. on the Theory of Computing (STOC 1988)","author":"H. Fraysseix de","year":"1988","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: Small Sets Supporting F\u00e1ry Embeddings of Planar Graphs. In: Proc. 20th ACM Symp. on the Theory of Computing (STOC 1988), pp. 426\u2013433. ACM Press, New York (1988)"},{"issue":"1","key":"16_CR14","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(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"issue":"4","key":"16_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(4), 302\u2013340 (1999)","journal-title":"Algorithmica"},{"issue":"1","key":"16_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.jda.2006.12.007","volume":"6","author":"E. Giacomo Di","year":"2008","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G.: Radial Drawings of Graphs: Geometric Constraints and Trade-offs. J. of Discrete Algorithms\u00a06(1), 109\u2013124 (2008)","journal-title":"J. of Discrete Algorithms"},{"issue":"2","key":"16_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.comgeo.2004.04.002","volume":"30","author":"E. Giacomo Di","year":"2005","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Wismath, S.K.: Curve-Constrained Drawings of Planar Graphs. Computational Geometry\u00a030(2), 1\u201323 (2005)","journal-title":"Computational Geometry"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Dujmovi\u0107, V., Suderman, M., Wood, D.R.: Really Straight Graph Drawings. In: GD 2004 [21], pp. 122\u2013132","DOI":"10.1007\/978-3-540-31843-9_14"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Erten, C., Kobourov, S.G.: Simultaneous Embedding of Planar Graphs with Few Bends. In: GD 2004 [21], pp. 195\u2013205","DOI":"10.1007\/978-3-540-31843-9_21"},{"key":"16_CR20","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":"16_CR21","series-title":"Lecture Notes in Computer Science","volume-title":"Graph Drawing","year":"2005","unstructured":"Pach, J. (ed.): GD 2004. LNCS, vol.\u00a03383. Springer, Heidelberg (2005)"},{"issue":"2","key":"16_CR22","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1006\/jagm.2000.1115","volume":"37","author":"M.T. Goodrich","year":"2000","unstructured":"Goodrich, M.T., Wagner, C.G.: A Framework for Drawing Planar Graphs with Curves and Polylines. J. of Algorithms\u00a037(2), 399\u2013421 (2000)","journal-title":"J. of Algorithms"},{"key":"16_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/3-540-37623-2_13","volume-title":"Graph Drawing","author":"C. Gutwenger","year":"1999","unstructured":"Gutwenger, C., Mutzel, P.: Planar Polyline Drawings with Good Angular Resolution. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 167\u2013182. Springer, Heidelberg (1999)"},{"key":"16_CR24","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/PL00009189","volume":"20","author":"D. Harel","year":"1998","unstructured":"Harel, D., Sardas, M.: An Algorithm for Straight-Line Drawing of Planar Graphs. Algorithmica\u00a020, 119\u2013135 (1998)","journal-title":"Algorithmica"},{"issue":"6","key":"16_CR25","doi-asserted-by":"publisher","first-page":"2150","DOI":"10.1137\/S0097539796308874","volume":"28","author":"X. He","year":"1999","unstructured":"He, X.: On Floor-Plan of Plane Graphs. SIAM J. on Computing\u00a028(6), 2150\u20132167 (1999)","journal-title":"SIAM J. on Computing"},{"issue":"3","key":"16_CR26","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1137\/S0895480197325031","volume":"12","author":"X. He","year":"1999","unstructured":"He, X., Kao, M.-Y., Lu, H.-I.: Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings. SIAM J. on Discrete Mathematics\u00a012(3), 317\u2013325 (1999)","journal-title":"SIAM J. on Discrete Mathematics"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Kant, G.: Drawing Planar Graphs using the lmc-Ordering. Technical Report RUU-CS-92-33, Dep. of Information and Computing Sciences, Utrecht University (1992)","DOI":"10.1109\/SFCS.1992.267814"},{"issue":"4","key":"16_CR28","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), 4\u201332 (1996)","journal-title":"Algorithmica"},{"issue":"3","key":"16_CR29","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. Int. J. of Computational Geometry and Applications\u00a07(3), 197\u2013210 (1997)","journal-title":"Int. J. of Computational Geometry and Applications"},{"issue":"1-2","key":"16_CR30","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(1-2), 175\u2013193 (1997)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"16_CR31","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 Labeling and Orderly Spanning Trees of Plane Graphs. Int. J. of Foundations of Computer Science\u00a016(1), 117\u2013141 (2005)","journal-title":"Int. J. of Foundations of Computer Science"},{"issue":"3","key":"16_CR32","first-page":"384","volume":"E83-D","author":"S.-I. Nakano","year":"2000","unstructured":"Nakano, S.-I.: Planar Drawings of Plane Graphs. IEICE Transactions on Information and Systems\u00a0E83-D(3), 384\u2013391 (2000)","journal-title":"IEICE Transactions on Information and Systems"},{"key":"16_CR33","unstructured":"Schnyder, W.: Embedding Planar Graphs on the Grid. In: Proc. 1st ACM\u2013SIAM Symp. on Discrete Algorithms (SODA 1990), pp. 138\u2013148 (1990)"},{"key":"16_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/10692760_26","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"K. Wada","year":"1998","unstructured":"Wada, K., Chen, W.: Linear Algorithms for a k-Partition Problem of Planar Graphs. In: Hromkovi\u010d, J., S\u00fdkora, O. (eds.) WG 1998. LNCS, vol.\u00a01517, pp. 324\u2013336. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11805-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:31:08Z","timestamp":1558272668000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11805-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642118043","9783642118050"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11805-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}