9 citations · 17 across the 3 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2017
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…
cs.CC2015★ 7 cited
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…