{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:34:00Z","timestamp":1725561240548},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540208310"},{"type":"electronic","value":"9783540245957"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24595-7_33","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T04:46:01Z","timestamp":1280378761000},"page":"357-368","source":"Crossref","is-referenced-by-count":0,"title":["Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles"],"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","reference":[{"key":"33_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/3-540-44541-2_10","volume-title":"Graph Drawing","author":"U. Brandes","year":"2001","unstructured":"Brandes, U., Cornelsen, S., Wagner, D.: How to draw the minimum cuts of a planar graph. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 103\u2013114. Springer, Heidelberg (2001)"},{"key":"33_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-540-39890-5_15","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S. Cornelsen","year":"2003","unstructured":"Cornelsen, S., Wagner, D.: Completely connected clustered graphs. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 168\u2013179. Springer, Heidelberg (2003) (to appear)"},{"key":"33_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/3-540-45848-4_5","volume-title":"Graph Drawing","author":"G. Battista Di","year":"2002","unstructured":"Di Battista, G., Didimo, W., Marcandalli, A.: Planarization of clustered graphs. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol.\u00a02265, pp. 60\u201374. Springer, Heidelberg (2002)"},{"key":"33_CR4","unstructured":"Dinitz, Y., Karzanov, A.V., Lomonosov, M.: On the structure of a family of minimal weighted cuts in a graph. In: Fridman, A. (ed.) Studies in Discrete Optimization, Nauka, pp. 290\u2013306 (1976) (in Russian)"},{"key":"33_CR5","first-page":"509","volume-title":"Proceedings of the 27th Annual ACM Symposium on the Theory of Computing (STOC 1995)","author":"Y. Dinitz","year":"1995","unstructured":"Dinitz, Y., Nutov, Z.: A 2-level cactus model for the system of minimum and minimum+1 edge\u2013cuts in a graph and its incremental maintenance. In: Proceedings of the 27th Annual ACM Symposium on the Theory of Computing (STOC 1995), pp. 509\u2013518. ACM, The Association for Computing Machinery, New York (1995)"},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/3-540-60313-1_145","volume-title":"Algorithms - ESA \u201995","author":"Q. Feng","year":"1995","unstructured":"Feng, Q., Cohen, R.F., Eades, P.: Planarity for clustered graphs. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol.\u00a0979, pp. 213\u2013226. Springer, Heidelberg (1995)"},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/BFb0021809","volume-title":"Graph Drawing","author":"U. F\u00f6\u00dfmeier","year":"1996","unstructured":"F\u00f6\u00dfmeier, U., Kaufmann, M.: Drawing high degree graphs with low bend numbers. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol.\u00a01027, pp. 254\u2013266. Springer, Heidelberg (1996)"},{"key":"33_CR8","unstructured":"Klau, G.W., Mutzel, P.: Quasi orthogonal drawing of planar graphs. Technical Report MPI-I-98-1-013, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany (1998), Available at \n                    \n                      http:\/\/data.mpi-sb.mpg.de\/internet\/reports.nsf"},{"key":"33_CR9","unstructured":"L\u00fctke-H\u00fcttmann, D.: Knickminimales Zeichnen 4-planarer Clustergraphen. Master\u2019s thesis, Universit\u00e4t des Saarlandes (1999) (Diplomarbeit)"},{"key":"33_CR10","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R. Tamassia","year":"1987","unstructured":"Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAM Journal on Computing\u00a016, 421\u2013444 (1987)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"33_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/21.87055","volume":"18","author":"R. Tamassia","year":"1988","unstructured":"Tamassia, R., Di Battista, G., Batini, C.: Automatic graph drawing and readability of diagrams. IEEE Transactions on Systems, Man and Cybernetics\u00a018(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\/978-3-540-24595-7_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T10:49:10Z","timestamp":1552819750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24595-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540208310","9783540245957"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24595-7_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}