{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T17:26:07Z","timestamp":1725643567603},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258770"},{"type":"electronic","value":"9783642258787"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-25878-7_24","type":"book-chapter","created":{"date-parts":[[2011,12,15]],"date-time":"2011-12-15T02:23:04Z","timestamp":1323915784000},"page":"242-253","source":"Crossref","is-referenced-by-count":7,"title":["Overloaded Orthogonal Drawings"],"prefix":"10.1007","author":[{"given":"Evgenios M.","family":"Kornaropoulos","sequence":"first","affiliation":[]},{"given":"Ioannis G.","family":"Tollis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"8","key":"24_CR1","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1109\/12.868028","volume":"49","author":"P. Bertolazzi","year":"2000","unstructured":"Bertolazzi, P., Di Battista, G., Didimo, W.: Computing orthogonal drawings with the minimum number of bends. IEEE Transactions on Computers\u00a049(8), 826\u2013840 (2000)","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"24_CR2","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0925-7721(97)00026-6","volume":"9","author":"T. Biedl","year":"1998","unstructured":"Biedl, T., Kant, G.: A better heuristic for orthogonal graph drawings. Computational Geometry: Theory and Applications\u00a09(3), 159\u2013180 (1998)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"6","key":"24_CR3","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1142\/S0218195900000310","volume":"10","author":"T.C. Biedl","year":"2000","unstructured":"Biedl, T.C., Madden, B.P., Tollis, I.G.: The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing. Int. J. Comput. Geometry Appl.\u00a010(6), 553\u2013580 (2000)","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"24_CR4","volume-title":"Graph Drawing: Algorithms for the Visualization of graphs","author":"G. Battista Di","year":"1998","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of graphs. Prentice - Hall, New Jersey (1998)"},{"issue":"4","key":"24_CR5","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF02187850","volume":"7","author":"G. Battista Di","year":"1992","unstructured":"Di Battista, G., Tamassia, R., Tollis, I.G.: Area Requirement and Symmetry Display of Planar Upward Drawings. Discrete and Comput. Geom.\u00a07(4), 381\u2013401 (1992)","journal-title":"Discrete and Comput. Geom."},{"issue":"1","key":"24_CR6","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: Vizualizing Non-planar Diagrams in a Planar Way. Journal of Graph Algorithms and Applications\u00a09(1), 31\u201352 (2005)","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"4","key":"24_CR7","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s00453-006-0159-8","volume":"47","author":"D. Eppstein","year":"2007","unstructured":"Eppstein, D., Goodrich, M.T., Meng, J.Y.: Confluent Layered Drawings. Algorithmica\u00a047(4), 439\u2013452 (2007)","journal-title":"Algorithmica"},{"issue":"3","key":"24_CR8","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/0304-3975(76)90086-4","volume":"2","author":"S. Even","year":"1976","unstructured":"Even, S., Tarjan, R.: Computing an st-numbering. Theoretical Computer Science\u00a02(3), 339\u2013344 (1976)","journal-title":"Theoretical Computer Science"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/3-540-63938-1_57","volume-title":"Graph Drawing","author":"U. F\u00f6\u00dfmeier","year":"1997","unstructured":"F\u00f6\u00dfmeier, U., Kaufmann, M.: Algorithms and Area Bounds for Nonplanar Orthogonal Drawings. In: DiBattista, G. (ed.) GD 1997. LNCS, vol.\u00a01353, pp. 134\u2013145. Springer, Heidelberg (1997)"},{"key":"24_CR10","unstructured":"Kornaropoulos, E.M., Tollis, I.G.: Weak Dominance Drawings and Linear Extension Diameter, arXiv:1108.1439 (2011)"},{"key":"24_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92106-2","volume-title":"Combinatorial algorithms for integrated circuit layout","author":"T. Lengauer","year":"1990","unstructured":"Lengauer, T.: Combinatorial algorithms for integrated circuit layout. John Wiley & Sons, Inc., New York (1990)"},{"issue":"6","key":"24_CR12","doi-asserted-by":"publisher","first-page":"1583","DOI":"10.1093\/ietfec\/e88-a.6.1583","volume":"E88-A","author":"K. Nomura","year":"2005","unstructured":"Nomura, K., Tayu, S., Ueno, S.: On the Orthogonal Drawing of Outerplanar Graphs. Journal IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences\u00a0E88-A(6), 1583\u20131588 (2005)","journal-title":"Journal IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"},{"issue":"1","key":"24_CR13","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/s004539910006","volume":"26","author":"A. Papakostas","year":"2000","unstructured":"Papakostas, A., Tollis, I.G.: Efficient Orthogonal Drawings of High Degree Graphs. Algorithmica\u00a026(1), 100\u2013125 (2000)","journal-title":"Algorithmica"},{"issue":"1-2","key":"24_CR14","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0925-7721(97)00017-5","volume":"9","author":"A. Papakostas","year":"1998","unstructured":"Papakostas, A., Tollis, I.G.: Algorithms for Area-Efficient Orthogonal Drawings. Computational Geometry Theory and Applications\u00a09(1-2), 83\u2013110 (1998)","journal-title":"Computational Geometry Theory and Applications"},{"issue":"2-3","key":"24_CR15","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.tcs.2008.08.012","volume":"408","author":"C. Papamanthou","year":"2008","unstructured":"Papamanthou, C., Tollis, I.G.: Algorithms for computing a parameterized st-orientation. Theoretical Computer Science\u00a0408(2-3), 224\u2013240 (2008)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"24_CR16","doi-asserted-by":"publisher","first-page":"337","DOI":"10.7155\/jgaa.00210","volume":"14","author":"C. Papamanthou","year":"2010","unstructured":"Papamanthou, C., Tollis, I.G.: Applications of Parameterized st-Orientations. Journal of Graph Algorithms and Applications\u00a014(2), 337\u2013365 (2010)","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"4","key":"24_CR17","doi-asserted-by":"publisher","first-page":"335","DOI":"10.7155\/jgaa.00074","volume":"7","author":"S. Rahman","year":"2003","unstructured":"Rahman, S., Nishizeki, T., Naznin, M.: Orthogonal Drawings of Plane Graphs Without Bends. Journal of Graph Algorithms and Applications\u00a07(4), 335\u2013362 (2003)","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"2","key":"24_CR18","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/net.3230140202","volume":"14","author":"J. Storer","year":"1984","unstructured":"Storer, J.: On minimal node-cost planar embeddings. Networks\u00a014(2), 181\u2013212 (1984)","journal-title":"Networks"},{"issue":"3","key":"24_CR19","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R. Tamassia","year":"1987","unstructured":"Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAM J. Computing\u00a016(3), 421\u2013444 (1987)","journal-title":"SIAM J. Computing"},{"issue":"9","key":"24_CR20","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1109\/31.34669","volume":"36","author":"R. Tamassia","year":"1989","unstructured":"Tamassia, R., Tollis, I.G.: Planar Grid Embeddings in Linear Time. IEEE Transactions on Circuits and Systems\u00a036(9), 1230\u20131234 (1989)","journal-title":"IEEE Transactions on Circuits and Systems"},{"issue":"11","key":"24_CR21","first-page":"1235","volume":"30","author":"L. Vismara","year":"2000","unstructured":"Vismara, L., Di Battista, G., Garg, A., Liotta, G., Tamassia, R., Vargiu, F.: Experimental studies on graph drawing algorithms. Software: Practice and Experience\u00a030(11), 1235\u20131284 (2000)","journal-title":"Software: Practice and Experience"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25878-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,28]],"date-time":"2020-06-28T21:15:23Z","timestamp":1593378923000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25878-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642258770","9783642258787"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25878-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}