The robust bilevel continuous knapsack problem. - Christoph Buchheim; Dorothee Henke (CoRR, 2019)

On the complexity of robust bilevel optimization with uncertain follower's objective. - Christoph Buchheim; Dorothee Henke; Felix Hommelsheim (Oper. Res. Lett., 2021)

The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective. - Christoph Buchheim; Dorothee Henke (J. Glob. Optim., 2022)

The Stochastic Bilevel Continuous Knapsack Problem with Uncertain Follower's Objective. - Christoph Buchheim; Dorothee Henke; Jannik Irmai (J. Optim. Theory Appl., 2022)

On the complexity of the bilevel minimum spanning tree problem. - Christoph Buchheim; Dorothee Henke; Felix Hommelsheim (Networks, 2022)

Optimization at the Second Level (Dagstuhl Seminar 22441). - Luce Brotcorne; Christoph Buchheim; Dick den Hertog; Dorothee Henke (Dagstuhl Reports, 2022)

On the Complexity of the Bilevel Shortest Path Problem. - Dorothee Henke; Lasse Wulf (CoRR, 2024)

Faster goal-oriented shortest path search for bulk and incremental detailed routing. - Markus Ahrens; Dorothee Henke; Stefan Rabenstein; Jens Vygen (Math. Program., 2024)

The Robust Bilevel Selection Problem. - Dorothee Henke (Open J. Math. Optim., 2025)

On coupling constraints in linear bilevel optimization. - Dorothee Henke; Henri Lefebvre; Martin Schmidt 003; Johannes Thürauf (Optim. Lett., 2025)