{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T17:10:00Z","timestamp":1726506600431},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433095"},{"type":"electronic","value":"9783540458487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45848-4_12","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T14:47:53Z","timestamp":1186843673000},"page":"139-153","source":"Crossref","is-referenced-by-count":2,"title":["Labeling Heuristics for Orthogonal Drawings"],"prefix":"10.1007","author":[{"given":"Carla","family":"Binucci","sequence":"first","affiliation":[]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Maddalena","family":"Nonato","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,2,21]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"P. Bertolazzi, G. Di Battista, and W. Didimo. Computing orthogonal drawings with the minimum numbr of bends. IEEE Transactions on Computers, 49(8), 2000.","DOI":"10.1109\/12.868028"},{"key":"12_CR2","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 frameworkfor visualizing statecharts","author":"R. Castello","year":"2001","unstructured":"R. Castello, R. Milli, and I. Tollis. An algorithmic frameworkfor visualizing statecharts. In Proc. GD\u2019 00, volume 1984 of LNCS, pages 139\u2013149, 2001."},{"key":"12_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/3-540-46648-7_31","volume-title":"Orthogonal and quasi-upward drawings with vertices of arbitrary size","author":"G. Battista Di","year":"1999","unstructured":"G. Di Battista, W. Didimo, M. Patrignani, and M. Pizzonia. Orthogonal and quasi-upward drawings with vertices of arbitrary size. In Proc. GD\u2019 99, volume 1731 of LNCS, pages 297\u2013310, 2000."},{"key":"12_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46648-7_31","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999."},{"key":"12_CR5","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0925-7721(96)00005-3","volume":"7","author":"G. Battista Di","year":"1997","unstructured":"G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of four graph drawing algorithms. Comput. Geom.Theory Appl., 7:303\u2013325, 1997.","journal-title":"Comput. Geom.Theory Appl."},{"key":"12_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1007\/3-540-37623-2_27","volume-title":"Edge labeling in the graph layout toolkit","author":"U. Dogrusoz","year":"1998","unstructured":"U. Dogrusoz, K. G. Kakoulis, B. Madden, and I. G. Tollis. Edge labeling in the graph layout toolkit. In Proc. GD\u2019 98, volume 1547 of LNCS, pages 356\u2013363, 1999."},{"key":"12_CR7","first-page":"109","volume":"6","author":"T. A. Feo","year":"1995","unstructured":"T. A. Feo and M. G. C. Resende. Greedy randomized adaptative search procedure. Journalof GlobalOptimization, 6:109\u2013133, 1995.","journal-title":"Journalof GlobalOptimization"},{"key":"12_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/BFb0021809","volume-title":"Drawing high degree graphs with low bend numbers","author":"U. F\u00f6\u00dfmeier","year":"1996","unstructured":"U. F\u00f6\u00dfmeier and M. Kaufmann. Drawing high degree graphs with low bend numbers. In Proc. GD\u2019 95, volume 1027 of LNCS, pages 254\u2013266, 1996."},{"key":"12_CR9","unstructured":"GDToolkit. Graph drawing toolkit. On line. \n                    http:\/\/www.dia.uniroma3.it\/~gdt\n                    \n                  ."},{"key":"12_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/3-540-62495-3_52","volume-title":"On the edge label placement problem","author":"K. G. Kakoulis","year":"1997","unstructured":"K. G. Kakoulis and I. G. Tollis. On the edge label placement problem. In Proc. GD\u2019 96, volume 1190 of LNCS, pages 241\u2013256, 1997."},{"key":"12_CR11","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 Proc. GD\u2019 97, volume 1353 of LNCS, pages 169\u2013180, 1998."},{"key":"12_CR12","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. Comput. Geom. Theory Appl., 18:1\u201317, 2001.","journal-title":"Comput. Geom. Theory Appl."},{"key":"12_CR13","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. W. Klau","year":"1999","unstructured":"G. W. Klau and P. Mutzel. Combining graph labeling and compaction. In Proc. GD\u2019 99, volume 1731 of LNCS, pages 27\u201337, 2000."},{"key":"12_CR14","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 slider model","author":"G. W. Klau","year":"2000","unstructured":"G. W. Klau and P. Mutzel. Optimal labelling of point features in the slider model. In Proc. COCOON\u2019 00, volume 1858 of LNCS, pages 340\u2013350, 2000."},{"key":"12_CR15","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 shapes","author":"S. Nakano","year":"2001","unstructured":"S. Nakano, T. Nishizeki, T. Tokuyama, and S. Watanabe. Labeling points with rectangles of various shapes. In Proc. GD\u2019 00, volume 1984 of LNCS, pages 91\u2013102, 2001."},{"key":"12_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. Comput. Geom. Theory Appl., 19:47\u201367, 2001.","journal-title":"Comput. Geom. Theory Appl."},{"key":"12_CR17","unstructured":"T. Strijk and A. Wol.. The map-labeling bibliography. \n                    http:\/\/www.math-inf.unigreifswald. de\/map-labeling\/bibliography\/\n                    \n                  ."},{"issue":"3","key":"12_CR18","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R. Tamassia","year":"1987","unstructured":"R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput., 16(3):421\u2013444, 1987.","journal-title":"SIAM J. Comput."},{"issue":"1","key":"12_CR19","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/21.87055","volume":"18","author":"R. Tamassia","year":"1988","unstructured":"R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Trans. Syst. Man Cybern., SMC-18(1):61\u201379, 1988.","journal-title":"IEEE Trans. Syst. Man Cybern."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45848-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T19:12:27Z","timestamp":1550776347000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45848-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433095","9783540458487"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-45848-4_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}