Geodesic

Sommaire du Fascicule no. 1

From light edges to strong edge-colouring of 1-planar graphs
Vertex order with optimal number of adjacent predecessors
On the Complexity of Digraph Colourings and Vertex Arboricity
A Characterization of Morphic Words with Polynomial Growth
The repetition threshold for binary rich words
Analysis of a Model for Generating Weakly Scale-free Networks
New tools for state complexity
A method for eternally dominating strong grids
The 3-way flower intersection problem for Steiner triple systems
The Chromatic Number of the Disjointness Graph of the Double Chain
The super-connectivity of Johnson graphs
Complexity of Leading Digit Sequences
The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints
Formal inverses of the generalized Thue-Morse sequences and variations of the Rudin-Shapiro sequence
The Complexity of Helly-$B_{1}$ EPG Graph Recognition
New schemes for simplifying binary constraint satisfaction problems
Complementary symmetric Rote sequences: the critical exponent and the recurrence function
Antifactors of regular bipartite graphs
Inversion sequences avoiding pairs of patterns
On the heapability of finite partial orders
The agreement distance of unrooted phylogenetic networks
Dissecting a square into congruent polygons
On an alternative sequence comparison statistic of Steele

Sommaire du Fascicule no. 2

Permutation Patterns 2019

Enumeration of Permutation Classes and Weighted Labelled Independent Sets
Bounded affine permutations I. Pattern avoidance and enumeration
Enumeration of Stack-Sorting Preimages via a Decomposition Lemma
Catalan words avoiding pairs of length three patterns
Flip-sort and combinatorial aspects of pop-stack sorting
Fillings of skew shapes avoiding diagonal patterns
Enumeration of Dumont permutations avoiding certain four-letter patterns
Two examples of Wilf-collapse
Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations
The undecidability of joint embedding for 3-dimensional permutation classes
Enumerating two permutation classes by the number of cycles
Permutations avoiding 4321 and 3241 have an algebraic generating function
The number of {1243, 2134}-avoiding permutations

Sommaire du Fascicule no. 3

Computational Logic and Applications (CLA'19)

Quantitative and Algorithmic aspects of Barrier Synchronization in Concurrency
Unary profile of lambda terms with restricted De Bruijn indices

Sommaire du Fascicule no. 4

A Type System Describing Unboundedness
(Open) packing number of some graph products
Evacuating Robots from a Disk Using Face-to-Face Communication
A B\"uchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
A Double Exponential Lower Bound for the Distinct Vectors Problem
Taking-and-merging games as rewrite games
Extension Complexity, MSO Logic, and Treewidth
Even cycles and perfect matchings in claw-free plane graphs
Two lower bounds for $p$-centered colorings
The LexCycle on $\overline{P_{2}\cup P_{3}}$-free Cocomparability Graphs
A Note on Graphs of Dichromatic Number 2
A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture
The number of distinct adjacent pairs in geometrically distributed words