{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:45:38Z","timestamp":1725493538090},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422877"},{"type":"electronic","value":"9783540482246"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_36","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:29:04Z","timestamp":1193552944000},"page":"433-443","source":"Crossref","is-referenced-by-count":28,"title":["Efficient Generation of Plane Triangulations without Repetitions"],"prefix":"10.1007","author":[{"given":"Zhangjian","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shin-ichi","family":"Nakano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"36_CR1","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1007\/BF01944353","volume":"16","author":"D. Avis","year":"1996","unstructured":"D. Avis, Generating rooted triangulations without repetitions, Algorithmica, 16, (1996), pp.618\u2013632.","journal-title":"Algorithmica"},{"key":"36_CR2","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1137\/0209055","volume":"9","author":"T. Beyer","year":"1980","unstructured":"T. Beyer and S. M. Hedetniemi, Constant time generation of rooted trees, SIAM J. Comput., 9, (1980), pp.706\u2013712.","journal-title":"SIAM J. Comput."},{"key":"36_CR3","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0925-7721(98)00016-9","volume":"10","author":"M. Chrobak","year":"1998","unstructured":"M. Chrobak and S. Nakano, Minimum-width grid drawings of plane graphs, Computational Geometry: Theory and Applications, 10, (1998), pp.29\u201354.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"36_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix de","year":"1990","unstructured":"H. de Fraysseix, J. Pach and R. Pollack, How to draw a planar graph on a grid, Combinatorica, 10, (1990), pp.41\u201351.","journal-title":"Combinatorica"},{"key":"36_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511569913","volume-title":"Efficient algorithms for listing combinatorial structures","author":"L. A. Goldberg","year":"1993","unstructured":"L. A. Goldberg, Efficient algorithms for listing combinatorial structures, Cambridge University Press, New York, (1993)."},{"key":"36_CR6","unstructured":"J. E. Hopcroft and J.K. Wong, Linear time algorithm for isomorphism of planar graphs, Proc. of 6th STOC, (1974), pp.172\u2013184."},{"key":"36_CR7","volume-title":"Combinatorial algorithms","author":"D. L. Kreher","year":"1998","unstructured":"D. L. Kreher and D. R. Stinson, Combinatorial algorithms, CRC Press, Boca Raton, (1998)."},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1006\/jagm.1997.0898","volume":"26","author":"B. D. McKay","year":"1998","unstructured":"B. D. McKay, Isomorph-free exhaustive generation, J. of Algorithms, 26, (1998), pp.306\u2013324.","journal-title":"J. of Algorithms"},{"key":"36_CR9","unstructured":"W. Schnyder, Embedding planar graphs on the grid, Proc. 1st Annual ACM-SIAM Symp. on Discrete Algorithms, San Francisco, (1990), pp.138\u2013148."},{"key":"36_CR10","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1137\/0215039","volume":"15","author":"R. A. Wright","year":"1986","unstructured":"R. A. Wright, B. Richmond, A. Odlyzko and B. D. McKay, Constant time generation of free trees, SIAM J. Comput., 15, (1986), pp.540\u2013548.","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T18:27:57Z","timestamp":1551032877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_36","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}