{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T20:55:49Z","timestamp":1725828949789},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662483497"},{"type":"electronic","value":"9783662483503"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-48350-3_51","type":"book-chapter","created":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T01:40:34Z","timestamp":1441071634000},"page":"607-618","source":"Crossref","is-referenced-by-count":0,"title":["A Characterization of Visibility Graphs for Pseudo-polygons"],"prefix":"10.1007","author":[{"given":"Matt","family":"Gibson","sequence":"first","affiliation":[]},{"given":"Erik","family":"Krohn","sequence":"additional","affiliation":[]},{"given":"Qing","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,12]]},"reference":[{"key":"51_CR1","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1137\/1.9781611973068.34","volume-title":"Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009","author":"G. Aloupis","year":"2009","unstructured":"Aloupis, G., Cardinal, J., Collette, S., Langerman, S., Orden, D., Ramos, P.: Decomposition of multiple coverings into more parts. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, pp. 302\u2013310. Society for Industrial and Applied Mathematics, Philadelphia (2009)"},{"issue":"7","key":"51_CR2","doi-asserted-by":"publisher","first-page":"3248","DOI":"10.1137\/090762968","volume":"39","author":"B. Aronov","year":"2010","unstructured":"Aronov, B., Ezra, E., Sharir, M.: Small-size epsilon-nets for axis-parallel rectangles and boxes. SIAM J. Comput.\u00a039(7), 3248\u20133282 (2010)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"51_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BF01300372","volume":"14","author":"S.-H. Choi","year":"1995","unstructured":"Choi, S.-H., Shin, S.Y., Chwa, K.-Y.: Characterizing and recognizing the visibility graph of a funnel-shaped polygon. Algorithmica\u00a014(1), 27\u201351 (1995)","journal-title":"Algorithmica"},{"key":"51_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0925-7721(95)00021-Z","volume":"5","author":"H. Everett","year":"1995","unstructured":"Everett, H., Corneil, D.G.: Negative results on characterizing visibility graphs. Comput. Geom.\u00a05, 51\u201363 (1995)","journal-title":"Comput. Geom."},{"issue":"1","key":"51_CR5","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/S0097539700380754","volume":"32","author":"U. Feige","year":"2003","unstructured":"Feige, U., Halld\u00f3rsson, M.M., Kortsarz, G., Srinivasan, A.: Approximating the domatic number. SIAM J. Comput.\u00a032(1), 172\u2013195 (2003)","journal-title":"SIAM J. Comput."},{"key":"51_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/3-540-19487-8_10","volume-title":"SWAT \u201988","author":"S.K. Ghosh","year":"1988","unstructured":"Ghosh, S.K.: On recognizing and characterizing visibility graphs of simple polygons. In: Karlsson, R., Lingas, A. (eds.) SWAT 1988. LNCS, vol.\u00a0318, pp. 96\u2013104. Springer, Heidelberg (1988)"},{"issue":"2","key":"51_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF02770871","volume":"17","author":"S.K. Ghosh","year":"1997","unstructured":"Ghosh, S.K.: On recognizing and characterizing visibility graphs of simple polygons. Discrete & Computational Geometry\u00a017(2), 143\u2013162 (1997)","journal-title":"Discrete & Computational Geometry"},{"key":"51_CR8","doi-asserted-by":"crossref","unstructured":"Ghosh, S.K., Goswami, P.P.: Unsolved problems in visibility graphs of points, segments, and polygons. ACM Comput. Surv.\u00a046(2), 22 (2013)","DOI":"10.1145\/2543581.2543589"},{"key":"51_CR9","doi-asserted-by":"crossref","unstructured":"O\u2019Rourke, J., Streinu, I.: Vertex-edge pseudo-visibility graphs: Characterization and recognition. In: Symposium on Computational Geometry, pp. 119\u2013128 (1997)","DOI":"10.1145\/262839.262915"},{"issue":"2","key":"51_CR10","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0925-7721(97)00011-4","volume":"10","author":"J. O\u2019Rourke","year":"1998","unstructured":"O\u2019Rourke, J., Streinu, I.: The vertex-edge visibility graph of a polygon. Computational Geometry\u00a010(2), 105\u2013120 (1998)","journal-title":"Computational Geometry"},{"key":"51_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF02574366","volume":"12","author":"G. Srinivasaraghavan","year":"1994","unstructured":"Srinivasaraghavan, G., Mukhopadhyay, A.: A new necessary condition for the vertex visibility graphs of simple polygons. Discrete & Computational Geometry\u00a012, 65\u201382 (1994)","journal-title":"Discrete & Computational Geometry"},{"issue":"3","key":"51_CR12","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.comgeo.2004.12.003","volume":"31","author":"I. Streinu","year":"2005","unstructured":"Streinu, I.: Non-stretchable pseudo-visibility graphs. Comput. Geom.\u00a031(3), 195\u2013206 (2005)","journal-title":"Comput. Geom."},{"key":"51_CR13","doi-asserted-by":"crossref","unstructured":"Varadarajan, K.R.: Epsilon nets and union complexity. In: Symposium on Computational Geometry, pp. 11\u201316 (2009)","DOI":"10.1145\/1542362.1542366"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48350-3_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:57:15Z","timestamp":1559246235000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48350-3_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662483497","9783662483503"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48350-3_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}