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)

Budgeted Maximum Graph Coverage. - Sven Oliver Krumke; Madhav V. Marathe; Diana Poensgen; S. S. Ravi; Hans-Christoph Wirth (WG, 2002)

Online Call Admission in Optical Networks with Larger Demands. - Sven Oliver Krumke; Diana Poensgen (WG, 2002)

News from the online traveling repairman. - Sven Oliver Krumke; Willem de Paepe; Diana Poensgen; Leen Stougie (Theor. Comput. Sci., 2003)

Facets of online optimization: online dial-a-ride problems and dynamic configuration of all-optical networks. - Diana Poensgen (2003)

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)

Erratum to "News from the online traveling repairman" [TCS 295 (1-3) (2003) 279-294]. - Sven Oliver Krumke; Willem de Paepe; Diana Poensgen; Leen Stougie (Theor. Comput. Sci., 2006)