Editorial Board
Cryptanalysis of a password authentication scheme over insecure networks
Tight approximation algorithm for connectivity augmentation problems
On the Approximation of Correlation Clustering and Consensus Clustering
Compact samples for data dissemination
A unified theory of structural tractability for constraint satisfaction problems
Improved bounds on sorting by length-weighted reversals
Compact roundtrip routing with topology-independent node names
Maximal repetitions in strings
Fast periodic graph exploration with constant memory
The gap in circumventing the impossibility of consensus
Hardness of optimal spaced seed design
Convex recolorings of strings and trees: Definitions, hardness results and algorithms
Finite automata for testing composition-based reconstructibility of sequences
Approximation of satisfactory bisection problems
Simultaneous matchings: Hardness and approximation
Computational complexity of auditing finite attributes in statistical databases
Fault tolerance in cellular automata at high fault rates
Efficient algorithms for counting parameterized list H-colorings
Contents