{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:55Z","timestamp":1761611215609},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001584"},{"type":"electronic","value":"9783540361510"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36151-0_7","type":"book-chapter","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T12:14:14Z","timestamp":1195215254000},"page":"66-73","source":"Crossref","is-referenced-by-count":2,"title":["Computing Labeled Orthogonal Drawings"],"prefix":"10.1007","author":[{"given":"Carla","family":"Binucci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maddalena","family":"Nonato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"7_CR1","unstructured":"C. Binucci, W. Didimo, G. Liotta, and M. Nonato. Computing labeled orthogonal drawings, manuscript: \n                    http:\/\/www.diei.unipg.it\/PAG PERS\/binucci\/binucci.htm\n                    \n                  ."},{"key":"7_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/3-540-45848-4_12","volume-title":"Labeling heuristics for orthogonal drawings","author":"C. Binucci","year":"2002","unstructured":"C. Binucci, W. Didimo, G. Liotta, and M. Nonato. Labeling heuristics for orthogonal drawings. In Symposium on Graph Drawing (GD\u201901), volume 2265 of LNCS, pages 139\u2013153, 2002."},{"key":"7_CR3","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S0925-7721(99)00054-1","volume":"16","author":"S. Bridgeman","year":"2000","unstructured":"S. Bridgeman, G. D. Battista, W. Didimo, G. Liotta, R. Tamassia, and L. Vismara. Turn-regularity and optimal area drawings of orthogonal representations. Computational Geometry: Theory and Applications, 16:53\u201393, 2000.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"7_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/3-540-44541-2_13","volume-title":"An algorithmic framework for visualizing statecharts","author":"R. Castello","year":"2001","unstructured":"R. Castello, R. Milli, and I. Tollis. An algorithmic framework for visualizing statecharts. In Symposium on Graph Drawing (GD\u201900), volume 1984 of LNCS, pages 139\u2013149, 2001."},{"key":"7_CR5","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999."},{"key":"7_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0067364","volume-title":"Graph Theory","author":"F. Harary","year":"1972","unstructured":"F. Harary. Graph Theory. Addison-Wesley, Reading, MA, 1972."},{"key":"7_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/3-540-63938-1_60","volume-title":"An algorithm for labeling edges of hierarchical drawings","author":"K. G. Kakoulis","year":"1997","unstructured":"K. G. Kakoulis and I. G. Tollis. An algorithm for labeling edges of hierarchical drawings. In Symposium on Graph Drawing (GD\u201997), volume 1353 of LNCS, pages 169\u2013180, 1998."},{"key":"7_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0925-7721(00)00025-0","volume":"18","author":"K. G. Kakoulis","year":"2001","unstructured":"K. G. Kakoulis and I. G. Tollis. On the complexity of the edge label placement problem. Computational Geometry: Theory and Applications, 18:1\u201317, 2001.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"M. Kaufmann and D. Wagner. Drawing Graphs. Springer Verlag, 2001.","DOI":"10.1007\/3-540-44969-8"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"G. Klau and P. Mutzel. Optimal labeling of point features in rectangular labeling models. Mathematical Programming, Series B, To appear.","DOI":"10.1007\/s10107-002-0327-9"},{"key":"7_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/3-540-46648-7_3","volume-title":"Combining graph labeling and compaction","author":"G. Klau","year":"1999","unstructured":"G. Klau and P. Mutzel. Combining graph labeling and compaction. In Symposium on Graph Drawing (GD\u201999), LNCS, pages 27\u201337, 1999."},{"key":"7_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/3-540-48777-8_23","volume-title":"Integer Programming and Combinatorial Optimization (IPCO\u201999)","author":"G. Klau","year":"1999","unstructured":"G. Klau and P. Mutzel. Optimal compaction of orthogonal grid drawings. In Integer Programming and Combinatorial Optimization (IPCO\u201999), volume 1610 of LNCS, pages 304\u2013319, 1999."},{"key":"7_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/3-540-44968-X_34","volume-title":"Optimal labelling of point features in the sliding model","author":"G. Klau","year":"2000","unstructured":"G. Klau and P. Mutzel. Optimal labelling of point features in the sliding model. In In Proc. COCOON\u201900, volume 1858 of LNCS, pages 340\u2013350, 2001."},{"key":"7_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/3-540-44541-2_9","volume-title":"Labeling points with rectangles of various shape","author":"S. Nakano","year":"2001","unstructured":"S. Nakano, T. Nishizeki, T. Tokuyama, and S. Watanabe. Labeling points with rectangles of various shape. In Symposium on Graph Drawing (GD\u201900), volume 1984 of LNCS, pages 91\u2013102, 2001."},{"key":"7_CR15","unstructured":"T. Nishizeki and N. Chiba. Planar Graphs: Theory and Algorithms, volume 32 of Annals of Discrete Mathematics. North-Holland, 1988."},{"key":"7_CR16","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0925-7721(01)00010-4","volume":"19","author":"M. Patrignani","year":"2001","unstructured":"M. Patrignani. On the complexity of orthogonal compaction. Computational Geometry: Theory and Applications, 19:47\u201367, 2001.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"7_CR17","unstructured":"T. Strijk and A. Wol.. The map labeling bibliography. on-line: \n                    http:\/\/www.mathinf. uni-greifswald.de\/map-labeling\/bibliography\/\n                    \n                  ."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36151-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T12:18:34Z","timestamp":1551097114000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36151-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001584","9783540361510"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-36151-0_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}