{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:54:37Z","timestamp":1725558877573},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245285"},{"type":"electronic","value":"9783540318439"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31843-9_12","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T16:54:14Z","timestamp":1278348854000},"page":"100-110","source":"Crossref","is-referenced-by-count":5,"title":["Clustering Cycles into Cycles of Clusters"],"prefix":"10.1007","author":[{"given":"Pier Francesco","family":"Cortese","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Di Battista","sequence":"additional","affiliation":[]},{"given":"Maurizio","family":"Patrignani","sequence":"additional","affiliation":[]},{"given":"Maurizio","family":"Pizzonia","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/10692760_11","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"T. Biedl","year":"1998","unstructured":"Biedl, T., Kaufmann, M., Mutzel, P.: Drawing planar partitions II: HH-drawings. In: Hromkovi\u010d, J., S\u00fdkora, O. (eds.) WG 1998. LNCS, vol.\u00a01517, pp. 124\u2013136. Springer, Heidelberg (1998)"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Biedl, T.C.: Drawing planar partitions III: Two constrained embedding problems. Tech. Report RRR 13-98, RUTCOR Rutgen University (1998)","DOI":"10.1145\/276884.276917"},{"key":"12_CR3","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)"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Cortese, P.F., Di Battista, G., Patrignani, M., Pizzonia, M.: Clustering cycles into cycles of clusters. Technical Report RT-DIA-91-2004, Dipartimento di Informatica e Automazione, Universit\u2018a di Roma Tre, Rome, Italy (2004)","DOI":"10.1007\/978-3-540-31843-9_12"},{"key":"12_CR5","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":"12_CR6","volume-title":"Graph Drawing.","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Upper Saddle River (1999)"},{"key":"12_CR7","unstructured":"Even, S.: Graph Algorithms. Computer Science Press, Potomac (1979)"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BFb0030816","volume-title":"Computing and Combinatorics","author":"Q.W. Feng","year":"1995","unstructured":"Feng, Q.W., Cohen, R.F., Eades, P.: How to draw a planar clustered graph. In: Du, D.-Z., Li, M. (eds.) COCOON 1995. LNCS, vol.\u00a0959, pp. 21\u201330. Springer, Heidelberg (1995)"},{"key":"12_CR9","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. (ed.) ESA 1995. LNCS, vol.\u00a0979, pp. 213\u2013226. Springer, Heidelberg (1995)"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/3-540-36151-0_21","volume-title":"Graph Drawing","author":"C. Gutwenger","year":"2002","unstructured":"Gutwenger, C., J\u00fcnger, M., Leipert, S., Mutzel, P., Percan, M., Weiskircher, R.: Advances in C-planarity testing of clustered graphs. In: Kobourov, S.G., Goodrich, M.T. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 220\u2013235. Springer, Heidelberg (2002)"},{"key":"12_CR11","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31843-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:23:12Z","timestamp":1559229792000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31843-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245285","9783540318439"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31843-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}