Charalampos E. Tsourakakis

Loading Google Thumbnails...
2012
26Colorful triangle counting and a MapReduce implementation. Rasmus Pagh, Charalampos E. Tsourakakis. Inf. Process. Lett. (112): 277-281 (2012). Web SearchBibTeXDownload
2011
25Approximation algorithms for speeding up dynamic programming and denoising aCGH data. Charalampos E. Tsourakakis, Richard Peng, Maria A. Tsiarli, Gary L. Miller, Russell Schwartz. ACM Journal of Experimental Algorithmics (16) (2011). Web SearchBibTeXDownload
24High Degree Vertices, Eigenvalues and Diameter of Random Apollonian Networks. Alan M. Frieze, Charalampos E. Tsourakakis. CoRR (abs/1104.5259) (2011). Web SearchBibTeXDownload
23Social Network Archetypes and Vertex Similarity, Graph Matching and the Generalized Eigenvalue Problem. Charalampos E. Tsourakakis. CoRR (abs/1110.2813) (2011). Web SearchBibTeXDownload
22The Degree Sequence of Random Apollonian Networks. Charalampos E. Tsourakakis. CoRR (abs/1106.1940) (2011). Web SearchBibTeXDownload
21Colorful Triangle Counting and a MapReduce Implementation. Rasmus Pagh, Charalampos E. Tsourakakis. CoRR (abs/1103.6073) (2011). Web SearchBibTeXDownload
20PEGASUS: mining peta-scale graphs. U. Kang, Charalampos E. Tsourakakis, Christos Faloutsos. Knowl. Inf. Syst. (27): 303-325 (2011). Web SearchBibTeXDownload
19Counting triangles in real-world networks using projections. Charalampos E. Tsourakakis. Knowl. Inf. Syst. (26): 501-520 (2011). Web SearchBibTeXDownload
18Spectral counting of triangles via element-wise sparsification and triangle-based link recommendation. Charalampos E. Tsourakakis, Petros Drineas, Eirinaios Michelakis, Ioannis Koutis, Christos Faloutsos. Social Netw. Analys. Mining (1): 75-81 (2011). Web SearchBibTeXDownload
17Approximate Dynamic Programming using Halfspace Queries and Multiscale Monge Decomposition. Gary L. Miller, Richard Peng, Russell Schwartz, Charalampos E. Tsourakakis. SODA 2011, 1675-1682. Web SearchBibTeXDownload
16HADI: Mining Radii of Large Graphs. U. Kang, Charalampos E. Tsourakakis, Ana Paula Appel, Christos Faloutsos, Jure Leskovec. TKDD (5): 8 (2011). Web SearchBibTeXDownload
2010
15Robust unmixing of tumor states in array comparative genomic hybridization data. David Tolliver, Charalampos E. Tsourakakis, Ayshwarya Subramanian, Stanley Shackney, Russell Schwartz. Bioinformatics [ISMB] (26): 106-114 (2010). Web SearchBibTeXDownload
14Efficient Triangle Counting in Large Graphs via Degree-based Vertex Partitioning. Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, Charalampos E. Tsourakakis. CoRR (abs/1011.0468) (2010). Web SearchBibTeXDownload
13Approximate Dynamic Programming for Fast Denoising of aCGH Data. Gary L. Miller, Richard Peng, Russell Schwartz, Charalampos E. Tsourakakis. CoRR (abs/1003.4942) (2010). Web SearchBibTeXDownload
12On the Vulnerability of Large Graphs. Hanghang Tong, B. Aditya Prakash, Charalampos E. Tsourakakis, Tina Eliassi-Rad, Christos Faloutsos, Duen Horng Chau. ICDM 2010, 1091-1096. Web SearchBibTeXDownload
11MACH: Fast Randomized Tensor Decompositions. Charalampos E. Tsourakakis. SDM 2010, 689-700. Web SearchBibTeXDownload
10Radius Plots for Mining Tera-byte Scale Graphs: Algorithms, Patterns, and Observations. U. Kang, Charalampos E. Tsourakakis, Ana Paula Appel, Christos Faloutsos, Jure Leskovec. SDM 2010, 548-558. Web SearchBibTeXDownload
9Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning. Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, Charalampos E. Tsourakakis. WAW 2010, 15-24. Web SearchBibTeXDownload
2009
8Spectral Counting of Triangles in Power-Law Networks via Element-Wise Sparsification. Charalampos E. Tsourakakis, Petros Drineas, Eirinaios Michelakis, Ioannis Koutis, Christos Faloutsos. ASONAM 2009, 66-71. Web SearchBibTeXDownload
7Approximate Triangle Counting. Charalampos E. Tsourakakis, Mihail N. Kolountzakis, Gary L. Miller. CoRR (abs/0904.3761) (2009). Web SearchBibTeXDownload
6MACH: Fast Randomized Tensor Decompositions. Charalampos E. Tsourakakis. CoRR (abs/0909.4969) (2009). Web SearchBibTeXDownload
5PEGASUS: A Peta-Scale Graph Mining System. U. Kang, Charalampos E. Tsourakakis, Christos Faloutsos. ICDM 2009, 229-238. Web SearchBibTeXDownload
4DOULION: counting triangles in massive graphs with a coin. Charalampos E. Tsourakakis, U. Kang, Gary L. Miller, Christos Faloutsos. KDD 2009, 837-846. Cited by 2Web SearchBibTeXDownload
2008
3Two heads better than one: pattern discovery in time-evolving multi-aspect data. Jimeng Sun, Charalampos E. Tsourakakis, Evan Hoke, Christos Faloutsos, Tina Eliassi-Rad. Data Min. Knowl. Discov. (17): 111-128 (2008). Web SearchBibTeXDownload
2Two Heads Better Than One: Pattern Discovery in Time-Evolving Multi-aspect Data. Jimeng Sun, Charalampos E. Tsourakakis, Evan Hoke, Christos Faloutsos, Tina Eliassi-Rad. ECML/PKDD (1) 2008, 22. Cited by 2Web SearchBibTeXDownload
1Fast Counting of Triangles in Large Real Networks without Counting: Algorithms and Laws. Charalampos E. Tsourakakis. ICDM 2008, 608-617. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research