| 2025 | ICDT | Targeted Least Cardinality Candidate Key for Relational Databases. | Vasileios Nakos, Hung Q. Ngo, Charalampos E. Tsourakakis |
| 2025 | WSDM | Q-DISCO: Query-Centric Densest Subgraphs in Networks with Opinion Information. | Tianyi Chen, Atsushi Miyauchi, Charalampos E. Tsourakakis |
| 2024 | ICML | On the Role of Edge Dependency in Graph Generative Models. | Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis |
| 2024 | WWW | Finding Dense and Persistently Expansive Subgraphs. | Petros Petsinis, Charalampos E. Tsourakakis, Panagiotis Karras |
| 2024 | WWW | Markovletics: Methods and A Novel Application for Learning Continuous-Time Markov Chain Mixtures. | Fabian Spaeh, Charalampos E. Tsourakakis |
| 2023 | KDD | Densest Diverse Subgraphs: How to Plan a Successful Cocktail Party with Diversity. | Atsushi Miyauchi, Tianyi Chen, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis |
| 2023 | PODS | Node-Differentially Private Estimation of the Number of Connected Components. | Iden Kalemaj, Sofya Raskhodnikova, Adam D. Smith, Charalampos E. Tsourakakis |
| 2023 | WWW | Learning Mixtures of Markov Chains with Quality Guarantees. | Fabian Spaeh, Charalampos E. Tsourakakis |
| 2022 | ICML | Practical Almost-Linear-Time Approximation Algorithms for Hybrid and Overlapping Graph Clustering. | Lorenzo Orecchia, Konstantinos Ameranis, Charalampos E. Tsourakakis, Kunal Talwar |
| 2022 | KDD | AntiBenford Subgraphs: Unsupervised Anomaly Detection in Financial Networks. | Tianyi Chen, Charalampos E. Tsourakakis |
| 2022 | SDM | Dense and well-connected subgraph detection in dual networks. | Tianyi Chen, Francesco Bonchi, David Garca-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis |
| 2021 | ICML | DeepWalking Backwards: From Embeddings Back to Graphs. | Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis |
| 2021 | KDD | Triangle-aware Spectral Sparsifiers and Community Detection. | Konstantinos Sotiropoulos, Charalampos E. Tsourakakis |
| 2020 | ISIT | Optimal Learning of Joint Alignments with a Faulty Oracle. | Kasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis |
| 2020 | ITA | Optimal Learning of Joint Alignments with a Faulty Oracle. | Kasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis |
| 2020 | WWW | Flowless: Extracting Densest Subgraphs Without Flow Computations. | Digvijay Boob, Yu Gao, Richard Peng, Saurabh Sawlani, Charalampos E. Tsourakakis, Di Wang, Junxing Wang |
| 2020 | WWW | Query-Efficient Correlation Clustering. | David Garca-Soriano, Konstantin Kutzkov, Francesco Bonchi, Charalampos E. Tsourakakis |
| 2020 | WWW | Clustering with a faulty oracle. | Kasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis |
| 2018 | KDD | Opinion Dynamics with Varying Susceptibility to Persuasion. | Rediet Abebe, Jon M. Kleinberg, David C. Parkes, Charalampos E. Tsourakakis |
| 2018 | WWW | Minimizing Polarization and Disagreement in Social Networks. | Cameron Musco, Christopher Musco, Charalampos E. Tsourakakis |
| 2018 | WAW | Joint Alignment from Pairwise Differences with a Noisy Oracle. | Michael Mitzenmacher, Charalampos E. Tsourakakis |
| 2017 | WWW | Scalable Motif-aware Graph Clustering. | Charalampos E. Tsourakakis, Jakub Pachocki, Michael Mitzenmacher |
| 2016 | ICDM | ADAGIO: Fast Data-Aware Near-Isometric Linear Embeddings. | Jaroslaw Blasiok, Charalampos E. Tsourakakis |
| 2016 | KDD | Scalable Betweenness Centrality Maximization via Sampling. | Ahmad Mahmoody, Charalampos E. Tsourakakis, Eli Upfal |
| 2015 | KDD | Dense Subgraph Discovery: KDD 2015 tutorial. | Aristides Gionis, Charalampos E. Tsourakakis |
| 2015 | KDD | Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling. | Michael Mitzenmacher, Jakub Pachocki, Richard Peng, Charalampos E. Tsourakakis, Shen Chen Xu |
| 2015 | WWW | Provably Fast Inference of Latent Features from Networks: with Applications to Learning Social Circles and Multilabel Classification. | Charalampos E. Tsourakakis |
| 2015 | WWW | The K-clique Densest Subgraph Problem. | Charalampos E. Tsourakakis |
| 2015 | STOC | Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams. | Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Charalampos E. Tsourakakis |
| 2014 | WSDM | FENNEL: streaming graph partitioning for massive scale graphs. | Charalampos E. Tsourakakis, Christos Gkantsidis, Bozidar Radunovic, Milan Vojnovic |
| 2013 | KDD | Algorithmic techniques for modeling and mining large graphs (AMAzING). | Alan M. Frieze, Aristides Gionis, Charalampos E. Tsourakakis |
| 2013 | KDD | Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees. | Charalampos E. Tsourakakis, Francesco Bonchi, Aristides Gionis, Francesco Gullo, Maria A. Tsiarli |
| 2013 | WABI | Modeling Intratumor Gene Copy Number Heterogeneity Using Fluorescence in Situ Hybridization Data. | Charalampos E. Tsourakakis |
| 2012 | WAW | On Certain Properties of Random Apollonian Networks. | Alan M. Frieze, Charalampos E. Tsourakakis |
| 2011 | SODA | Approximate Dynamic Programming using Halfspace Queries and Multiscale Monge Decomposition. | Gary L. Miller, Richard Peng, Russell Schwartz, Charalampos E. Tsourakakis |
| 2010 | ICDM | On the Vulnerability of Large Graphs. | Hanghang Tong, B. Aditya Prakash, Charalampos E. Tsourakakis, Tina Eliassi-Rad, Christos Faloutsos, Duen Horng Chau |
| 2010 | SDM | Radius Plots for Mining Tera-byte Scale Graphs: Algorithms, Patterns, and Observations. | U Kang, Charalampos E. Tsourakakis, Ana Paula Appel, Christos Faloutsos, Jure Leskovec |
| 2010 | SDM | MACH: Fast Randomized Tensor Decompositions. | Charalampos E. Tsourakakis |
| 2010 | WAW | Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning. | Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, Charalampos E. Tsourakakis |
| 2009 | ICDM | PEGASUS: A Peta-Scale Graph Mining System. | U Kang, Charalampos E. Tsourakakis, Christos Faloutsos |
| 2009 | KDD | DOULION: counting triangles in massive graphs with a coin. | Charalampos E. Tsourakakis, U Kang, Gary L. Miller, Christos Faloutsos |
| 2008 | ICDM | Fast Counting of Triangles in Large Real Networks without Counting: Algorithms and Laws. | Charalampos E. Tsourakakis |