{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:32:52Z","timestamp":1743028372654,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"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_12","type":"book-chapter","created":{"date-parts":[[2016,12,7]],"date-time":"2016-12-07T15:22:42Z","timestamp":1481124162000},"page":"144-151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Snapping Graph Drawings to the Grid Optimally"],"prefix":"10.1007","author":[{"given":"Andre","family":"L\u00f6ffler","sequence":"first","affiliation":[]},{"given":"Thomas C.","family":"van Dijk","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,8]]},"reference":[{"key":"12_CR1","series-title":"International Series in Operations Research and Management Science","volume-title":"Feasibility and Infeasibility in Optimization: Algorithms and Computational Methods","author":"JW Chinneck","year":"2008","unstructured":"Chinneck, J.W.: Feasibility and Infeasibility in Optimization: Algorithms and Computational Methods. International Series in Operations Research and Management Science, vol. 118. Springer, Heidelberg (2008)"},{"issue":"1","key":"12_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0925-7721(98)00016-9","volume":"11","author":"M Chrobak","year":"1998","unstructured":"Chrobak, M., Nakano, S.-I.: Minimum-width grid drawings of plane graphs. Comput. Geom. 11(1), 29\u201354 (1998)","journal-title":"Comput. Geom."},{"issue":"3","key":"12_CR3","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.comgeo.2006.03.002","volume":"36","author":"M de Berg","year":"2007","unstructured":"de Berg, M., Halperin, D., Overmars, M.: An intersection-sensitive algorithm for snap rounding. Comput. Geom. 36(3), 159\u2013165 (2007)","journal-title":"Comput. Geom."},{"issue":"03","key":"12_CR4","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1142\/S0218195912500045","volume":"22","author":"M de Berg","year":"2012","unstructured":"de Berg, M., Khosravi, A.: Optimal binary space partitions for segments in the plane. Int. J. Comput. Geom. Appl. 22(03), 187\u2013205 (2012)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"1","key":"12_CR5","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(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"key":"12_CR6","volume-title":"Concrete Mathematics\u2013A Foundation for Computer Science","author":"RL Graham","year":"1994","unstructured":"Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics\u2013A Foundation for Computer Science. Addison-Wesley, Reading (1994)"},{"issue":"2","key":"12_CR7","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1142\/S0218195998000096","volume":"8","author":"LJ Guibas","year":"1998","unstructured":"Guibas, L.J., Marimont, D.H.: Rounding arrangements dynamically. Int. J. Comput. Geom. Appl. 8(2), 157\u2013178 (1998)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-319-03841-4_39","volume-title":"Graph Drawing","author":"S Kieffer","year":"2013","unstructured":"Kieffer, S., Dwyer, T., Marriott, K., Wybrow, M.: Incremental grid-like layout using soft and hard constraints. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 448\u2013459. Springer, Heidelberg (2013). doi:\n                      10.1007\/978-3-319-03841-4_39"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-540-77537-9_21","volume-title":"Graph Drawing","author":"M Krug","year":"2008","unstructured":"Krug, M., Wagner, D.: Minimizing the area for planar straight-line grid drawings. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol. 4875, pp. 207\u2013212. Springer, Heidelberg (2008). doi:\n                      10.1007\/978-3-540-77537-9_21"},{"doi-asserted-by":"crossref","unstructured":"L\u00f6ffler, A., van Dijk, T.C., Wolff, A.: Snapping graph drawings to the grid optimally. Arxiv report \n                      arXiv.org\/abs\/1608.08844\n                      \n                     (2016)","key":"12_CR10","DOI":"10.1007\/978-3-319-50106-2_12"},{"unstructured":"McCarl, B.A., Spreen, T.H.: Applied mathematical programming using algebraic systems. Texas A&M University (1997)","key":"12_CR11"},{"unstructured":"N\u00f6llenburg, M.: Automated drawing of metro maps. Master\u2019s thesis, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe (2005). \n                      http:\/\/www.ubka.uni-karlsruhe.de\/indexer-vvv\/ira\/2005\/25","key":"12_CR12"},{"issue":"5","key":"12_CR13","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1109\/TVCG.2010.81","volume":"17","author":"M N\u00f6llenburg","year":"2011","unstructured":"N\u00f6llenburg, M., Wolff, A.: Drawing and labeling high-quality metro maps by mixed-integer programming. IEEE Trans. Visual. Comput. Graphics 17(5), 626\u2013641 (2011)","journal-title":"IEEE Trans. Visual. Comput. Graphics"},{"unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Proceedings of 1st ACM-SIAM Symposium on Discrete Algorithms (SODA 1990), pp. 138\u2013148 (1990)","key":"12_CR14"},{"issue":"52","key":"12_CR15","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"WT Tutte","year":"1963","unstructured":"Tutte, W.T.: How to draw a graph. Proc. London Math. Soc. 13(52), 743\u2013768 (1963)","journal-title":"Proc. London Math. Soc."},{"issue":"1","key":"12_CR16","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s00450-007-0036-y","volume":"22","author":"A Wolff","year":"2007","unstructured":"Wolff, A.: Drawing subway maps: A survey. Informatik - Forschung & Entwicklung 22(1), 23\u201344 (2007)","journal-title":"Informatik - Forschung & Entwicklung"}],"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_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T00:40:46Z","timestamp":1600476046000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50106-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501055","9783319501062"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50106-2_12","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"}]}}