{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,3]],"date-time":"2026-10-03T13:19:25Z","timestamp":1791033565985,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,4,27]],"date-time":"2013-04-27T00:00:00Z","timestamp":1367020800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,4,27]]},"DOI":"10.1145\/2470654.2466444","type":"proceedings-article","created":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T19:47:45Z","timestamp":1367437665000},"page":"3247-3256","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":161,"title":["Motif simplification"],"prefix":"10.1145","author":[{"given":"Cody","family":"Dunne","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, Maryland, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ben","family":"Shneiderman","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, Maryland, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,4,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2006.120"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1134271.1134277"},{"key":"e_1_3_2_1_3_1","volume-title":"Graph drawing: Algorithms for the visualization of graphs","author":"Battista G. D.","year":"1998","unstructured":"Battista , G. D. , Eades , P. , Tamassia , R. , and Tollis , I. G . Graph drawing: Algorithms for the visualization of graphs . Prentice Hall , July 1998 . Battista, G. D., Eades, P., Tamassia, R., and Tollis, I. G. Graph drawing: Algorithms for the visualization of graphs. Prentice Hall, July 1998."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.229.4716.828"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2207676.2208293"},{"key":"e_1_3_2_1_6_1","first-page":"364","article-title":"Listing all maximal cliques in large sparse real-world graphs","volume":"6630","author":"Eppstein D.","year":"2011","unstructured":"Eppstein , D. , and Strash , D . Listing all maximal cliques in large sparse real-world graphs . In SEA , vol. 6630 ( 2011 ), 364 -- 375 . Eppstein, D., and Strash, D. Listing all maximal cliques in large sparse real-world graphs. In SEA, vol. 6630 (2011), 364--375.","journal-title":"SEA"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1753326.1753358"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380211102"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOVIS.2004.1"},{"key":"e_1_3_2_1_10_1","volume-title":"RECOMB","author":"Grochow J.","year":"2007","unstructured":"Grochow , J. , and Kellis , M . Network motif discovery using Subgraph Enumeration and Symmetry-Breaking . In RECOMB ( 2007 ), 92--106. Grochow, J., and Kellis, M. Network motif discovery using Subgraph Enumeration and Symmetry-Breaking. In RECOMB (2007), 92--106."},{"key":"e_1_3_2_1_11_1","volume-title":"Morgan Kaufmann","author":"Hansen D.","year":"2011","unstructured":"Hansen , D. , Shneiderman , B. , and Smith , M . Analyzing social media networks with NodeXL: Insights from a connected world . Morgan Kaufmann , 2011 . Hansen, D., Shneiderman, B., and Smith, M. Analyzing social media networks with NodeXL: Insights from a connected world. Morgan Kaufmann, 2011."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00051"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2006.160"},{"key":"e_1_3_2_1_14_1","volume-title":"INTERACT","author":"Henry N.","year":"2007","unstructured":"Henry , N. , and Fekete , J . -D. MatLink: Enhanced matrix visualization for analyzing social networks . In INTERACT ( 2007 ), 288--302. Henry, N., and Fekete, J.-D. MatLink: Enhanced matrix visualization for analyzing social networks. In INTERACT (2007), 288--302."},{"key":"e_1_3_2_1_15_1","volume-title":"Data Visualization","author":"Herman I.","year":"1999","unstructured":"Herman , I. , Marshall , M. S. , Melan\u00e7on , G. , Duke , D. J. , Delest , M. , and Domenger , J . -P. Skeletal images as visual cues in graph visualization . In Data Visualization ( 1999 ), 13--22. Herman, I., Marshall, M. S., Melan\u00e7on, G., Duke, D. J., Delest, M., and Domenger, J.-P. Skeletal images as visual cues in graph visualization. In Data Visualization (1999), 13--22."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/IV.2005.138"},{"key":"e_1_3_2_1_17_1","volume-title":"NetLens: Iterative exploration of content-actor network data","author":"Kang H.","year":"2006","unstructured":"Kang , H. , Plaisant , C. , Lee , B. , and Bederson , B. B . NetLens: Iterative exploration of content-actor network data . In IEEE VAST ( 2006 ), 91--98. Kang, H., Plaisant, C., Lee, B., and Bederson, B. B. NetLens: Iterative exploration of content-actor network data. In IEEE VAST (2006), 91--98."},{"key":"e_1_3_2_1_18_1","volume-title":"Complexity of Computer Computations","author":"Karp R. M.","year":"1972","unstructured":"Karp , R. M. Reducibility among combinatorial problems . In Complexity of Computer Computations , R. E. Miller and J. W. Thatcher, Eds. Plenum Press , 1972 , 85--103. Karp, R. M. Reducibility among combinatorial problems. In Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, Eds. Plenum Press, 1972, 85--103."},{"key":"e_1_3_2_1_19_1","volume-title":"APVis","author":"Klukas C.","year":"2006","unstructured":"Klukas , C. , Schreiber , F. , and Schw\u00f6bbermeyer , H . Coordinated perspectives and enhanced force-directed layout for the analysis of network motifs . In APVis ( 2006 ), 39--48. Klukas, C., Schreiber, F., and Schw\u00f6bbermeyer, H. Coordinated perspectives and enhanced force-directed layout for the analysis of network motifs. In APVis (2006), 39--48."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1168149.1168168"},{"key":"e_1_3_2_1_21_1","volume-title":"Anomaly analysis and visualization through compressed graphs","author":"Liao Q.","year":"2012","unstructured":"Liao , Q. , Shi , L. , and Sun , X . Anomaly analysis and visualization through compressed graphs . In IEEE LDAV Poster Session ( 2012 ). Liao, Q., Shi, L., and Sun, X. Anomaly analysis and visualization through compressed graphs. In IEEE LDAV Poster Session (2012)."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/22949.22950"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(96)00299-7"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.298.5594.824"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376661"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2006.166"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1556460.1556497"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.06.015"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2379690.2379699"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFVIS.2004.43"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1124772.1124891"},{"key":"e_1_3_2_1_32_1","first-page":"2","article-title":"Visualizing the signatures of social roles in online discussion groups","volume":"8","author":"Welser H. T.","year":"2007","unstructured":"Welser , H. T. , Gleave , E. , Fisher , D. , and Smith , M . Visualizing the signatures of social roles in online discussion groups . JOSS 8 , 2 ( 2007 ). Welser, H. T., Gleave, E., Fisher, D., and Smith, M. Visualizing the signatures of social roles in online discussion groups. JOSS 8, 2 (2007).","journal-title":"JOSS"}],"event":{"name":"CHI '13: CHI Conference on Human Factors in Computing Systems","location":"Paris France","acronym":"CHI '13","sponsor":["SIGCHI ACM Special Interest Group on Computer-Human Interaction"]},"container-title":["Proceedings of the SIGCHI Conference on Human Factors in Computing Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2470654.2466444","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2470654.2466444","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:18:23Z","timestamp":1750234703000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2470654.2466444"}},"subtitle":["improving network visualization readability with fan, connector, and clique glyphs"],"short-title":[],"issued":{"date-parts":[[2013,4,27]]},"references-count":32,"alternative-id":["10.1145\/2470654.2466444","10.1145\/2470654"],"URL":"https:\/\/doi.org\/10.1145\/2470654.2466444","relation":{},"subject":[],"published":{"date-parts":[[2013,4,27]]},"assertion":[{"value":"2013-04-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}