Charalampos E. Tsourakakis

ORCID

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 63

Top Venues

CoRR

WWW

KDD

ACM Trans. Knowl. Discov. Data

Publications

Dragos Ristache, Fabian Spaeh, Charalampos E. Tsourakakis
Wiser than the Wisest of Crowds: The Asch Effect Revisited under Friedkin-Johnsen Opinion Dynamics. CoRR (2024)
Fabian Spaeh, Charalampos E. Tsourakakis
Markovletics: Methods and A Novel Application for Learning Continuous-Time Markov Chain Mixtures. WWW (2024)
Petros Petsinis, Charalampos E. Tsourakakis, Panagiotis Karras
Finding Dense and Persistently Expansive Subgraphs. WWW (Companion Volume) (2024)
Fabian Spaeh, Charalampos E. Tsourakakis
Markovletics: Methods and A Novel Application for Learning Continuous-Time Markov Chain Mixtures. CoRR (2024)
Fabian Spaeh, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis
ULTRA-MC: A Unified Approach to Learning Mixtures of Markov Chains via Hitting Times. CoRR (2024)
Fabian Spaeh, Charalampos E. Tsourakakis
Learning Mixtures of Markov Chains with Quality Guarantees. WWW (2023)
Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis
On the Role of Edge Dependency in Graph Generative Models. CoRR (2023)
Iden Kalemaj, Sofya Raskhodnikova, Adam D. Smith, Charalampos E. Tsourakakis
Node-Differentially Private Estimation of the Number of Connected Components. PODS (2023)
Fabian Spaeh, Charalampos E. Tsourakakis
Learning Mixtures of Markov Chains with Quality Guarantees. CoRR (2023)
Atsushi Miyauchi, Tianyi Chen, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis
Densest Diverse Subgraphs: How to Plan a Successful Cocktail Party with Diversity. CoRR (2023)
Atsushi Miyauchi, Tianyi Chen, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis
Densest Diverse Subgraphs: How to Plan a Successful Cocktail Party with Diversity. KDD (2023)
Iden Kalemaj, Sofya Raskhodnikova, Adam D. Smith, Charalampos E. Tsourakakis
Node-Differentially Private Estimation of the Number of Connected Components. CoRR (2023)
Adriano Fazzone, Tommaso Lanciano, Riccardo Denni, Charalampos E. Tsourakakis, Francesco Bonchi
Discovering Polarization Niches via Dense Subgraphs with Attractors and Repulsers. Proc. VLDB Endow. 15 (13) (2022)
Tianyi Chen, Brian Matejek, Michael Mitzenmacher, Charalampos E. Tsourakakis
Algorithmic Tools for Understanding the Motif Structure of Networks. ECML/PKDD (2) (2022)
Tianyi Chen, Charalampos E. Tsourakakis
AntiBenford Subgraphs: Unsupervised Anomaly Detection in Financial Networks. CoRR (2022)
Rediet Abebe, T.-H. Hubert Chan, Jon M. Kleinberg, Zhibin Liang, David C. Parkes, Mauro Sozio, Charalampos E. Tsourakakis
Opinion Dynamics Optimization by Varying Susceptibility to Persuasion via Non-Convex Local Search. ACM Trans. Knowl. Discov. Data 16 (2) (2022)
Tianyi Chen, Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis
Dense and well-connected subgraph detection in dual networks. SDM (2022)
Lorenzo Orecchia, Konstantinos Ameranis, Charalampos E. Tsourakakis, Kunal Talwar
Practical Almost-Linear-Time Approximation Algorithms for Hybrid and Overlapping Graph Clustering. ICML (2022)
Tianyi Chen, Charalampos E. Tsourakakis
AntiBenford Subgraphs: Unsupervised Anomaly Detection in Financial Networks. KDD (2022)
Tianyi Chen, Xu Wang, Charalampos E. Tsourakakis
Polarizing Opinion Dynamics with Confirmation Bias. SocInfo (2022)
Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis
DeepWalking Backwards: From Embeddings Back to Graphs. ICML (2021)
Konstantinos Sotiropoulos, Charalampos E. Tsourakakis
Triangle-aware Spectral Sparsifiers and Community Detection. KDD (2021)
Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis
Finding densest k-connected subgraphs. Discret. Appl. Math. 305 (2021)
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
Smurf-Based Anti-money Laundering in Time-Evolving Transaction Networks. ECML/PKDD (4) (2021)
Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis
On the Power of Edge Independent Graph Models. NeurIPS (2021)
Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis
On the Power of Edge Independent Graph Models. CoRR (2021)
Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis
DeepWalking Backwards: From Embeddings Back to Graphs. CoRR (2021)
Tianyi Chen, Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis
Dense and well-connected subgraph detection in dual networks. CoRR (2021)
Rediet Abebe, T.-H. Hubert Chan, Jon M. Kleinberg, Zhibin Liang, David C. Parkes, Mauro Sozio, Charalampos E. Tsourakakis
Opinion Dynamics with Varying Susceptibility to Persuasion via Non-Convex Local Search. CoRR (2020)
Kasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis
Optimal Learning of Joint Alignments with a Faulty Oracle. ISIT (2020)
Kasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis
Optimal Learning of Joint Alignments with a Faulty Oracle. ITA (2020)
David García-Soriano, Konstantin Kutzkov, Francesco Bonchi, Charalampos E. Tsourakakis
Query-Efficient Correlation Clustering. WWW (2020)
Kasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis
Clustering with a faulty oracle. WWW (2020)
Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis
Node Embeddings and Exact Low-Rank Representations of Complex Networks. NeurIPS (2020)
Michael Mitzenmacher, Charalampos E. Tsourakakis
Joint Alignment From Pairwise Differences with a Noisy Oracle. CoRR (2020)
Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis
Finding Densest k-Connected Subgraphs. CoRR (2020)
David García-Soriano, Konstantin Kutzkov, Francesco Bonchi, Charalampos E. Tsourakakis
Query-Efficient Correlation Clustering. CoRR (2020)
Digvijay Boob, Yu Gao, Richard Peng, Saurabh Sawlani, Charalampos E. Tsourakakis, Di Wang, Junxing Wang
Flowless: Extracting Densest Subgraphs Without Flow Computations. WWW (2020)
Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis
Node Embeddings and Exact Low-Rank Representations of Complex Networks. CoRR (2020)
Digvijay Boob, Yu Gao, Richard Peng, Saurabh Sawlani, Charalampos E. Tsourakakis, Di Wang, Junxing Wang
Flowless: Extracting Densest Subgraphs Without Flow Computations. CoRR (2019)
Charalampos E. Tsourakakis, Tianyi Chen, Naonori Kakimura, Jakub Pachocki
Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries. ECML/PKDD (1) (2019)
Konstantinos Sotiropoulos, John W. Byers, Polyvios Pratikakis, Charalampos E. Tsourakakis
TwitterMancer: Predicting Interactions on Twitter Accurately. CoRR (2019)
Kasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis
Optimal Learning of Joint Alignments with a Faulty Oracle. CoRR (2019)
Konstantinos Sotiropoulos, John W. Byers, Polyvios Pratikakis, Charalampos E. Tsourakakis
TwitterMancer: Predicting User Interactions on Twitter. Allerton (2019)
Charalampos E. Tsourakakis, Tianyi Chen, Naonori Kakimura, Jakub Pachocki
Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries. CoRR (2019)
Cameron Musco, Christopher Musco, Charalampos E. Tsourakakis
Minimizing Polarization and Disagreement in Social Networks. WWW (2018)
Jeremy G. Hoskins, Cameron Musco, Christopher Musco, Charalampos E. Tsourakakis
Learning Networks from Random Walk-Based Node Similarities. CoRR (2018)
Charalampos E. Tsourakakis, Shreyas Sekar, Johnson Lam, Liu Yang
Risk-Averse Matchings over Uncertain Graph Databases. CoRR (2018)
Michael Mitzenmacher, Charalampos E. Tsourakakis
Joint Alignment from Pairwise Differences with a Noisy Oracle. WAW (2018)
Charalampos E. Tsourakakis, Shreyas Sekar, Johnson Lam, Liu Yang
Risk-Averse Matchings over Uncertain Graph Databases. ECML/PKDD (2) (2018)
Rediet Abebe, Jon M. Kleinberg, David C. Parkes, Charalampos E. Tsourakakis
Opinion Dynamics with Varying Susceptibility to Persuasion. KDD (2018)
Rediet Abebe, Jon M. Kleinberg, David C. Parkes, Charalampos E. Tsourakakis
Opinion Dynamics with Varying Susceptibility to Persuasion. CoRR (2018)
Charalampos E. Tsourakakis, Jakub Pachocki, Michael Mitzenmacher
Scalable Motif-aware Graph Clustering. WWW (2017)
Cameron Musco, Christopher Musco, Charalampos E. Tsourakakis
Minimizing Polarization and Disagreement in Social Networks. CoRR (2017)
Charalampos E. Tsourakakis, Michael Mitzenmacher, Jaroslaw Blasiok, Ben Lawson, Preetum Nakkiran, Vasileios Nakos
Predicting Positive and Negative Links with Noisy Queries: Theory & Practice. CoRR (2017)
Chen Chen, Hanghang Tong, B. Aditya Prakash, Charalampos E. Tsourakakis, Tina Eliassi-Rad, Christos Faloutsos, Duen Horng Chau
Node Immunization on Large Graphs: Theory and Algorithms. IEEE Trans. Knowl. Data Eng. 28 (1) (2016)
Jaroslaw Blasiok, Charalampos E. Tsourakakis
ADAGIO: Fast Data-Aware Near-Isometric Linear Embeddings. ICDM (2016)
Ahmad Mahmoody, Charalampos E. Tsourakakis, Eli Upfal
Scalable Betweenness Centrality Maximization via Sampling. KDD (2016)
Charalampos E. Tsourakakis, Jakub W. Pachocki, Michael Mitzenmacher
Scalable motif-aware graph clustering. CoRR (2016)
Jaroslaw Blasiok, Charalampos E. Tsourakakis
ADAGIO: Fast Data-aware Near-Isometric Linear Embeddings. CoRR (2016)
Charalampos E. Tsourakakis
Motif-driven graph analysis. Allerton (2016)
Michael Mitzenmacher, Charalampos E. Tsourakakis
Predicting Signed Edges with O(n log n) Queries. CoRR (2016)
Ahmad Mahmoody, Charalampos E. Tsourakakis, Eli Upfal
Scalable Betweenness Centrality Maximization via Sampling. CoRR (2016)
Michael Mitzenmacher, Jakub Pachocki, Richard Peng, Charalampos E. Tsourakakis, Shen Chen Xu
Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling. KDD (2015)
Aristides Gionis, Charalampos E. Tsourakakis
Dense Subgraph Discovery: KDD 2015 tutorial. KDD (2015)
Charalampos E. Tsourakakis
Streaming Graph Partitioning in the Planted Partition Model. COSN (2015)
Charalampos E. Tsourakakis
The K-clique Densest Subgraph Problem. WWW (2015)
Charalampos E. Tsourakakis
Provably Fast Inference of Latent Features from Networks: with Applications to Learning Social Circles and Multilabel Classification. WWW (2015)
Francesco Bonchi, Aristides Gionis, Francesco Gullo, Charalampos E. Tsourakakis, Antti Ukkonen
Chromatic Correlation Clustering. ACM Trans. Knowl. Discov. Data 9 (4) (2015)
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Charalampos E. Tsourakakis
Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams. CoRR (2015)
Andrzej Dudek, Alan M. Frieze, Charalampos E. Tsourakakis
Rainbow Connection of Random Regular Graphs. SIAM J. Discret. Math. 29 (4) (2015)
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Charalampos E. Tsourakakis
Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams. STOC (2015)
George Nychis, Charalampos E. Tsourakakis, Srinivasan Seshan, Peter Steenkiste
Centralized, measurement-based, spectrum management for environments with heterogeneous wireless networks. DySPAN (2014)
Charalampos E. Tsourakakis
A Novel Approach to Finding Near-Cliques: The Triangle-Densest Subgraph Problem. CoRR (2014)
Alan M. Frieze, Charalampos E. Tsourakakis
Some Properties of Random Apollonian Networks. Internet Math. 10 (1-2) (2014)
Charalampos E. Tsourakakis, Christos Gkantsidis, Bozidar Radunovic, Milan Vojnovic
FENNEL: streaming graph partitioning for massive scale graphs. WSDM (2014)
Charalampos E. Tsourakakis
Mathematical and Algorithmic Analysis of Network and Biological Data. CoRR (2014)
Charalampos E. Tsourakakis
Toward Quantifying Vertex Similarity in Networks. Internet Math. 10 (3-4) (2014)
Charalampos E. Tsourakakis
Streaming Graph Partitioning in the Planted Partition Model. CoRR (2014)
Charalampos E. Tsourakakis
Modeling Intratumor Gene Copy Number Heterogeneity Using Fluorescence in Situ Hybridization Data. WABI (2013)
Charalampos E. Tsourakakis, Francesco Bonchi, Aristides Gionis, Francesco Gullo, Maria A. Tsiarli
Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees. KDD (2013)
Alan M. Frieze, Aristides Gionis, Charalampos E. Tsourakakis
Algorithmic techniques for modeling and mining large graphs (AMAzING). KDD (2013)
Charalampos E. Tsourakakis
Perfect Reconstruction of Oncogenetic Trees CoRR (2012)
Alan M. Frieze, Charalampos E. Tsourakakis
Rainbow Connection of Sparse Random Graphs. Electron. J. Comb. 19 (4) (2012)
Alan M. Frieze, Charalampos E. Tsourakakis
Rainbow Connectivity of Sparse Random Graphs. APPROX-RANDOM (2012)
Rasmus Pagh, Charalampos E. Tsourakakis
Colorful triangle counting and a MapReduce implementation. Inf. Process. Lett. 112 (7) (2012)
Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, Charalampos E. Tsourakakis
Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning. Internet Math. 8 (1-2) (2012)
Alan M. Frieze, Charalampos E. Tsourakakis
On Certain Properties of Random Apollonian Networks. WAW (2012)
Alan M. Frieze, Charalampos E. Tsourakakis
Rainbow Connectivity of Sparse Random Graphs. CoRR (2012)
U Kang, Charalampos E. Tsourakakis, Ana Paula Appel, Christos Faloutsos, Jure Leskovec
HADI: Mining Radii of Large Graphs. ACM Trans. Knowl. Discov. Data 5 (2) (2011)
Charalampos E. Tsourakakis
The Degree Sequence of Random Apollonian Networks CoRR (2011)
Charalampos E. Tsourakakis, Richard Peng, Maria A. Tsiarli, Gary L. Miller, Russell Schwartz
Approximation algorithms for speeding up dynamic programming and denoising aCGH data. ACM J. Exp. Algorithmics 16 (2011)
Charalampos E. Tsourakakis, Petros Drineas, Eirinaios Michelakis, Ioannis Koutis, Christos Faloutsos
Spectral counting of triangles via element-wise sparsification and triangle-based link recommendation. Soc. Netw. Anal. Min. 1 (2) (2011)
Charalampos E. Tsourakakis, Mihail N. Kolountzakis, Gary L. Miller
Triangle Sparsifiers. J. Graph Algorithms Appl. 15 (6) (2011)
Rasmus Pagh, Charalampos E. Tsourakakis
Colorful Triangle Counting and a MapReduce Implementation CoRR (2011)
Gary L. Miller, Richard Peng, Russell Schwartz, Charalampos E. Tsourakakis
Approximate Dynamic Programming using Halfspace Queries and Multiscale Monge Decomposition. SODA (2011)
Alan M. Frieze, Charalampos E. Tsourakakis
High Degree Vertices, Eigenvalues and Diameter of Random Apollonian Networks CoRR (2011)
U Kang, Charalampos E. Tsourakakis, Christos Faloutsos
PEGASUS: mining peta-scale graphs. Knowl. Inf. Syst. 27 (2) (2011)
Charalampos E. Tsourakakis
Counting triangles in real-world networks using projections. Knowl. Inf. Syst. 26 (3) (2011)
Charalampos E. Tsourakakis
Social Network Archetypes and Vertex Similarity, Graph Matching and the Generalized Eigenvalue Problem CoRR (2011)

Charalampos E. Tsourakakis.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Charalampos E. Tsourakakis