9 citations · 17 across the 3 of their papers we have counts for
4 papers
Finding Counterfactual Explanations through Constraint Relaxations
Sharmi Dev Gupta, Begum Genc, Barry O'Sullivan
Interactive constraint systems often suffer from infeasibility (no solution) due to conflicting user constraints. A common approach to recover infeasibility is to eliminate the con…
On the Complexity of Robust Stable Marriage
Begum Genc, Mohamed Siala, Gilles Simonin +1
Robust Stable Marriage (RSM) is a variant of the classical Stable Marriage problem, where the robustness of a given stable matching is measured by the number of modifications requi…
Finding Robust Solutions to Stable Marriage
Begum Genc, Mohamed Siala, Barry O'Sullivan +1
We study the notion of robustness in stable matching problems. We first define robustness by introducing (a,b)-supermatches. An -supermatch is a stable matching in which if…
All Colors Shortest Path Problem
Yunus Can Bilge, Doğukan Çağatay, Begüm Genç +3
All Colors Shortest Path problem defined on an undirected graph aims at finding a shortest, possibly non-simple, path where every color occurs at least once, assuming that each ver…