{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:23:13Z","timestamp":1743106993580,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642184680"},{"type":"electronic","value":"9783642184697"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-18469-7_39","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T00:30:40Z","timestamp":1297297840000},"page":"395-396","source":"Crossref","is-referenced-by-count":1,"title":["Placing Edge Labels by Modifying an Orthogonal Graph Drawing"],"prefix":"10.1007","author":[{"given":"Konstantinos G.","family":"Kakoulis","sequence":"first","affiliation":[]},{"given":"Ioannis G.","family":"Tollis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"39_CR1","first-page":"71","volume":"32","author":"C. Binucci","year":"2005","unstructured":"Binucci, C., Didimo, W., Liotta, G., Nonato, M.: Orthogonal Drawings of Graphs with Vertex and Edge Labels. CGTA\u00a032(2), 71\u2013114 (2005)","journal-title":"CGTA"},{"key":"39_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/3-540-46648-7_31","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Didimo, W., Patrignani, M., Pizzonia, M.: Orthogonal and quasi-upward drawings with vertices of arbitrary size. In: Kratochv\u00edl, J. (ed.) GD 1999. LNCS, vol.\u00a01731, pp. 27\u201337. Springer, Heidelberg (1999)"},{"key":"39_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/3-540-46648-7_3","volume-title":"Graph Drawing","author":"G.W. Klau","year":"1999","unstructured":"Klau, G.W., Mutzel, P.: Combining Graph Labeling and Compaction. In: Kratochv\u00edl, J. (ed.) GD 1999. LNCS, vol.\u00a01731, pp. 27\u201337. Springer, Heidelberg (1999)"},{"issue":"1","key":"39_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0925-7721(00)00025-0","volume":"18","author":"K.G. Kakoulis","year":"2001","unstructured":"Kakoulis, K.G., Tollis, I.G.: On the Complexity of the Edge Label Placement Problem. Computational Geometry\u00a018(1), 1\u201317 (2001)","journal-title":"Computational Geometry"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18469-7_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:41:17Z","timestamp":1558294877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18469-7_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642184680","9783642184697"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18469-7_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}