18 citations · 169 across the 45 of their papers we have counts for
52 papers
Estimating Hitting Times Locally At Scale
Themistoklis Haris, Fabian Spaeh, Spyros Dragazis +1
Hitting times provide a fundamental measure of distance in random processes, quantifying the expected number of steps for a random walk starting at node to reach node . They…
Countering Election Sway: Strategic Algorithms in Friedkin-Johnsen Dynamics
Dragos Ristache, Fabian Spaeh, Charalampos E. Tsourakakis
Social influence profoundly impacts individual choices and collective behaviors in politics. In this work, driven by the goal of protecting elections from improper influence, we co…
Parallel Motif-Based Community Detection
Tianyi Chen, Charalampos E. Tsourakakis
Community detection is a central task in graph analytics. Given the substantial growth in graph size, scalability in community detection continues to be an unresolved challenge. Re…
Q-DISCO: Query-Centric Densest Subgraphs in Networks with Opinion Information
Tianyi Chen, Atsushi Miyauchi, Charalampos E. Tsourakakis
Given a network , where each node is associated with a vector representing its opinion about different topics, how can we uncov…
Targeted Least Cardinality Candidate Key for Relational Databases
Vasileios Nakos, Hung Q. Ngo, Charalampos E. Tsourakakis
Functional dependencies (FDs) are a central theme in databases, playing a major role in the design of database schemas and the optimization of queries. In this work, we introduce t…
A Note on Computing Betweenness Centrality from the 2-core
Charalampos E. Tsourakakis
A central task in network analysis is to identify important nodes in a graph. Betweenness centrality (BC) is a popular centrality measure that captures the significance of nodes ba…