University of Leicester

informatics

Accepted Publications in Algorithms and Complexity

  1. Udo Adamy, Thomas Erlebach, Dieter Mitsche, Ingo Schurr, Bettina Speckmann, Emo Welzl. Off-line Admission Control for Advance Reservations in Star Networks. In Proceedings of the Second Workshop on Approximation and Online Algorithms (WAOA 2004), Bergen, Norway, September 2004. LNCS, Springer-Verlag. To appear.
  2. S. Dantchev and F.D. Valencia. On Infinite CSPs. In Proceedings of the Third International Workshop on Modelling and Reformulating Constraint Satisfaction Problems, to be held at the 10th International Conference on Principles and Practice of Constraint Programming (CP 2004). To appear.
  3. Thomas Erlebach, Klaus Jansen, Eike Seidel. Polynomial-Time Approximation Schemes for Geometric Intersection Graphs. SIAM Journal on Computing To appear.
  4. Thomas Erlebach, Riko Jacob, Matus Mihalak, Marc Nunkesser, Gabor Szabo, Peter Widmayer. Joint Base Station Scheduling. In Proceedings of the Second Workshop on Approximation and Online Algorithms (WAOA 2004), Bergen, Norway, September 2004. LNCS, Springer-Verlag. To appear.
  5. Thomas Erlebach, Alexander Hall, Alessandro Panconesi and Danica Vukadinovic. Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing. In Proceedings of the First Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN), August 2004. LNCS, Springer-Verlag. To appear.
  6. S. Yang and X. Yao. Experimental study on population-based incremental learning algorithms for dynamic optimization problems. To appear in The Journal of Soft Computing, 2004.

Author: Naila Rahman (nyr1 at mcs.le.ac.uk), T: +44 (0)116 252 2593.
© University of Leicester May 2003. Last modified: 18th November 2004, 17:14:01.
Informatics Web Maintainer. This document has been approved by the Head of Department.