{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:18:50Z","timestamp":1725581930031},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642622144"},{"type":"electronic","value":"9783642186387"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-642-18638-7_12","type":"book-chapter","created":{"date-parts":[[2011,4,23]],"date-time":"2011-04-23T02:57:24Z","timestamp":1303527444000},"page":"257-278","source":"Crossref","is-referenced-by-count":0,"title":["A Diagramming Software for UML Class Diagrams"],"prefix":"10.1007","author":[{"given":"Carsten","family":"Gutwenger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"J\u00fcnger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karsten","family":"Klein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim","family":"Kupke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Leipert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I. G. (1999) Graph Drawing. Prentice Hall"},{"issue":"1","key":"12_CR2","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1137\/S0097539794279626","volume":"27","author":"P Bertolazzi","year":"1998","unstructured":"Bertolazzi, P., Di Battista, G., Mannino, C., Tamassia, R. (1998) Optimal upward planarity testing of single-source digraphs. SI AM Journal on Computing 27(1), 132\u2013169","journal-title":"SI AM Journal on Computing"},{"key":"12_CR3","unstructured":"Booch, G., Rumbaugh, J., Jacobson, I. (1999) Unified Modeling Language User Guide. Addison Wesley Longman"},{"key":"12_CR4","unstructured":"Rational Software Corporation. (2002) Rational Rose, Rational XDE"},{"key":"12_CR5","unstructured":"TogetherSoft Corporation. (2002) Together ControlCenter"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Di Battista, G., Didimo, W., Marcandalli, A. (2002) Planarization of clustered graphs. In: P. Mutzel, M. J\u00fcnger, and S. Leipert (eds.) Graph Drawing\u2019 01, Lecture Notes in Computer Science 2265, Springer-Verlag, 60\u201374","DOI":"10.1007\/3-540-45848-4_5"},{"issue":"A","key":"12_CR7","first-page":"89","volume":"21","author":"P Eades","year":"1986","unstructured":"Eades, P., Kelly, D. (1986) Heuristics for reducing crossings in 2-layered networks. Ars Combinatoria 21(A), 89\u201398","journal-title":"Ars Combinatoria"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Eichelberger, H. (2002) SugiBib. In: P. Mutzel, M. J\u00fcnger, and S. Leipert (eds.) Graph Drawing\u2019 01, Lecture Notes in Computer Science 2265, Springer-Verlag, 467\u2013468","DOI":"10.1007\/3-540-45848-4_49"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Eiglsperger, M., Kaufmann, M. (2001) An approach for mixed upward planarization. In: Proc. 7th International Workshop on Algorithms and Data Structures (WADS\u201901), Lecture Notes in Computer Science 2125, Springer-Verlag, 352\u2013364","DOI":"10.1007\/3-540-44634-6_33"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Feng, Q.-W., Cohen, R. F., Eades, P. (1995) Planarity for clustered graphs. In P. Spirakis (ed.) Algorithms \u2014 ESA\u2019 95, Lecture Notes in Computer Science 979, Springer-Verlag, 213\u2013226","DOI":"10.1007\/3-540-60313-1_145"},{"issue":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1109\/32.221135","volume":"19","author":"ER Gansner","year":"1993","unstructured":"Gansner, E. R., Koutsofios, E., North, S. C, Vo, K. P. (1993) A technique for drawing directed graphs. IEEE Transactions on Software Engineering 19(3), 214\u2013230","journal-title":"IEEE Transactions on Software Engineering"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Garg, A., Tamassia, R. (1995) On the computational complexity of upward and rectilinear planarity testing. In: R. Tamassia and I. G. Tollis (eds.) Graph Drawing\u2019 94, Lecture Notes in Computer Science 894, Springer-Verlag, 286\u2013297","DOI":"10.1007\/3-540-58950-3_384"},{"key":"12_CR13","unstructured":"Gutwenger, C, Mutzel, P., Weiskircher, R. (2001) Inserting an edge into a planar graph. In: Proceedings of the Twelwth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u2019 01), ACM Press, 246\u2013255"},{"issue":"7","key":"12_CR14","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1109\/43.709399","volume":"17","author":"M J\u00fcnger","year":"1998","unstructured":"J\u00fcnger, M., Leipert, S., Mutzel, P. (1998) A note on computing a maximal planar subgraph using PQ-trees. IEEE Transactions on Computer-Aided Design 17(7), 609\u2013612","journal-title":"IEEE Transactions on Computer-Aided Design"},{"issue":"1","key":"12_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00001","volume":"1","author":"M J\u00fcnger","year":"1996","unstructured":"J\u00fcnger, M., Mutzel, P. (1996) 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms. Journal of Graph Algorithms and Applications (JGAA) 1(1), 1\u201325, http:\/\/www.cs.brown.edu\/publications\/jgaa\/","journal-title":"Journal of Graph Algorithms and Applications (JGAA)"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Klau, G. W., Klein, K., Mutzel, P. (2000) An experimental comparison of orthogonal compaction algorithms. Technical report, Technische Universit\u00e4t Wien","DOI":"10.1007\/3-540-44541-2_5"},{"key":"12_CR17","volume-title":"Quasi-orthogonal drawing of planar graphs","author":"GW Klau","year":"1998","unstructured":"Klau, G. W., Mutzel, P. (1998) Quasi-orthogonal drawing of planar graphs. Technical Report MPI-I-98-1-013, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Purchase, H., Allder, J.-A., Carrington, D. (2001) User preference of graph layout aesthetics: A UML study. In: J. Marks (ed.) Graph Drawing\u2019 00, Lecture Notes in Computer Science 1984, Springer-Verlag, 5\u201318","DOI":"10.1007\/3-540-44541-2_2"},{"key":"12_CR19","unstructured":"Seemann, J. (1997) Extending the sugiyama algorithm for drawing UML class diagrams. In: G. Di Battista (ed.) Graph Drawing\u2019 97, Lecture Notes in Computer Science 1353, Springer-Verlag, 415\u2013424"},{"issue":"2","key":"12_CR20","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"SMC-11","author":"K Sugiyama","year":"1981","unstructured":"Sugiyama, K, Tagawa, S., Toda, M. (1981) Methods for visual understanding of hierarchical systems. IEEE Transactions on System, Man, and Cybernetics SMC-11(2), 109\u2013125","journal-title":"IEEE Transactions on System, Man, and Cybernetics"},{"issue":"3","key":"12_CR21","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R Tamassia","year":"1988","unstructured":"Tamassia, R. (1988) On embedding a graph in the grid with the minimum number of bends. SIAM Journal on Computing 16(3), 421\u2013444","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"12_CR22","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/21.87055","volume":"SMC-18","author":"R Tamassia","year":"1988","unstructured":"Tamassia, R., Di Battista, G., Batini, C. (1988) Automatic graph drawing and readability of diagrams. IEEE Transactions on System, Man, and Cybernetics SMC-18(1), 61\u201379","journal-title":"IEEE Transactions on System, Man, and Cybernetics"}],"container-title":["Mathematics and Visualization","Graph Drawing Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18638-7_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:07:20Z","timestamp":1606187240000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18638-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783642622144","9783642186387"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18638-7_12","relation":{},"ISSN":["1612-3786"],"issn-type":[{"type":"print","value":"1612-3786"}],"subject":[],"published":{"date-parts":[[2004]]}}}