Nils Mosis

11 papers A* 1A 1B 3Journal 6
YearRankTypeTitle / Venue / Authors
2026 A* conf
An Unconditional Lower Bound for the Active-Set Method in Convex Quadratic Maximization.
SODA
Eleon Bach, Yann Disser, Sophie Huiberts, Nils Mosis
2026 A conf
Lower Bounds for Ranking-Based Pivot Rules.
STACS
Yann Disser, Georg Loho, Matthew T. Maat, Nils Mosis
2026 J jnl
Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride.
SIAM J. Discret. Math.
Júlia Baligács, Yann Disser, Nils Mosis, David Weckbecker
2025 B conf
An Unconditional Lower Bound for the Active-Set Method on the Hypercube.
IPCO
Yann Disser, Nils Mosis
2025 J jnl
An unconditional lower bound for the active-set method in convex quadratic maximization.
CoRR
Eleon Bach, Yann Disser, Sophie Huiberts, Nils Mosis
2025 J jnl
An unconditional lower bound for the active-set method on the hypercube.
CoRR
Yann Disser, Nils Mosis
2025 J jnl
Lower bounds for ranking-based pivot rules.
CoRR
Yann Disser, Georg Loho, Matthew T. Maat, Nils Mosis
2023 B conf
A Unified Worst Case for Classical Simplex and Policy Iteration Pivot Rules.
ISAAC
Yann Disser, Nils Mosis
2023 J jnl
A unified worst case for classical simplex and policy iteration pivot rules.
CoRR
Yann Disser, Nils Mosis
2022 B conf
An Improved Algorithm for Open Online Dial-a-Ride.
WAOA
Júlia Baligács, Yann Disser, Nils Mosis, David Weckbecker
2022 J jnl
An Improved Algorithm for Open Online Dial-a-Ride.
CoRR
Júlia Baligács, Yann Disser, Nils Mosis, David Weckbecker