| 2007 |
|---|
| 10 | EE | Dalia Krieger,
Pascal Ochem,
Narad Rampersad,
Jeffrey Shallit:
Avoiding Approximate Squares.
Developments in Language Theory 2007: 278-289 |
| 9 | EE | Jérémie Chalopin,
Daniel Gonçalves,
Pascal Ochem:
Planar graphs are in 1-STRING.
SODA 2007: 609-617 |
| 8 | EE | Louis Esperet,
Pascal Ochem:
Oriented colorings of 2-outerplanar graphs.
Inf. Process. Lett. 101(5): 215-219 (2007) |
| 7 | EE | Pascal Ochem:
Letter frequency in infinite repetition-free words.
Theor. Comput. Sci. 380(3): 388-392 (2007) |
| 2006 |
|---|
| 6 | EE | Mickaël Montassier,
Pascal Ochem,
André Raspaud:
On the acyclic choosability of graphs.
Journal of Graph Theory 51(4): 281-300 (2006) |
| 2005 |
|---|
| 5 | EE | Lucian Ilie,
Pascal Ochem,
Jeffrey Shallit:
A generalization of repetition threshold.
Theor. Comput. Sci. 345(2-3): 359-369 (2005) |
| 2004 |
|---|
| 4 | EE | Lucian Ilie,
Pascal Ochem,
Jeffrey Shallit:
A Generalization of Repetition Threshold.
MFCS 2004: 818-826 |
| 3 | EE | Pascal Ochem:
Oriented colorings of triangle-free planar graphs.
Inf. Process. Lett. 92(2): 71-76 (2004) |
| 2 | EE | József Balogh,
Pascal Ochem,
András Pluhár:
On the interval number of special graphs.
Journal of Graph Theory 46(4): 241-253 (2004) |
| 2003 |
|---|
| 1 | EE | Gregory Kucherov,
Pascal Ochem,
Michaël Rao:
How Many Square Occurrences Must a Binary Sequence Contain?
Electr. J. Comb. 10: (2003) |
