{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:58:32Z","timestamp":1725893912057},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540778905"},{"type":"electronic","value":"9783540778912"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77891-2_20","type":"book-chapter","created":{"date-parts":[[2008,1,12]],"date-time":"2008-01-12T03:19:36Z","timestamp":1200107976000},"page":"210-221","source":"Crossref","is-referenced-by-count":5,"title":["Listing All Plane Graphs"],"prefix":"10.1007","author":[{"given":"Katsuhisa","family":"Yamanaka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shin-ichi","family":"Nakano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D. Avis","year":"1996","unstructured":"Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Appl. Math.\u00a065, 21\u201346 (1996)","journal-title":"Discrete Appl. Math."},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1137\/0209055","volume":"9","author":"T. Beyer","year":"1980","unstructured":"Beyer, T., Hedetniemi, S.M.: Constant time generation of rooted trees. SIAM J. Comput.\u00a09, 706\u2013712 (1980)","journal-title":"SIAM J. Comput."},{"key":"20_CR3","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0925-7721(98)00016-9","volume":"10","author":"M. Chrobak","year":"1998","unstructured":"Chrobak, M., Nakano, S.: Minimum-width grid drawings of plane graphs. Comput. Geom. Theory and Appl.\u00a010, 29\u201354 (1998)","journal-title":"Comput. Geom. Theory and Appl."},{"key":"20_CR4","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":"20_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511569913","volume-title":"Efficient algorithms for listing combinatorial structures","author":"L.A. Goldberg","year":"1993","unstructured":"Goldberg, L.A.: Efficient algorithms for listing combinatorial structures. Cambridge University Press, New York (1993)"},{"unstructured":"Knuth, D.E.: The art of computer programming, vol. 4, fascicle 2, generating all tuples and permutations, Addison-Wesley (2005)","key":"20_CR6"},{"key":"20_CR7","volume-title":"Combinatorial algorithms","author":"D.L. Kreher","year":"1998","unstructured":"Kreher, D.L., Stinson, D.R.: Combinatorial algorithms. CRC Press, Boca Raton (1998)"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/3-540-48224-5_36","volume-title":"Automata, Languages and Programming","author":"Z. Li","year":"2001","unstructured":"Li, Z., Nakano, S.: Efficient generation of plane triangulations without repetitions. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 433\u2013443. Springer, Heidelberg (2001)"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1006\/jagm.1997.0898","volume":"26","author":"B.D. McKay","year":"1998","unstructured":"McKay, B.D.: Isomorph-free exhaustive generation. J. Algorithms\u00a026, 306\u2013324 (1998)","journal-title":"J. Algorithms"},{"key":"20_CR10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.comgeo.2003.06.001","volume":"27","author":"S. Nakano","year":"2004","unstructured":"Nakano, S.: Efficient generation of triconnected plane triangulations. Comput. Geom. Theory Appl.\u00a027, 109\u2013122 (2004)","journal-title":"Comput. Geom. Theory Appl."},{"unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Proc. 1st ACM-SIAM SODA, pp. 138\u2013148 (1990)","key":"20_CR11"},{"key":"20_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511805967","volume-title":"Enumerative combinatorics","author":"R.P. Stanley","year":"1997","unstructured":"Stanley, R.P.: Enumerative combinatorics, vol.\u00a01. Cambridge Univ. Press, Cambridge (1997)"},{"key":"20_CR13","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511609589","volume-title":"Enumerative combinatorics","author":"R.P. Stanley","year":"1999","unstructured":"Stanley, R.P.: Enumerative combinatorics, vol.\u00a02. Cambridge Univ. Press, Cambridge (1999)"},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1137\/0215039","volume":"15","author":"R.A. Wright","year":"1986","unstructured":"Wright, R.A., Richmond, B., Odlyzko, A., McKay, B.D.: Constant time generation of free trees. SIAM J. Comput.\u00a015, 540\u2013548 (1986)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77891-2_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:55:07Z","timestamp":1619506507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77891-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540778905","9783540778912"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77891-2_20","relation":{},"subject":[]}}