{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:36:06Z","timestamp":1725525366203},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002014"},{"type":"electronic","value":"9783642002021"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00202-1_14","type":"book-chapter","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T02:34:01Z","timestamp":1234233241000},"page":"151-164","source":"Crossref","is-referenced-by-count":0,"title":["Generating All Triangulations of Plane Graphs (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Mohammad Tanvir","family":"Parvez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Md. Saidur","family":"Rahman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shin-ichi","family":"Nakano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","first-page":"82","volume":"6","author":"D. Avis","year":"1996","unstructured":"Avis, D., Fukuda, K.: Reverse Search for Enumeration. Discrete Applied Mathematics\u00a06, 82\u201390 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0925-7721(02)00111-6","volume":"33","author":"S. Bespamyatnikh","year":"2002","unstructured":"Bespamyatnikh, S.: An Efficient Algorithm for Enumeration of Triangulations. Comput. Geom. Theory Appl.\u00a033, 271\u2013279 (2002)","journal-title":"Comput. Geom. Theory Appl."},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BF02574703","volume":"6","author":"B. Chazelle","year":"1991","unstructured":"Chazelle, B.: Triangulating a Polygon in Linear Time. Discrete Comput. Geom.\u00a06, 485\u2013524 (1991)","journal-title":"Discrete Comput. Geom."},{"key":"14_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"2000","unstructured":"de Berg, M., van Krevald, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer, Heidelberg (2000)"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0925-7721(99)00016-4","volume":"13","author":"F. Hurtado","year":"1999","unstructured":"Hurtado, F., Noy, M.: Graph of Triangulations of a Convex Polygon and Tree of Triangulations. Computational Geometry\u00a013, 179\u2013188 (1999)","journal-title":"Computational Geometry"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1006\/jctb.1998.1889","volume":"76","author":"H. Komuro","year":"1999","unstructured":"Komuro, H., Nakamoto, A., Negami, S.: Diagonal Flips in Triangulations on Closed Surfaces with Minimum Degree at Least 4. Journal of Combinatorial Theory, Series B\u00a076, 68\u201392 (1999)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"14_CR7","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":"14_CR8","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. Journal of Algorithms\u00a026, 306\u2013324 (1998)","journal-title":"Journal of Algorithms"},{"key":"14_CR9","doi-asserted-by":"publisher","DOI":"10.1142\/5648","volume-title":"Planar Graph Drawing","author":"T. Nishizeki","year":"2004","unstructured":"Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. World Scientific, Singapore (2004)"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-540-24595-7_25","volume-title":"Graph Drawing","author":"S. Nakano","year":"2004","unstructured":"Nakano, S., Uno, T.: More Efficient Generation of Plane Triangulations. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 273\u2013292. Springer, Heidelberg (2004)"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-30559-0_3","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S. Nakano","year":"2004","unstructured":"Nakano, S., Uno, T.: Constant Time Generation of Trees with Specified Diameter. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 33\u201345. Springer, Heidelberg (2004)"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/s00453-006-0114-8","volume":"46","author":"D. Poulalhon","year":"2006","unstructured":"Poulalhon, D., Schaeffer, G.: Optimal Coding and Sampling of Triangulations. Algorithmica\u00a046, 505\u2013527 (2006)","journal-title":"Algorithmica"},{"key":"14_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804120","volume-title":"Computational Geometry in C","author":"J. O\u2019Rourke","year":"1998","unstructured":"O\u2019Rourke, J.: Computational Geometry in C, 2nd edn. Cambridge University Press, Cambridge (1998)","edition":"2"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1090\/S0894-0347-1988-0928904-4","volume":"1","author":"D. Sleator","year":"1988","unstructured":"Sleator, D., Tarjan, R., Thurston, W.: Rotation Distance, Triangulations, and Hyperbolic Geometry. J. Amer. Math. Soc.\u00a01, 647\u2013681 (1988)","journal-title":"J. Amer. Math. Soc."},{"key":"14_CR15","doi-asserted-by":"publisher","DOI":"10.1142\/4109","volume-title":"VLSI Physical Design Automation: Theory and Practice","author":"S.M. Sait","year":"1999","unstructured":"Sait, S.M., Youssef, H.: VLSI Physical Design Automation: Theory and Practice. World Scientific, Singapore (1999)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00202-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T03:41:04Z","timestamp":1551757264000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00202-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002014","9783642002021"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00202-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}