Pascal Ochem

Louis Esperet, Mickaël Montassier, Pascal Ochem, Alexandre Pinlou: A Complexity Dichotomy for the Coloring of Sparse Graphs. Journal of Graph Theory 73(1): 85-102 (2013)

Pascal Ochem, Alexandre Pinlou: Application of entropy compression in pattern avoidance. CoRR abs/1301.1873 (2013)

Robert Mercas, Pascal Ochem, Alexey V. Samsonov, Arseny M. Shur: Binary Patterns in Binary Cube-Free Words: Avoidability and Growth. CoRR abs/1301.4682 (2013)

Pascal Ochem, Elise Vaslet: Repetition thresholds for subdivided graphs and trees. RAIRO - Theor. Inf. and Applic. 46(1): 123-130 (2012)

S. Adam Fletcher, Pace P. Nielsen, Pascal Ochem: Sieve methods for odd perfect numbers. Math. Comput. 81(279) (2012)

Pascal Ochem, Michaël Rao: Odd perfect numbers are greater than 10¹⁵⁰⁰. Math. Comput. 81(279) (2012)

Mathew C. Francis, Daniel Gonçalves, Pascal Ochem: The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract). WG 2012: 57-68

Mathew C. Francis, Daniel Gonçalves, Pascal Ochem: The Maximum Clique Problem in Multiple Interval Graphs. CoRR abs/1201.0043 (2012)

Francesca Fiorenzi, Pascal Ochem, Patrice Ossona de Mendez, Xuding Zhu: Thue choosability of trees. Discrete Applied Mathematics 159(17): 2045-2049 (2011)

Pascal Ochem, Alexandre Pinlou: Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs. Electronic Notes in Discrete Mathematics 37: 123-128 (2011)

Hervé Hocquard, Pascal Ochem, Petru Valicov: Bounds and complexity results for strong edge colouring of subcubic graphs. Electronic Notes in Discrete Mathematics 38: 463-468 (2011)

Francesca Fiorenzi, Pascal Ochem, Elise Vaslet: Bounds for the generalized repetition threshold. Theor. Comput. Sci. 412(27): 2955-2963 (2011)

Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Eric Sopena: Homomorphisms of 2-edge-colored graphs. Discrete Applied Mathematics 158(12): 1365-1379 (2010)

Jérémie Chalopin, Daniel Gonçalves, Pascal Ochem: Planar Graphs Have 1-string Representations. Discrete & Computational Geometry 43(3): 626-647 (2010)

Roman Kolpakov, Gregory Kucherov, Pascal Ochem: On maximal repetitions of arbitrary exponent. Inf. Process. Lett. 110(7): 252-256 (2010)

Pascal Ochem: Binary words avoiding the pattern AABBCABBA. RAIRO - Theor. Inf. and Applic. 44(1): 151-158 (2010)

Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, Pascal Ochem, André Raspaud: Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k. Journal of Graph Theory 65(2): 83-93 (2010)

Louis Esperet, Sylvain Gravier, Mickaël Montassier, Pascal Ochem, Aline Parreau: Locally identifying coloring of graphs. CoRR abs/1010.5624 (2010)

Louis Esperet, Pascal Ochem: On circle graphs with girth at least five. Discrete Mathematics 309(8): 2217-2222 (2009)

Daniel Gonçalves, Pascal Ochem: On star and caterpillar arboricity. Discrete Mathematics 309(11): 3694-3702 (2009)

Roman Kolpakov, Gregory Kucherov, Pascal Ochem: On maximal repetitions of arbitrary exponent. CoRR abs/0906.4750 (2009)

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)

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)

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)

Pascal Ochem, Narad Rampersad, Jeffrey Shallit: Avoiding Approximate Squares. Int. J. Found. Comput. Sci. 19(3): 633-648 (2008)

Pascal Ochem, Alexandre Pinlou: Oriented colorings of partial 2-trees. Inf. Process. Lett. 108(2): 82-86 (2008)

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)

Jérémie Chalopin, Pascal Ochem: Dejean's conjecture and letter frequency. ITA 42(3): 477-480 (2008)

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

Jérémie Chalopin, Pascal Ochem: Dejean's conjecture and letter frequency. Electronic Notes in Discrete Mathematics 28: 501-505 (2007)

Louis Esperet, Pascal Ochem: On circle graphs with girth at least five. Electronic Notes in Discrete Mathematics 29: 129-133 (2007)

Pascal Ochem, Alexandre Pinlou: Oriented vertex and arc colorings of partial 2-trees. Electronic Notes in Discrete Mathematics 29: 195-199 (2007)

Louis Esperet, Pascal Ochem: Oriented colorings of 2-outerplanar graphs. Inf. Process. Lett. 101(5): 215-219 (2007)

Pascal Ochem: Letter frequency in infinite repetition-free words. Theor. Comput. Sci. 380(3): 388-392 (2007)

Dalia Krieger, Pascal Ochem, Narad Rampersad, Jeffrey Shallit: Avoiding Approximate Squares. Developments in Language Theory 2007: 278-289

Jérémie Chalopin, Daniel Gonçalves, Pascal Ochem: Planar graphs are in 1-STRING. SODA 2007: 609-617

Pascal Ochem: A generator of morphisms for infinite words. ITA 40(3): 427-441 (2006)

Mickaël Montassier, Pascal Ochem, André Raspaud: On the acyclic choosability of graphs. Journal of Graph Theory 51(4): 281-300 (2006)

Daniel Gonçalves, Pascal Ochem: On some arboricities in planar graphs. Electronic Notes in Discrete Mathematics 22: 427-432 (2005)

Lucian Ilie, Pascal Ochem, Jeffrey Shallit: A generalization of repetition threshold. Theor. Comput. Sci. 345(2-3): 359-369 (2005)

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

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)

Lucian Ilie, Pascal Ochem, Jeffrey Shallit: A Generalization of Repetition Threshold. MFCS 2004: 818-826

Gregory Kucherov, Pascal Ochem, Michaël Rao: How Many Square Occurrences Must a Binary Sequence Contain? Electr. J. Comb. 10 (2003)