Maarten Lipmann

According to our database, Maarten Lipmann authored at least 5 papers between 2002 and 2017.

Collaborative distances:

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

2017

Tight Bounds for Online TSP on the Line.

Antje Bjelde, Yann Disser, Jan Hackfeld, Christoph Hansknecht, Maarten Lipmann, Julie Meißner, Kevin Schewior, Miriam Schlöter, Leen Stougie

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2005

On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem.

Sven Oliver Krumke, Willem de Paepe, Diana Poensgen, Maarten Lipmann, Alberto Marchetti-Spaccamela, Leen Stougie

Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

2002

How to cut a cake almost fairly.

Sven Oliver Krumke, Maarten Lipmann, Willem de Paepe, Diana Poensgen, Jörg Rambau, Leen Stougie, Gerhard J. Woeginger

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

On-Line Dial-a-Ride Problems under a Restricted Information Model.

Maarten Lipmann, Xiwen Lu, Willem de Paepe, René Sitters, Leen Stougie

Proceedings of the Algorithms, 2002

Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem.

Sven Oliver Krumke, Luigi Laura, Maarten Lipmann, Alberto Marchetti-Spaccamela, Willem de Paepe, Diana Poensgen, Leen Stougie

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002