{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T01:53:12Z","timestamp":1725846792674},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662491911"},{"type":"electronic","value":"9783662491928"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49192-8_11","type":"book-chapter","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T10:47:27Z","timestamp":1452163647000},"page":"134-147","source":"Crossref","is-referenced-by-count":2,"title":["L-Drawings of Directed Graphs"],"prefix":"10.1007","author":[{"given":"Patrizio","family":"Angelini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giordano","family":"Da Lozzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Di Bartolomeo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valentino","family":"Di Donato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Patrignani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincenzo","family":"Roselli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioannis G.","family":"Tollis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,8]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Angelini, P., Da Lozzo, G., Di Bartolomeo, M., Di Donato, V., Patrignani, M., Roselli, V., Tollis, I.G.: L-drawings of directed graphs. CoRR abs\/1509.00684 (2015)","DOI":"10.1007\/978-3-662-49192-8_11"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/3-540-63397-9_4","volume-title":"Algorithms \u2013 ESA 1997","author":"TC Biedl","year":"1997","unstructured":"Biedl, T.C., Kaufmann, M.: Area-efficient static and incremental graph drawings. In: Burkard, R., Woeginger, G. (eds.) ESA 1997. LNCS, vol. 1284, pp. 37\u201352. Springer, Heidelberg (1997)"},{"key":"11_CR3","volume-title":"Graph Drawing","author":"G Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Englewood Cliffs (1999)"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BFb0028251","volume-title":"Algorithms and Data Structures","author":"J D\u00edaz","year":"1991","unstructured":"D\u00edaz, J., Gibbons, A., Paterson, M., Toran, J.: The MINSUMCUT problem. In: Dehne, F., Sack, J., Santoro, N. (eds.) WADS 1991. LNCS, vol. 519, pp. 65\u201379. Springer, Heidelberg (1991)"},{"issue":"6","key":"11_CR5","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1017\/S0963548300004454","volume":"9","author":"J D\u00edaz","year":"2000","unstructured":"D\u00edaz, J., Penrose, M., Petit, J., Serna, M.: Convergence theorems for some layout measures on random lattice and random geometric graphs. Comb. Prob. Comput. 9(6), 489\u2013511 (2000)","journal-title":"Comb. Prob. Comput."},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/568522.568523","volume":"34","author":"J D\u00edaz","year":"2002","unstructured":"D\u00edaz, J., Petit, J., Serna, M.: A survey of graph layout problems. ACM Comput. Surv. 34(3), 313\u2013356 (2002)","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"31","DOI":"10.7155\/jgaa.00099","volume":"9","author":"M Dickerson","year":"2005","unstructured":"Dickerson, M., Eppstein, D., Goodrich, M.T., Meng, J.Y.: Confluent drawings: visualizing non-planar diagrams in a planar way. J. Graph Alg. Appl. 9(1), 31\u201352 (2005)","journal-title":"J. Graph Alg. Appl."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Didimo, W., Montecchiani, F., Pallas, E., Tollis, I.G.: How to visualize directed graphs: a user study. In: IISA 2014, pp. 152\u2013157. IEEE","DOI":"10.1109\/IISA.2014.6878777"},{"issue":"2","key":"11_CR9","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)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"11_CR10","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1057\/palgrave.ivs.9500092","volume":"4","author":"M Ghoniem","year":"2005","unstructured":"Ghoniem, M., Fekete, J., Castagliola, P.: On the readability of graphs using node-link and matrix-based representations: a controlled experiment and statistical analysis. Inf. Vis. 4(2), 114\u2013135 (2005)","journal-title":"Inf. Vis."},{"issue":"4","key":"11_CR11","doi-asserted-by":"publisher","first-page":"86","DOI":"10.4213\/dm506","volume":"9","author":"P Golovach","year":"1997","unstructured":"Golovach, P.: The total vertex separation number of a graph. Disk. Mat. 9(4), 86\u201391 (1997)","journal-title":"Disk. Mat."},{"issue":"1","key":"11_CR12","doi-asserted-by":"publisher","first-page":"87","DOI":"10.4213\/dm410","volume":"10","author":"P Golovach","year":"1998","unstructured":"Golovach, P., Fomin, F.: The total vertex separation number and the profile of graphs. Disk. Mat. 10(1), 87\u201394 (1998)","journal-title":"Disk. Mat."},{"key":"11_CR13","first-page":"65","volume":"2","author":"E Grinberg","year":"1966","unstructured":"Grinberg, E., Dambit, J.: Latviiskii Matematicheskii Ezhegodnik 2, 65\u201370 (1966). in Russian","journal-title":"Latviiskii Matematicheskii Ezhegodnik"},{"key":"11_CR14","unstructured":"Gurobi Optimization: Gurobi Optimizer. \n                      http:\/\/www.gurobi.com\/"},{"key":"11_CR15","volume-title":"Handbook of Graph Drawing and Visualization","author":"P Healy","year":"2013","unstructured":"Healy, P., Nikolov, N.S.: Hierarchical drawing algorithms. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization. CRC Press, Boca Raton (2013)"},{"issue":"6","key":"11_CR16","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1109\/TVCG.2007.70582","volume":"13","author":"N Henry","year":"2007","unstructured":"Henry, N., Fekete, J., McGuffin, M.J.: Nodetrix: a hybrid visualization of social networks. IEEE Trans. Vis. Comput. Graph. 13(6), 1302\u20131309 (2007)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"11_CR17","unstructured":"Huang, J., Kang, Z.: A genetic algorithm for the feedback set problems. In: ICPACE 2003 (2003)"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Huang, W., Hong, S., Eades, P.: Effects of crossing angles. In: PacificVis 2008. IEEE (2008)","DOI":"10.1109\/PACIFICVIS.2008.4475457"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-25878-7_24","volume-title":"Graph Drawing","author":"EM Kornaropoulos","year":"2011","unstructured":"Kornaropoulos, E.M., Tollis, I.G.: Overloaded orthogonal drawings. In: Speckmann, B. (ed.) GD 2011. LNCS, vol. 7034, pp. 242\u2013253. Springer, Heidelberg (2011)"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-642-36763-2_44","volume-title":"Graph Drawing","author":"EM Kornaropoulos","year":"2013","unstructured":"Kornaropoulos, E.M., Tollis, I.G.: DAGView: An Approach for Visualizing Large Graphs. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 499\u2013510. Springer, Heidelberg (2013)"},{"issue":"1","key":"11_CR21","first-page":"107","volume":"10","author":"Y Lin","year":"1994","unstructured":"Lin, Y., Yuan, J.: Profile minimization problem for matrices and graphs. Acta Mathematicae Applicatae Sinica. English Series. Yingyong. Shuxue Xuebao 10(1), 107\u2013112 (1994)","journal-title":"Shuxue Xuebao"},{"key":"11_CR22","unstructured":"Los Alamos Nat. Lab.: NetworkX. \n                      http:\/\/networkx.lanl.gov\/index.html"},{"issue":"2","key":"11_CR23","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K Sugiyama","year":"1981","unstructured":"Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst. Man Cybern. 11(2), 109\u2013125 (1981)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"11_CR24","unstructured":"yWorks: yEd Graph Editor. \n                      http:\/\/www.yworks.com\/en\/products\/yfiles\/yed\/"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2016: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49192-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T05:04:43Z","timestamp":1559365483000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49192-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662491911","9783662491928"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49192-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}