{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:23:36Z","timestamp":1725553416449},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540340706"},{"type":"electronic","value":"9783540340713"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11751540_16","type":"book-chapter","created":{"date-parts":[[2006,5,10]],"date-time":"2006-05-10T08:28:51Z","timestamp":1147249731000},"page":"141-150","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient Algorithm for Mobile Guarded Guards in Simple Grids"],"prefix":"10.1007","author":[{"given":"Adrian","family":"Kosowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Ma\u0142afiejski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"\u017byli\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Aggarwal, A.: The Art Gallery Theorem: Its Variations, Applications, and Algorithmic Aspects, Ph.D. Thesis. Johns Hopkins University (1984)"},{"key":"16_CR2","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1109\/TC.1981.1675729","volume":"30","author":"D. Avis","year":"1981","unstructured":"Avis, D., Toussaint, G.T.: An optimal algorithm for determining the visibility of a\u00a0polygon from an edge. IEEE Trans. Comput. C-30, 910\u2013914 (1981)","journal-title":"IEEE Trans. Comput. C-"},{"key":"16_CR3","unstructured":"Bjorling-Sachs, I., Souvaine, D.L.: A tight bound for edge guards in monotone polygons, DIMACS Technical Report 92-52 (1992)"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0095-8956(75)90061-1","volume":"18","author":"V. Chv\u00e1tal","year":"1997","unstructured":"Chv\u00e1tal, V.: A combinatorial theorem in plane geometry. J. Combin. Theory, Ser. B\u00a018, 39\u201341 (1997)","journal-title":"J. Combin. Theory, Ser. B"},{"key":"16_CR5","doi-asserted-by":"publisher","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. Inf. Process. Lett.\u00a066, 125\u2013126 (1998)","journal-title":"Inf. Process. Lett."},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Finke, U., Hinchirs, K.: Overlaying simply connected planar subdivisions in linear time. In: Proc. of ACM SoCG 1995, pp. 119\u2013126 (1995)","DOI":"10.1145\/220279.220292"},{"key":"16_CR7","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0925-7721(93)90013-V","volume":"2","author":"L.P. Gewali","year":"1993","unstructured":"Gewali, L.P., Ntafos, S.: Covering grids and orthogonal polygons with periscope guards. Computational Geometry: Theory and Applications\u00a02, 309\u2013334 (1993)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"16_CR8","unstructured":"Hern\u00e1ndez-Pe\u00f1alver, G.: Controlling guards. In: Proc. of CCCG 1994, pp. 387\u2013392 (1994)"},{"key":"16_CR9","unstructured":"Hern\u00e1ndez-Pe\u00f1alver, G.: Vigilancia vigilada en pol\u00edgonos ortogonales. Actas del VI Encuentro de Geometria Computacional, 198-205 (1995)"},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.comgeo.2004.07.002","volume":"30","author":"M.J. Katz","year":"2005","unstructured":"Katz, M.J., Mitchell, J.S.B., Nir, Y.: Orthogonal segment stabbing. Computational Geometry: Theory and Applications\u00a030, 197\u2013205 (2005)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"16_CR11","unstructured":"Kosowski, A., Ma\u0142afiejski, M., \u017byli\u0144ski, P.: Weakly cooperative mobile guards in grids. In: Extended abstract in Proc. of JCDCG, pp. 83\u201384 (2004)"},{"key":"16_CR12","unstructured":"Liaw, B.C., Huang, N.F., Lee, R.C.T.: The minimum cooperative guards problem on k-spiral polygons. In: Proc. of CCCG 1993, pp. 97\u2013101 (1993)"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0020-0190(94)00128-6","volume":"52","author":"B.C. Liaw","year":"1994","unstructured":"Liaw, B.C., Huang, N.F., Lee, R.C.T.: An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons. Inf. Process. Lett.\u00a052, 69\u201375 (1994)","journal-title":"Inf. Process. Lett."},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/11424758_68","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2005","author":"M. Ma\u0142afiejski","year":"2005","unstructured":"Ma\u0142afiejski, M., \u017byli\u0144ski, P.: Weakly cooperative guards in grids. In: Gervasi, O., Gavrilova, M.L., Kumar, V., Lagan\u00e1, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol.\u00a03480, pp. 647\u2013656. Springer, Heidelberg (2005)"},{"key":"16_CR15","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0925-7721(03)00039-7","volume":"26","author":"T.S. Michael","year":"2003","unstructured":"Michael, T.S., Pinciu, V.: Art gallery theorems for guarded guards. Computational Geometry: Theory and Applications\u00a026, 247\u2013258 (2003)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1007\/3-540-45545-0_87","volume-title":"Computational Science - ICCS 2001","author":"T.S. Michael","year":"2001","unstructured":"Michael, T.S., Pinciu, V.: Multiply guarded guards in orthogonal art galleries. In: Alexandrov, V.N., Dongarra, J., Juliano, B.A., Renner, R.S., Tan, C.J.K. (eds.) ICCS-ComputSci 2001. LNCS, vol.\u00a02073, pp. 753\u2013762. Springer, Heidelberg (2001)"},{"key":"16_CR17","unstructured":"Nierhoff, T., \u017byli\u0144ski, P.: Note on cooperative guards in grids. In: Annual CGC Workshop, Neustrelitz (2003)"},{"key":"16_CR18","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. Inf. Process. Lett.\u00a023, 99\u2013102 (1986)","journal-title":"Inf. Process. Lett."},{"key":"16_CR19","first-page":"273","volume":"14","author":"J. O\u2019Rourke","year":"1983","unstructured":"O\u2019Rourke, J.: Galleries need fewer mobile guards: a variation to Chvat\u00e1tal\u2019s Theorem. Geometriae Dedicata\u00a014, 273\u2013283 (1983)","journal-title":"Geometriae Dedicata"},{"key":"16_CR20","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":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"886","DOI":"10.1007\/3-540-44842-X_90","volume-title":"Connected guards in orthogonal galleries","author":"V. Pinciu","year":"2003","unstructured":"Pinciu, V.: ICCSA 2003. LNCS, vol.\u00a02669, pp. 886\u2013893. Springer, Heidelberg (2003)"},{"key":"16_CR22","volume-title":"Handbook on Computational Geometry","author":"J. Urrutia","year":"2000","unstructured":"Urrutia, J.: Art Gallery and Illumination Problems. In: Handbook on Computational Geometry. Elsevier, Amsterdam (2000)"},{"key":"16_CR23","unstructured":"\u017byli\u0144ski, P.: Watched guards in art galleries. accepted for: Journal of Geometry"},{"key":"16_CR24","unstructured":"\u017byli\u0144ski, P.: Cooperative Guards Problem \u2013 Combinatorial Bounds and Complexity, Ph.D. Thesis. Gda\u0144sk University (2005)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications - ICCSA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11751540_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:57:43Z","timestamp":1619492263000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11751540_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540340706","9783540340713"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11751540_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}