{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:33:38Z","timestamp":1742394818936},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540669043"},{"type":"electronic","value":"9783540466482"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46648-7_3","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T04:29:28Z","timestamp":1186892968000},"page":"27-37","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Combining Graph Labeling and Compaction"],"prefix":"10.1007","author":[{"given":"Gunnar W.","family":"Klau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,3]]},"reference":[{"key":"3_CR1","unstructured":"AGD. AGD User Manual. Max-Planck-Institut Saarbr\u00fccken, Universit\u00e4t Halle, Universit\u00e4t K\u00f6ln, 1999. \nhttp:\/\/www.mpi-sb.mpg.de\/AGD\n\n."},{"key":"3_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/3-540-63938-1_84","volume-title":"Graph Drawing (Proc. GD\u2019 97)","author":"T. Biedl","year":"1997","unstructured":"T. Biedl, B. Madden, and I. Tollis. The three-phase method: A unified approach to orthogonal graph drawing. In G. Di Battista, editor, Graph Drawing (Proc. GD\u2019 97), volume 1353 of Lecture Notes in Computer Science, pages 391\u2013402. Springer-Verlag, 1997."},{"key":"3_CR3","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, 1999."},{"key":"3_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/BFb0021809","volume-title":"Graph Drawing (Proc. GD\u2019 95)","author":"U. F\u00f6\u00dfmeier","year":"1996","unstructured":"U. F\u00f6\u00dfmeier and M. Kaufmann. Drawing high degree graphs with low bend numbers. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD\u2019 95), volume 1027 of Lecture Notes in Computer Science, pages 254\u2013266. Springer-Verlag, 1996."},{"key":"3_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/3-540-63938-1_57","volume-title":"Graph Drawing (Proc. GD\u2019 97)","author":"U. F\u00f6\u00dfmeier","year":"1997","unstructured":"U. F\u00f6\u00dfmeier and M. Kaufmann. Algorithms and area bounds for nonplanar orthogonal drawings. In G. Di Battista, editor, Graph Drawing (Proc. GD\u2019 97), volume 1353 of Lecture Notes in Computer Science, pages 134\u2013145. Springer-Verlag, 1997."},{"key":"3_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-63938-1_61","volume-title":"Graph Drawing (Proc. GD\u2019 97)","author":"C. Iturriaga","year":"1997","unstructured":"C. Iturriaga and A. Lubiw. Elastic labels: The two-axis case. In G. Di Battista, editor, Graph Drawing (Proc. GD\u2019 97), volume 1353 of Lecture Notes in Computer Science, pages 181\u2013192, 1997."},{"key":"3_CR7","unstructured":"G. W. Klau and P. Mutzel. Quasi-orthogonal drawing of planar graphs. Technical Report MPI-I-98-1-013, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fc\u00fccken, May 1998."},{"key":"3_CR8","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\u2019 99)","author":"G. W. Klau","year":"1999","unstructured":"G. W. Klau and P. Mutzel. Optimal compaction of orthogonal grid drawings. In G. P. Cornu\u00e9jols, editor, Integer Programming and Combinatorial Optimization (IPCO\u2019 99), number 1610 in Springer Lecture Notes in Computer Science, pages 304\u2013319, 1999."},{"key":"3_CR9","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":"1997","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, 1997."},{"key":"3_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-322-92106-2","volume-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"T. Lengauer","year":"1990","unstructured":"T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. John Wiley & Sons, New York, 1990."},{"key":"3_CR11","unstructured":"M. Patrignani. On the complexity of orthogonal compaction. Technical Report RT-DIA-39-99, Dipartimento di Informatica e Automazione, Universit\u00e0 degli Studi di Roma Tre, January 1999."},{"issue":"3","key":"3_CR12","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. WS. A. Wolff and T. Strijk. The map labeling bibliography. \nhttp:\/\/www.inf.fu-berlin.de\/map-labeling\/bibliography\n\n.","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46648-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T13:14:23Z","timestamp":1585919663000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46648-7_3"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540669043","9783540466482"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-46648-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"3 March 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}