Online Bin Coloring. - Sven Oliver Krumke; Willem de Paepe; Jörg Rambau; Leen Stougie (ESA, 2001)

The Online TSP Against Fair Adversaries. - Michiel Blom; Sven Oliver Krumke; Willem de Paepe; Leen Stougie (INFORMS J. Comput., 2001)

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)

A Competitive Algorithm for the General 2-Server Problem. - René Sitters; Leen Stougie; Willem de Paepe (ICALP, 2003)

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

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

Computer-Aided Complexity Classification of Dial-a-Ride Problems. - Willem de Paepe; Jan Karel Lenstra; Jirí Sgall; René A. Sitters; Leen Stougie (INFORMS J. Comput., 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)

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)

Bincoloring. - Sven Oliver Krumke; Willem de Paepe; Jörg Rambau; Leen Stougie (Theor. Comput. Sci., 2008)