{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:16:39Z","timestamp":1743110199283,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"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_16","type":"book-chapter","created":{"date-parts":[[2018,1,20]],"date-time":"2018-01-20T03:42:19Z","timestamp":1516419739000},"page":"184-196","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["EPG-representations with Small Grid-Size"],"prefix":"10.1007","author":[{"given":"Therese","family":"Biedl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Derka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vida","family":"Dujmovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pat","family":"Morin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,21]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/978-3-319-27261-0_39","volume-title":"Graph Drawing and Network Visualization","author":"MJ Alam","year":"2015","unstructured":"Alam, M.J., Bl\u00e4sius, T., Rutter, I., Ueckerdt, T., Wolff, A.: Pixel and Voxel Representations of Graphs. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 472\u2013486. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27261-0_39"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Seymour, P., Thomas, R.: A separator theorem for graphs with an excluded minor and its applications. In: Proceedings of the Twenty-second Annual ACM Symposium on Theory of Computing, STOC 1990, pp. 293\u2013299. ACM, New York (1990)","DOI":"10.1145\/100216.100254"},{"issue":"14","key":"16_CR3","doi-asserted-by":"publisher","first-page":"3174","DOI":"10.1016\/j.dam.2009.06.015","volume":"157","author":"A Asinowski","year":"2009","unstructured":"Asinowski, A., Suk, A.: Edge intersection graphs of systems of paths on a grid with a bounded number of bends. Discrete Appl. Math. 157(14), 3174\u20133180 (2009)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"16_CR4","first-page":"1","volume":"12","author":"T Biedl","year":"2010","unstructured":"Biedl, T., Stern, M.: Edge-intersection graphs of $$k$$-bend paths in grids. Discrete Math. Theor. Comput. Sci. 12(1), 1\u201312 (2010). (electronic journal)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"1\u20132","key":"16_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H Bodlaender","year":"1998","unstructured":"Bodlaender, H.: A partial k-arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209(1\u20132), 1\u201345 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR6","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53622-3","volume-title":"Graph Theory","author":"R Diestel","year":"2017","unstructured":"Diestel, R.: Graph Theory. GTM, vol. 173. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-53622-3"},{"key":"16_CR7","unstructured":"Dvorak, Z., Norin, S.: Treewidth of graphs with balanced separations. CoRR abs\/1408.3869 (2014)"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-642-40104-6_29","volume-title":"Algorithms and Data Structures","author":"D Epstein","year":"2013","unstructured":"Epstein, D., Golumbic, M.C., Morgenstern, G.: Approximation Algorithms for $$B_1$$-EPG Graphs. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 328\u2013340. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40104-6_29"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.dam.2016.07.007","volume":"215","author":"M Francis","year":"2016","unstructured":"Francis, M., Lahiri, A.: VPG and EPG bend-numbers of Halin graphs. Discrete Appl. Math. 215, 95\u2013105 (2016)","journal-title":"Discrete Appl. Math."},{"key":"16_CR10","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, 2nd edn. Academic Press, New York (2004)","edition":"2"},{"issue":"3","key":"16_CR11","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1002\/net.20305","volume":"54","author":"M Golumbic","year":"2009","unstructured":"Golumbic, M., Lipshteyn, M., Stern, M.: Edge intersection graphs of single bend paths on a grid. Networks 54(3), 130\u2013138 (2009)","journal-title":"Networks"},{"issue":"1","key":"16_CR12","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.jctb.2008.06.004","volume":"99","author":"M Grohe","year":"2009","unstructured":"Grohe, M., Marx, D.: On tree width, bramble size, and expansion. J. Comb. Theory, Ser. B 99(1), 218\u2013228 (2009)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.dam.2013.10.035","volume":"167","author":"D Heldt","year":"2014","unstructured":"Heldt, D., Knauer, K., Ueckerdt, T.: Edge-intersection graphs of grid paths: the bend-number. Discrete Appl. Math. 167, 144\u2013162 (2014)","journal-title":"Discrete Appl. Math."},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Leiserson, C.: Area-efficient graph layouts (for VLSI). In: IEEE Symposium on Foundations of Computer Science (FOCS 1980), pp. 270\u2013281 (1980)","DOI":"10.1109\/SFCS.1980.13"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Marcus, A., Spielman, D., Srivastava, N.: Interlacing families I: bipartite Ramanujan graphs of all degrees. In: Symposium on Foundations of Computer Science, FOCS. pp. 529\u2013537. IEEE Computer Society (2013)","DOI":"10.1109\/FOCS.2013.63"},{"issue":"4","key":"16_CR16","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00453-009-9312-5","volume":"59","author":"I Markov","year":"2011","unstructured":"Markov, I., Shi, Y.: Constant-degree graph expansions that preserve treewidth. Algorithmica 59(4), 461\u2013470 (2011)","journal-title":"Algorithmica"},{"key":"16_CR17","unstructured":"Mehrabi, S.: Approximation algorithms for independence and domination on $$B_1$$-VPG and $$B_1$$-EPG-graphs. CoRR abs\/1702.05633 (2017)"}],"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_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T11:23:11Z","timestamp":1710242591000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-73915-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319739144","9783319739151"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73915-1_16","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"}]}}