Table of Contents
Analysis of Algorithms
| Connectivity for line-of-sight networks in higher dimensions | PDF PostScript |
| Luc Devroye, Linda Farczadi | 71-86 |
| Coupon collecting and transversals of hypergraphs | PDF PostScript |
| Marcel Wild, Svante Janson, Stephan Wagner, Dirk Laurie | 259-270 |
Automata, Logic and Semantics
| Derivatives of Approximate Regular Expressions | PDF PostScript |
| Jean-Marc Champarnaud, Hadrien Jeanne, Ludovic Mignot | 95-120 |
| A Stronger Recognizability Condition for Two-dimensional Languages | PDF PostScript |
| Marcella Anselmo, Maria Madonia | 139-156 |
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 |
| Topological structuring of the digital plane | PDF PostScript |
| Josef Slapal | 165-176 |
| Cyclic partitions of complete nonuniform hypergraphs and complete multipartite hypergraphs | PDF PostScript |
| Shonda Gosselin, Artur Szymanski, Adam Pawel Wojda | 215-222 |
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 |
| The Complexity of 2-Coloring and Strong Coloring in Uniform Hypergraphs with High Degrees | PDF PostScript |
| Edyta Szymanska | 121-138 |
| A note on contracting claw-free graphs | PDF PostScript |
| Jiri Fiala, Marcin Kaminski, Daniel Paulusma | 223-232 |
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 |
| Removable Edges in Near-bricks | PDF PostScript |
| Xiumei Wang, Cheng He, Yixun Lin | 157-164 |
| Probe interval graphs and probe unit interval graphs on superclasses of cographs | PDF PostScript |
| Flavia Bonomo, Guillermo Durán, Luciano Norberto Grippo, Martín Darío Safe | 177-194 |
| A note on the NP-hardness of two matching problems in induced subgrids | PDF PostScript |
| Tinaz Ekim, Marc Demange | 233-242 |
| Maximal independent sets in bipartite graphs with at least one cycle | PDF PostScript |
| Shuchao LI, Huihui Zhang, Xiaoyan Zhang | 243-258 |
Graphs and Algorithms
| On-line ranking of split graphs | PDF PostScript |
| Piotr Borowiecki, Dariusz Dereniowski | 195-214 |
ISSN: 1365-8050