Willem de Paepe

According to our database1, Willem de Paepe authored at least 11 papers between 2001 and 2008.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2008
Bincoloring.
Theor. Comput. Sci., 2008

2006
Erratum to "News from the online traveling repairman" [TCS 295 (1-3) (2003) 279-294].
Theor. Comput. Sci., 2006

2005
On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem.
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

2004
Computer-Aided Complexity Classification of Dial-a-Ride Problems.
INFORMS J. Comput., 2004

On-Line Dial-a-Ride Problems Under a Restricted Information Model.
Algorithmica, 2004

2003
News from the online traveling repairman.
Theor. Comput. Sci., 2003

A Competitive Algorithm for the General 2-Server Problem.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002
How to cut a cake almost fairly.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001
The Online TSP Against Fair Adversaries.
INFORMS J. Comput., 2001

Online Bin Coloring.
Proceedings of the Algorithms, 2001


  Loading...