{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:13:39Z","timestamp":1778498019103,"version":"3.51.4"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319739144","type":"print"},{"value":"9783319739151","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-73915-1_6","type":"book-chapter","created":{"date-parts":[[2018,1,20]],"date-time":"2018-01-20T03:42:19Z","timestamp":1516419739000},"page":"67-80","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Obstacle Numbers of Planar Graphs"],"prefix":"10.1007","author":[{"given":"John","family":"Gimbel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0724-3729","authenticated-orcid":false,"given":"Patrice","family":"Ossona de Mendez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3102-4166","authenticated-orcid":false,"given":"Pavel","family":"Valtr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,21]]},"reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s00454-009-9233-8","volume":"44","author":"H Alpert","year":"2010","unstructured":"Alpert, H., Koch, C., Laison, J.D.: Obstacle numbers of graphs. Discrete Comput. Geom. 44(1), 223\u2013244 (2010)","journal-title":"Discrete Comput. Geom."},{"key":"6_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, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27261-0_30"},{"key":"6_CR3","doi-asserted-by":"crossref","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:1606.03782 (2016)","DOI":"10.7155\/jgaa.00452"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Chaplick, S., Lipp, F., Park, J., Wolff, A.: Obstructing visibilities with one obstacle. arXiv:1607.00278 (2016)","DOI":"10.1007\/978-3-319-50106-2_23"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"De Berg, M., Van Kreveld, M., Overmars, M., Schwarzkopf, O.C.: Computational geometry. In: Computational Geometry, pp. 1\u201317. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-3-540-77974-2_1","DOI":"10.1007\/978-3-540-77974-2_1"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Dujmovi\u0107, V., Morin, P.: On obstacle numbers. Electron. J. Combin 22(3), P3 (2013)","DOI":"10.37236\/4373"},{"key":"6_CR7","first-page":"229","volume":"II","author":"I F\u00e1ry","year":"1948","unstructured":"F\u00e1ry, I.: On straight line representation of planar graphs. Acta Scientiarum Mathematicarum (Szeged) II, 229\u2013233 (1948)","journal-title":"Acta Scientiarum Mathematicarum (Szeged)"},{"key":"6_CR8","unstructured":"de Fraysseix, H., Ossona de Mendez, P., Pach, J.: Representation of planar graphs by segments. In: Intuitive Geometry, vol. 63. Colloquia Mathematica Societatis J\u00e1nos Bolyai, pp. 109\u2013117. North-Holland (1991)"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/BF02574056","volume":"13","author":"H de Fraysseix","year":"1995","unstructured":"de Fraysseix, H., Ossona de Mendez, P., Pach, J.: A left-first search algorithm for planar graphs. Discrete Comput. Geom. 13, 459\u2013468 (1995)","journal-title":"Discrete Comput. Geom."},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: Small sets supporting Fary embeddings of planar graphs. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC 1988, pp. 426\u2013433. ACM, New York (1988)","DOI":"10.1145\/62212.62254"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H de Fraysseix","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10, 41\u201351 (1990)","journal-title":"Combinatorica"},{"key":"6_CR12","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/978-1-4614-0110-0_13","DOI":"10.1007\/978-1-4614-0110-0_13"},{"key":"6_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543340","volume-title":"Visibility Algorithms in the Plane","author":"SK Ghosh","year":"2007","unstructured":"Ghosh, S.K.: Visibility Algorithms in the Plane. Cambridge University Press, New York (2007)"},{"issue":"2","key":"6_CR14","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/2543581.2543589","volume":"46","author":"SK Ghosh","year":"2013","unstructured":"Ghosh, S.K., Goswami, P.P.: Unsolved problems in visibility graphs of points, segments, and polygons. ACM Comput. Surv. (CSUR) 46(2), 22 (2013)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: Intersection graphs of segments. J. Combin. Theory Ser. B 62(B)(2), 289\u2013315 (1994)","DOI":"10.1006\/jctb.1994.1071"},{"key":"6_CR16","doi-asserted-by":"crossref","DOI":"10.56021\/9780801866890","volume-title":"Graphs on Surfaces","author":"B Mohar","year":"2001","unstructured":"Mohar, B., Thomassen, C.: Graphs on Surfaces. The Johns Hopkins University Press, Baltimore (2001)"},{"key":"6_CR17","unstructured":"O\u2019Rourke, J.: Visibility. In: Handbook of Discrete and Computational Geometry, pp. 467\u2013479. CRC Press (1997)"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"O\u2019Rourke, J.: Open problems in the combinatorics of visibility and illumination. In: Advances in Discrete and Computational Geometry: Proceedings of the 1996 AMS-IMS-SIAM Joint Summer Research Conference, Discrete and Computational Geometry-Ten Years Later, 14\u201318 July 1996, Mount Holyoke College, vol. 223, p. 237. American Univ. in Cairo Press (1999)","DOI":"10.1090\/conm\/223\/03140"},{"issue":"3","key":"6_CR19","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 and Combinatorics 27(3), 465\u2013473 (2011)","journal-title":"Graphs and Combinatorics"},{"key":"6_CR20","unstructured":"Sar\u0131\u00f6z, D.: Approximating the obstacle number for a graph drawing efficiently. In: Proceedings of 23rd Canadian Conference on Computational Geometry, pp. 297\u2013302 (2011)"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Steinitz, E.: Polyeder und Raumeinteilungen. Teubner (1916)","DOI":"10.1515\/crll.1916.146.1"},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0021-9800(70)80007-2","volume":"8","author":"WT Tutte","year":"1970","unstructured":"Tutte, W.T.: Toward a theory of crossing numbers. J. Comb. Theory 8, 45\u201353 (1970)","journal-title":"J. Comb. Theory"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Urrutia, J.: Art gallery and illumination problems. In: Handbook of Computational Geometry, pp. 973\u20131027. North-Holland (2000)","DOI":"10.1016\/B978-044482537-7\/50023-1"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73915-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T11:22:21Z","timestamp":1710242541000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-73915-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319739144","9783319739151"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73915-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"21 January 2018","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":"Boston","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2017.ccis.northeastern.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}