{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T08:27:35Z","timestamp":1758875255345},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540654735"},{"type":"electronic","value":"9783540376231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-37623-2_27","type":"book-chapter","created":{"date-parts":[[2007,11,19]],"date-time":"2007-11-19T07:45:17Z","timestamp":1195458317000},"page":"356-363","source":"Crossref","is-referenced-by-count":3,"title":["Edge Labeling in the Graph Layout Toolkit"],"prefix":"10.1007","author":[{"given":"U\u011fur","family":"Do\u011frus\u00f6z","sequence":"first","affiliation":[]},{"given":"Konstantinos G.","family":"Kakoulis","sequence":"additional","affiliation":[]},{"given":"Brendan","family":"Madden","sequence":"additional","affiliation":[]},{"given":"Ioannis G.","family":"Tollis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,1,15]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G. Battista Di","year":"1994","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl., 4:235\u2013282, 1994.","journal-title":"Comput. Geom. Theory Appl"},{"key":"27_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/3-540-62495-3_52","volume-title":"Graph Drawing (Proc. GD\u2019 96","author":"K. G. Kakoulis","year":"1997","unstructured":"K. G. Kakoulis and I. G. Tollis. On the Edge Label Placement Problem. In S. North, editor, Graph Drawing (Proc. GD\u2019 96, volume 1190 of Lecture Notes in Computer Science, pages 241\u2013256. Springer-Verlag, 1997."},{"key":"27_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/3-540-63938-1_60","volume-title":"Graph Drawing (Proc. GD\u2019 97","author":"K. G. Kakoulis","year":"1998","unstructured":"K. G. Kakoulis and I. G. Tollis. An Algorithm for Labeling Edges of Hierarchical Drawings. In G. Di Battista, editor, Graph Drawing (Proc. GD\u2019 97, volume 1353 of Lecture Notes in Computer Science, pages 169\u2013180. Springer-Verlag, 1998."},{"key":"27_CR4","unstructured":"K. G. Kakoulis and I. G. Tollis. On the Multiple Label Placement Problem. To appear in the Proc. of the 10th Canadian Conference on Computational Geometry, August1998."},{"key":"27_CR5","unstructured":"Tom Sawyer Software. Graph Layout Toolkit Reference Manual. Berkeley, CA, 1992\u20131998."},{"key":"27_CR6","unstructured":"Tom Sawyer Software. Graph Layout Toolkit User\u2019s Guide. Berkeley, CA, 1992\u20131998."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-37623-2_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T13:41:50Z","timestamp":1551102110000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-37623-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540654735","9783540376231"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-37623-2_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}