{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:47:37Z","timestamp":1725490057043},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735441"},{"type":"electronic","value":"9783540735458"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73545-8_25","type":"book-chapter","created":{"date-parts":[[2007,8,17]],"date-time":"2007-08-17T13:44:11Z","timestamp":1187358251000},"page":"243-253","source":"Crossref","is-referenced-by-count":1,"title":["Enumerating Constrained Non-crossing Geometric Spanning Trees"],"prefix":"10.1007","author":[{"given":"Naoki","family":"Katoh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shin-ichi","family":"Tanigawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"25_CR1","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.ipl.2005.09.003","volume":"97","author":"O. Aichholzer","year":"2006","unstructured":"Aichholzer, O., Aurenhammer, F., Huemer, C., Krasser, H.: Transforming spanning trees and pseudo-triangulations. Inf. Process. Lett.\u00a097(1), 19\u201322 (2006)","journal-title":"Inf. Process. Lett."},{"key":"25_CR2","unstructured":"Aichholzer, O., Aurenhammer, F., Huemer, C., Vogtenhuber, B.: Gray code enumeration of plane straight-line graphs. In: Proc.\u00a022th European Workshop on Computational Geometry (EuroCG 2006), pp. 71\u201374. Greece (2006)"},{"issue":"1-2","key":"25_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0925-7721(01)00042-6","volume":"21","author":"O. Aichholzer","year":"2002","unstructured":"Aichholzer, O., Aurenhammer, F., Hurtado, F.: Sequences of spanning trees and a fixed tree theorem. Comput. Geom.\u00a021(1-2), 3\u201320 (2002)","journal-title":"Comput. Geom."},{"key":"25_CR4","unstructured":"Aichholzer, O., Reinhardt, K.: A quadratic distance bound on sliding between crossing-free spanning trees. In: Proc. 20th European Workshop on Computational Geometry (EWCG 2004), pp. 13\u201316 (2004)"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF02293050","volume":"8","author":"D. Avis","year":"1992","unstructured":"Avis, D., Fukuda, K.: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra. Discrete and Computational Geometry\u00a08, 295\u2013313 (1992)","journal-title":"Discrete and Computational Geometry"},{"issue":"1-3","key":"25_CR6","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 Applied Mathematics\u00a065(1-3), 21\u201346 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"25_CR7","unstructured":"Avis, D., Katoh, N., Ohsaki, M., Streinu, I., Tanigawa, S.: Enumerating constrained non-crossing minimally rigid frameworks, \n                  \n                    http:\/\/arxiv.org\/PS_cache\/math\/pdf\/0608\/0608102.pdf"},{"issue":"3","key":"25_CR8","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/S0925-7721(02)00111-6","volume":"23","author":"S. Bespamyatnikh","year":"2002","unstructured":"Bespamyatnikh, S.: An efficient algorithm for enumeration of triangulations. Comput. Geom. Theory Appl.\u00a023(3), 271\u2013279 (2002)","journal-title":"Comput. Geom. Theory Appl."},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/3-540-44968-X_6","volume-title":"Computing and Combinatorics","author":"M.C. Hernando","year":"2000","unstructured":"Hernando, M.C., Houle, M.E., Hurtado, F.: On local transformation of polygons with visibility properties. In: Du, D.-Z., Eades, P., Sharma, A.K., Lin, X., Estivill-Castro, V. (eds.) COCOON 2000. LNCS, vol.\u00a01858, pp. 54\u201363. Springer, Heidelberg (2000)"},{"issue":"3","key":"25_CR10","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s003730200038","volume":"18","author":"C. Hernando","year":"2002","unstructured":"Hernando, C., Hurtado, F., Noy, M.: Graphs of non-crossing perfect matchings. Graphs and Combinatorics\u00a018(3), 517\u2013532 (2002)","journal-title":"Graphs and Combinatorics"},{"issue":"3","key":"25_CR11","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/PL00009464","volume":"22","author":"F. Hurtado","year":"1999","unstructured":"Hurtado, F., Noy, M., Urrutia, J.: Flipping edges in triangulations. Discrete & Computational Geometry\u00a022(3), 333\u2013346 (1999)","journal-title":"Discrete & Computational Geometry"},{"key":"25_CR12","first-page":"481","volume-title":"Handbook of Combinatorics","author":"D.J.A. Welsh","year":"1995","unstructured":"Welsh, D.J.A.: Matroids: fundamental concepts. In: Graham, R.L., Gr\u00f6tschel, M., Lov\u00e1sz, L. (eds.) Handbook of Combinatorics, vol.\u00a0I, pp. 481\u2013526. North-Holland, Amsterdam (1995)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73545-8_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:17:49Z","timestamp":1619518669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73545-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735441","9783540735458"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73545-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}