Publications

Academic Record: Google Scholar, DBLP

Recent

Preprints are subject to change.

1. Streaming Graph Partitioning in the Planted Partition Model

2. A Novel Approach to Finding Near-Cliques: The Triangle-Densest Subgraph Problem

3. Rainbow Connection of Random Regular Graphs
   Co-authors: Andrzej Dudek, Alan Frieze
   

2014

1. Chromatic Correlation Clustering
   Co-authors: Francesco Bonchi, Aristides Gionis, Francesco Gullo, Antti Ukkonen
   Transactions on Knowledge Discovery from Data (TKDD)

2. 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)

3. 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.

4. Towards Quantifying Vertex Similarity in Networks
   Internet Mathematics

2013

1. Modeling Intratumor Gene Copy Number Heterogeneity using Fluorescence in Situ Hybridization data
   WABI 2013

2. 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)

3. 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.

4. Some Properties of Random Apollonian Networks
   Coauthors: Alan Frieze
   Internet Mathematics
   Invited paper

5. Mathematical and Algorithmic Analysis of Network and Biological Data
   Ph.D. Thesis

2012

1. Rainbow Connectivity of Sparse Random Graphs
   Co-authors: Alan Frieze
   Electronic Journal of Combinatorics (EJC)

2. Rainbow Connectivity of Sparse Random Graphs
   Co-authors: Alan Frieze
   RANDOM 2012
   See journal version (EJC)

3. Certain Properties of Random Apollonian Networks
   Co-authors: Alan Frieze
   9th Workshop on Algorithms and Models for the Web Graph (WAW 2012)

4. 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

5. Colorful Triangle Counting and a MapReduce Implementation
   Co-authors: Rasmus Pagh
   Information Processing Letters

2011

1. 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

2. Triangle Sparsifiers
   Co-authors: Mihail N. Kolountzakis, Gary L. Miller
   Journal of Graph Algorithms And Applications

3. 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)

4. PEGASUS: Mining Peta-Scale Graphs
   Co-authors: U Kang, Christos Faloutsos
   Knowledge and Information Systems (KAIS)
   Invited Journal Paper

5. Counting Triangles Using Projections
   Knowledge and Information Systems (KAIS)
   Invited Journal Paper

6. HADI: Mining Radii of Large Graphs
   Co-authors: U Kang, Ana Paula Appel, Christos Faloutsos, Jure Leskovec
   ACM Transactions on Knowledge Discovery from Data

7. 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

8. 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

9. Scale Graph Mining with MapReduce: Counting Triangles in Large Real Networks
   Invited book chapter

2010

1. Data Mining with MapReduce: Graph and Tensor Algorithms with Applications
   Master Thesis, Machine Learning Department, CMU

2. 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

3. 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

4. MACH: Fast Randomized Tensor Decompositions
   SIAM International Conference on Data Mining (SDM 2010)

5. 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)

6. 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

1. 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

2. 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

3. 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)
   

4. 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

5. 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

1. 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

2. Counting of Triangles in Large Real Networks, without counting: Algorithms and Laws
   IEEE International Conference on Data Mining
   Invited to special issue
   

3. 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