5 citations · 17 across the 24 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.CC2022
Recognizing when a preference system is close to admitting a master list
Ildikó Schlotter
A preference system is an undirected graph where vertices have preferences over their neighbors, and admits a master list if all preferences can be deri…
cs.CC2022★ 2 cited
Odd Paths, Cycles and -joins: Connections and Algorithms
Ildikó Schlotter, András Sebő
Minimizing the weight of an edge set satisfying parity constraints is a challenging branch of combinatorial optimization as witnessed by the binary hypergraph chapter of Alexander…
cs.DM2022★ 1 cited
Maximum-utility popular matchings with bounded instability
Ildikó Schlotter, Ágnes Cseh
In a graph where vertices have preferences over their neighbors, a matching is called popular if it does not lose a head-to-head election against any other matching when the vertic…