| 2013 | ||
|---|---|---|
| j4 | U. Kang, Martial Hebert, Soonyong Park: Fast and scalable approximate spectral graph matching for correspondence problems. Inf. Sci. 220: 306-318 (2013) | |
| 2012 | ||
| j3 | U. Kang, Hanghang Tong, Jimeng Sun, Ching-Yung Lin, Christos Faloutsos: gbase: an efficient analysis platform for large graphs. VLDB J. 21(5): 637-650 (2012) | |
| c16 | U. Kang, Duen Horng Chau, Christos Faloutsos: Pegasus: Mining billion-scale graphs in the cloud. ICASSP 2012: 5341-5344 | |
| c15 | U. Kang, Evangelos E. Papalexakis, Abhay Harpale, Christos Faloutsos: GigaTensor: scaling tensor analysis up by 100 times - algorithms and discoveries. KDD 2012: 316-324 | |
| c14 | ||
| c13 | Christos Faloutsos, U. Kang: Managing and mining large graphs: patterns and algorithms. SIGMOD Conference 2012: 585-588 | |
| c12 | Leman Akoglu, Duen Horng Chau, U. Kang, Danai Koutra, Christos Faloutsos: OPAvion: mining and visualization in large graphs. SIGMOD Conference 2012: 717-720 | |
| 2011 | ||
| j2 | U. Kang, Charalampos E. Tsourakakis, Christos Faloutsos: PEGASUS: mining peta-scale graphs. Knowl. Inf. Syst. 27(2): 303-325 (2011) | |
| j1 | U. Kang, Charalampos E. Tsourakakis, Ana Paula Appel, Christos Faloutsos, Jure Leskovec: HADI: Mining Radii of Large Graphs. TKDD 5(2): 8 (2011) | |
| c11 | U. Kang, Duen Horng Chau, Christos Faloutsos: Mining large graphs: Algorithms, inference, and discoveries. ICDE 2011: 243-254 | |
| c10 | U. Kang, Christos Faloutsos: Beyond 'Caveman Communities': Hubs and Spokes for Graph Compression and Mining. ICDM 2011: 300-309 | |
| c9 | Robson Leonardo Ferreira Cordeiro, Caetano Traina Jr., Agma Juci Machado Traina, Julio López, U. Kang, Christos Faloutsos: Clustering very large multi-dimensional datasets with MapReduce. KDD 2011: 690-698 | |
| c8 | U. Kang, Hanghang Tong, Jimeng Sun, Ching-Yung Lin, Christos Faloutsos: GBASE: a scalable and general graph management system. KDD 2011: 1091-1099 | |
| c7 | U. Kang, Brendan Meeder, Christos Faloutsos: Spectral Analysis for Billion-Scale Graphs: Discoveries and Implementation. PAKDD (2) 2011: 13-25 | |
| c6 | Danai Koutra, Tai-You Ke, U. Kang, Duen Horng Chau, Hsing-Kuo Kenneth Pao, Christos Faloutsos: Unifying Guilt-by-Association Approaches: Theorems and Fast Algorithms. ECML/PKDD (2) 2011: 245-260 | |
| c5 | U. Kang, Spiros Papadimitriou, Jimeng Sun, Hanghang Tong: Centralities in Large Networks: Algorithms and Observations. SDM 2011: 119-130 | |
| 2010 | ||
| c4 | U. Kang, Mary McGlohon, Leman Akoglu, Christos Faloutsos: Patterns on the Connected Components of Terabyte-Scale Graphs. ICDM 2010: 875-880 | |
| c3 | U. Kang, Charalampos E. Tsourakakis, Ana Paula Appel, Christos Faloutsos, Jure Leskovec: Radius Plots for Mining Tera-byte Scale Graphs: Algorithms, Patterns, and Observations. SDM 2010: 548-558 | |
| 2009 | ||
| c2 | U. Kang, Charalampos E. Tsourakakis, Christos Faloutsos: PEGASUS: A Peta-Scale Graph Mining System. ICDM 2009: 229-238 | |
| c1 | Charalampos E. Tsourakakis, U. Kang, Gary L. Miller, Christos Faloutsos: DOULION: counting triangles in massive graphs with a coin. KDD 2009: 837-846 | |
Data released under the ODC-BY 1.0 license — See also our legal information page