2 citations · 4 across the 15 of their papers we have counts for
7 papers · 1 filter
Fair Committee Selection under Ordinal Preferences and Limited Cardinal Information
Ameet Gadekar, Aristides Gionis, Suhas Thejaswi +1
We study the problem of fair -committee selection under an egalitarian objective. Given agents partitioned into groups (\eg, demographic quotas), the goal is to aggregat…
Capacitated Fair-Range Clustering: Hardness and Approximation Algorithms
Ameet Gadekar, Suhas Thejaswi
Capacitated fair-range -clustering generalizes classical -clustering by incorporating both capacity constraints and demographic fairness. In this setting, each facility has a…
Diversity-aware clustering: Computational Complexity and Approximation Algorithms
Suhas Thejaswi, Ameet Gadekar, Bruno Ordozgoiti +1
In this work, we study diversity-aware clustering problems where the data points are associated with multiple attributes resulting in intersecting groups. A clustering solution nee…
Clustering with fair-center representation: parameterized approximation algorithms and heuristics
Suhas Thejaswi, Ameet Gadekar, Bruno Ordozgoiti +1
We study a variant of classical clustering formulations in the context of algorithmic fairness, known as diversity-aware clustering. In this variant we are given a collection of fa…
Diversity-aware -median : Clustering with fair center representation
Suhas Thejaswi, Bruno Ordozgoiti, Aristides Gionis
We introduce a novel problem for diversity-aware clustering. We assume that the potential cluster centers belong to a set of groups defined by protected attributes, such as ethnici…
Restless reachability problems in temporal graphs
Suhas Thejaswi, Juho Lauri, Aristides Gionis
We study a family of reachability problems under waiting-time restrictions in temporal and vertex-colored temporal graphs. Given a temporal graph and a set of source vertices, we f…
Finding path motifs in large temporal graphs using algebraic fingerprints
Suhas Thejaswi, Aristides Gionis, Juho Lauri
We study a family of pattern-detection problems in vertex-colored temporal graphs. In particular, given a vertex-colored temporal graph and a multiset of colors as a query, we sear…