CV (in French - out of date)

• [ PS ] - [ PDF ]
  

Ph.D. thesis (in English)

• Graph coloring and combinatorics on words. [ PS ] - [ PDF ]
  

Combinatorics on words

• Francesca Fiorenzi, Pascal Ochem.
  More on generalized repetition thresholds. [ PDF ]
  WORDS 2009. Salerno, September 14-18 2009.
  

• Pascal Ochem.
  Binary words avoiding the pattern AABBCABBA. [ PDF ]
  Theoret. Informatics Appl. To appear.
  

• Pascal Ochem, Michael Rao.
  Minimum frequencies of occurrences of squares and letters in infinite words. [ PDF ]
  Mons Days of Theoretical Computer Science. Mons, August 27 - 30 2008
  

• Pascal Ochem.
  Unequal letter frequencies in ternary square-free words. [ PDF ]
  WORDS 2007. Marseille, September 17-21 2007
  

• Pascal Ochem, Narad Rampersad, Jeffrey Shallit.
  Avoiding approximate squares.
  IJFCS 19 (3) (2008), 633-648.

• Jeremie Chalopin, Pascal Ochem.
  Dejean's conjecture and letter frequency. [ PS ]
  Mons Days of Theoretical Computer Science. Rennes, August 30 - September 2 2006
  Theoret. Informatics Appl. 42 (3) (2008), 477-480.

• Pascal Ochem, Tony Reix.
  Upper bound on the number of ternary square-free words. [ PS ]
  Workshop on Words and Automata. St Petersburg, June 7 2006
  

• Pascal Ochem.
  Letter frequency in infinite repetition-free words. [ PS ]
  WORDS 2005. Montreal, September 13-17 2005.
  Theoret. Comput. Sci. 380 (2007), 388-392.

• Pascal Ochem.
  A generator of morphisms for infinite words. [ PS ]
  Word avoidability, complexity and morphisms. Turku, July 17 2004.
  Theoret. Informatics Appl. 40 (2006), 427-441.

• Lucian Ilie, Pascal Ochem, Jeffrey Shallit.
  A generalization of repetition threshold. [ PS ]
  MFCS 2004. Prague, August 22-27 2004.
  Theoret. Comput. Sci. 345 (2005), 359-369.

• Gregory Kucherov, Pascal Ochem, Michael Rao.
  How Many Square Occurrences Must a Binary Sequence Contain ? [ PS ]
  Electron. J. Comb. 10(1) (2003), #R12.

Graph theory

• Daniel Goncalves, Pascal Ochem.
  On star and caterpillar arboricity.
  Discrete Math. 309(11) (2009), 3694-3702.

• Louis Esperet, Arnaud Labourel, Pascal Ochem.
  On induced-universal graphs for the class of bounded-degree graphs.
  Inform. Process. Lett. 108(5) (2008), 255-260.

• Mickael Montassier, Pascal Ochem, Alexandre Pinlou.
  Strong oriented chromatic number of planar graphs without short cycles.
  DMTCS 10(1) (2008).

• Pascal Ochem, Alexandre Pinlou, Eric Sopena.
  On the oriented chromatic index of oriented graphs.
  J. Graph Theory 57(4) (2008), 313-332.

• Louis Esperet, Pascal Ochem.
  On circle graphs with girth at least five. [ PS ]
  EuroComb 2007. Seville, September 11-15 2007.
  ENDM 29 (2007), 129-133.
  Discrete Math. 309(8) (2009), 2217-2222.

• Pascal Ochem, Alexandre Pinlou.
  Oriented colorings of partial 2-trees. [ PDF ]
  EuroComb 2007. Seville, September 11-15 2007.
  ENDM 29 (2007), 195-199.
  Inform. Process. Lett. 108(2) (2008), 82-86.

• Jeremie Chalopin, Daniel Goncalves, Pascal Ochem.
  Planar graphs are in 1-STRING. [ PS ]
  Proceedings of SODA'07, 609-617.

• Louis Esperet, Pascal Ochem.
  Oriented colorings of 2-outerplanar graphs.
  Inform. Process. Lett. 101(5) (2006), 215-219.

• Pascal Ochem.
  Negative results on acyclic improper colorings. [ PS ]
  EuroComb 2005. Berlin, September 5-9 2005.
  DMTCS Conference Volume AE (2005), 357-362.

• Mickael Montassier, Pascal Ochem, Andre Raspaud.
  On the acyclic choosability of graphs.
  Graph Theory 2004. Paris, July 5-9 2004
  J. Graph Theory 51(4) (2006), 281-300.

• Pascal Ochem.
  Oriented colorings of triangle-free planar graphs.
  Inform. Process. Lett. 92(2) (2004), 71-76.

• Jozsef Balogh, Pascal Ochem, Andras Pluhar.
  On the interval number of special graphs.
  J. Graph Theory 46(4) (2004), 241-253.