{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:03:57Z","timestamp":1743087837874,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"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_34","type":"book-chapter","created":{"date-parts":[[2018,1,20]],"date-time":"2018-01-20T03:42:19Z","timestamp":1516419739000},"page":"440-453","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity"],"prefix":"10.1007","author":[{"given":"Boris","family":"Klemz","sequence":"first","affiliation":[]},{"given":"G\u00fcnter","family":"Rote","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,21]]},"reference":[{"key":"34_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-319-50106-2_37","volume-title":"Graph Drawing and Network Visualization","author":"P Angelini","year":"2016","unstructured":"Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., Rutter, I.: Beyond level planarity. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 482\u2013495. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50106-2_37"},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2014.12.019","volume":"571","author":"P Angelini","year":"2015","unstructured":"Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F., Roselli, V.: The importance of being proper: (in clustered-level planarity and T-level planarity). Theor. Comput. Sci. 571, 1\u20139 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2014.12.019","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"34_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.7155\/jgaa.00100","volume":"9","author":"C Bachmaier","year":"2005","unstructured":"Bachmaier, C., Brandenburg, F., Forster, M.: Radial level planarity testing and embedding in linear time. J. Graph Algorithms Appl. 9(1), 53\u201397 (2005). http:\/\/jgaa.info\/accepted\/2005\/BachmaierBrandenburgForster2005.9.1.pdf","journal-title":"J. Graph Algorithms Appl."},{"key":"34_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-540-87744-8_12","volume-title":"Algorithms - ESA 2008","author":"C Bachmaier","year":"2008","unstructured":"Bachmaier, C., Brunner, W.: Linear time planarity testing and embedding of strongly connected cyclic level graphs. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 136\u2013147. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87744-8_12"},{"issue":"3","key":"34_CR5","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. Geometry Appl. 22(3), 187\u2013206 (2012). http:\/\/www.worldscinet.com\/doi\/abs\/10.1142\/S0218195912500045","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"34_CR6","doi-asserted-by":"publisher","unstructured":"Br\u00fcckner, G., Rutter, I.: Partial and constrained level planarity. In: Klein, P.N. (ed.) Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, 16\u201319 January, pp. 2000\u20132011. SIAM (2017). https:\/\/doi.org\/10.1137\/1.9781611974782","DOI":"10.1137\/1.9781611974782"},{"issue":"6","key":"34_CR7","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1109\/21.23105","volume":"18","author":"G Di Battista","year":"1988","unstructured":"Di Battista, G., Nardelli, E.: Hierarchies and planarity theory. IEEE Trans. Syst. Man Cybern. 18(6), 1035\u20131046 (1988). https:\/\/doi.org\/10.1109\/21.23105","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"34_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-540-24618-3_18","volume-title":"SOFSEM 2004: Theory and Practice of Computer Science","author":"M Forster","year":"2004","unstructured":"Forster, M., Bachmaier, C.: Clustered level planarity. In: Van Emde Boas, P., Pokorn\u00fd, J., Bielikov\u00e1, M., \u0160tuller, J. (eds.) SOFSEM 2004. LNCS, vol. 2932, pp. 218\u2013228. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24618-3_18"},{"key":"34_CR9","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-1-4614-0110-0_14","volume-title":"Thirty Essays on Geometric Graph Theory","author":"R Fulek","year":"2013","unstructured":"Fulek, R., Pelsmajer, M.J., Schaefer, M., \u0160tefankovi\u010d, D.: Hanani-Tutte, monotone drawings, and level-planarity. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory, pp. 263\u2013287. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-0110-0_14"},{"issue":"2","key":"34_CR10","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/S0097539794277123","volume":"31","author":"A Garg","year":"2001","unstructured":"Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM J. Comput. 31(2), 601\u2013625 (2001). https:\/\/doi.org\/10.1137\/S0097539794277123","journal-title":"SIAM J. Comput."},{"issue":"8","key":"34_CR11","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1016\/j.comgeo.2013.04.003","volume":"46","author":"ED Giacomo","year":"2013","unstructured":"Giacomo, E.D., Frati, F., Fulek, R., Grilli, L., Krug, M.: Orthogeodesic point-set embedding of trees. Comput. Geom. 46(8), 929\u2013944 (2013). https:\/\/doi.org\/10.1016\/j.comgeo.2013.04.003","journal-title":"Comput. Geom."},{"key":"34_CR12","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.jda.2012.04.012","volume":"16","author":"ED Giacomo","year":"2012","unstructured":"Giacomo, E.D., Grilli, L., Krug, M., Liotta, G., Rutter, I.: Hamiltonian orthogeodesic alternating paths. J. Discrete Algorithms 16, 34\u201352 (2012). https:\/\/doi.org\/10.1016\/j.jda.2012.04.012","journal-title":"J. Discrete Algorithms"},{"key":"34_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/BFb0021813","volume-title":"Graph Drawing","author":"LS Heath","year":"1996","unstructured":"Heath, L.S., Pemmaraju, S.V.: Recognizing leveled-planar dags in linear time. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 300\u2013311. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0021813"},{"key":"34_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-63938-1_62","volume-title":"Graph Drawing","author":"M J\u00fcnger","year":"1997","unstructured":"J\u00fcnger, M., Leipert, S., Mutzel, P.: Pitfalls of using PQ-trees in automatic graph drawing. In: DiBattista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 193\u2013204. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63938-1_62"},{"key":"34_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/3-540-37623-2_17","volume-title":"Graph Drawing","author":"M J\u00fcnger","year":"1998","unstructured":"J\u00fcnger, M., Leipert, S., Mutzel, P.: Level planarity testing in linear time. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 224\u2013237. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-37623-2_17"},{"key":"34_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-11805-0_21","volume-title":"Graph Drawing","author":"B Katz","year":"2010","unstructured":"Katz, B., Krug, M., Rutter, I., Wolff, A.: Manhattan-geodesic embedding of planar graphs. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 207\u2013218. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11805-0_21"},{"key":"34_CR17","unstructured":"Klemz, B., Rote, G.: Ordered level planarity, geodesic planarity and Bi-Monotonicity. CoRR abs\/1708.07428 (2017). https:\/\/arxiv.org\/abs\/1708.07428"},{"issue":"16\u201317","key":"34_CR18","doi-asserted-by":"publisher","first-page":"2349","DOI":"10.1016\/j.dam.2012.05.028","volume":"160","author":"A Wotzlaw","year":"2012","unstructured":"Wotzlaw, A., Speckenmeyer, E., Porschen, S.: Generalized k-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation. Discrete Appl. Math. 160(16\u201317), 2349\u20132363 (2012). https:\/\/doi.org\/10.1016\/j.dam.2012.05.028","journal-title":"Discrete Appl. Math."}],"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_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T11:25:11Z","timestamp":1710242711000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-73915-1_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319739144","9783319739151"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73915-1_34","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"}]}}