{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:43:25Z","timestamp":1742913805081,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319501055"},{"type":"electronic","value":"9783319501062"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-50106-2_9","type":"book-chapter","created":{"date-parts":[[2016,12,7]],"date-time":"2016-12-07T15:22:42Z","timestamp":1481124162000},"page":"107-120","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Computing NodeTrix Representations of Clustered Graphs"],"prefix":"10.1007","author":[{"given":"Giordano","family":"Da Lozzo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Di Battista","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrizio","family":"Frati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Patrignani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,8]]},"reference":[{"key":"9_CR1","unstructured":"CiteVis: Visualizing citations among InfoVis conference papers. \n                      http:\/\/www.cc.gatech.edu\/gvu\/ii\/citevis"},{"key":"9_CR2","unstructured":"NodeTrix. \n                      http:\/\/www.aviz.fr\/Research\/Nodetrix"},{"key":"9_CR3","unstructured":"NodeTrix Representations: a proof-of-concept editor. \n                      http:\/\/www.dia.uniroma3.it\/~dalozzo\/projects\/matrix"},{"issue":"2","key":"9_CR4","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.comgeo.2014.08.001","volume":"48","author":"P Angelini","year":"2015","unstructured":"Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., Roselli, V.: Relaxing the constraints of clustered planarity. Comput. Geom.: Theory Appl. 48(2), 42\u201375 (2015)","journal-title":"Comput. Geom.: Theory Appl."},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-319-27261-0_19","volume-title":"Graph Drawing and Network Visualization","author":"P Angelini","year":"2015","unstructured":"Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., Rutter, I.: Intersection-link representations of graphs. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 217\u2013230. Springer, Heidelberg (2015). doi:\n                      10.1007\/978-3-319-27261-0_19"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2014.12.019","volume":"571","author":"P Angelini","year":"2015","unstructured":"Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F., Roselli, V.: The importance of being proper (in clustered-level planarity and T-level planarity). Theor. Comput. Sci. 571, 1\u20139 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.tcs.2014.11.016","volume":"575","author":"P Angelini","year":"2015","unstructured":"Angelini, P., Da Lozzo, G., Neuwirth, D.: Advancements on SEFE and partitioned book embedding problems. Theor. Comput. Sci. 575, 71\u201389 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"9_CR8","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B Aspvall","year":"1979","unstructured":"Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inf. Process. Lett. 8(3), 121\u2013123 (1979)","journal-title":"Inf. Process. Lett."},{"issue":"11","key":"9_CR9","first-page":"1587","volume":"17","author":"V Batagelj","year":"2011","unstructured":"Batagelj, V., Brandenburg, F.J., Didimo, W., Liotta, G., Palladino, P., Patrignani, M.: Visual analysis of large graphs using $$(x, y)$$-clustering and hybrid visualizations. IEEE TVCG 17(11), 1587\u20131598 (2011)","journal-title":"IEEE TVCG"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-662-45803-7_35","volume-title":"Graph Drawing","author":"M Chimani","year":"2014","unstructured":"Chimani, M., Battista, G., Frati, F., Klein, K.: Advances on testing c-planarity of embedded flat clustered graphs. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 416\u2013427. Springer, Heidelberg (2014). doi:\n                      10.1007\/978-3-662-45803-7_35"},{"issue":"2","key":"9_CR11","doi-asserted-by":"publisher","first-page":"225","DOI":"10.7155\/jgaa.00165","volume":"12","author":"PF Cortese","year":"2008","unstructured":"Cortese, P.F., Di Battista, G., Frati, F., Patrignani, M., Pizzonia, M.: C-planarity of c-connected clustered graphs. J. Graph Algorithms Appl. 12(2), 225\u2013262 (2008)","journal-title":"J. Graph Algorithms Appl."},{"key":"9_CR12","unstructured":"Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M.: Computing nodetrix representations of clustered graphs. CoRR abs\/1608.08952v1 (2016). \n                      http:\/\/arxiv.org\/abs\/1608.08952v1"},{"issue":"3","key":"9_CR13","doi-asserted-by":"publisher","first-page":"349","DOI":"10.7155\/jgaa.00191","volume":"13","author":"G Di Battista","year":"2009","unstructured":"Di Battista, G., Frati, F.: Efficient c-planarity testing for embedded flat clustered graphs with small faces. J. Graph Algorithms Appl. 13(3), 349\u2013378 (2009)","journal-title":"J. Graph Algorithms Appl."},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-60313-1_145","volume-title":"Algorithms \u2014 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. 979, pp. 213\u2013226. Springer, Heidelberg (1995). doi:\n                      10.1007\/3-540-60313-1_145"},{"issue":"1","key":"9_CR15","doi-asserted-by":"publisher","first-page":"73","DOI":"10.7155\/jgaa.00160","volume":"12","author":"C Gutwenger","year":"2008","unstructured":"Gutwenger, C., Klein, K., Mutzel, P.: Planarity testing and optimal edge insertion with embedding constraints. J. Graph Algorithms Appl. 12(1), 73\u201395 (2008)","journal-title":"J. Graph Algorithms Appl."},{"issue":"6","key":"9_CR16","first-page":"1317","volume":"14","author":"N Henry","year":"2008","unstructured":"Henry, N., Bezerianos, A., Fekete, J.D.: Improving the readability of clustered social networks using node duplication. IEEE TVCG 14(6), 1317\u20131324 (2008)","journal-title":"IEEE TVCG"},{"issue":"6","key":"9_CR17","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1109\/TVCG.2007.70582","volume":"13","author":"N Henry","year":"2007","unstructured":"Henry, N., Fekete, J.D., McGuffin, M.J.: NodeTrix: a hybrid visualization of social networks. IEEE Trans. Vis. Comput. Graph. 13(6), 1302\u20131309 (2007)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"1","key":"9_CR18","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1137\/0208008","volume":"8","author":"J Opatrny","year":"1979","unstructured":"Opatrny, J.: Total ordering problem. SIAM J. Comput. 8(1), 111\u2013114 (1979)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9_CR19","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1006\/jagm.1994.1012","volume":"16","author":"JP Spinrad","year":"1994","unstructured":"Spinrad, J.P.: Recognition of circle graphs. J. Algorithms 16(2), 264\u2013282 (1994)","journal-title":"J. Algorithms"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BFb0035832","volume-title":"STACS 88","author":"W Unger","year":"1988","unstructured":"Unger, W.: On the k-colouring of circle-graphs. In: Cori, R., Wirsing, M. (eds.) STACS 1988. LNCS, vol. 294, pp. 61\u201372. Springer, Heidelberg (1988). doi:\n                      10.1007\/BFb0035832"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50106-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T00:40:00Z","timestamp":1600476000000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50106-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501055","9783319501062"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50106-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"8 December 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}