 | 2009 |
|---|
| 24 |       | Roman Kolpakov,
Gregory Kucherov,
Pascal Ochem:
On maximal repetitions of arbitrary exponent
CoRR abs/0906.4750: (2009) |
| 2008 |
|---|
| 23 | | Mickaël Montassier,
Pascal Ochem,
Alexandre Pinlou:
Strong Oriented Chromatic Number of Planar Graphs without Short Cycles.
Discrete Mathematics & Theoretical Computer Science 10(1): (2008) |
| 22 | | Mickaël Montassier,
Pascal Ochem,
Alexandre Pinlou:
Strong oriented chromatic number of planar graphs without cycles of specific lengths.
Electronic Notes in Discrete Mathematics 30: 27-32 (2008) |
| 21 | | Amanda Montejano,
Pascal Ochem,
Alexandre Pinlou,
André Raspaud,
Eric Sopena:
Homomorphisms of 2-edge-colored graphs.
Electronic Notes in Discrete Mathematics 30: 33-38 (2008) |
| 20 | | Jérémie Chalopin,
Pascal Ochem:
Dejean's conjecture and letter frequency.
ITA 42(3): 477-480 (2008) |
| 19 | | Pascal Ochem,
Alexandre Pinlou:
Oriented colorings of partial 2-trees.
Inf. Process. Lett. 108(2): 82-86 (2008) |
| 18 | | Louis Esperet,
Arnaud Labourel,
Pascal Ochem:
On induced-universal graphs for the class of bounded-degree graphs.
Inf. Process. Lett. 108(5): 255-260 (2008) |
| 17 | | Pascal Ochem,
Narad Rampersad,
Jeffrey Shallit:
Avoiding Approximate Squares.
Int. J. Found. Comput. Sci. 19(3): 633-648 (2008) |
| 16 | | Pascal Ochem,
Alexandre Pinlou,
Eric Sopena:
On the oriented chromatic index of oriented graphs.
Journal of Graph Theory 57(4): 313-332 (2008) |
| 2007 |
|---|
| 15 | | Dalia Krieger,
Pascal Ochem,
Narad Rampersad,
Jeffrey Shallit:
Avoiding Approximate Squares.
Developments in Language Theory 2007: 278-289 |
| 14 | | Jérémie Chalopin,
Daniel Gonçalves,
Pascal Ochem:
Planar graphs are in 1-STRING.
SODA 2007: 609-617 |
| 13 | | Jérémie Chalopin,
Pascal Ochem:
Dejean's conjecture and letter frequency.
Electronic Notes in Discrete Mathematics 28: 501-505 (2007) |
| 12 | | Louis Esperet,
Pascal Ochem:
On circle graphs with girth at least five.
Electronic Notes in Discrete Mathematics 29: 129-133 (2007) |
| 11 | | Pascal Ochem,
Alexandre Pinlou:
Oriented vertex and arc colorings of partial 2-trees.
Electronic Notes in Discrete Mathematics 29: 195-199 (2007) |
| 10 | | Louis Esperet,
Pascal Ochem:
Oriented colorings of 2-outerplanar graphs.
Inf. Process. Lett. 101(5): 215-219 (2007) |
| 9 | | Pascal Ochem:
Letter frequency in infinite repetition-free words.
Theor. Comput. Sci. 380(3): 388-392 (2007) |
| 2006 |
|---|
| 8 | | Pascal Ochem:
A generator of morphisms for infinite words.
ITA 40(3): 427-441 (2006) |
| 7 | | Mickaël Montassier,
Pascal Ochem,
André Raspaud:
On the acyclic choosability of graphs.
Journal of Graph Theory 51(4): 281-300 (2006) |
| 2005 |
|---|
| 6 | | Daniel Gonçalves,
Pascal Ochem:
On some arboricities in planar graphs.
Electronic Notes in Discrete Mathematics 22: 427-432 (2005) |
| 5 | | Lucian Ilie,
Pascal Ochem,
Jeffrey Shallit:
A generalization of repetition threshold.
Theor. Comput. Sci. 345(2-3): 359-369 (2005) |
| 2004 |
|---|
| 4 | | Lucian Ilie,
Pascal Ochem,
Jeffrey Shallit:
A Generalization of Repetition Threshold.
MFCS 2004: 818-826 |
| 3 | | Pascal Ochem:
Oriented colorings of triangle-free planar graphs.
Inf. Process. Lett. 92(2): 71-76 (2004) |
| 2 | | 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 | | Gregory Kucherov,
Pascal Ochem,
Michaël Rao:
How Many Square Occurrences Must a Binary Sequence Contain?
Electr. J. Comb. 10: (2003) |
