Academic Record: Google Scholar, DBLP
2023
- Densest diverse subgraphs: How to Plan a Successful Cocktail Party with Diversity
Co-authors: Tianyi Chen, Atsushi Miyauchi, Konstantinos Sotiropoulos
ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2023) - Node-Differentially Private Estimation of the Number of Connected Components
Co-authors: Iden Kalemaj, Sofya Raskhodnikova, Adam Smith
ACM Principles of Database Systems (PODS 2023) - Learning Mixtures of Markov Chains with Quality Guarantees
Co-author: Fabian Christian Spaeh
Web Conference (WebConf 2023) - Discovering Polarization Niches via Dense Subgraphs with Attractors and Repulsers
Co-authors: Adriano Fazzone, Tommaso Lanciano, Riccardo Denni, Francesco Bonchi
49th International Conference on Very Large Databases (VLDB 2023)
2022
- Polarizing Opinion Dynamics with Confirmation Bias
Co-authors: Tianyi Chen, Xu Wang
The 13th International Conference on Social Informatics (SocInfo 2022) - Edge-Colored Directed Subgraph Enumeration on the Connectome
Co-authors: Tianyi Chen, Brian Matajek, Michael Mitzenmacher, Hanspeter Pfister, Donglai Wei
Nature Scientific Reports - Algorithmic Tools for Mining the Motif Structure of Networks
Co-authors: Tianyi Chen, Brian Matajek, Michael Mitzenmacher
European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD 2022) - AntiBenford Subgraphs: Unsupervised Anomaly Detection in Financial Networks
Co-authors: Tianyi Chen
ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD 2022) - Practical Almost-Linear-Time Approximation Algorithms for Hybrid and Overlapping Graph Clustering
Co-authors: Kostas Ameranis, Lorenzo Orecchia, Kunal Talwar
International Conference on Machine Learning (ICML 2022) - Dense and well-connected subgraph detection in dual networks
Co-authors: Tianyi Chen, Francesco Bonchi, David Garcia-Soriano, Atsushi Miyauchi
SIAM International Conference on Data Mining (SDM22) - Opinion Dynamics with Varying Susceptibility to Persuasion via Non-Convex Local Search
Co-authors: Rediet Abebe, T-H. Hubert Chan, Jon Kleinberg, Zhibin Liang, David Parkes, Mauro Sozio
Transactions on Knowledge Discovery from Data (TKDD)
2021
- On the Power of Edge Independent Graph Models
Co-authors: Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos
Thirty-fifth Conference on Neural Information Processing Systems (NeurIPS 2021) - Finding Densest k-connected Subgraphs
Co-authors: Francesco Bonchi, David Garcia Soriano, Atsushi Miyauchi
Journal of Discrete Applied Mathematics - Smurf-based Anti-Money Laundering in Time-Evolving Transaction Networks
Co-authors: Michele Starnini, Maryam Zamanipour, Andre Panisson, Walter Allasia, Marco Fornasiero, Laura Li Puma, Valeria Ricci, Silvia Ronchiadin, Angela Ugrinoska, Marco Varetto and Dario Moncalvo
European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD 2021) - Triangle-aware Spectral Sparsifiers and Community Detection
Co-author: Konstantinos Sotiropoulos
Knowledge Discovery in Databases (KDD 2021) - DeepWalking Backwards: From Embeddings Back to Graphs
Co-authors: Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos
International Conference on Machine Learning (ICML 2021)
2020
- Joint Alignment From Pairwise Differences with a Noisy Oracle
Co-author: Michael Mitzenmacher
Internet Mathematics (Invited WAW 2018 paper) - Predicting Positive and Negative Links with Noisy Queries: Theory & Practice
Co-authors: Michael Mitzenmacher, Kasper Green Larsen Jarosław Błasiok, Ben Lawson, Preetum Nakkiran, Vasileios Nakos
Internet Mathematics
Project Web page - Node Embeddings and Exact Low-Rank Representations of Complex Networks
Co-authors: Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos
Thirty-fourth Conference on Neural Information Processing Systems (NeurIPS 2020) - Optimal Learning of Joint Alignments with a Faulty Oracle
Co-authors: Kasper Green Larsen, Michael Mitzenmacher
2020 IEEE International Symposium on Information Theory (ISIT 2020) - Flowless: Extracting Densest Subgraphs Without Flow Computations
Co-authors: Digvijay Boob, Yu Gao, Richard Peng, Saurabh Sawlani, Di Wang, Junxing Wang
The WebConference 2020 (WWW 2020) - Query-efficient correlation clustering
Co-authors: Francesco Bonchi, David Garcia Soriano, Konstantin Kutzkov
The WebConference 2020 (WWW 2020) - Clustering with a faulty oracle
Co-authors: Kasper Green Larsen, Michael Mitzenmacher
The WebConference 2020 (WWW 2020)
2019
- TwitterMancer: Predicting Interactions on Twitter Accurately
Co-authors: Kostas Sotiropoulos, Polyvios Pratikakis, John Byers
57th Annual Allerton Conference on Communication, Control, and Computing (Allerton 2019) - Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries
Co-authors: Tianyi Chen, Naonori Kakimura, Jakub Pachocki
ECML-PKDD 2019
2018
- Learning Networks from Random Walk-Based Node Similarities
Co-authors: Jeremy G. Hoskins, Cameron Musco, Christopher Musco
NIPS 2018
Project Web page - Risk-Averse Matchings over Uncertain Graph Databases
Co-authors: Shreyas Sekar, Johnson Lam, Liu Yang
ECML-PKDD 2018
Project Web page - Opinion Dynamics with Varying Susceptibility to Persuasion
Co-authors: Rediet Abebe, Jon Kleinberg, David Parkes
KDD 2018
Please see updated version of our work here, merged with the paper of Chan, Liang, Sozio WWW 2019 - Joint Alignment From Pairwise Differences with a Noisy Oracle
Co-author: Michael Mitzenmacher
WAW 2018 - Minimizing Polarization and Disagreement in Social Networks
Co-authors: Cameron Musco, Chris Musco
WWW 2018
Project Web page
2017
- Scalable motif-aware graph clustering
Co-authors: Jakub Pachocki, Michael Mitzenmacher
WWW 2017
Project Web page
2016
- Predicting Signed Edges with O(n^(1+o(1))) Queries
Co-authors: Michael Mitzenmacher
Project Web page - Adagio: Fast Data-Aware Near-Isometric Linear Embeddings
Co-author: Jarosław Błasiok
IEEE International Conference on Data Mining (ICDM) 2016 - Motif-Driven Graph Analysis
54th Annual Allerton Conference on Communication, Control, and Computing - Scalable Betweenness Centrality Maximization via Sampling
Co-authors: Ahmad Mahmoody, Eli Upfal
ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2016) - Node Immunization on Large Graphs: Theory and Algorithms
Transactions on Knowledge and Data Engineering (TKDE)
Co-authors: Chen Chen, Hanghang Tong, Aditya Prakash, Christos Faloutsos, Tina-Elliasi Rad
2015
- Rainbow Connection of Random Regular Graphs
Co-authors: Andrzej Dudek, Alan Frieze
SIAM Journal of Discrete Mathematics - Streaming Graph Partitioning in the Planted Partition Model
ACM Conference on Online Social Networks (COSN’15) - Dense subgraph discovery – Tutorial
Co-authors: Aristides Gionis
ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2015) - Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling
21st ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2015)
Co-authors: Michael Mitzenmacher, Jakub Pachocki, Richard Peng, Shen Chen Xu - Space- and Time-Efficient Algorithms for Maintaining Dense Subgraphs on One-Pass Dynamic Streams
47th ACM Symposium on Theory of Computing (STOC 2015)
Co-authors: Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai - Provably Fast Inference of Latent Features from Networks
24th International World Wide Web Conference (WWW 2015) - The k-clique Densest Subgraph Problem
24th International World Wide Web Conference (WWW 2015) - Chromatic Correlation Clustering
Co-authors: Francesco Bonchi, Aristides Gionis, Francesco Gullo, Antti Ukkonen
ACM Transactions on Knowledge Discovery from Data (TKDD)
2014
- Graph Partitioning for Massive-Scale Graphs
Patent, Pub. No.: US2014/0320497, Pub.Data: Oct. 30, 2014
Co-inventors: Christos Gkantsidis, Bozidar Radunovic, Milan Vojnovic
Assignee: Microsoft Corporation, Redmond, WA - Centralized, Measurement-based, Spectrum Management for Environments with Heterogeneous Wireless Networks
Co-authors: George Nychis, Srinivasan Seshan, Peter Steenkiste
IEEE International Symposium on Dynamic Spectrum Access Networks 2014 (DySPAN 2014) - Fennel: Streaming Graph Partitioning for Massive Scale Graphs
Co-authors: Christos Gkantsidis, Bozidar Radunovic, Milan Vojnovic
7th ACM Web Search and Data Mining Conference (WSDM 2014)
For more details, see the Microsoft technical report. - Towards Quantifying Vertex Similarity in Networks
Internet Mathematics
2013
- Modeling Intratumor Gene Copy Number Heterogeneity using Fluorescence in Situ Hybridization data
WABI 2013 - Algorithmic techniques for modeling and mining large graphs
Coauthors: Alan Frieze, Aristides Gionis
ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2013)
European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD 2013) - Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees
Coauthors: Francesco Bonchi, Aris Gionis, Francesco Gullo, Maria A. Tsiarli
ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2013)
For more details, see Chapter 6. - Some Properties of Random Apollonian Networks
Coauthors: Alan Frieze
Internet Mathematics
Invited paper - Mathematical and Algorithmic Analysis of Network and Biological Data
Ph.D. Thesis
2012
- Rainbow Connectivity of Sparse Random Graphs
Co-authors: Alan Frieze
Electronic Journal of Combinatorics (EJC) - Rainbow Connectivity of Sparse Random Graphs
Co-authors: Alan Frieze
RANDOM 2012
See journal version (EJC) - Certain Properties of Random Apollonian Networks
Co-authors: Alan Frieze
9th Workshop on Algorithms and Models for the Web Graph (WAW 2012) - Efficient Triangle Counting in Large Graphs via Degree-based Vertex Partitioning
Co-authors: Mihail N. Kolountzakis, Gary L. Miller, Richard Peng
Internet Mathematics
Invited paper - Colorful Triangle Counting and a MapReduce Implementation
Co-authors: Rasmus Pagh
Information Processing Letters
2011
- Approximation Algorithms for Speeding up Dynamic Programming and Denoising aCGH data
Co-authors: Richard Peng, Maria Tsiarli, Gary L. Miller, Russell Schwartz
ACM Journal on Experimental Algorithmics - Triangle Sparsifiers
Co-authors: Mihail N. Kolountzakis, Gary L. Miller
Journal of Graph Algorithms And Applications - Approximate Dynamic Programming using Halfspace Queries and Multiscale Monge decomposition
Co-authors: Gary L. Miller, Richard Peng, Russell Schwartz
Symposium on Discrete Algorithms (SODA 2011) - PEGASUS: Mining Peta-Scale Graphs
Co-authors: U Kang, Christos Faloutsos
Knowledge and Information Systems (KAIS)
Invited Journal Paper - Counting Triangles Using Projections
Knowledge and Information Systems (KAIS)
Invited Journal Paper - HADI: Mining Radii of Large Graphs
Co-authors: U Kang, Ana Paula Appel, Christos Faloutsos, Jure Leskovec
ACM Transactions on Knowledge Discovery from Data - Spectral Counting of Triangles via Element-Wise Sparsification and Triangle-based Link Recommendation
Co-authors: Petros Drineas, Eirinaios Michelakis, Ioannis Koutis, Christos Faloutsos
Advances in Social Networks Analysis and Mining
Invited book chapter - Scale Graph Mining With MapReduce: Diameter Estimation and Eccentricity Plots of Massive Graphs with Mining Applications
Social Network Mining, Analysis and Research Trends: Techniques and Applications
Invited book chapter - Scale Graph Mining with MapReduce: Counting Triangles in Large Real Networks
Invited book chapter
2010
- Data Mining with MapReduce: Graph and Tensor Algorithms with Applications
Master Thesis, Machine Learning Department, CMU - Efficient Triangle Counting in Large Graphs via Degree-based Vertex Partitioning
Co-authors: Mihail N. Kolountzakis, Gary L. Miller, Richard Peng
7th Workshop on Algorithms and Models for the Web Graph (WAW 2010)
Invited to special issue - Radius Plots for Mining Tera-byte Scale Graphs: Algorithms, Patterns, and Observations
Co-authors: U Kang, Ana Paula Appel, Christos Faloutsos, Jure Leskovec
SIAM International Conference on Data Mining (SDM 2010)
Invited to special issue - MACH: Fast Randomized Tensor Decompositions
SIAM International Conference on Data Mining (SDM 2010)
Project web page - On the Vulnerability of Large Graphs
Co-authors: Hanghang Tong, B. Aditya Prakash, Tina Eliassi-Rad, Christos Faloutsos, Duen Horng Chau
IEEE International Conference on Data Mining (ICDM 2010) - Robust Unmixing of Tumor States in Array Comparative Genomic Hybridization Data
Co-authors: David Tolliver, Ayshwarya Subramanian, Stanley Shackney, Russell Schwartz
Bioinformatics, Oxford Journals
Conference version appeared in International Conference on Intelligent Systems for Molecular Biology
2009
- PEGASUS: A Peta-Scale Graph Mining System – Implementation and Observations
Co-authors: U Kang, Christos Faloutsos
IEEE International Conference on Data Mining (ICDM 2009)
Best Application Paper Runner Up
Invited to special issue - Large Graph-Mining: Power Tools and a Practitioner’s Guide
pdf (zipped), ppt (zipped)
Co-authors: Gary L. Miller, Christos Faloutsos
ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2009)
Video - DOULION: Counting Triangles in Massive Graphs With a Coin
Co-authors: U Kang, Gary L. Miller, Christos Faloutsos
ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2009) - Spectral Counting of Triangles in Power-Law Graphs via Element-Wise Sparsification
Co-authors: Petros Drineas, Eirinaios Michelakis, Ioannis Koutis, Christos Faloutsos
Advances in Social Networks Analysis and Mining (ASONAM 2009)
Invited to special issue - VeWRA: An Algorithm for Wrapper Verification
Co-authors: Georgios Paliouras
CMU ML Tech Report CMU-ML-09-100, 2009
Work from undergraduate studies, an engineering project which resulted in a robust wrapper verification system
2008
- Two heads better than one: pattern discovery in time-evolving multi-aspect data
Co-authors: Jimeng Sun, Evan Hoke, Christos Faloutsos, Tina Eliassi-Rad
Data Mining and Knowledge Discovery
Invited Paper
Project Web page - Counting of Triangles in Large Real Networks, without counting: Algorithms and Laws
IEEE International Conference on Data Mining
Invited to special issue - Two heads better than one: pattern discovery in time-evolving multi-aspect data
Co-authors: Jimeng Sun, Evan Hoke, Christos Faloutsos, Tina Eliassi-Rad
European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD 2008)
Invited to special issue
See extended journal version
tsourakakis.com 