{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:42Z","timestamp":1725559002921},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223399"},{"type":"electronic","value":"9783540278108"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27810-8_15","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T17:27:29Z","timestamp":1279042049000},"page":"161-173","source":"Crossref","is-referenced-by-count":0,"title":["Connectivity of Graphs Under Edge Flips"],"prefix":"10.1007","author":[{"given":"Norbert","family":"Zeh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"1621","DOI":"10.1137\/S0097539702411368","volume":"32","author":"O. Aichholzer","year":"2003","unstructured":"Aichholzer, O., Aurenhammer, F., Brass, P., Krasser, H.: Pseudo-triangulations from surfaces and a novel type of edge flip. SIAM J. Comp.\u00a032, 1621\u20131653 (2003)","journal-title":"SIAM J. Comp."},{"key":"15_CR2","doi-asserted-by":"crossref","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. Comp. Geom.: Theory and Appl.\u00a021, 3\u201320 (2002)","journal-title":"Comp. Geom.: Theory and Appl."},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-540-45078-8_2","volume-title":"Algorithms and Data Structures","author":"O. Aichholzer","year":"2003","unstructured":"Aichholzer, O., Aurenhammer, F., Krasser, H.: Adapting (pseudo)-triangulations with a near-linear number of edge flips. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol.\u00a02748, pp. 12\u201324. Springer, Heidelberg (2003)"},{"key":"15_CR4","unstructured":"Edelsbrunner, H.: Personal communication (2003)"},{"key":"15_CR5","unstructured":"Edelsbrunner, H., Nekhayev, D.V.: Repairing self-intersections of triangulated surfaces in space. Tech. Report rgi-tech-03-053, Raindrop Geomagic Inc (2003)"},{"key":"15_CR6","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF01975867","volume":"15","author":"H. Edelsbrunner","year":"1996","unstructured":"Edelsbrunner, H., Shah, N.R.: Incremental topological flipping works for regular triangulations. Algorithmica \u00a015, 223\u2013241 (1996)","journal-title":"Algorithmica"},{"key":"15_CR7","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1142\/9789812831699_0007","volume-title":"Computing in Euclidean Geometry","author":"S. Fortune","year":"1995","unstructured":"Fortune, S.: Voronoi diagrams and Delaunay triangulations. In: Hu, D.Z., Wang, F.K. (eds.) Computing in Euclidean Geometry, 2nd edn., pp. 225\u2013265. World Scientific, Singapore (1995)","edition":"2"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1142\/S0218195903001098","volume":"13","author":"J. Galtier","year":"2003","unstructured":"Galtier, J., Hurtado, F., Noy, M., P\u00e9rennes, S., Urrutia, J.: Simultaneous edge flipping in triangulations. Int. Journal on Comp. Geom. and Appl.\u00a013, 113\u2013133 (2003)","journal-title":"Int. Journal on Comp. Geom. and Appl."},{"key":"15_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco (1979)"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF01758770","volume":"7","author":"L.J. Guibas","year":"1992","unstructured":"Guibas, L.J., Knuth, D.E., Sharir, M.: Randomized incremental construction of Delaunay and Voronoi diagrams. Algorithmica\u00a07, 381\u2013413 (1992)","journal-title":"Algorithmica"},{"key":"15_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. Disc. and Comp. Geom.\u00a022, 333\u2013346 (1999)","journal-title":"Disc. and Comp. Geom."},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0910044","volume":"10","author":"B. Joe","year":"1989","unstructured":"Joe, B.: Three-dimensional triangulations from local transformations. SIAM J. Scientific and Statistical Comp.\u00a010, 718\u2013741 (1989)","journal-title":"SIAM J. Scientific and Statistical Comp."},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0167-8396(91)90038-D","volume":"8","author":"B. Joe","year":"1991","unstructured":"Joe, B.: Construction of three-dimensional Delaunay triangulations using local transformations. Computer Aided Geometric Design\u00a08, 123\u2013142 (1991)","journal-title":"Computer Aided Geometric Design"},{"key":"15_CR14","first-page":"1","volume":"47","author":"S. Negami","year":"1999","unstructured":"Negami, S.: Diagonal flips of triangulations on surfaces, a survey. Yokohama Mathematical Journal\u00a047, 1\u201340 (1999)","journal-title":"Yokohama Mathematical Journal"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF02574375","volume":"12","author":"V.T. Rajan","year":"1994","unstructured":"Rajan, V.T.: Optimality of the delaunay triangulation in _d. Disc. and Comp. Geom.\u00a012, 189\u2013202 (1994)","journal-title":"Disc. and Comp. Geom."},{"key":"15_CR16","unstructured":"Zeh, N.: Connectivity of graphs under edge flips. Tech. Report CS-2003-07, Faculty of Computer Science, Dalhousie University (2003)"},{"key":"15_CR17","unstructured":"Zeh, N.: Improved and more realistic algorithms for maximal graph connectivity. Tech. Report CS-2004-04, Faculty of Computer Science, Dalhousie University (2004)"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27810-8_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:27:06Z","timestamp":1620012426000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27810-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223399","9783540278108"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27810-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}