M. Sc. Nils Mosis

Lower bounds for ranking-based pivot rules (In submission)
with Y. Disser, G. Loho, M. Maat.

An unconditional lower bound for the active-set method in convex quadratic maximization (arXiv)
with E. Bach, Y. Disser, S. Huiberts. SODA 2026.

An unconditional lower bound for the active-set method on the hypercube
with Y. Disser. IPCO 2025. (arXiv full version)

A unified worst case for classical simplex and policy iteration pivot rules
with Y. Disser. ISAAC 2023. (arXiv full version)

An Improved Algorithm for Open Online Dial-a-Ride
with J. Baligács, Y. Disser, D. Weckbecker. WAOA 2022.

---

Lower Bounds for Simplex Pivot Rules via Markov Decision Processes
Operations Research Proceedings 2023.

Laufzeitschranken für den Simplex Algorithmus durch Markov-Entscheidungsprozesse
in OR News Nr. 79. December 2023.

Upcoming: SODA 2026
in Vancouver (Canada). January 2026.

The Simplex Method: Theory, Complexity, and Applications
at FU Berlin. June 2025.

MOR Research Seminar
at University of Twente. January 2025.

Discrete Geometry and Topological Combinatorics Seminar
at FU Berlin. January 2024.

ISAAC 2023
in Kyoto (Japan). December 2023.

OR 2023 (master thesis award)
in Hamburg (Germany). August 2023

Seminar of the Research Group Optimization
at TU Darmstadt. November 2023, February 2025.