{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:16:59Z","timestamp":1758273419270},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540314257"},{"type":"electronic","value":"9783540316671"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11618058_31","type":"book-chapter","created":{"date-parts":[[2006,1,20]],"date-time":"2006-01-20T09:56:50Z","timestamp":1137751010000},"page":"343-354","source":"Crossref","is-referenced-by-count":5,"title":["Drawing Graphs Using Modular Decomposition"],"prefix":"10.1007","author":[{"given":"Charis","family":"Papadopoulos","sequence":"first","affiliation":[]},{"given":"Constantinos","family":"Voglis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","volume-title":"Algorithms for the Visualization of Graphs","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs (1999)"},{"key":"31_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.: Optimal upward planarity testing of single-source digraphs. SIAM J. Comput.\u00a027, 132\u2013169 (1998)","journal-title":"SIAM J. Comput."},{"key":"31_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/3-540-45848-4_59","volume-title":"Graph Drawing","author":"U. Brandes","year":"2002","unstructured":"Brandes, U., Eiglsperger, M., Herman, I., Himsolt, M., Marshall, M.S.: GraphML progress report: structural layer proposal. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol.\u00a02265, pp. 501\u2013512. Springer, Heidelberg (2002)"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1006\/jagm.2001.1185","volume":"41","author":"E. Dahlhaus","year":"2001","unstructured":"Dahlhaus, E., Gustedt, J., McConnell, R.M.: Efficient and practical algorithms for sequential modular decomposition. J. Algorithms\u00a041, 360\u2013387 (2001)","journal-title":"J. Algorithms"},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-63938-1_58","volume-title":"Graph Drawing","author":"P. Eades","year":"1997","unstructured":"Eades, P., Feng, Q.W.: Drawing clustered graphs on an orthogonal grid. In: DiBattista, G. (ed.) GD 1997. LNCS, vol.\u00a01353, pp. 146\u2013157. Springer, Heidelberg (1997)"},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/3-540-62495-3_42","volume-title":"Graph Drawing","author":"P. Eades","year":"1997","unstructured":"Eades, P., Feng, Q.W., Lin, X.: Straight-line drawing algorithms for hierarchical graphs and clustered graphs. In: North, S.C. (ed.) GD 1996. LNCS, vol.\u00a01190, pp. 113\u2013128. Springer, Heidelberg (1997)"},{"key":"31_CR8","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.-W. Feng","year":"1995","unstructured":"Feng, Q.-W., 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":"31_CR9","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"T. Fruchterman","year":"1991","unstructured":"Fruchterman, T., Reingold, E.: Graph drawing by force-directed placement. Software-Practice and Experience\u00a021, 1129\u20131164 (1991)","journal-title":"Software-Practice and Experience"},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1186\/gb-2004-5-8-r57","volume":"5","author":"J. Gagneur","year":"2004","unstructured":"Gagneur, J., Krause, R., Bouwmeester, T., Casari, G.: Modular decomposition of protein-protein interaction networks. Genome Biology\u00a05, R57 (2004)","journal-title":"Genome Biology"},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/3-540-37623-2_28","volume-title":"Graph Drawing","author":"E.R. Gansner","year":"1999","unstructured":"Gansner, E.R., North, S.C.: Improved force-directed layouts. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 364\u2013373. Springer, Heidelberg (1999)"},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1145\/1556262.1556288","volume-title":"Proc. of Working Conference on Advanced Visual Interfaces (AVI 2002)","author":"D. Harel","year":"2002","unstructured":"Harel, D., Koren, Y.: Drawing graphs with non-uniform vertices. In: Proc. of Working Conference on Advanced Visual Interfaces (AVI 2002), pp. 157\u2013166. ACM Press, New York (2002)"},{"key":"31_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/3-540-37623-2_29","volume-title":"Graph Drawing","author":"M.L. Huang","year":"1999","unstructured":"Huang, M.L., Eades, P.: A fully animated interactive system for clustering and navigating huge graphs. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 374\u2013383. Springer, Heidelberg (1999)"},{"key":"31_CR14","unstructured":"Li, W., Eades, P., Nikolov, N.: Using spring algorithms to remove node overlapping. In: Proc. Asia Pacific Symp. Information Visualization, APVIS 2005 (2005)"},{"key":"31_CR15","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","volume":"201","author":"R.M. McConnell","year":"1999","unstructured":"McConnell, R.M., Spinrad, J.: Modular decomposition and transitive orientation. Discrete Math.\u00a0201, 189\u2013241 (1999)","journal-title":"Discrete Math."},{"key":"31_CR16","unstructured":"yEd - Java Graph Editor, http:\/\/www.yworks.com\/en\/products_yed_about.htm"},{"key":"31_CR17","doi-asserted-by":"crossref","first-page":"253","DOI":"10.7155\/jgaa.00070","volume":"7","author":"C. Walshaw","year":"2003","unstructured":"Walshaw, C.: A multilevel algorithm for force-directed graph drawing. J. Graph Algorithms Appl.\u00a07, 253\u2013285 (2003)","journal-title":"J. Graph Algorithms Appl."},{"key":"31_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/BFb0021835","volume-title":"Graph Drawing","author":"X. Wang","year":"1996","unstructured":"Wang, X., Miyamoto, I.: Generating customized layouts. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol.\u00a01027, pp. 504\u2013515. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11618058_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:12:17Z","timestamp":1619507537000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11618058_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540314257","9783540316671"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11618058_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}