{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:07Z","timestamp":1759637947145,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319501055"},{"type":"electronic","value":"9783319501062"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-50106-2_23","type":"book-chapter","created":{"date-parts":[[2016,12,7]],"date-time":"2016-12-07T15:22:42Z","timestamp":1481124162000},"page":"295-308","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Obstructing Visibilities with One Obstacle"],"prefix":"10.1007","author":[{"given":"Steven","family":"Chaplick","sequence":"first","affiliation":[]},{"given":"Fabian","family":"Lipp","sequence":"additional","affiliation":[]},{"given":"Ji-won","family":"Park","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,8]]},"reference":[{"issue":"1","key":"23_CR1","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s00454-009-9233-8","volume":"44","author":"H Alpert","year":"2009","unstructured":"Alpert, H., Koch, C., Laison, J.D.: Obstacle numbers of graphs. Discrete Comput. Geom. 44(1), 223\u2013244 (2009). \n                      http:\/\/dx.doi.org\/10.1007\/s00454-009-9233-8","journal-title":"Discrete Comput. Geom."},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-319-27261-0_30","volume-title":"Graph Drawing and Network Visualization","author":"M Balko","year":"2015","unstructured":"Balko, M., Cibulka, J., Valtr, P.: Drawing graphs using a small number of obstacles. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 360\u2013372. Springer, Heidelberg (2015). doi:\n                      10.1007\/978-3-319-27261-0_30"},{"key":"23_CR3","unstructured":"Berman, L.W., Chappell, G.G., Faudree, J.R., Gimbel, J., Hartman, C., Williams, G.I.: Graphs with obstacle number greater than one. Arxiv report \n                      arXiv.org\/abs\/1606.03782\n                      \n                     (2016)"},{"key":"23_CR4","unstructured":"Cardinal, J., Hoffmann, U.: Recognition and complexity of point visibility graphs. In: Arge, L., Pach, J. (eds.) Proceedings of the 31st International Symposium Computational Geometry (SoCG 2015), LIPIcs, vol. 34, pp. 171\u2013185. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2015)"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Chaplick, S., Lipp, F., Park, J.w., Wolff, A.: Obstructing visibilities with one obstacle. Arxiv report \n                      arXiv.org\/abs\/1607.00278v2\n                      \n                     (2016)","DOI":"10.1007\/978-3-319-50106-2_23"},{"key":"23_CR6","unstructured":"Dujmovi\u0107, V., Morin, P.: On obstacle numbers. Electr. J. Combin. 33(3), paper #P3.1, 7\u00a0p. (2015). \n                      arXiv.org\/abs\/1308.4321"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-1-4614-0110-0_13","volume-title":"Thirty Essays on Geometric Graph Theory","author":"R Fulek","year":"2013","unstructured":"Fulek, R., Saeedi, N., Sar\u0131\u00f6z, D.: Convex obstacle numbers of outerplanar graphs and bipartite permutation graphs. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory, pp. 249\u2013261. Springer, New York (2013)"},{"key":"23_CR8","unstructured":"Ghosh, S.K., Goswami, P.P.: Unsolved problems in visibility graphs of points, segments and polygons. Arxiv report \n                      arXiv.org\/abs\/1012.5187v4\n                      \n                     (2012)"},{"issue":"3","key":"23_CR9","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1006\/jagm.1995.1047","volume":"19","author":"MC Golumbic","year":"1995","unstructured":"Golumbic, M.C., Kaplan, H., Shamir, R.: Graph sandwich problems. J. Algorithms 19(3), 449\u2013473 (1995)","journal-title":"J. Algorithms"},{"key":"23_CR10","unstructured":"Johnson, M.P., Sar\u0131\u00f6z, D.: Representing a planar straight-line graph using few obstacles. In: Proceedings of the 26th Canadian Conference Computational Geometry (CCCG 2014), pp. 95\u201399 (2014). \n                      http:\/\/www.cccg.ca\/proceedings\/2014\/papers\/paper14.pdf"},{"key":"23_CR11","unstructured":"Koch, A., Krug, M., Rutter, I.: Graphs with plane outside-obstacle representations. Arxiv report \n                      arXiv.org\/abs\/1306.2978\n                      \n                     (2013)"},{"key":"23_CR12","unstructured":"Mukkamala, P., Pach, J., P\u00e1lv\u00f6lgyi, D.: Lower bounds on the obstacle number of graphs. Electr. J. Combin. 19(2), paper #P32, 8\u00a0p. (2012). \n                      http:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v19i2p32"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-642-16926-7_27","volume-title":"Graph Theoretic Concepts in Computer Science","author":"P Mukkamala","year":"2010","unstructured":"Mukkamala, P., Pach, J., Sar\u0131\u00f6z, D.: Graphs with large obstacle numbers. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol. 6410, pp. 292\u2013303. Springer, Heidelberg (2010). doi:\n                      10.1007\/978-3-642-16926-7_27"},{"issue":"3","key":"23_CR14","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s00373-011-1027-0","volume":"27","author":"J Pach","year":"2011","unstructured":"Pach, J., Sar\u0131\u00f6z, D.: On the structure of graphs with low obstacle number. Graphs Comb. 27(3), 465\u2013473 (2011). \n                      http:\/\/dx.doi.org\/10.1007\/s00373-011-1027-0","journal-title":"Graphs Comb."},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the 10th Annual ACM Symposium Theory Computing (STOC 1978), pp. 216\u2013226 (1978). \n                      http:\/\/dx.doi.org\/10.1145\/800133.804350","DOI":"10.1145\/800133.804350"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50106-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T00:41:45Z","timestamp":1600476105000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50106-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501055","9783319501062"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50106-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"8 December 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}