Geodesic

Sommaire du Fascicule no. 1

Deterministic Recurrent Communication and Synchronization in Restricted Sensor Network
Cycle transversals in bounded degree graphs
Negative bases and automata
Tree-width and large grid minors in planar graphs
Recursions and divisibility properties for combinatorial Macdonald polynomials
Irregular edge coloring of 2-regular graphs
A de Bruijn - Erdos theorem and metric spaces

Sommaire du Fascicule no. 2

Random 2-SAT Solution Components and a Fitness Landscape
Parameterized Problems Related to Seidel's Switching
A Combinatorial Approach to the Tanny Sequence
Colouring the Square of the Cartesian Product of Trees
Generation of Cubic graphs
Sturmian Sequences and Invertible Substitutions
An expected polynomial time algorithm for coloring 2-colorable 3-graphs
Avoidance colourings for small nonclassical Ramsey numbers

Sommaire du Fascicule no. 3

Nordhaus-Gaddum Type Results for Total Domination
The largest singletons in weighted set partitions and its applications
On packing of two copies of a hypergraph
On the number of maximal independent sets in a graph
On the complexity of vertex-coloring edge-weightings
On the Book Thickness of k-Trees
On the number of factors in codings of three interval exchange
The Variance of the Profile in Digital Search Trees
Digital search trees with m trees: Level polynomials and insertion costs
New Upper Bounds for the Heights of Some Light Subgraphs in 1-Planar Graphs with High Minimum Degree
8-star-choosability of a graph with maximum average degree less than 3

Sommaire du Fascicule no. 4

Combinatorics, Groups, Algorithms, and Complexity: Conference in honor of Laci Babai's 60th birthday
Polynomial-time normalizers
On the metric dimension of Grassmann graphs
The extended equivalence and equation solvability problems for groups
On the residual solvability of generalized free products of solvable groups
Separating the k-party communication complexity hierarchy: an application of the Zarankiewicz problem
On the sensitivity of cyclically-invariant Boolean functions
On the minimal distance of a polynomial code
Computing tensor decompositions of finite matrix groups