1 citations · 1 across the 9 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.DB2024★ 1 cited
Improved Approximation Algorithms for Relational Clustering
Aryan Esmailpour, Stavros Sintos
Clustering plays a crucial role in computer science, facilitating data analysis and problem-solving across numerous fields. By partitioning large datasets into meaningful groups, c…
math.CO2024
Combinatorial upper bounds for the smallest eigenvalue of a graph
Aryan Esmailpour, Sara Saeedi Madani, Dariush Kiani
Let be a graph, and let denote the smallest eigenvalue of . First, we provide an upper bound for based on induced bipartite subgraphs of . Consequently, we…