Maarten Lipmann

According to our database1, Maarten Lipmann authored at least 5 papers between 2002 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Tight Bounds for Online TSP on the Line.
ACM Trans. Algorithms, 2021

2005
On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem.
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

2004
On-Line Dial-a-Ride Problems Under a Restricted Information Model.
Algorithmica, 2004

2002
How to cut a cake almost fairly.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002


  Loading...