{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:11:33Z","timestamp":1725484293444},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439967"},{"type":"electronic","value":"9783540456551"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45655-4_52","type":"book-chapter","created":{"date-parts":[[2007,5,21]],"date-time":"2007-05-21T11:37:01Z","timestamp":1179747421000},"page":"484-493","source":"Crossref","is-referenced-by-count":4,"title":["Bend Minimization in Orthogonal Drawings Using Integer Programming"],"prefix":"10.1007","author":[{"given":"Petra","family":"Mutzel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren\u00e9","family":"Weiskircher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,29]]},"reference":[{"issue":"8","key":"52_CR1","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1109\/12.868028","volume":"49","author":"P. Bertolazzi","year":"2000","unstructured":"P. Bertolazzi, G. Di Battista, and W. Didimo. Computing orthogonal drawings with the minimum number of bends. IEEE Transactions on Computers, 49(8):826\u2013840, 2000.","journal-title":"IEEE Transactions on Computers"},{"key":"52_CR2","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0925-7721(96)00005-3","volume":"7","author":"B.G.L.+.9.7._.G. Battista Di","year":"1997","unstructured":"BGL+97._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\u2013326, 1997.","journal-title":"Comput. Geom. Theory Appl."},{"issue":"1","key":"52_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1137\/0217004","volume":"17","author":"D. Bienstock","year":"1988","unstructured":"D. Bienstock and C. L. Monma. On the complexity of covering vertices by faces in a planar graph. SIAM Journal on Computing, 17(1):53\u201376, 1988.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"52_CR4","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1002\/net.3230190107","volume":"19","author":"D. Bienstock","year":"1989","unstructured":"D. Bienstock and C. L. Monma. Optimal enclosing regions in planar graphs. Networks, 19(1):79\u201394, 1989.","journal-title":"Networks"},{"issue":"1","key":"52_CR5","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF01840379","volume":"5","author":"D. Bienstock","year":"1990","unstructured":"D. Bienstock and C. L. Monma. On the complexity of embedding planar graphs to minimize certain distance measures. Algorithmica, 5(1):93\u2013109, 1990.","journal-title":"Algorithmica"},{"issue":"5","key":"52_CR6","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G. Battista Di","year":"1996","unstructured":"G. Di Battista and R. Tamassia. On-line planarity testing. SIAM Journal on Computing, 25(5):956\u2013997, 1996.","journal-title":"SIAM Journal on Computing"},{"key":"52_CR7","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 LNCS, pages 254\u2013266. Springer-Verlag, 1996."},{"key":"52_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-44541-2_8","volume-title":"Graph Drawing (Proc. 2000)","author":"C. Gutwenger","year":"2001","unstructured":"C. Gutwenger and P. Mutzel. A linear time implementation of SPQR-trees. In J. Marks, editor, Graph Drawing (Proc. 2000), volume 1984 of LNCS, pages 77\u201390. Springer-Verlag, 2001."},{"key":"52_CR9","series-title":"Lect Notes Comput Sci","first-page":"286","volume-title":"Proceedings Graph Drawing\u2019 94","author":"A. Garg","year":"1994","unstructured":"A. Garg and R. Tamassia. On the computational complexity of upward and rectilinear planarity testing. In R. Tamassia and I. G. Tollis, editors, Proceedings Graph Drawing\u2019 94, volume 894 of LNCS, pages 286\u2013297. Springer-Verlag, 1994."},{"issue":"3","key":"52_CR10","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J. E. Hopcroft","year":"1973","unstructured":"J. E. Hopcroft and R. E. Tarjan. Dividing a graph into triconnected components. SIAM Journal on Computing, 2(3):135\u2013158, 1973.","journal-title":"SIAM Journal on Computing"},{"key":"52_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/3-540-48777-8_27","volume-title":"Proceedings IPCO\u2019 99","author":"P. Mutzel","year":"1999","unstructured":"P. Mutzel and R. Weiskircher. Optimizing over all combinatorial embeddings of a planar graph. In G. Cornu\u00e9jols, R. Burkard, and G. W\u00f6ginger, editors, Proceedings IPCO\u2019 99, volume 1610 of LNCS, pages 361\u2013376. Springer Verlag, 1999."},{"key":"52_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/3-540-44968-X_10","volume-title":"Proceedings COCOON\u2019 00","author":"P. Mutzel","year":"2000","unstructured":"P. Mutzel and R. Weiskircher. Computing optimal embeddings for planar graphs. In Proceedings COCOON\u2019 00, volume 1858 of LNCS, pages 95\u2013104. Springer Verlag, 2000."},{"issue":"3","key":"52_CR13","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 Journal on Computing, 16(3):421\u2013444, 1987.","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45655-4_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T20:45:44Z","timestamp":1550349944000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45655-4_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439967","9783540456551"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45655-4_52","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}