Table of Contents
General
| Computation with No Memory, and Rearrangeable Multicast Networks | PDF PostScript |
| Serge Burckel, Emeric Gioan, Emmanuel Thomé | 121-142 |
Analysis of Algorithms
| Computing the number of h-edge spanning forests in complete bipartite graphs | PDF PostScript |
| Rebecca J. Stones | 313-326 |
Automata, Logic and Semantics
| Canonical forms for free κ-semigroups | PDF PostScript |
| José Carlos Costa | 159-178 |
| An S-adic characterization of minimal subshifts with first difference of complexity 1 ≤ p(n+1) - p(n) ≤ 2 | PDF PostScript |
| Julien Leroy | 233-286 |
Combinatorics
| Congruence successions in compositions | PDF PostScript |
| Toufik Mansour, Mark Shattuck, Mark C Wilson | 327-338 |
| Descents after maxima in compositions | PDF PostScript |
| Aubrey Blecher, Charlotte Brennan, Arnold Knopfmacher | 61-72 |
| Graphs where every k-subset of vertices is an identifying set | |
| Sylvain Gravier, Svante Janson, Tero Laihonen, Sanna Maarit Ranto | 73-88 |
| A combinatorial non-commutative Hopf algebra of graphs | PDF PostScript |
| Adrian Tanasa, Gerard H. E. Duchamp, Loic Foissy, Nguyen Hoang-Nghia, Dominique Manchon | 356-370 |
| Robot's hand and expansions in non-integer bases | PDF PostScript |
| Anna Chiara Lai, Paola Loreti | 371-394 |
Discrete Algorithms
| The Price of Mediation | PDF PostScript |
| Milan Bradonjic, Gunes Ercal, Adam Meyerson, Alan Roytman | 31-60 |
| An Amortized Search Tree Analysis for Finding a k-Leaf Spanning Tree in an Undirected Graph | PDF PostScript |
| Daniel Binkele-Raible, Henning Fernau | 179-200 |
Graph Theory
| On size, radius and minimum degree | PDF PostScript |
| Simon Mukwembi | 1-6 |
| On Hamiltonian Paths and Cycles in Sufficiently Large Distance Graphs | PDF PostScript |
| Christian Löwenstein, Dieter Rautenbach, Roman Soták | 7-30 |
| List circular backbone colouring | PDF PostScript |
| Frederic Havet, Andrew King | 89-104 |
| Efficient open domination in graph products | PDF PostScript |
| Dorota Kuziak, Iztok Peterin, Ismael Gonzalez Yero | 105-120 |
| Strong parity vertex coloring of plane graphs | PDF PostScript |
| Tomáš Kaiser, Ondřej Rucký, Matěj Stehlík, Riste Škrekovski | 143-158 |
| The Total Irregularity of a Graph | PDF PostScript |
| Hosam Abdo, Stephan Brandt, Darko Dimitrov | 201-206 |
| The Price of Connectivity for Vertex Cover | PDF PostScript |
| Eglantine Camby, Jean Cardinal, Samuel Fiorini, Oliver Schaudt | 207-224 |
| On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph | PDF PostScript |
| Olivier Baudon, Julien Bensmail, Rafał Kalinowski, Antoni Marczyk, Jakub Przybyło, Mariusz Woźniak | 225-232 |
| A forcible version of Niessen's problem on degree sequences of graphs | PDF PostScript |
| Jiyun Guo, Jianhua Yin | 287-292 |
| On the Meyniel condition for hamiltonicity in bipartite digraphs | PDF PostScript |
| Janusz Adamus, Lech Adamus, Anders Yeo | 293-302 |
| The generalized 3-connectivity of Lexicographic product graphs | PDF PostScript |
| Xueliang Li, Yaping Mao | 339-354 |
Special issue in honor of Laci Babai's 60th birthday
| Elements in finite classical groups whose powers have large 1-Eigenspaces | PDF PostScript |
| Alice C. Niemeyer, Cheryl E. Praeger | 303-312 |
ISSN: 1365-8050