{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T14:04:26Z","timestamp":1648821866345},"reference-count":8,"publisher":"Oxford University Press (OUP)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"DOI":"10.1093\/comjnl\/bxw106","type":"journal-article","created":{"date-parts":[[2016,12,2]],"date-time":"2016-12-02T07:05:39Z","timestamp":1480662339000},"source":"Crossref","is-referenced-by-count":0,"title":["Remote Monitoring by Edges and Faces of Maximal Outerplanar Graphs"],"prefix":"10.1093","author":[{"given":"Gregorio","family":"Hern\u00e1ndez","sequence":"first","affiliation":[]},{"given":"Mafalda","family":"Martins","sequence":"additional","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2017,1,2]]},"reference":[{"key":"2017010717101973000_bxw106v2.1","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/j.endm.2014.08.020","article-title":"Monitoring maximal outerplanar graphs","volume":"46","author":"Hern\u00e1ndez","year":"2014","journal-title":"Electron. Notes Discrete Math."},{"key":"2017010717101973000_bxw106v2.2","unstructured":"Haynes, T.W. , Hedetniemi, S. and Slater, P. (1998) Fundamentals of Domination in Graphs, Chapman & Hall\/CRC Pure and Applied Mathematics. Taylor & Francis."},{"key":"2017010717101973000_bxw106v2.3","first-page":"173","article-title":"Guarding polyhedral terrains","volume":"7","author":"Bose","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"2017010717101973000_bxw106v2.4","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0925-7721(95)00051-8","article-title":"Edge guarding polyhedral terrains","volume":"7","author":"Everett","year":"1997","journal-title":"Computat. Geometry"},{"key":"2017010717101973000_bxw106v2.5","unstructured":"Canales, S. , Hern\u00e1ndez, G. , Martins, M. and Matos, I. (2013) Distance domination, guarding and vertex cover for maximal outerplanar graphs. In Proc. XV Spanish Meeting on Computational Geometry (EGC'13), pp. 51\u201354."},{"key":"2017010717101973000_bxw106v2.6","doi-asserted-by":"crossref","first-page":"225","DOI":"10.2140\/pjm.1975.61.225","article-title":"Relations between packing and covering number of a tree","volume":"61","author":"Meir","year":"1975","journal-title":"Pacific J. Math."},{"key":"2017010717101973000_bxw106v2.7","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.dam.2015.05.010","article-title":"Distance-domination, distance-guarding, and distance-vertex cover of maximal outerplanar graphs","volume":"194","author":"Alvarado","year":"2015","journal-title":"Discrete Appl. Math."},{"key":"2017010717101973000_bxw106v2.8","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF00147413","article-title":"Covering and guarding polygons using L k -sets","volume":"37","author":"Shermer","year":"1991","journal-title":"Geom. Dedic."}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T01:07:52Z","timestamp":1498352872000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxw106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,2]]},"references-count":8,"alternative-id":["10.1093\/comjnl\/bxw106"],"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxw106","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,2]]}}}