Geodesic

Tome 8 (2006)

Sommaire

The Online Specialization Problem
On randomly colouring locally sparse graphs
Optimal L(h,k)-Labeling of Regular Grids
Common intervals in permutations
The first descent in samples of geometric random variables and permutations
On the number of spanning trees of K_n^m #x00B1 G graphs
On the computability of the topological entropy of subshifts
Tiling Z² with translations of one set
New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks
On Sampling Colorings of Bipartite Graphs
A survey of multivariate aspects of the contraction method
Recognizing HH-free, HHD-free, and Welsh-Powell Opposition Graphs
Approximation Algorithms for Multicoloring Planar Graphs and Powers of Square and Triangular Meshes
P6- and triangle-free graphs revisited: structure and bounded clique-width
Generalized connected domination in graphs
A Cartesian closed category of event structures with quotients
d-records in geometrically distributed random variables
Counting l-letter subwords in compositions
Some new optimal and suboptimal infinite families of undirected double-loop networks