Table of Contents
Analysis of Algorithms
| Connectivity for line-of-sight networks in higher dimensions | PDF PostScript |
| Luc Devroye, Linda Farczadi | 71-86 |
Combinatorics
| Descent variation of samples of geometric variables | PDF PostScript |
| Charlotte Brennan, Arnold Knopfmacher | 1-12 |
| Operations on partially ordered sets and rational identities of type A | PDF PostScript |
| Adrien Boussicault | 13-32 |
| On the enumeration of d-minimal permutations | PDF PostScript |
| Mathilde Bouvel, Luca Ferrari | 33-48 |
Discrete Algorithms
| Efficient repeat finding in sets of strings via suffix arrays | PDF PostScript |
| Pablo Barenbaum, Verónica Becher, Alejandro Deymonnaz, Melisa Halsband, Pablo Ariel Heiber | 59-70 |
Graph Theory
| Bipartite Powers of k-chordal Graphs | PDF PostScript |
| L. Sunil Chandran, Rogers Mathew | 49-58 |
| Improved Bounds on the Crossing Number of Butterfly Network | PDF PostScript |
| Paul D. Manuel, Bharati Rajan, Indra Rajasingh, P. Vasanthi Beulah | 87-94 |
ISSN: 1365-8050