Stavros Sintos

activity

20232026

most citedFaster Algorithms for Fair Max-Min Diversification in

R^{d}

7 citations · 8 across the 10 of their papers we have counts for

collaborators

Showing 2026Show all

3 papers · 1 filter

cs.DS2026

Compact Representations of Geometric Bipartite Graphs via Weighted Biclique Covers

Aryan Esmailpour, Khoi Le, Stavros Sintos

Bipartite graphs are a fundamental representation for relational data arising in recommendation systems, social networks, and communication graphs. A key challenge in these setting…

cs.DB2026

Faster Relational Algorithms Using Geometric Data Structures

Aryan Esmailpour, Stavros Sintos

Optimization tasks over relational data, such as clustering, often suffer from the prohibitive cost of join operations, which are necessary to access the full dataset. While geomet…

cs.LG2026

Metric $k$ -clustering using only Weak Comparison Oracles

Rahul Raychaudhury, Aryan Esmailpour, Sainyam Galhotra +1

Clustering is a fundamental primitive in unsupervised learning. However, classical algorithms for $k$ -clustering (such as $k$ -median and $k$ -means) assume access to exact pairwise…

Compact Representations of Geometric Bipartite Graphs via Weighted Biclique Covers

Faster Relational Algorithms Using Geometric Data Structures

Metric k-clustering using only Weak Comparison Oracles

Metric $k$ -clustering using only Weak Comparison Oracles