{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T11:35:59Z","timestamp":1753356959735},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642106309"},{"type":"electronic","value":"9783642106316"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10631-6_26","type":"book-chapter","created":{"date-parts":[[2009,12,4]],"date-time":"2009-12-04T07:03:43Z","timestamp":1259910223000},"page":"244-254","source":"Crossref","is-referenced-by-count":4,"title":["Computing the Map of Geometric Minimal Cuts"],"prefix":"10.1007","author":[{"given":"Jinhui","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evanthia","family":"Papadopoulou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF01840357","volume":"2","author":"S. Fortune","year":"1987","unstructured":"Fortune, S.: A sweepline algorithm for Voronoi diagrams. Algorithmica\u00a02, 153\u2013174 (1987)","journal-title":"Algorithmica"},{"issue":"4","key":"26_CR2","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1145\/502090.502095","volume":"48","author":"J. Holm","year":"2001","unstructured":"Holm, J., Lichtenberg, K., Thorup, M.: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM\u00a048(4), 723\u2013760 (2001)","journal-title":"J. ACM"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01840386","volume":"5","author":"K. Mehlhorn","year":"1990","unstructured":"Mehlhorn, K., N\u00e4her, S.: Dynamic franctional cascading. Algorithmica\u00a05, 215\u2013241 (1990)","journal-title":"Algorithmica"},{"issue":"5","key":"26_CR4","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1109\/43.920683","volume":"20","author":"E. Papadopoulou","year":"2001","unstructured":"Papadopoulou, E.: Critical area computation for missing material defects in VLSI circuits. IEEE Transactions on Computer-Aided Design\u00a020(5), 583\u2013597 (2001)","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s00453-004-1095-0","volume":"40","author":"E. Papadopoulou","year":"2004","unstructured":"Papadopoulou, E.: The Hausdorff Voronoi Diagram of Point Clusters in the Plane. Algorithmica\u00a040, 63\u201382 (2004)","journal-title":"Algorithmica"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1007\/978-3-540-77120-3_62","volume-title":"Algorithms and Computation","author":"E. Papadopoulou","year":"2007","unstructured":"Papadopoulou, E.: Higher order Voronoi diagrams of segments for VLSI critical area extraction. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol.\u00a04835, pp. 716\u2013727. Springer, Heidelberg (2007)"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Thorup, M.: Near-optimal fully-dynamic graph connectivity. In: STOC, pp. 343\u2013350 (2000)","DOI":"10.1145\/335305.335345"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/PL00009296","volume":"17","author":"M. Abellanas","year":"1997","unstructured":"Abellanas, M., Hernandez, G., Klein, R., Neumann-Lara, V., Urrutia, J.: A Combinatorial Property of Convex Sets. Discrete Comput. Geometry\u00a017, 307\u2013318 (1997)","journal-title":"Discrete Comput. Geometry"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF02187733","volume":"4","author":"H. Edelsbrunner","year":"1989","unstructured":"Edelsbrunner, H., Guibas, L.J., Sharir, M.: The upper envelope of piecewise linear functions: algorithms and applications. Discrete Comput. Geometry\u00a04, 311\u2013336 (1989)","journal-title":"Discrete Comput. Geometry"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1142\/S0218195901000626","volume":"11","author":"E. Papadopoulou","year":"2001","unstructured":"Papadopoulou, E., Lee, D.T.: The L\n                \u2009\u221e\u2009 Voronoi Diagram of Segments and VLSI Applications. International Journal of Computational Geometry and Applications\u00a011, 503\u2013528 (2001)","journal-title":"International Journal of Computational Geometry and Applications"},{"issue":"4","key":"26_CR11","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1109\/43.752929","volume":"18","author":"E. Papadopoulou","year":"1999","unstructured":"Papadopoulou, E., Lee, D.T.: Critical Area computation via Voronoi diagrams. IEEE Transactions on Computer-Aided Design\u00a018(4), 463\u2013474 (1999)","journal-title":"IEEE Transactions on Computer-Aided Design"},{"issue":"6","key":"26_CR12","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1142\/S0218195904001536","volume":"14","author":"E. Papadopoulou","year":"2004","unstructured":"Papadopoulou, E., Lee, D.T.: The Hausdorff Voronoi diagram of polygonal objects: A divide and conquer approach. International Journal of Computational Geometry and Applications\u00a014(6), 421\u2013452 (2004)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Dehne, F., Maheshwari, A., Taylor, R.: A Coarse Grained Parallel Algorithm for Hausdorff Voronoi Diagrams. In: Proc. 2006 International Conference on Parallel Processing, pp. 497\u2013504 (2006)","DOI":"10.1109\/ICPP.2006.5"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10631-6_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:36:50Z","timestamp":1619782610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10631-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642106309","9783642106316"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10631-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}