Charalampos E. Tsourakakis

Orcid: 0000-0001-5591-3585

Affiliations:
  • Boston University, USA


According to our database1, Charalampos E. Tsourakakis authored at least 91 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Targeted Least Cardinality Candidate Key for Relational Databases.
CoRR, 2024

A Note on Computing Betweenness Centrality from the 2-core.
CoRR, 2024

Wiser than the Wisest of Crowds: The Asch Effect Revisited under Friedkin-Johnsen Opinion Dynamics.
CoRR, 2024

ULTRA-MC: A Unified Approach to Learning Mixtures of Markov Chains via Hitting Times.
CoRR, 2024

Markovletics: Methods and A Novel Application for Learning Continuous-Time Markov Chain Mixtures.
Proceedings of the ACM on Web Conference 2024, 2024

Finding Dense and Persistently Expansive Subgraphs.
Proceedings of the Companion Proceedings of the ACM on Web Conference 2024, 2024

Wiser than the Wisest of Crowds: The Asch Effect and Polarization Revisited.
Proceedings of the Machine Learning and Knowledge Discovery in Databases. Research Track, 2024

On the Role of Edge Dependency in Graph Generative Models.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

2023
Learning Mixtures of Markov Chains with Quality Guarantees.
Proceedings of the ACM Web Conference 2023, 2023

Node-Differentially Private Estimation of the Number of Connected Components.
Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2023

Densest Diverse Subgraphs: How to Plan a Successful Cocktail Party with Diversity.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

2022
Opinion Dynamics Optimization by Varying Susceptibility to Persuasion via Non-Convex Local Search.
ACM Trans. Knowl. Discov. Data, 2022

Discovering Polarization Niches via Dense Subgraphs with Attractors and Repulsers.
Proc. VLDB Endow., 2022

Polarizing Opinion Dynamics with Confirmation Bias.
Proceedings of the Social Informatics - 13th International Conference, 2022

Dense and well-connected subgraph detection in dual networks.
Proceedings of the 2022 SIAM International Conference on Data Mining, 2022

Algorithmic Tools for Understanding the Motif Structure of Networks.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2022

AntiBenford Subgraphs: Unsupervised Anomaly Detection in Financial Networks.
Proceedings of the KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14, 2022

Practical Almost-Linear-Time Approximation Algorithms for Hybrid and Overlapping Graph Clustering.
Proceedings of the International Conference on Machine Learning, 2022

2021
Finding densest k-connected subgraphs.
Discret. Appl. Math., 2021

Smurf-Based Anti-money Laundering in Time-Evolving Transaction Networks.
Proceedings of the Machine Learning and Knowledge Discovery in Databases. Applied Data Science Track, 2021

On the Power of Edge Independent Graph Models.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Triangle-aware Spectral Sparsifiers and Community Detection.
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

DeepWalking Backwards: From Embeddings Back to Graphs.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Opinion Dynamics with Varying Susceptibility to Persuasion via Non-Convex Local Search.
CoRR, 2020

Clustering with a faulty oracle.
Proceedings of the WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020, 2020

Query-Efficient Correlation Clustering.
Proceedings of the WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020, 2020

Flowless: Extracting Densest Subgraphs Without Flow Computations.
Proceedings of the WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020, 2020

Node Embeddings and Exact Low-Rank Representations of Complex Networks.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Optimal Learning of Joint Alignments with a Faulty Oracle.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
TwitterMancer: Predicting Interactions on Twitter Accurately.
CoRR, 2019

Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2019

TwitterMancer: Predicting User Interactions on Twitter.
Proceedings of the 57th Annual Allerton Conference on Communication, 2019

2018
Learning Networks from Random Walk-Based Node Similarities.
CoRR, 2018

Minimizing Polarization and Disagreement in Social Networks.
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

Joint Alignment from Pairwise Differences with a Noisy Oracle.
Proceedings of the Algorithms and Models for the Web Graph - 15th International Workshop, 2018

Risk-Averse Matchings over Uncertain Graph Databases.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2018

Inferring Networks From Random Walk-Based Node Similarities.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Opinion Dynamics with Varying Susceptibility to Persuasion.
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

2017
Predicting Positive and Negative Links with Noisy Queries: Theory & Practice.
CoRR, 2017

Scalable Motif-aware Graph Clustering.
Proceedings of the 26th International Conference on World Wide Web, 2017

2016
Node Immunization on Large Graphs: Theory and Algorithms.
IEEE Trans. Knowl. Data Eng., 2016

Predicting Signed Edges with O(n log n) Queries.
CoRR, 2016

Scalable Betweenness Centrality Maximization via Sampling.
Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016

ADAGIO: Fast Data-Aware Near-Isometric Linear Embeddings.
Proceedings of the IEEE 16th International Conference on Data Mining, 2016

