{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:04:30Z","timestamp":1760439870250},"reference-count":18,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4215,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2002,1]]},"DOI":"10.1016\/s0925-7721(01)00042-6","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T10:29:16Z","timestamp":1034591356000},"page":"3-20","source":"Crossref","is-referenced-by-count":24,"title":["Sequences of spanning trees and a fixed tree theorem"],"prefix":"10.1016","volume":"21","author":[{"given":"Oswin","family":"Aichholzer","sequence":"first","affiliation":[]},{"given":"Franz","family":"Aurenhammer","sequence":"additional","affiliation":[]},{"given":"Ferran","family":"Hurtado","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(01)00042-6_BIB001","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1142\/S0218195997000211","article-title":"Matching shapes with a reference point","volume":"7","author":"Aichholzer","year":"1997","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/S0925-7721(01)00042-6_BIB002","first-page":"9","article-title":"Crossing-free subgraphs","volume":"12","author":"Ajtai","year":"1982","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0925-7721(01)00042-6_BIB003","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/PL00009210","article-title":"Matching convex shapes with respect to the symmetric difference","volume":"21","author":"Alt","year":"1998","journal-title":"Algorithmica"},{"key":"10.1016\/S0925-7721(01)00042-6_BIB004","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1142\/S0218195995000064","article-title":"Computing the Fr\u00e9chet distance between two polygonal curves","volume":"5","author":"Alt","year":"1995","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/S0925-7721(01)00042-6_BIB005","series-title":"Handbook of Computational Geometry","first-page":"201","article-title":"Voronoi diagrams","author":"Aurenhammer","year":"2000"},{"key":"10.1016\/S0925-7721(01)00042-6_BIB006","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1016\/0166-218X(95)00026-N","article-title":"Reverse search for enumeration","volume":"65","author":"Avis","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0925-7721(01)00042-6_BIB007","unstructured":"P. Bose, J. Czyzowicz, F. Hurtado, Rotation flips and non-crossing trees, Manuscript"},{"key":"10.1016\/S0925-7721(01)00042-6_BIB008","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01553881","article-title":"Constrained Delaunay triangulations","volume":"4","author":"Chew","year":"1989","journal-title":"Algorithmica"},{"key":"10.1016\/S0925-7721(01)00042-6_BIB009","series-title":"Computing in Euclidean Geometry","first-page":"225","article-title":"Voronoi diagrams and Delaunay triangulations","author":"Fortune","year":"1995"},{"key":"10.1016\/S0925-7721(01)00042-6_BIB010","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0925-7721(00)00010-9","article-title":"Lower bounds on the number of crossing free subgraphs of Kn","volume":"16","author":"Garc\u0131&#x0301;a","year":"2000","journal-title":"Computational Geometry"},{"key":"10.1016\/S0925-7721(01)00042-6_BIB011","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0012-365X(95)00073-6","article-title":"Distances between graphs under edge operations","volume":"161","author":"Goddard","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/S0925-7721(01)00042-6_BIB012","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0166-218X(99)00006-2","article-title":"Geometric tree graphs of points in convex position","volume":"93","author":"Hernando","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0925-7721(01)00042-6_BIB013","series-title":"Proc. of 6th International Computing and Combinatorics Conference COCOON'00","first-page":"54","article-title":"On local transformation of polygons with visibility properties","volume":"1858","author":"Hernando","year":"2000"},{"key":"10.1016\/S0925-7721(01)00042-6_BIB014","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1137\/0122021","article-title":"On the tree graph of a matroid","volume":"22","author":"Holzmann","year":"1972","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0925-7721(01)00042-6_BIB015","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/PL00009317","article-title":"Ramsey-type results for geometric graphs, I","volume":"18","author":"K\u00e1rolyi","year":"1997","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(01)00042-6_BIB016","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","article-title":"On the shortest spanning subtree of a graph and the traveling salesman problem","volume":"7","author":"Kruskal","year":"1956","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/S0925-7721(01)00042-6_BIB017","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02187695","article-title":"Generalized Delaunay triangulation for planar graphs","volume":"1","author":"Lee","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(01)00042-6_BIB018","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1002\/jgt.3190120318","article-title":"On connectivities of tree graphs","volume":"12","author":"Liu","year":"1988","journal-title":"J. Graph Theory"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772101000426?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772101000426?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T08:22:04Z","timestamp":1556871724000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772101000426"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0925772101000426"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(01)00042-6","relation":{},"ISSN":["0925-7721"],"issn-type":[{"type":"print","value":"0925-7721"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}