- Theoretical Informatics and Applications Will be set by the publisher Informatique Theorique et Applications
- Dejean's conjecture and letter frequency Jeremie Chalopin and Pascal Ochem
- Pascal Ochem 1 TAT CIVIL, GNRALITS
- Discrete Mathematics and Theoretical Computer Science DMTCS vol. (subm.), by the authors, 26--1 Negative results on acyclic improper colorings
- Upper bound on the number of ternary squarefree words
- How many square occurrences must a binary sequence Gregory Kucherov Pascal Ochem y Michael Rao z
- Pascal Ochem 1 TAT CIVIL, GNRALITS
- A Generalization of Repetition Threshold Lucian Ilie a,1 Pascal Ochem b,# Je#rey Shallit c,1
- On circle graphs with girth at least ve Louis Esperet # and Pascal Ochem +
- Oriented vertex and arc-colorings of partial 2-trees (Extended Abstract)
- N o d'ordre : 3083 PRSENTE
- Planar graphs are in 1-STRING J. Chalopin, D. Gonalves, P. Ochem
- Theoretical Informatics and Applications Will be set by the publisher Informatique Theorique et Applications
- Unequal letter frequencies in ternary square-free words
- Avoiding Approximate Squares Dalia Krieger2
- Letter frequency in infinite repetitionfree Pascal Ochem a,1
- Oriented colorings of triangle-free planar graphs
- Theoretical Informatics and Applications Will be set by the publisher Informatique Theorique et Applications
- Upper bound on the number of ternary square-free words
- Theoretical Informatics and Applications Will be set by the publisher Informatique Theorique et Applications
- Negative results on acyclic improper colorings
- A Generalization of Repetition Threshold 1 Lucian Ilie a,2
- On the acyclic choosability of graphs Mickal Montassier
