Nils Mosis

According to our database, Nils Mosis authored at least 6 papers between 2022 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2026

Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride.

Júlia Baligács, Yann Disser, Nils Mosis, David Weckbecker

SIAM J. Discret. Math., 2026

Lower Bounds for Ranking-Based Pivot Rules.

Yann Disser, Georg Loho, Matthew T. Maat, Nils Mosis

Proceedings of the 43rd International Symposium on Theoretical Aspects of Computer Science, 2026

An Unconditional Lower Bound for the Active-Set Method in Convex Quadratic Maximization.

Eleon Bach, Yann Disser, Sophie Huiberts, Nils Mosis

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025

An Unconditional Lower Bound for the Active-Set Method on the Hypercube.

Yann Disser, Nils Mosis

Proceedings of the Integer Programming and Combinatorial Optimization, 2025

2023

A Unified Worst Case for Classical Simplex and Policy Iteration Pivot Rules.

Yann Disser, Nils Mosis

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022

An Improved Algorithm for Open Online Dial-a-Ride.

Júlia Baligács, Yann Disser, Nils Mosis, David Weckbecker

Proceedings of the Approximation and Online Algorithms - 20th International Workshop, 2022