{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T03:25:16Z","timestamp":1783481116821,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642341908","type":"print"},{"value":"9783642341915","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-34191-5_13","type":"book-chapter","created":{"date-parts":[[2012,11,11]],"date-time":"2012-11-11T19:57:47Z","timestamp":1352663867000},"page":"138-145","source":"Crossref","is-referenced-by-count":3,"title":["Simultaneously Flippable Edges in Triangulations"],"prefix":"10.1007","author":[{"given":"Diane L.","family":"Souvaine","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrew","family":"Winslow","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.comgeo.2008.04.001","volume":"42","author":"P. Bose","year":"2009","unstructured":"Bose, P., Hurtado, F.: Flips in planar graphs. Computational Geometry: Theory and Applications\u00a042, 60\u201380 (2009)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"13_CR2","first-page":"637","volume-title":"28th International Symposium on Theoretical Aspects of Computer Science","author":"A. Dumitrescu","year":"2011","unstructured":"Dumitrescu, A., Schulz, A., Sheffer, A., T\u00f3th, C.D.: Bounds on the maximum multiplicity of some common geometric graphs. In: 28th International Symposium on Theoretical Aspects of Computer Science, pp. 637\u2013648. Dagstuhl Publishing, Germany (2011)"},{"key":"13_CR3","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. International Journal of Computational Geometry and Applications\u00a013, 113\u2013133 (2003)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/978-3-642-22300-6_44","volume-title":"Algorithms and Data Structures","author":"M. Hoffmann","year":"2011","unstructured":"Hoffmann, M., Sharir, M., Sheffer, A., T\u00f3th, C.D., Welzl, E.: Counting Plane Graphs: Flippability and Its Applications. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol.\u00a06844, pp. 524\u2013535. Springer, Heidelberg (2011)"},{"key":"13_CR5","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 and Compututational Geometry\u00a022, 333\u2013346 (1999)","journal-title":"Discrete and Compututational Geometry"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00453-005-1187-5","volume":"45","author":"M. Mucha","year":"2006","unstructured":"Mucha, M., Sankowski, P.: Maximum matchings in planar graphs via Gaussian elimination. Algorithmica\u00a045, 3\u201320 (2006)","journal-title":"Algorithmica"},{"key":"13_CR7","first-page":"17","volume-title":"21st IEEE Symposium on Foundations of Computer Science","author":"S. Micali","year":"1980","unstructured":"Micali, S., Vazirani, V.V.: An \n                  \n                    \n                  \n                  $O(\\sqrt{|V|}\\cdot|E|)$\n                 algorithm for finding maximum matching in general graphs. In: 21st IEEE Symposium on Foundations of Computer Science, pp. 17\u201327. IEEE Press, New York (1980)"},{"key":"13_CR8","unstructured":"Urrutia, J.: Flipping edges in triangulations of point sets, polygons and maximal planar graphs. Invited talk, 1st Japanese Conference on Discrete and Computational Geometry, JCDCG 1997 (1997), \n                  \n                    http:\/\/www.matem.unam.mx\/~urrutia\/online_papers\/TrianSurv.pdf"}],"container-title":["Lecture Notes in Computer Science","Computational Geometry"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34191-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T18:07:48Z","timestamp":1557338868000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34191-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642341908","9783642341915"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34191-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}