{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T12:10:26Z","timestamp":1737288626093,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540415541"},{"type":"electronic","value":"9783540445418"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44541-2_10","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:01:32Z","timestamp":1184601692000},"page":"103-114","source":"Crossref","is-referenced-by-count":6,"title":["How to Draw the Minimum Cuts of a Planar Graph"],"prefix":"10.1007","author":[{"given":"Ulrik","family":"Brandes","sequence":"first","affiliation":[]},{"given":"Sabine","family":"Cornelsen","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,27]]},"reference":[{"unstructured":"Y. Dinitz, A. V. Karzanov, and M. Lomonosov. On the structure of a family of minimal weighted cuts in a graph. In A. Fridman, editor, Studies in Discrete Optimization, pages 290\u2013306. Nauka, 1976. (in Russian).","key":"10_CR1"},{"doi-asserted-by":"crossref","unstructured":"Y. Dinitz and Z. Nutov. A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance. In Proceedings of the 27th Annual ACM Symposium on the Theory of Computing (STOC\u2019 95), pages 509\u2013518. ACM, The Association for Computing Machinery, 199","key":"10_CR2","DOI":"10.1145\/225058.225268"},{"issue":"4","key":"10_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.7155\/jgaa.00016","volume":"3","author":"P. Eades","year":"1999","unstructured":"P. Eades, Q. Feng, and H. Nagamochi. Drawing clustered graphs on an orthogonal grid. Journal on Graph Algorithms and Applications,3(4):3\u201329, 1999.","journal-title":"Journal on Graph Algorithms and Applications"},{"key":"10_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/3-540-60313-1_145","volume-title":"Planarity for clustered graphs","author":"Q. Feng","year":"1995","unstructured":"Q. Feng, R. F. Cohen, and P. Eades. Planarity for clustered graphs. In P. Spirakis, editor, Proceedings of the 3rd European Symposium on Algorithms (ESA\u2019 95), volume 979 of Lecture Notes in Computer Science, pages 213\u2013226. Springer, 1995."},{"issue":"1","key":"10_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1006\/jagm.1999.1039","volume":"33","author":"L. Fleischer","year":"1999","unstructured":"L. Fleischer. Building chain and cactus representations of all minimum cuts from Hao-Orlin in the same asymptotic run time. Journal of Algorithms, 33(1):51\u201372, 1999.","journal-title":"Journal of Algorithms"},{"key":"10_CR6","series-title":"Lect Notes Comput Sci","first-page":"201","volume-title":"A new minimum cost flow algorithm with applications to graph drawing","author":"A. Garg","year":"1996","unstructured":"A. Garg and R. Tamassia. A new minimum cost flow algorithm with applications to graph drawing. In S. C. North, editor, Proceedings of the 4th International Symposium on Graph Drawing (GD\u2019 96), volume 1190 of Lecture Notes in Computer Science, pages 201\u2013213. Springer, 1996."},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1006\/jcss.1997.1493","volume":"55","author":"M. R. Henzinger","year":"1997","unstructured":"M. R. Henzinger, P. Klein, S. Rao, and S. Subramanian. Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences, 55:3\u201323, 1997. Special Issue on Selected Papers from STOC 1994.","journal-title":"Journal of Computer and System Sciences"},{"key":"10_CR8","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-031, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany, 1998."},{"unstructured":"D. L\u00fctke-H\u00fcttmann. Knickminimales Zeichnen 4-planarer Clustergraphen. Master\u2019s thesis, Universit\u00e4t des Saarlandes, 1999. (Diplomarbeit).","key":"10_CR9"},{"unstructured":"K. Mehlhorn and S. N\u00e4her. The Leda Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999. Project home page at http:\/\/www.mpi-sb.mpg.de\/LEDA\/ .","key":"10_CR10"},{"key":"10_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1007\/3-540-37623-2_44","volume-title":"A library of algorithms for graph drawing","author":"P. Mutzel","year":"1998","unstructured":"P. Mutzel, C. Gutwenger, R. Brockenauer, S. Fialko, G. W. Klau, M. Kr\u00fcger, T. Ziegler, S. N\u00e4her, D. Alberts, D. Ambras, G. Koch, M. J\u00fcnger, C. Buchheim, and S. Leipert. A library of algorithms for graph drawing. In S. H. Whitesides, editor, Proceedings of the 6th International Symposium on Graph Drawing (GD\u2019 98), volume 1547 of Lecture Notes in Computer Science, pages 456\u2013457. Springer, 1998. Project home page at http:\/\/www.mpi-sb.mpg.de\/AGD\/ ."},{"issue":"2","key":"10_CR12","first-page":"135","volume":"39","author":"H. Nagamochi","year":"1996","unstructured":"H. Nagamochi and T. Kameda. Constructing cactus representation for all minimum cuts in an undirected network. Journal of the Operations Research, 39(2):135\u2013158, 1996.","journal-title":"Journal of the Operations Research"},{"key":"10_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:421\u2013444, 1987.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"10_CR14","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/21.87055","volume":"18","author":"R. Tamassia","year":"1988","unstructured":"R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Transactions on Systems, Man and Cybernetics, 18(1):61\u201379, 1988.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44541-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T11:46:17Z","timestamp":1737287177000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44541-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540415541","9783540445418"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44541-2_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}