{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:30:59Z","timestamp":1760441459201,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319739144"},{"type":"electronic","value":"9783319739151"}],"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_7","type":"book-chapter","created":{"date-parts":[[2018,1,20]],"date-time":"2018-01-20T03:42:19Z","timestamp":1516419739000},"page":"81-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Grid-Obstacle Representations with Connections to Staircase Guarding"],"prefix":"10.1007","author":[{"given":"Therese","family":"Biedl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saeed","family":"Mehrabi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,21]]},"reference":[{"issue":"1\u20132","key":"7_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P Alimonti","year":"2000","unstructured":"Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theor. Comput. Sci. 237(1\u20132), 123\u2013134 (2000)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"7_CR2","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."},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s00454-010-9310-z","volume":"45","author":"T Biedl","year":"2011","unstructured":"Biedl, T.: Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs. Discrete Comput. Geom. 45(1), 141\u2013160 (2011)","journal-title":"Discrete Comput. Geom."},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-662-45803-7_32","volume-title":"Graph Drawing","author":"T Biedl","year":"2014","unstructured":"Biedl, T.: Height-preserving transformations of planar graph drawings. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 380\u2013391. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45803-7_32"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/10692760_11","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"T Biedl","year":"1998","unstructured":"Biedl, T., Kaufmann, M., Mutzel, P.: Drawing planar partitions II: HH-drawings. In: Hromkovi\u010d, J., S\u00fdkora, O. (eds.) WG 1998. LNCS, vol. 1517, pp. 124\u2013136. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/10692760_11"},{"key":"7_CR6","unstructured":"Bishnu, A., Ghosh, A., Mathew, R., Mishra, G., Paul, S.: Grid obstacle representations of graphs (2017). coRR report arXiv:1708.01765"},{"issue":"1\u20133","key":"7_CR7","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"BN Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Math. 86(1\u20133), 165\u2013177 (1990)","journal-title":"Discrete Math."},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0925-7721(92)90021-J","volume":"2","author":"P Crescenzi","year":"1992","unstructured":"Crescenzi, P., Di Battista, G., Piperno, A.: A note on optimal area algorithms for upward drawings of binary trees. Comput. Geom. 2, 187\u2013200 (1992)","journal-title":"Comput. Geom."},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Dujmovic, V., Morin, P.: On obstacle numbers. Electr. J. Comb. 22(3), P3.1 (2015)","DOI":"10.37236\/4373"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0925-7721(93)90013-V","volume":"2","author":"L Gewali","year":"1992","unstructured":"Gewali, L., Ntafos, S.C.: Covering grids and orthogonal polygons with periscope guards. Comput. Geom. 2, 309\u2013334 (1992)","journal-title":"Comput. Geom."},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0022-0000(90)90017-F","volume":"40","author":"R Motwani","year":"1990","unstructured":"Motwani, R., Raghunathan, A., Saran, H.: Covering orthogonal polygons with star polygons: the perfect graph approach. J. Comput. Syst. Sci. 40(1), 19\u201348 (1990)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"7_CR12","first-page":"80","volume":"26","author":"J Pach","year":"2016","unstructured":"Pach, J.: Graphs with no grid obstacle representation. Geombinatorics 26(2), 80\u201383 (2016)","journal-title":"Geombinatorics"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF02187706","volume":"1","author":"P Rosenstiehl","year":"1986","unstructured":"Rosenstiehl, P., Tarjan, R.E.: Rectilinear planar layouts and bipolar orientation of planar graphs. Discrete Comput. Geom. 1, 343\u2013353 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R Tamassia","year":"1986","unstructured":"Tamassia, R., Tollis, I.: A unified approach to visibility representations of planar graphs. Disc. Comput. Geom. 1, 321\u2013341 (1986)","journal-title":"Disc. Comput. Geom."},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Wismath, S.: Characterizing bar line-of-sight graphs. In: ACM Symposium on Computational Geometry (SoCG 1985), pp. 147\u2013152. ACM (1985)","DOI":"10.1145\/323233.323253"}],"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_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T11:22:25Z","timestamp":1710242545000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-73915-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319739144","9783319739151"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73915-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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"}]}}