Publications in Algorithms and Complexity 2004
 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. 2746, February
2004.
 Thomas Erlebach and Alexander Hall. NPHardness of Broadcast Scheduling and
Inapproximability of SingleSource Unsplittable MinCost Flow. Journal of
Scheduling, 7, pp. 223241, 2004.
 Thomas Erlebach and Maurice Rueegg. Optimal Bandwidth Reservation in
HoseModel VPNs with MultiPath Routing. In IEEE Infocom, March 2004.
 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, SpringerVerlag, March 2004,
pp. 270281.
 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, SpringerVerlag, pp. 159172
 R. F. Geary, R. Raman and V. Raman. Succinct ordinal trees with
levelancestor queries. In Proceedings of the 15th Annual ACMSIAM
Symposium on Discrete Algorithms (SODA04), pp. 110, ACM Press,
2004.
 Danny Krizanc, Flaminia L. Luccio, and Rajeev Raman.
Compact routing schemes for Dynamic Ring Networks.
Theory of Computing Systems, 37 (2004), pp. 585507.
 D. W. Parkes, V. Yu. Shavrukov and R. M. Thomas,
Monoid presentations of groups by finite special stringrewriting systems.
RAIRO Theoretical Informatics and Applications 38 (2004), pp. 245256.
 R. Raman.
Data structures for sets (Chapter 33).
In D. P. Mehta and S. Sahni,
Handbook of Data Structures and Applications,
CRC Press, 2004.
 Stamatis Stefanakos and Thomas Erlebach. Routing in AllOptical Ring Networks
Revisited. In Proceedings of the 9th IEEE Symposium on Computers and Communications
(ISCC 2004), pp. 288293, 2004.
 S. Yang. Adaptive group mutation for tackling deception in genetic
search. WSEAS Transactions on Systems, 3(1), 2004.
 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. 12621269.

