Charalampos E. Tsourakakis

129 papers A* 31A 6B 3C 4Misc 1Journal 69Unranked 13

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Node-Differentially Private Estimation of the Number of Connected Components. ACM Trans. Algorithms Iden Kalemaj, Sofya Raskhodnikova, Adam D. Smith, Charalampos E. Tsourakakis
2025	J	`jnl`	Countering Election Sway: Strategic Algorithms in Friedkin-Johnsen Dynamics. CoRR Dragos Ristache, Fabian Spaeh, Charalampos E. Tsourakakis
2025	J	`jnl`	Estimating Hitting Times Locally At Scale. CoRR Themistoklis Haris, Fabian Spaeh, Spyros Dragazis, Charalampos E. Tsourakakis
2025	A	`conf`	Q-DISCO: Query-Centric Densest Subgraphs in Networks with Opinion Information. WSDM Tianyi Chen, Atsushi Miyauchi, Charalampos E. Tsourakakis
2025	A	`conf`	Targeted Least Cardinality Candidate Key for Relational Databases. ICDT Vasileios Nakos, Hung Q. Ngo, Charalampos E. Tsourakakis
2024	J	`jnl`	A Note on Computing Betweenness Centrality from the 2-core. CoRR Charalampos E. Tsourakakis
2024	—	`conf`	Finding Dense and Persistently Expansive Subgraphs. WWW (Companion Volume) Petros Petsinis, Charalampos E. Tsourakakis, Panagiotis Karras
2024	A*	`conf`	Markovletics: Methods and A Novel Application for Learning Continuous-Time Markov Chain Mixtures. WWW Fabian Spaeh, Charalampos E. Tsourakakis
2024	J	`jnl`	Markovletics: Methods and A Novel Application for Learning Continuous-Time Markov Chain Mixtures. CoRR Fabian Spaeh, Charalampos E. Tsourakakis
2024	A*	`conf`	On the Role of Edge Dependency in Graph Generative Models. ICML Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis
2024	B	`conf`	Parallel Motif-Based Community Detection. IEEE Big Data Tianyi Chen, Charalampos E. Tsourakakis
2024	J	`jnl`	Parallel Motif-Based Community Detection. CoRR Tianyi Chen, Charalampos E. Tsourakakis
2024	J	`jnl`	Q-DISCO: Query-Centric Densest Subgraphs in Networks with Opinion Information. CoRR Tianyi Chen, Atsushi Miyauchi, Charalampos E. Tsourakakis
2024	J	`jnl`	Targeted Least Cardinality Candidate Key for Relational Databases. CoRR Vasileios Nakos, Hung Q. Ngo, Charalampos E. Tsourakakis
2024	J	`jnl`	ULTRA-MC: A Unified Approach to Learning Mixtures of Markov Chains via Hitting Times. CoRR Fabian Spaeh, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis
2024	J	`jnl`	Wiser than the Wisest of Crowds: The Asch Effect Revisited under Friedkin-Johnsen Opinion Dynamics. CoRR Dragos Ristache, Fabian Spaeh, Charalampos E. Tsourakakis
2024	—	`conf`	Wiser than the Wisest of Crowds: The Asch Effect and Polarization Revisited. ECML/PKDD (5) Dragos Ristache, Fabian Spaeh, Charalampos E. Tsourakakis
2023	A*	`conf`	Densest Diverse Subgraphs: How to Plan a Successful Cocktail Party with Diversity. KDD Atsushi Miyauchi, Tianyi Chen, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis
2023	J	`jnl`	Densest Diverse Subgraphs: How to Plan a Successful Cocktail Party with Diversity. CoRR Atsushi Miyauchi, Tianyi Chen, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis
2023	A*	`conf`	Learning Mixtures of Markov Chains with Quality Guarantees. WWW Fabian Spaeh, Charalampos E. Tsourakakis
2023	J	`jnl`	Learning Mixtures of Markov Chains with Quality Guarantees. CoRR Fabian Spaeh, Charalampos E. Tsourakakis
2023	A*	`conf`	Node-Differentially Private Estimation of the Number of Connected Components. PODS Iden Kalemaj, Sofya Raskhodnikova, Adam D. Smith, Charalampos E. Tsourakakis
2023	J	`jnl`	Node-Differentially Private Estimation of the Number of Connected Components. CoRR Iden Kalemaj, Sofya Raskhodnikova, Adam D. Smith, Charalampos E. Tsourakakis
2023	J	`jnl`	On the Role of Edge Dependency in Graph Generative Models. CoRR Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis
2022	—	`conf`	Algorithmic Tools for Understanding the Motif Structure of Networks. ECML/PKDD (2) Tianyi Chen, Brian Matejek, Michael Mitzenmacher, Charalampos E. Tsourakakis
2022	A*	`conf`	AntiBenford Subgraphs: Unsupervised Anomaly Detection in Financial Networks. KDD Tianyi Chen, Charalampos E. Tsourakakis
2022	J	`jnl`	AntiBenford Subgraphs: Unsupervised Anomaly Detection in Financial Networks. CoRR Tianyi Chen, Charalampos E. Tsourakakis
2022	A	`conf`	Dense and well-connected subgraph detection in dual networks. SDM Tianyi Chen, Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis
2022	J	`jnl`	Discovering Polarization Niches via Dense Subgraphs with Attractors and Repulsers. Proc. VLDB Endow. Adriano Fazzone, Tommaso Lanciano, Riccardo Denni, Charalampos E. Tsourakakis, Francesco Bonchi
2022	J	`jnl`	Opinion Dynamics Optimization by Varying Susceptibility to Persuasion via Non-Convex Local Search. ACM Trans. Knowl. Discov. Data Rediet Abebe, T.-H. Hubert Chan, Jon M. Kleinberg, Zhibin Liang, David C. Parkes, Mauro Sozio, Charalampos E. Tsourakakis
2022	—	`conf`	Polarizing Opinion Dynamics with Confirmation Bias. SocInfo Tianyi Chen, Xu Wang, Charalampos E. Tsourakakis
2022	A*	`conf`	Practical Almost-Linear-Time Approximation Algorithms for Hybrid and Overlapping Graph Clustering. ICML Lorenzo Orecchia, Konstantinos Ameranis, Charalampos E. Tsourakakis, Kunal Talwar
2021	A*	`conf`	DeepWalking Backwards: From Embeddings Back to Graphs. ICML Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis
2021	J	`jnl`	DeepWalking Backwards: From Embeddings Back to Graphs. CoRR Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis
2021	J	`jnl`	Dense and well-connected subgraph detection in dual networks. CoRR Tianyi Chen, Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis
2021	J	`jnl`	Finding densest k-connected subgraphs. Discret. Appl. Math. Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis
2021	A*	`conf`	On the Power of Edge Independent Graph Models. NeurIPS Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis
2021	J	`jnl`	On the Power of Edge Independent Graph Models. CoRR Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis
2021	—	`conf`	Smurf-Based Anti-money Laundering in Time-Evolving Transaction Networks. ECML/PKDD (4) Michele Starnini, Charalampos E. Tsourakakis, Maryam Zamanipour, André Panisson, Walter Allasia, Marco Fornasiero, Laura Li Puma, Valeria Ricci, Silvia Ronchiadin, Angela Ugrinoska, Marco Varetto, Dario Moncalvo
2021	A*	`conf`	Triangle-aware Spectral Sparsifiers and Community Detection. KDD Konstantinos Sotiropoulos, Charalampos E. Tsourakakis
2020	A*	`conf`	Clustering with a faulty oracle. WWW Kasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis
2020	J	`jnl`	Finding Densest k-Connected Subgraphs. CoRR Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis
2020	A*	`conf`	Flowless: Extracting Densest Subgraphs Without Flow Computations. WWW Digvijay Boob, Yu Gao, Richard Peng, Saurabh Sawlani, Charalampos E. Tsourakakis, Di Wang, Junxing Wang
2020	J	`jnl`	Joint Alignment From Pairwise Differences with a Noisy Oracle. CoRR Michael Mitzenmacher, Charalampos E. Tsourakakis
2020	A*	`conf`	Node Embeddings and Exact Low-Rank Representations of Complex Networks. NeurIPS Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis
2020	J	`jnl`	Node Embeddings and Exact Low-Rank Representations of Complex Networks. CoRR Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis
2020	J	`jnl`	Opinion Dynamics with Varying Susceptibility to Persuasion via Non-Convex Local Search. CoRR Rediet Abebe, T.-H. Hubert Chan, Jon M. Kleinberg, Zhibin Liang, David C. Parkes, Mauro Sozio, Charalampos E. Tsourakakis
2020	B	`conf`	Optimal Learning of Joint Alignments with a Faulty Oracle. ISIT Kasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis
2020	Misc	`conf`	Optimal Learning of Joint Alignments with a Faulty Oracle. ITA Kasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis
2020	A*	`conf`	Query-Efficient Correlation Clustering. WWW David García-Soriano, Konstantin Kutzkov, Francesco Bonchi, Charalampos E. Tsourakakis
2020	J	`jnl`	Query-Efficient Correlation Clustering. CoRR David García-Soriano, Konstantin Kutzkov, Francesco Bonchi, Charalampos E. Tsourakakis
2019	J	`jnl`	Flowless: Extracting Densest Subgraphs Without Flow Computations. CoRR Digvijay Boob, Yu Gao, Richard Peng, Saurabh Sawlani, Charalampos E. Tsourakakis, Di Wang, Junxing Wang
2019	—	`conf`	Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries. ECML/PKDD (1) Charalampos E. Tsourakakis, Tianyi Chen, Naonori Kakimura, Jakub Pachocki
2019	J	`jnl`	Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries. CoRR Charalampos E. Tsourakakis, Tianyi Chen, Naonori Kakimura, Jakub Pachocki
2019	J	`jnl`	Optimal Learning of Joint Alignments with a Faulty Oracle. CoRR Kasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis
2019	J	`jnl`	TwitterMancer: Predicting Interactions on Twitter Accurately. CoRR Konstantinos Sotiropoulos, John W. Byers, Polyvios Pratikakis, Charalampos E. Tsourakakis
2019	—	`conf`	TwitterMancer: Predicting User Interactions on Twitter. Allerton Konstantinos Sotiropoulos, John W. Byers, Polyvios Pratikakis, Charalampos E. Tsourakakis
2018	C	`conf`	Joint Alignment from Pairwise Differences with a Noisy Oracle. WAW Michael Mitzenmacher, Charalampos E. Tsourakakis
2018	J	`jnl`	Learning Networks from Random Walk-Based Node Similarities. CoRR Jeremy G. Hoskins, Cameron Musco, Christopher Musco, Charalampos E. Tsourakakis
2018	A*	`conf`	Minimizing Polarization and Disagreement in Social Networks. WWW Cameron Musco, Christopher Musco, Charalampos E. Tsourakakis
2018	A*	`conf`	Opinion Dynamics with Varying Susceptibility to Persuasion. KDD Rediet Abebe, Jon M. Kleinberg, David C. Parkes, Charalampos E. Tsourakakis
2018	J	`jnl`	Opinion Dynamics with Varying Susceptibility to Persuasion. CoRR Rediet Abebe, Jon M. Kleinberg, David C. Parkes, Charalampos E. Tsourakakis
2018	—	`conf`	Risk-Averse Matchings over Uncertain Graph Databases. ECML/PKDD (2) Charalampos E. Tsourakakis, Shreyas Sekar, Johnson Lam, Liu Yang
2018	J	`jnl`	Risk-Averse Matchings over Uncertain Graph Databases. CoRR Charalampos E. Tsourakakis, Shreyas Sekar, Johnson Lam, Liu Yang
2017	J	`jnl`	Minimizing Polarization and Disagreement in Social Networks. CoRR Cameron Musco, Christopher Musco, Charalampos E. Tsourakakis
2017	J	`jnl`	Predicting Positive and Negative Links with Noisy Queries: Theory & Practice. CoRR Charalampos E. Tsourakakis, Michael Mitzenmacher, Jaroslaw Blasiok, Ben Lawson, Preetum Nakkiran, Vasileios Nakos
2017	A*	`conf`	Scalable Motif-aware Graph Clustering. WWW Charalampos E. Tsourakakis, Jakub Pachocki, Michael Mitzenmacher
2016	A*	`conf`	ADAGIO: Fast Data-Aware Near-Isometric Linear Embeddings. ICDM Jaroslaw Blasiok, Charalampos E. Tsourakakis
2016	J	`jnl`	ADAGIO: Fast Data-aware Near-Isometric Linear Embeddings. CoRR Jaroslaw Blasiok, Charalampos E. Tsourakakis
2016	—	`conf`	Motif-driven graph analysis. Allerton Charalampos E. Tsourakakis
2016	J	`jnl`	Node Immunization on Large Graphs: Theory and Algorithms. IEEE Trans. Knowl. Data Eng. Chen Chen, Hanghang Tong, B. Aditya Prakash, Charalampos E. Tsourakakis, Tina Eliassi-Rad, Christos Faloutsos, Duen Horng Chau
2016	J	`jnl`	Predicting Signed Edges with O(n log n) Queries. CoRR Michael Mitzenmacher, Charalampos E. Tsourakakis
2016	A*	`conf`	Scalable Betweenness Centrality Maximization via Sampling. KDD Ahmad Mahmoody, Charalampos E. Tsourakakis, Eli Upfal
2016	J	`jnl`	Scalable Betweenness Centrality Maximization via Sampling. CoRR Ahmad Mahmoody, Charalampos E. Tsourakakis, Eli Upfal
2016	J	`jnl`	Scalable motif-aware graph clustering. CoRR Charalampos E. Tsourakakis, Jakub Pachocki, Michael Mitzenmacher
2015	J	`jnl`	Chromatic Correlation Clustering. ACM Trans. Knowl. Discov. Data Francesco Bonchi, Aristides Gionis, Francesco Gullo, Charalampos E. Tsourakakis, Antti Ukkonen
2015	A*	`conf`	Dense Subgraph Discovery: KDD 2015 tutorial. KDD Aristides Gionis, Charalampos E. Tsourakakis
2015	A*	`conf`	Provably Fast Inference of Latent Features from Networks: with Applications to Learning Social Circles and Multilabel Classification. WWW Charalampos E. Tsourakakis
2015	J	`jnl`	Rainbow Connection of Random Regular Graphs. SIAM J. Discret. Math. Andrzej Dudek, Alan M. Frieze, Charalampos E. Tsourakakis
2015	A*	`conf`	Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling. KDD Michael Mitzenmacher, Jakub Pachocki, Richard Peng, Charalampos E. Tsourakakis, Shen Chen Xu
2015	A*	`conf`	Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams. STOC Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Charalampos E. Tsourakakis
2015	J	`jnl`	Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams. CoRR Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Charalampos E. Tsourakakis
2015	—	`conf`	Streaming Graph Partitioning in the Planted Partition Model. COSN Charalampos E. Tsourakakis
2015	A*	`conf`	The K-clique Densest Subgraph Problem. WWW Charalampos E. Tsourakakis
2014	J	`jnl`	A Novel Approach to Finding Near-Cliques: The Triangle-Densest Subgraph Problem. CoRR Charalampos E. Tsourakakis
2014	—	`conf`	Centralized, measurement-based, spectrum management for environments with heterogeneous wireless networks. DySPAN George Nychis, Charalampos E. Tsourakakis, Srinivasan Seshan, Peter Steenkiste
2014	A	`conf`	FENNEL: streaming graph partitioning for massive scale graphs. WSDM Charalampos E. Tsourakakis, Christos Gkantsidis, Bozidar Radunovic, Milan Vojnovic
2014	J	`jnl`	Mathematical and Algorithmic Analysis of Network and Biological Data. CoRR Charalampos E. Tsourakakis
2014	—	`ch.`	PEGASUS: A System for Large-Scale Graph Processing. Large Scale and Big Data Charalampos E. Tsourakakis
2014	J	`jnl`	Some Properties of Random Apollonian Networks. Internet Math. Alan M. Frieze, Charalampos E. Tsourakakis
2014	J	`jnl`	Streaming Graph Partitioning in the Planted Partition Model. CoRR Charalampos E. Tsourakakis
2014	J	`jnl`	Toward Quantifying Vertex Similarity in Networks. Internet Math. Charalampos E. Tsourakakis
2013	A*	`conf`	Algorithmic techniques for modeling and mining large graphs (AMAzING). KDD Alan M. Frieze, Aristides Gionis, Charalampos E. Tsourakakis
2013	A*	`conf`	Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees. KDD Charalampos E. Tsourakakis, Francesco Bonchi, Aristides Gionis, Francesco Gullo, Maria A. Tsiarli
2013	C	`conf`	Modeling Intratumor Gene Copy Number Heterogeneity Using Fluorescence in Situ Hybridization Data. WABI Charalampos E. Tsourakakis
2012	J	`jnl`	Colorful triangle counting and a MapReduce implementation. Inf. Process. Lett. Rasmus Pagh, Charalampos E. Tsourakakis
2012	J	`jnl`	Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning. Internet Math. Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, Charalampos E. Tsourakakis
2012	C	`conf`	On Certain Properties of Random Apollonian Networks. WAW Alan M. Frieze, Charalampos E. Tsourakakis
2012	J	`jnl`	Perfect Reconstruction of Oncogenetic Trees CoRR Charalampos E. Tsourakakis
2012	J	`jnl`	Rainbow Connection of Sparse Random Graphs. Electron. J. Comb. Alan M. Frieze, Charalampos E. Tsourakakis
2012	—	`conf`	Rainbow Connectivity of Sparse Random Graphs. APPROX-RANDOM Alan M. Frieze, Charalampos E. Tsourakakis
2012	J	`jnl`	Rainbow Connectivity of Sparse Random Graphs. CoRR Alan M. Frieze, Charalampos E. Tsourakakis
2011	A*	`conf`	Approximate Dynamic Programming using Halfspace Queries and Multiscale Monge Decomposition. SODA Gary L. Miller, Richard Peng, Russell Schwartz, Charalampos E. Tsourakakis
2011	J	`jnl`	Approximation algorithms for speeding up dynamic programming and denoising aCGH data. ACM J. Exp. Algorithmics Charalampos E. Tsourakakis, Richard Peng, Maria A. Tsiarli, Gary L. Miller, Russell Schwartz
2011	J	`jnl`	Colorful Triangle Counting and a MapReduce Implementation CoRR Rasmus Pagh, Charalampos E. Tsourakakis
2011	J	`jnl`	Counting triangles in real-world networks using projections. Knowl. Inf. Syst. Charalampos E. Tsourakakis
2011	J	`jnl`	HADI: Mining Radii of Large Graphs. ACM Trans. Knowl. Discov. Data U Kang, Charalampos E. Tsourakakis, Ana Paula Appel, Christos Faloutsos, Jure Leskovec
2011	J	`jnl`	High Degree Vertices, Eigenvalues and Diameter of Random Apollonian Networks CoRR Alan M. Frieze, Charalampos E. Tsourakakis
2011	—	`ch.`	Large Scale Graph Mining with MapReduce: Counting Triangles in Large Real Networks. Graph Data Management Charalampos E. Tsourakakis
2011	J	`jnl`	PEGASUS: mining peta-scale graphs. Knowl. Inf. Syst. U Kang, Charalampos E. Tsourakakis, Christos Faloutsos
2011	J	`jnl`	Social Network Archetypes and Vertex Similarity, Graph Matching and the Generalized Eigenvalue Problem CoRR Charalampos E. Tsourakakis
2011	J	`jnl`	Spectral counting of triangles via element-wise sparsification and triangle-based link recommendation. Soc. Netw. Anal. Min. Charalampos E. Tsourakakis, Petros Drineas, Eirinaios Michelakis, Ioannis Koutis, Christos Faloutsos
2011	J	`jnl`	The Degree Sequence of Random Apollonian Networks CoRR Charalampos E. Tsourakakis
2011	J	`jnl`	Triangle Sparsifiers. J. Graph Algorithms Appl. Charalampos E. Tsourakakis, Mihail N. Kolountzakis, Gary L. Miller
2010	J	`jnl`	Approximate Dynamic Programming for Fast Denoising of aCGH Data CoRR Gary L. Miller, Richard Peng, Russell Schwartz, Charalampos E. Tsourakakis
2010	C	`conf`	Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning. WAW Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, Charalampos E. Tsourakakis
2010	J	`jnl`	Efficient Triangle Counting in Large Graphs via Degree-based Vertex Partitioning CoRR Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, Charalampos E. Tsourakakis
2010	A	`conf`	MACH: Fast Randomized Tensor Decompositions. SDM Charalampos E. Tsourakakis
2010	A*	`conf`	On the Vulnerability of Large Graphs. ICDM Hanghang Tong, B. Aditya Prakash, Charalampos E. Tsourakakis, Tina Eliassi-Rad, Christos Faloutsos, Duen Horng Chau
2010	A	`conf`	Radius Plots for Mining Tera-byte Scale Graphs: Algorithms, Patterns, and Observations. SDM U Kang, Charalampos E. Tsourakakis, Ana Paula Appel, Christos Faloutsos, Jure Leskovec
2010	J	`jnl`	Robust unmixing of tumor states in array comparative genomic hybridization data. Bioinform. David Tolliver, Charalampos E. Tsourakakis, Ayshwarya Subramanian, Stanley Shackney, Russell Schwartz
2009	J	`jnl`	Approximate Triangle Counting CoRR Charalampos E. Tsourakakis, Mihail N. Kolountzakis, Gary L. Miller
2009	A*	`conf`	DOULION: counting triangles in massive graphs with a coin. KDD Charalampos E. Tsourakakis, U Kang, Gary L. Miller, Christos Faloutsos
2009	J	`jnl`	MACH: Fast Randomized Tensor Decompositions CoRR Charalampos E. Tsourakakis
2009	A*	`conf`	PEGASUS: A Peta-Scale Graph Mining System. ICDM U Kang, Charalampos E. Tsourakakis, Christos Faloutsos
2009	B	`conf`	Spectral Counting of Triangles in Power-Law Networks via Element-Wise Sparsification. ASONAM Charalampos E. Tsourakakis, Petros Drineas, Eirinaios Michelakis, Ioannis Koutis, Christos Faloutsos
2008	A*	`conf`	Fast Counting of Triangles in Large Real Networks without Counting: Algorithms and Laws. ICDM Charalampos E. Tsourakakis
2008	—	`conf`	Two Heads Better Than One: Pattern Discovery in Time-Evolving Multi-aspect Data. ECML/PKDD (1) Jimeng Sun, Charalampos E. Tsourakakis, Evan Hoke, Christos Faloutsos, Tina Eliassi-Rad
2008	J	`jnl`	Two heads better than one: pattern discovery in time-evolving multi-aspect data. Data Min. Knowl. Discov. Jimeng Sun, Charalampos E. Tsourakakis, Evan Hoke, Christos Faloutsos, Tina Eliassi-Rad