{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:00:29Z","timestamp":1743112829369,"version":"3.40.3"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319037790"},{"type":"electronic","value":"9783319037806"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-319-03780-6_21","type":"book-chapter","created":{"date-parts":[[2013,11,21]],"date-time":"2013-11-21T01:13:18Z","timestamp":1384996398000},"page":"238-249","source":"Crossref","is-referenced-by-count":0,"title":["Map of Geometric Minimal Cuts for General Planar Embedding"],"prefix":"10.1007","author":[{"given":"Lei","family":"Xu","sequence":"first","affiliation":[]},{"given":"Evanthia","family":"Papadopoulou","sequence":"additional","affiliation":[]},{"given":"Jinhui","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","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 & Computational Geometry\u00a017, 307\u2013318 (1997)","journal-title":"Discrete & Computational Geometry"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Dey, S.K., Papadopoulou, E.: The L\u2009\u221e\u2009(L1) Farthest Line-Segment Voronoi diagram. In: The Ninth International Symposium on Voronoi Diagrams in Science and Engineering, pp. 49\u201355 (2012)","DOI":"10.1109\/ISVD.2012.27"},{"key":"21_CR3","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":"5","key":"21_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":"21_CR5","doi-asserted-by":"crossref","unstructured":"Papadopoulou, E.: Higher order Voronoi diagrams of segments for VLSI critical area extraction. In: The Eighteenth International Symposium on Algorithms and Computation, pp. 716\u2013727 (2007)","DOI":"10.1007\/978-3-540-77120-3_62"},{"issue":"5","key":"21_CR6","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1109\/43.920683","volume":"20","author":"E. Papadopoulou","year":"2011","unstructured":"Papadopoulou, E.: Net-aware critical area extraction for opens in VLSI circuits via high-order Voronoi diagram. IEEE Transactions on Computer-Aided Design\u00a020(5), 583\u2013597 (2011)","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Xu, J., Xu, L., Papadopoulou, E.: Computing the Map of Geometric Minimal Cuts. In: The Twentieth International Symposium on Algorithms and Computation, pp. 244\u2013254 (2009)","DOI":"10.1007\/978-3-642-10631-6_26"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Xu, J., Xu, L., Papadopoulou, E.: Map of Geometric Minimal Cuts with Applications. In: Handbook of Combinatorial Optimization, 2nd edn. Springer (2013)","DOI":"10.1007\/978-1-4419-7997-1_27"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03780-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T09:31:22Z","timestamp":1558690282000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03780-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319037790","9783319037806"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03780-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}