Charalampos E. Tsourakakis
Charalampos E. Tsourakakis
Boston University & Harvard University
確認したメール アドレス: seas.harvard.edu - ホームページ
タイトル
引用先
引用先
年
Pegasus: A peta-scale graph mining system implementation and observations
U Kang, CE Tsourakakis, C Faloutsos
ICDM 2009. Ninth IEEE International Conference on Data Mining, 229-238, 2009
8612009
Doulion: counting triangles in massive graphs with a coin
CE Tsourakakis, U Kang, GL Miller, C Faloutsos
KDD 2009. Proceedings of the 15th ACM SIGKDD international conference on …, 2009
3302009
Fast counting of triangles in large real networks without counting: Algorithms and laws
CE Tsourakakis
ICDM'08. Eighth IEEE International Conference on Data Mining, 2008., 608-617, 2008
2702008
FENNEL: Streaming Graph Partitioning for Massive Scale Graphs
CE Tsourakakis, C Gkantsidis, B Radunovic, M Vojnovic
WSDM'14, 2014
2542014
Denser than the Densest Subgraph: Extracting Optimal Quasi-Cliques with Quality Guarantees
CE Tsourakakis, F Bonchi, A Gionis, F Gullo, MA Tsiarli
Proceedings of the 19th ACM SIGKDD international conference on Knowledge …, 2013
2242013
PEGASUS: mining peta-scale graphs
U Kang, CE Tsourakakis, C Faloutsos
Knowledge and information systems 27 (2), 303-325, 2011
1742011
Colorful Triangle Counting and a MapReduce Implementation
R Pagh, CE Tsourakakis
Arxiv preprint arXiv:1103.6073, 2011
1502011
On the vulnerability of large graphs
H Tong, BA Prakash, C Tsourakakis, T Eliassi-Rad, C Faloutsos, ...
Data Mining (ICDM), 2010 IEEE 10th International Conference on, 1091-1096, 2010
1412010
Efficient triangle counting in large graphs via degree-based vertex partitioning
M Kolountzakis, G Miller, R Peng, C Tsourakakis
Algorithms and Models for the Web-Graph, 15-24, 2010
1362010
HADI: Mining radii of large graphs
U Kang, CE Tsourakakis, AP Appel, C Faloutsos, J Leskovec
ACM Transactions on Knowledge Discovery from Data (TKDD) 5 (2), 8, 2011
1312011
The K-clique Densest Subgraph Problem
CE Tsourakakis
24th International World Wide Web Conference (WWW'15), 2015
1052015
Space-and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams
S Bhattacharya, M Henzinger, D Nanongkai, CE Tsourakakis
STOC 2015 (arXiv preprint arXiv:1504.02268), 2015
952015
Scalable motif-aware graph clustering
CE Tsourakakis, J Pachocki, M Mitzenmacher
Proceedings of the 26th International Conference on World Wide Web, 1451-1460, 2017
892017
Hadi: Fast diameter estimation and mining in massive graphs with hadoop
U Kang, C Tsourakakis, AP Appel, C Faloutsos, J Leskovec
ACM Trasactions on Knowledge Discovery from Data (TKDD) 5 (2), 8, 2008
852008
Mach: Fast randomized tensor decompositions
CE Tsourakakis
Arxiv preprint arXiv:0909.4969, 2009
832009
Triangle Sparsifiers
CE Tsourakakis, MN Kolountzakis, GL Miller
polylog (n) 1, 3, 2011
742011
Radius plots for mining tera-byte scale graphs: Algorithms, patterns, and observations
U Kang, CE Tsourakakis, C Faloutsos
662010
Chromatic correlation clustering
F Bonchi, A Gionis, F Gullo, CE Tsourakakis, A Ukkonen
ACM Transactions on Knowledge Discovery from Data (TKDD) 9 (4), 1-24, 2015
642015
Node immunization on large graphs: Theory and algorithms
C Chen, H Tong, BA Prakash, CE Tsourakakis, T Eliassi-Rad, C Faloutsos, ...
IEEE Transactions on Knowledge and Data Engineering 28 (1), 113-126, 2016
612016
Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling
M Mitzenmacher, J Pachocki, R Peng, CE Tsourakakis, SC Xu
21st ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD'15), 2015
602015
現在システムで処理を実行できません。しばらくしてからもう一度お試しください。
論文 1–20