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 (APPROX, 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 (SODA, 2002)

On-Line Dial-a-Ride Problems Under a Restricted Information Model. - Maarten Lipmann; Xiwen Lu; Willem de Paepe; René Sitters; Leen Stougie (Algorithmica, 2004)

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 (WAOA, 2005)

Tight Bounds for Online TSP on the Line. - Antje Bjelde; Jan Hackfeld; Yann Disser; Christoph Hansknecht; Maarten Lipmann; Julie Meißner; Miriam Schlöter; Kevin Schewior; Leen Stougie (ACM Trans. Algorithms, 2021)