University of Leicester

informatics

Publications in Algorithms and Complexity 2004

  1. Mark Cieliebak, Thomas Erlebach, Zsuzsanna Liptak, Jens Stoye, Emo Welzl. Algorithmic Complexity of Protein Identification. Combinatorics of Weighted Strings Discrete Applied Mathematics, 137(1), pp. 27-46, February 2004.
  2. Thomas Erlebach and Alexander Hall. NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow. Journal of Scheduling, 7, pp. 223-241, 2004.
  3. Thomas Erlebach and Maurice Rueegg. Optimal Bandwidth Reservation in Hose-Model VPNs with Multi-Path Routing. In IEEE Infocom, March 2004.
  4. Thomas Erlebach, Riko Jacob, Matus Mihalak, Marc Nunkesser, Gabor Szabo, Peter Widmayer. An Algorithmic View on OVSF Code Assignment. In Proceedings of the 21st International Symposium on Theoretical Aspects of Computer Science (STACS 2004), LNCS 2996, Springer-Verlag, March 2004, pp. 270-281.
  5. R. F. Geary, N. Rahman, R. Raman and V. Raman, A Simple Optimal Representation for Balanced Parentheses. In Proceedings of Fifteenth Annual Combinatorial Pattern Matching Symposium 2004 (CPM 2004), LNCS 3109, Springer-Verlag, pp. 159-172
  6. R. F. Geary, R. Raman and V. Raman. Succinct ordinal trees with level-ancestor queries. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA04), pp. 1-10, ACM Press, 2004.
  7. Danny Krizanc, Flaminia L. Luccio, and Rajeev Raman. Compact routing schemes for Dynamic Ring Networks. Theory of Computing Systems, 37 (2004), pp. 585-507.
  8. D. W. Parkes, V. Yu. Shavrukov and R. M. Thomas, Monoid presentations of groups by finite special string-rewriting systems. RAIRO Theoretical Informatics and Applications 38 (2004), pp. 245-256.
  9. R. Raman. Data structures for sets (Chapter 33). In D. P. Mehta and S. Sahni, Handbook of Data Structures and Applications, CRC Press, 2004.
  10. Stamatis Stefanakos and Thomas Erlebach. Routing in All-Optical Ring Networks Revisited. In Proceedings of the 9th IEEE Symposium on Computers and Communications (ISCC 2004), pp. 288-293, 2004.
  11. S. Yang. Adaptive group mutation for tackling deception in genetic search. WSEAS Transactions on Systems, 3(1), 2004.
  12. S. Yang. Constructing dynamic test environments for genetic algorithms based on problem difficulty. In Proceedings of the 2004 Congress on Evolutionary Computation, 2 (2004), pp. 1262-1269.

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