Nils Mosis

Orcid: 0000-0002-0692-0647

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

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride.
SIAM J. Discret. Math., 2026

Lower Bounds for Ranking-Based Pivot Rules.
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.
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.
Proceedings of the Integer Programming and Combinatorial Optimization, 2025

2023
A Unified Worst Case for Classical Simplex and Policy Iteration Pivot Rules.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022
An Improved Algorithm for Open Online Dial-a-Ride.
Proceedings of the Approximation and Online Algorithms - 20th International Workshop, 2022


  Loading...