3 citations · 3 across the 3 of their papers we have counts for
3 papers
math.OC2026
Complexity of partitioned-items response problems: matchings and perfect matchings
Christoph Buchheim, Lowig Duer, Eva Ley +2
We consider bilevel optimization problems in which leader and follower jointly construct a feasible solution for an underlying combinatorial optimization problem. Response problems…
cs.DS2026★ 3 cited
Recoverable Robust Optimization with Commitment
Felix Hommelsheim, Nicole Megow, Komal Muluk +1
We propose a model for recoverable robust optimization with commitment. Given a combinatorial optimization problem and uncertainty about elements that may fail, we ask for a robust…
cs.DS2026
On the Complexity of Bilevel Independent Set Problem
Komal Muluk
We consider a bilevel optimization problem in which the ground set is partitioned between two decision makers, a leader and a follower, whose optimization problems are interleaved.…