Table of Contents
Automata, Logic and Semantics
| Monadic second-order classes of forests with a monadic second-order 0-1 law | PDF PostScript |
| Jason P. Bell, Stanley N. Burris, Karen Yeats | 87-108 |
| The Join of the Varieties of R-trivial and L-trivial Monoids via Combinatorics on Words | PDF PostScript |
| Manfred Kufleitner, Alexander Lauser | 141-146 |
Combinatorics
| Adaptive Identification of Sets of Vertices in Graphs | PDF PostScript |
| Ville Junnila | 69-86 |
Discrete Algorithms
| A linear time algorithm for finding an Euler walk in a strongly connected 3-uniform hypergraph | PDF PostScript |
| Zbigniew Lonc, Paweł Naroski | 147-158 |
Distributed Computing and Networking
| Optimal Computer Crash Performance Precaution | PDF PostScript |
| Efraim Laksman, Håkan Lennerstad, Lars Lundberg | 55-68 |
Graph Theory
| The generalized 3-connectivity of Cartesian product | PDF PostScript |
| Hengzhe Li, Xueliang Li, Yuefang Sun | 43-54 |
| α-Labelings and the Structure of Trees with Nonzero α-Deficit | PDF PostScript |
| Gunnar Brinkmann, Simon Crevals, Hadrien M\élot, Leanne Rylands, Eckhard Steffen | 159-174 |
Graphs and Algorithms
| Vertex-colouring edge-weightings with two edge weights | PDF PostScript |
| Mahdad Khatirinejad, Reza Naserasr, Mike Newman, Ben Seamone, Brett Stevens | 1-20 |
| On Hamilton-chain saturated uniform hypergraphs | PDF PostScript |
| Andrzej Zak, Aneta Dudek | 21-28 |
| A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set | PDF PostScript |
| Serge Gaspers, Mathieu Liedloff | 29-42 |
| Bounds for the minimum oriented diameter | PDF PostScript |
| Sascha Kurz, Martin Lätsch | 109-140 |
ISSN: 1365-8050