{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:36:16Z","timestamp":1743086176318,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"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_1","type":"book-chapter","created":{"date-parts":[[2018,1,20]],"date-time":"2018-01-20T03:42:19Z","timestamp":1516419739000},"page":"3-16","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Aligned Drawings of Planar Graphs"],"prefix":"10.1007","author":[{"given":"Tamara","family":"Mchedlidze","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcel","family":"Radermacher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,21]]},"reference":[{"key":"1_CR1","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"},{"issue":"4","key":"1_CR2","doi-asserted-by":"publisher","first-page":"1935","DOI":"10.1137\/130924172","volume":"28","author":"J Cano","year":"2014","unstructured":"Cano, J., T\u00f3th, C.D., Urrutia, J.: Upper bound constructions for untangling planar geometric graphs. SIAM J. Discrete Math. 28(4), 1935\u20131943 (2014)","journal-title":"SIAM J. Discrete Math."},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-319-50106-2_14","volume-title":"Graph Drawing and Network Visualization","author":"S Chaplick","year":"2016","unstructured":"Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., Wolff, A.: Drawing graphs on few lines and few planes. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 166\u2013180. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50106-2_14"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-319-62127-2_23","volume-title":"Algorithms and Data Structures","author":"S Chaplick","year":"2017","unstructured":"Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., Wolff, A.: The complexity of drawing graphs on few lines and few planes. Algorithms and Data Structures. LNCS, vol. 10389, pp. 265\u2013276. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62127-2_23"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-319-50106-2_13","volume-title":"Graph Drawing and Network Visualization","author":"G Da Lozzo","year":"2016","unstructured":"Da Lozzo, G., Dujmovi\u0107, V., Frati, F., Mchedlidze, T., Roselli, V.: Drawing planar graphs with many collinear vertices. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 152\u2013165. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50106-2_13"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-319-27261-0_27","volume-title":"Graph Drawing and Network Visualization","author":"V Dujmovi\u0107","year":"2015","unstructured":"Dujmovi\u0107, V.: The utility of untangling. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 321\u2013332. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27261-0_27"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-18469-7_16","volume-title":"Graph Drawing","author":"V Dujmovi\u0107","year":"2011","unstructured":"Dujmovi\u0107, V., Evans, W., Kobourov, S., Liotta, G., Weibel, C., Wismath, S.: On graphs supported by line sets. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 177\u2013182. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18469-7_16"},{"issue":"1","key":"1_CR8","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/s00454-012-9464-y","volume":"49","author":"V Dujmovi\u0107","year":"2013","unstructured":"Dujmovi\u0107, V., Langerman, S.: A center transversal theorem for hyperplanes and applications to graph drawing. Discrete Comput. Geom. 49(1), 74\u201388 (2013)","journal-title":"Discrete Comput. Geom."},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-62592-5_66","volume-title":"Algorithms and Complexity","author":"U F\u00f6\u00dfmeier","year":"1997","unstructured":"F\u00f6\u00dfmeier, U., Kaufmann, M.: Nice drawings for planar bipartite graphs. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds.) CIAC 1997. LNCS, vol. 1203, pp. 122\u2013134. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-62592-5_66"},{"issue":"3","key":"1_CR10","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0097-3165(80)90038-2","volume":"29","author":"JE Goodman","year":"1980","unstructured":"Goodman, J.E., Pollack, R.: Proof of Gr\u00fcnbaum\u2019s conjecture on the stretchability of certain arrangements of pseudolines. J. Comb. Theory Ser. A 29(3), 385\u2013390 (1980)","journal-title":"J. Comb. Theory Ser. A"},{"key":"1_CR11","first-page":"256","volume":"78","author":"F Levi","year":"1926","unstructured":"Levi, F.: Die Teilung der projektiven Ebene durch Gerade oder Pseudogerade. Ber. Math.-Phys. Kl. S\u00e4chs. Akad. Wiss 78, 256\u2013267 (1926)","journal-title":"Ber. Math.-Phys. Kl. S\u00e4chs. Akad. Wiss"},{"key":"1_CR12","unstructured":"Mchedlidze, T., Radermacher, M., Rutter, I.: Aligned Drawings of Planar Graphs (2017). https:\/\/arxiv.org\/abs\/1708.08778v2"},{"key":"1_CR13","unstructured":"Mchedlidze, T., Radermacher, M., Rutter, I.: Aligned drawings of planar graphs. In: Proceedings of the 33rd European Workshop on Computational Geometry (EuroCG 2017) (2017)"},{"key":"1_CR14","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/BFb0082792","volume-title":"Topology and Geometry \u2014 Rohlin Seminar","author":"NE Mnev","year":"1988","unstructured":"Mnev, N.E.: The universality theorems on the classification problem of configuration varieties and convex polytopes varieties. In: Viro, O.Y., Vershik, A.M. (eds.) Topology and Geometry \u2014 Rohlin Seminar. LNM, vol. 1346, pp. 527\u2013543. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/BFb0082792"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Shor, P.: Stretchability of pseudolines is NP-hard. In: Applied Geometry and Discrete Mathematics-The Victor Klee Festschrift, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 4, pp. 531\u2013554. American Mathematical Society (1991)","DOI":"10.1090\/dimacs\/004\/41"},{"key":"1_CR16","unstructured":"Wahlstr\u00f6m, M.: Abusing the Tutte matrix: an algebraic instance compression for the K-set-cycle problem. In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, pp. 341\u2013352 (2013)"}],"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_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T11:21:45Z","timestamp":1710242505000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-73915-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319739144","9783319739151"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73915-1_1","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"}]}}