{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:18Z","timestamp":1759638378207},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642174575"},{"type":"electronic","value":"9783642174582"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17458-2_3","type":"book-chapter","created":{"date-parts":[[2010,12,15]],"date-time":"2010-12-15T11:12:57Z","timestamp":1292411577000},"page":"21-30","source":"Crossref","is-referenced-by-count":11,"title":["Evacuation of Rectilinear Polygons"],"prefix":"10.1007","author":[{"given":"S\u00e1ndor","family":"Fekete","sequence":"first","affiliation":[]},{"given":"Chris","family":"Gray","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Kr\u00f6ller","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Bast, H., Hert, S.: The area partitioning problem. In: Proc. 12th Can. Conf. Comput. Geom. (CCCG 2000), Fredericton, NB, Canada, pp. 163\u2013171 (2000)"},{"issue":"2","key":"3_CR2","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1287\/moor.1090.0382","volume":"34","author":"N. Baumann","year":"2009","unstructured":"Baumann, N., Skutella, M.: Earliest arrival flows with multiple sources. Math. Oper. Res.\u00a034(2), 499\u2013512 (2009); Journal version of 2006 FOCS article Solving evacuation problems efficiently","journal-title":"Math. Oper. Res."},{"issue":"2","key":"3_CR3","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1002\/(SICI)1097-0037(199809)32:2<115::AID-NET4>3.0.CO;2-E","volume":"32","author":"R. Becker","year":"1998","unstructured":"Becker, R., Lari, I., Lucertini, M., Simeone, B.: Max-min partitioning of grid graphs into connected components. Networks\u00a032(2), 115\u2013125 (1998)","journal-title":"Networks"},{"key":"3_CR4","unstructured":"Fekete, S.P., Gray, C., Kr\u00f6ller, A.: Evacuation of rectilinear polygons. Technical report (2010), \n                  \n                    http:\/\/arxiv.org\/abs\/1008.4420"},{"key":"3_CR5","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, New York (1979)"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R.L. Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics\u00a017, 416\u2013429 (1969)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"3_CR7","unstructured":"Gy\u00f6ri, E.: On division of graphs to connected subgraphs. Combinatorics, Keszthely, 485\u2013494 (1978)"},{"issue":"3","key":"3_CR8","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF01896190","volume":"30","author":"L. Lov\u00e1sz","year":"1977","unstructured":"Lov\u00e1sz, L.: A homology theory for spanning trees of a graph. Acta Mathematica Hungarica\u00a030(3), 241\u2013251 (1977)","journal-title":"Acta Mathematica Hungarica"},{"issue":"4","key":"3_CR9","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1142\/S0218195998000230","volume":"8","author":"V. Lumelsky","year":"1998","unstructured":"Lumelsky, V.: Polygon area decomposition for multiple-robot workspace division. Int. Journal of Computational Geometry and Applications\u00a08(4), 437\u2013466 (1998)","journal-title":"Int. Journal of Computational Geometry and Applications"},{"issue":"1","key":"3_CR10","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/BF02939489","volume":"9","author":"J. Ma","year":"1994","unstructured":"Ma, J., Ma, S.: An O(k\n                2\n                n\n                2) algorithm to find a k-partition in a k-connected graph. Journal of Computer Science and Technology\u00a09(1), 86\u201391 (1994)","journal-title":"Journal of Computer Science and Technology"},{"issue":"4","key":"3_CR11","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/s00454-001-0047-6","volume":"26","author":"C. Moore","year":"2001","unstructured":"Moore, C., Robson, J.: Hard tiling problems with simple tiles. Discrete and Computational Geometry\u00a026(4), 573\u2013590 (2001)","journal-title":"Discrete and Computational Geometry"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.endm.2004.06.033","volume":"18","author":"L.R. Salgado","year":"2004","unstructured":"Salgado, L.R., Wakabayashi, Y.: Approximation results on balanced connected partitions of graphs. Electr. Notes in Discrete Mathematics\u00a018, 207\u2013212 (2004)","journal-title":"Electr. Notes in Discrete Mathematics"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-540-76796-1_21","volume-title":"Research Trends in Combinatorial Optimization","author":"M. Skutella","year":"2009","unstructured":"Skutella, M.: An introduction to network flows over time. In: Research Trends in Combinatorial Optimization, pp. 451\u2013482. Springer, Heidelberg (2009)"},{"issue":"5","key":"3_CR14","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0020-0190(90)90189-5","volume":"33","author":"H. Suzuki","year":"1990","unstructured":"Suzuki, H., Takahashi, N., Nishizeki, T.: A linear algorithm for bipartition of biconnected graphs. Information Processing Letters\u00a033(5), 227\u2013231 (1990)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17458-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T19:55:22Z","timestamp":1553284522000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17458-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174575","9783642174582"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17458-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}