Motif-driven graph analysis.
Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2015
Chromatic Correlation Clustering.
ACM Trans. Knowl. Discov. Data, 2015

Rainbow Connection of Random Regular Graphs.
SIAM J. Discret. Math., 2015

The K-clique Densest Subgraph Problem.
Proceedings of the 24th International Conference on World Wide Web, 2015

Provably Fast Inference of Latent Features from Networks: with Applications to Learning Social Circles and Multilabel Classification.
Proceedings of the 24th International Conference on World Wide Web, 2015

Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling.
Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015

Dense Subgraph Discovery: KDD 2015 tutorial.
Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015

Streaming Graph Partitioning in the Planted Partition Model.
Proceedings of the 2015 ACM on Conference on Online Social Networks, 2015

2014
Toward Quantifying Vertex Similarity in Networks.
Internet Math., 2014

Some Properties of Random Apollonian Networks.
Internet Math., 2014

Mathematical and Algorithmic Analysis of Network and Biological Data.
CoRR, 2014

A Novel Approach to Finding Near-Cliques: The Triangle-Densest Subgraph Problem.
CoRR, 2014

FENNEL: streaming graph partitioning for massive scale graphs.
Proceedings of the Seventh ACM International Conference on Web Search and Data Mining, 2014

Centralized, measurement-based, spectrum management for environments with heterogeneous wireless networks.
Proceedings of the IEEE International Symposium on Dynamic Spectrum Access Networks, 2014

PEGASUS: A System for Large-Scale Graph Processing.
Proceedings of the Large Scale and Big Data - Processing and Management., 2014

2013
Modeling Intratumor Gene Copy Number Heterogeneity Using Fluorescence in Situ Hybridization Data.
Proceedings of the Algorithms in Bioinformatics - 13th International Workshop, 2013

Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees.
Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013

Algorithmic techniques for modeling and mining large graphs (AMAzING).
Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013

2012
Colorful triangle counting and a MapReduce implementation.
Inf. Process. Lett., 2012

Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning.
Internet Math., 2012

Perfect Reconstruction of Oncogenetic Trees
CoRR, 2012

Rainbow Connection of Sparse Random Graphs.
Electron. J. Comb., 2012

On Certain Properties of Random Apollonian Networks.
Proceedings of the Algorithms and Models for the Web Graph - 9th International Workshop, 2012

Rainbow Connectivity of Sparse Random Graphs.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011
HADI: Mining Radii of Large Graphs.
ACM Trans. Knowl. Discov. Data, 2011

Spectral counting of triangles via element-wise sparsification and triangle-based link recommendation.
Soc. Netw. Anal. Min., 2011

Counting triangles in real-world networks using projections.
Knowl. Inf. Syst., 2011

PEGASUS: mining peta-scale graphs.
Knowl. Inf. Syst., 2011

Triangle Sparsifiers.
J. Graph Algorithms Appl., 2011

Approximation algorithms for speeding up dynamic programming and denoising aCGH data.
ACM J. Exp. Algorithmics, 2011

Social Network Archetypes and Vertex Similarity, Graph Matching and the Generalized Eigenvalue Problem
CoRR, 2011

The Degree Sequence of Random Apollonian Networks
CoRR, 2011

High Degree Vertices, Eigenvalues and Diameter of Random Apollonian Networks
CoRR, 2011

Approximate Dynamic Programming using Halfspace Queries and Multiscale Monge Decomposition.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Large Scale Graph Mining with MapReduce: Counting Triangles in Large Real Networks.
Proceedings of the Graph Data Management: Techniques and Applications., 2011

2010
Approximate Dynamic Programming for Fast Denoising of aCGH Data
CoRR, 2010

Robust unmixing of tumor states in array comparative genomic hybridization data.
Bioinform., 2010

MACH: Fast Randomized Tensor Decompositions.
Proceedings of the SIAM International Conference on Data Mining, 2010

Radius Plots for Mining Tera-byte Scale Graphs: Algorithms, Patterns, and Observations.
Proceedings of the SIAM International Conference on Data Mining, 2010

On the Vulnerability of Large Graphs.
Proceedings of the ICDM 2010, 2010

2009
Approximate Triangle Counting
CoRR, 2009

DOULION: counting triangles in massive graphs with a coin.
Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France, June 28, 2009

PEGASUS: A Peta-Scale Graph Mining System.
Proceedings of the ICDM 2009, 2009

Spectral Counting of Triangles in Power-Law Networks via Element-Wise Sparsification.
Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining, 2009

2008
Two heads better than one: pattern discovery in time-evolving multi-aspect data.
Data Min. Knowl. Discov., 2008

Fast Counting of Triangles in Large Real Networks without Counting: Algorithms and Laws.
Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), 2008


  Loading...