{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T04:01:30Z","timestamp":1754193690775},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540258605"},{"type":"electronic","value":"9783540320432"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11424758_68","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T16:56:24Z","timestamp":1268412984000},"page":"647-656","source":"Crossref","is-referenced-by-count":11,"title":["Weakly Cooperative Guards in Grids"],"prefix":"10.1007","author":[{"given":"Micha\u0142","family":"Ma\u0142afiejski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"\u017byli\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"68_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0196-6774(90)90001-U","volume":"11","author":"F. Berman","year":"1990","unstructured":"Berman, F., Johnson, D., Leighton, T., Shor, P.W., Snyder, L.: Generalized planar matching. J. Algorithms\u00a011, 153\u2013184 (1990)","journal-title":"J. Algorithms"},{"key":"68_CR2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0020-0190(98)00046-5","volume":"66","author":"J. Czy\u017cowicz","year":"1998","unstructured":"Czy\u017cowicz, J., Kranakis, E., Urrutia, J.: A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments. Info. Proc. Lett.\u00a066, 125\u2013126 (1998)","journal-title":"Info. Proc. Lett."},{"key":"68_CR3","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1007\/s10107-003-0414-6","volume":"98","author":"K.M.J. Bontridder","year":"2003","unstructured":"De Bontridder, K.M.J., Hald\u00f3rsson, B.V., Hald\u00f3rsson, M.M., Hurkens, C.A.J., Lenstra, J.K., Ravi, R., Stougie, L.: Approximation algorithms for the test cover problem. Mathematical Programming\u00a098, 477\u2013491 (2003)","journal-title":"Mathematical Programming"},{"key":"68_CR4","first-page":"161","volume":"22","author":"J.S. Deogun","year":"1996","unstructured":"Deogun, J.S., Sarasamma, S.T.: On the minimum cooperative guards problem. J. Combin. Math. Combin. Comput.\u00a022, 161\u2013182 (1996)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"68_CR5","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/0196-6774(86)90002-7","volume":"7","author":"M.E. Dyer","year":"1986","unstructured":"Dyer, M.E., Frieze, A.M.: Planar 3DM is NP-complete. J. Algorithms\u00a07, 174\u2013184 (1986)","journal-title":"J. Algorithms"},{"key":"68_CR6","doi-asserted-by":"crossref","unstructured":"Finke, U., Hinchirs, K.: Overlaying simply connected planar subdivisions in linear time. In: Proc. 11th Annu. ACM Sympos. Comput. Geom., pp. 119\u2013126 (1995)","DOI":"10.1145\/220279.220292"},{"key":"68_CR7","volume-title":"Computers and Intractability: A Guide to the Theorey of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theorey of NP-completeness. Freeman, New York (1979)"},{"key":"68_CR8","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/0212040","volume":"12","author":"P. Hell","year":"1983","unstructured":"Hell, P., Kirkpatrick, D.G.: On the complexity of general graph factor problems. SIAM Journal of Comput.\u00a012, 601\u2013609 (1983)","journal-title":"SIAM Journal of Comput."},{"key":"68_CR9","unstructured":"Hern\u00e1ndez-Pe\u00f1alver, G.: Controlling guards. In: Proc. of Sixth Canadian Conference on Computational Geometry, pp. 387\u2013392 (1994)"},{"key":"68_CR10","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0020-0190(94)00128-6","volume":"57","author":"B.C. Liaw","year":"1994","unstructured":"Liaw, B.C., Lee, R.C.T.: An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons. Info. Proc. Lett.\u00a057, 69\u201375 (1994)","journal-title":"Info. Proc. Lett."},{"key":"68_CR11","unstructured":"Liaw, B.C., Huang, N.F., Lee, R.C.T.: The minimum cooperative guards problem on k-spiral polygons. In: Proc. of Fifth Canadian Conference on Computational Geometry, pp. 97\u2013101 (1993)"},{"key":"68_CR12","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1007\/BF01759074","volume":"6","author":"S. Masuyama","year":"1991","unstructured":"Masuyama, S., Ibaraki, T.: Chain packing in graphs. Algorithmica\u00a06, 826\u2013839 (1991)","journal-title":"Algorithmica"},{"key":"68_CR13","unstructured":"Nierhoff, T., \u017byli\u0144ski, P.: Cooperative guards in grids. In: Third Annual CGC Workshop (2003)"},{"key":"68_CR14","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0020-0190(86)90050-5","volume":"23","author":"S. Ntafos","year":"1986","unstructured":"Ntafos, S.: On gallery watchman in grids. Info. Proc. Lett.\u00a023, 99\u2013102 (1986)","journal-title":"Info. Proc. Lett."},{"key":"68_CR15","volume-title":"Art Gallery Theorems and Algorithms","author":"J. O\u2019Rourke","year":"1987","unstructured":"O\u2019Rourke, J.: Art Gallery Theorems and Algorithms. Oxford University Press, Oxford (1987)"},{"key":"68_CR16","volume-title":"Art Gallery and Illumination Problems, Handbook on Computational Geometry","author":"J. Urrutia","year":"2000","unstructured":"Urrutia, J.: Art Gallery and Illumination Problems, Handbook on Computational Geometry. Elsevier Science, Amsterdam (2000)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11424758_68.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:54:08Z","timestamp":1605642848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11424758_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540258605","9783540320432"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11424758_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}