Travelled to:1 × Australia
1 × France
2 × USA
Collaborated with:A.Gionis A.M.Frieze S.Bhattacharya M.Henzinger D.Nanongkai U.Kang G.L.Miller C.Faloutsos M.Mitzenmacher J.Pachocki R.Peng S.C.Xu F.Bonchi F.Gullo M.A.Tsiarli
Talks about:subgraph (3) larg (3) algorithm (2) graph (2) cliqu (2) dens (2) discoveri (1) techniqu (1) maintain (1) guarante (1)
Person: Charalampos E. Tsourakakis
DBLP: Tsourakakis:Charalampos_E=
Contributed to:
2015
201520132009Wrote 6 papers:
- KDD-2015-GionisT #tutorial
- Dense Subgraph Discovery: KDD 2015 tutorial (AG, CET), pp. 2313–2314.
- KDD-2015-MitzenmacherPPT #clique #detection #network #scalability
- Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling (MM, JP, RP, CET, SCX), pp. 815–824.
- STOC-2015-BhattacharyaHNT #algorithm #maintenance
- Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams (SB, MH, DN, CET), pp. 173–182.
- KDD-2013-FriezeGT #algorithm #graph #mining #modelling #scalability
- Algorithmic techniques for modeling and mining large graphs (AMAzING) (AMF, AG, CET), p. 1523.
- KDD-2013-TsourakakisBGGT #clique #quality
- Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees (CET, FB, AG, FG, MAT), pp. 104–112.
- KDD-2009-TsourakakisKMF #graph #named
- DOULION: counting triangles in massive graphs with a coin (CET, UK, GLM, CF), pp. 837–846.