{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:32:07Z","timestamp":1771036327764,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540660194","type":"print"},{"value":"9783540487777","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48777-8_23","type":"book-chapter","created":{"date-parts":[[2007,3,2]],"date-time":"2007-03-02T08:43:11Z","timestamp":1172824991000},"page":"304-319","source":"Crossref","is-referenced-by-count":25,"title":["Optimal Compaction of Orthogonal Grid Drawings (Extended Abstract)"],"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":[[1999,4,30]]},"reference":[{"key":"23_CR1","unstructured":"AGD. AGD User Manual. Max-Planck-Institut Saarbr\u00fccken, Universit\u00e4t Halle, Universit\u00e4t K\u00f6ln, 1998. http:\/\/www.mpi-sb.mpg.de\/AGD ."},{"key":"23_CR2","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R. K. Ahuja","year":"1993","unstructured":"R. K. Ahuja, T. L. Magnanti, and J.B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ, 1993."},{"key":"23_CR3","unstructured":"D. Alberts, C. Gutwenger, P. Mutzel, and S. N\u00e4her. AGD-Library: A library of algorithms for graph drawing. In G. Italiano and S. Orlando, editors, WAE\u2019 97 (Proc. on the Workshop on Algorithm Engineering), Venice, Italy, Sept. 11\u201313, 1997. http:\/\/www.dsi.unive.it\/~wae97 ."},{"key":"23_CR4","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0925-7721(96)00005-3","volume":"7","author":"G. D. Battista","year":"1997","unstructured":"G. D. Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of four graph drawing algorithms. CGTA: Computational Geometry: Theory and Applications, 7:303\u2013316, 1997.","journal-title":"CGTA: Computational Geometry: Theory and Applications"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"S. Bridgeman, G. Di Battista, W. Didimo, G. Liotta, R. Tamassia, and L. Vismara. Turn-regularity and optimal area drawings of orthogonal representations. Technical report, Dipartimento di Informatica e Automazione, Universit\u00e0 degli Studi di Roma Tre, 1999. To appear.","DOI":"10.1007\/3-540-46648-7_2"},{"key":"23_CR6","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":"23_CR7","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0167-6377(98)00013-3","volume":"22","author":"M. J\u00fcnger","year":"1998","unstructured":"M. J\u00fcnger and S. Thienel. Introduction to ABACUS-A Branch-And-CUt System. Operations Research Letters, 22:83\u201395, March 1998.","journal-title":"Operations Research Letters"},{"issue":"1","key":"23_CR8","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1109\/TCAD.1984.1270052","volume":"CAD-3","author":"G. Kedem","year":"1984","unstructured":"G. Kedem and H. Watanabe. Graph optimization techniques for IC-layout and compaction. IEEE Transact. Comp.-Aided Design of Integrated Circuits and Systems, CAD-3(1):12\u201320, 1984.","journal-title":"IEEE Transact. Comp.-Aided Design of Integrated Circuits and Systems"},{"key":"23_CR9","series-title":"Technical Report","volume-title":"Optimal compaction of orthogonal grid drawings","author":"G. W. Klau","year":"1998","unstructured":"G. W. Klau and P. Mutzel. Optimal compaction of orthogonal grid drawings. Technical Report MPI-I-98-1-031, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, December 1998."},{"key":"23_CR10","series-title":"Technical Report","volume-title":"Quasi-orthogonal drawing of planar graphs","author":"G. W. Klau","year":"1998","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\u00fccken, May 1998."},{"key":"23_CR11","doi-asserted-by":"crossref","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":"23_CR12","unstructured":"K. Mehlhorn, S. N\u00e4her, M. Seel, and C. Uhrig. LEDA Manual Version 3.7.1. Technical report, Max-Planck-Institut f\u00fcr Informatik, 1998. http:\/\/www.mpi-sb.mpg.de\/LEDA ."},{"issue":"1","key":"23_CR13","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/204865.204889","volume":"38","author":"K. Mehlhorn","year":"1995","unstructured":"K. Mehlhorn and S. N\u00e4her. LEDA: A platform for combinatorial and geometric computing. Communications of the ACM, 38(1):96\u2013102, 1995.","journal-title":"Communications of the ACM"},{"key":"23_CR14","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."},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0167-9260(83)80019-4","volume":"1","author":"M. Schlag","year":"1983","unstructured":"M. Schlag, Y.-Z. Liao, and C. K. Wong. An algorithm for optimal two-dimensional compaction of VLSI layouts. Integration, the VLSI Journal, 1:179\u2013209, 1983.","journal-title":"Integration, the VLSI Journal"},{"issue":"3","key":"23_CR16","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."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48777-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T05:05:22Z","timestamp":1587359122000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48777-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540660194","9783540487777"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-48777-8_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}