Diana Poensgen

According to our database, Diana Poensgen authored at least 8 papers between 2002 and 2006.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2006

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

2005

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

Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

2003

Facets of online optimization: online dial-a-ride problems and dynamic configuration of all-optical networks.

Diana Poensgen

PhD thesis, 2003

News from the online traveling repairman.

Sven Oliver Krumke, Willem de Paepe, Diana Poensgen, Leen Stougie

Theor. Comput. Sci., 2003

2002

Online Call Admission in Optical Networks with Larger Demands.

Sven Oliver Krumke, Diana Poensgen

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

Budgeted Maximum Graph Coverage.

Sven Oliver Krumke, Madhav V. Marathe, Diana Poensgen, S. S. Ravi, Hans-Christoph Wirth

Proceedings of the Graph-Theoretic Concepts in Computer Science, 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

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.

Sven Oliver Krumke, Luigi Laura, Maarten Lipmann, Alberto Marchetti-Spaccamela, Willem de Paepe, Diana Poensgen, Leen Stougie

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002