{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:33Z","timestamp":1725558933912},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241324"},{"type":"electronic","value":"9783540305590"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30559-0_23","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T19:01:42Z","timestamp":1278097302000},"page":"270-284","source":"Crossref","is-referenced-by-count":2,"title":["Planar Graphs, via Well-Orderly Maps and Trees"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Bonichon","sequence":"first","affiliation":[]},{"given":"Cyril","family":"Gavoille","sequence":"additional","affiliation":[]},{"given":"Nicolas","family":"Hanusse","sequence":"additional","affiliation":[]},{"given":"Dominique","family":"Poulalhon","sequence":"additional","affiliation":[]},{"given":"Gilles","family":"Schaeffer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","first-page":"269","volume":"60","author":"V.A. Liskovets","year":"1987","unstructured":"Liskovets, V.A., Walsh, T.R.: Ten steps to counting planar graphs. Congressus Numerantium\u00a060, 269\u2013277 (1987)","journal-title":"Congressus Numerantium"},{"key":"23_CR2","first-page":"61","volume":"113","author":"A. Denise","year":"1996","unstructured":"Denise, A., Vasconcellos, M., Welsh, D.J.: The random planar graph. Congressus Numerantium\u00a0113, 61\u201379 (1996)","journal-title":"Congressus Numerantium"},{"key":"23_CR3","unstructured":"McDiarmid, C.J., Steger, A., Welsh, D.J.: Random planar graphs (2001) (Preprint)"},{"key":"23_CR4","volume-title":"3rd Colloquium on Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities","author":"O. Gim\u00e9nez","year":"2004","unstructured":"Gim\u00e9nez, O., Noy, M.: Estimating the growth constant of labelled planar graphs. In: 3rd Colloquium on Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities. Birkh\u00e4user, Basel (2004)"},{"key":"23_CR5","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":"23_CR6","doi-asserted-by":"crossref","unstructured":"Bender, E.A., Gao, Z., Wormald, N.C.: The number of labeled 2-connected planar graphs. The Electronic Journal of Combinatorics\u00a09, R43 (2002)","DOI":"10.37236\/1659"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02392023","volume":"126","author":"E.M. Wright","year":"1971","unstructured":"Wright, E.M.: Graphs on unlabelled nodes with a given number of edges. Acta Math.\u00a0126, 1\u20139 (1971)","journal-title":"Acta Math."},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Khodakovsky, A., Alliez, P., Desbrun, M., Schr\u00f6der, P.: Near-optimal connectivity encoding of 2-manifold polygon meshes. Graphical Models (2002) (to appear in a special issue )","DOI":"10.1006\/gmod.2002.0575"},{"key":"23_CR9","unstructured":"King, D., Rossignac, J.: Guaranteed 3.67V bit encoding of planar triangle graphs. In: 11th Canadian Conference on Computational Geometry, pp. 146\u2013149 (1999)"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1109\/2945.764870","volume":"5","author":"J. Rossignac","year":"1999","unstructured":"Rossignac, J.: Edgebreaker: Connectivity compression for triangle meshes. IEEE Transactions on Visualization and Computer Graphics\u00a05, 47\u201361 (1999)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1137\/0218058","volume":"18","author":"G.N. Frederickson","year":"1989","unstructured":"Frederickson, G.N., Janardan, R.: Efficient message routing in planar networks. SIAM Journal on Computing\u00a018, 843\u2013857 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-48523-6_32","volume-title":"Automata, Languages and Programming","author":"C. Gavoille","year":"1999","unstructured":"Gavoille, C., Hanusse, N.: Compact routing tables for graphs of bounded genus. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 351\u2013360. Springer, Heidelberg (1999)"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-45655-4_8","volume-title":"Computing and Combinatorics","author":"H.-I. Lu","year":"2002","unstructured":"Lu, H.-I.: Improved compact routing tables for planar networks via orderly spanning trees. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol.\u00a02387, pp. 57\u201366. Springer, Heidelberg (2002)"},{"key":"23_CR14","volume-title":"42th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"M. Thorup","year":"2001","unstructured":"Thorup, M.: Compact oracles for reachability and approximate distances in planar digraphs. In: 42th Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1007\/3-540-45061-0_84","volume-title":"Automata, Languages and Programming","author":"M. Bodirsky","year":"2003","unstructured":"Bodirsky, M., Gr\u00f6pl, C., Kang, M.: Generating labeled planar graphs uniformly at random. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 1095\u20131107. Springer, Heidelberg (2003)"},{"key":"23_CR16","unstructured":"Gerke, S., McDiarmid, C.J.: On the number of edges in random planar graphs. Combinatorics, Probability & Computing (2002) (to appear)"},{"key":"23_CR17","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0166-218X(84)90126-4","volume":"8","author":"G. Tur\u00e1n","year":"1984","unstructured":"Tur\u00e1n, G.: Succinct representations of graphs. Discrete Applied Mathematics\u00a08, 289\u2013294 (1984)","journal-title":"Discrete Applied Mathematics"},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0166-218X(93)E0150-W","volume":"58","author":"K. Keeler","year":"1995","unstructured":"Keeler, K., Westbrook, J.: Short encodings of planar graphs and maps. Discrete Applied Mathematics\u00a058, 239\u2013252 (1995)","journal-title":"Discrete Applied Mathematics"},{"key":"23_CR19","first-page":"118","volume-title":"38th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"J.I. Munro","year":"1997","unstructured":"Munro, J.I., Raman, V.: Succinct representation of balanced parentheses, static trees and planar graphs. In: 38th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 118\u2013126. IEEE Computer Society Press, Los Alamitos (1997)"},{"key":"23_CR20","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/0022-0000(89)90032-9","volume":"38","author":"M. Yannakakis","year":"1989","unstructured":"Yannakakis, M.: Embedding planar graphs in four pages. Journal of Computer and System Sciences\u00a038, 36\u201367 (1989)","journal-title":"Journal of Computer and System Sciences"},{"key":"23_CR21","unstructured":"Chiang, Y.T., Lin, C.C., Lu, H.I.: Orderly spanning trees with applications to graph encoding and graph drawing. In: 12th Symposium on Discrete Algorithms (SODA), ACM-SIAM, pp. 506\u2013515 (2001)"},{"key":"23_CR22","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":"23_CR23","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: 1st Symposium on Discrete Algorithms (SODA), ACM-SIAM, pp. 138\u2013148 (1990)"},{"key":"23_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1080","DOI":"10.1007\/3-540-45061-0_83","volume-title":"Automata, Languages and Programming","author":"D. Poulalhon","year":"2003","unstructured":"Poulalhon, D., Schaeffer, G.: Optimal coding and sampling of triangulations. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 1080\u20131094. Springer, Heidelberg (2003)"},{"key":"23_CR25","volume-title":"Combinatorial Enumeration","author":"I. Goulden","year":"1983","unstructured":"Goulden, I., Jackson, D.: Combinatorial Enumeration. John Wiley & Sons, Chichester (1983)"},{"key":"23_CR26","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, p. 1043\u20131053. Springer, Heidelberg (2002)"},{"key":"23_CR27","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":"23_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/3-540-36379-3_4","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"N. Bonichon","year":"2002","unstructured":"Bonichon, N., Le Sa\u00ebc, B., Mosbah, M.: Optimal area algorithm for planar polyline drawings. In: Ku\u010dera, L. (ed.) WG 2002. LNCS, vol.\u00a02573, pp. 35\u201346. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30559-0_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:22:20Z","timestamp":1605759740000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30559-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241324","9783540305590"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30559-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}