Period
2002 - 2007
Number
6
Co-Authors
Bincoloring (2007)
Krumke, SO, Paepe, WE De, Rambau, Jörg
On minimizing the maximum flow time in the online dial-a-ride problem (2005)
Krumke, SO, Paepe, WE De, Poensgen, D
A competitive algorithm for the general 2-server problem (2003)
Sitters, RA, Stougie, L, Paepe, WE De
Computer-aided complexity classification of dial-a-ride problems (2003)
Sgall, J, Lenstra, JK, Paepe, WE De
Complexity results and competitive analysis for vehicle routing problems (2002)
Paepe, WE De
Doctoral degree 30-09-2002; Department of Mathematics and Computing Science; Supervisors: J.K. Lenstra and A.G. de Kok
On-line dial-a-ride problems under a restricted information model (2002)
Lipmann, M, Lu, X, Paepe, WE De