Pascal Ochem

Publications

Article dans une revue (75)

Complement Avoidance in Binary Words James Currie,Lubomíra Dvoraková,Pascal Ochem,Daniela Opočenská,Narad Rampersadet al. The Electronic Journal of Combinatorics, 2025, 32 (4), pp.4.24. ⟨10.37236/11555⟩ Article dans une revue lirmm-05326572v1
Acyclic, star and injective colouring: A complexity picture for H-free graphs Jan Bok,Nikola Jedličková,Barnaby Martin,Pascal Ochem,Daniël Paulusmaet al. Journal of Computer and System Sciences, 2025, 154, pp.103662. ⟨10.1016/j.jcss.2025.103662⟩ Article dans une revue lirmm-05124700v1
Words avoiding the morphic images of most of their factors Pascal Ochem,Matthieu Rosenfeld Discrete Mathematics and Theoretical Computer Science, 2025, 27:3 (Combinatorics), ⟨10.46298/dmtcs.15919⟩ Article dans une revue lirmm-05326624v1
4-tangrams are 4-avoidable Pascal Ochem,Théo Pierron Discrete Mathematics and Theoretical Computer Science, 2025, 27:3 (Combinatorics), ⟨10.46298/dmtcs.15310⟩ Article dans une revue lirmm-05154498v1
Contact graphs of boxes with unidirectional contacts Daniel Gonçalves,Vincent Limouzy,Pascal Ochem Discrete Mathematics and Theoretical Computer Science, 2024, 25 (3 (special issue ICGT'22)), ⟨10.46298/dmtcs.10805⟩ Article dans une revue lirmm-04659843v1
Critical Exponent of Binary Words with Few Distinct Palindromes L’ubomíra Dvoraková,Pascal Ochem,Daniela Opočenská The Electronic Journal of Combinatorics, 2024, 31 (2), pp.P2.29. ⟨10.37236/12574⟩ Article dans une revue lirmm-04659827v1
Properties of a ternary infinite word James Currie,Pascal Ochem,Narad Rampersad,Jeffrey Shallit RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2023, 57, pp.#1. ⟨10.1051/ita/2022010⟩ Article dans une revue lirmm-04028901v1
Antisquares and Critical Exponents Aseem Baranwal,James Currie,Lucas Mol,Pascal Ochem,Narad Rampersadet al. Discrete Mathematics and Theoretical Computer Science, 2023, 25 (2), pp.#11. ⟨10.46298/dmtcs.10063⟩ Article dans une revue lirmm-03799689v2
On ternary Dejean words avoiding 010 Pascal Ochem Notes on Number Theory and Discrete Mathematics, 2023, 29 (3), pp.545-548. ⟨10.7546/nntdm.2023.29.3.545-548⟩ Article dans une revue hal-04241523v1
Pseudoperiodic Words and a Question of Shevelev Joseph Meleshko,Pascal Ochem,Jeffrey Shallit,Sonja Linghui Shan Discrete Mathematics and Theoretical Computer Science, 2023, 25:2 (Automata, Logic and Semantics), ⟨10.46298/dmtcs.9919⟩ Article dans une revue hal-04244909v1
Doubled Patterns with Reversal and Square-Free Doubled Patterns Antoine Domenech,Pascal Ochem The Electronic Journal of Combinatorics, 2023, 30 (1), ⟨10.37236/11590⟩ Article dans une revue hal-04241511v1
Acyclic, Star, and Injective Colouring: Bounding the Diameter Christoph Brause,Petr Golovach,Barnaby Martin,Pascal Ochem,Daniël Paulusmaet al. The Electronic Journal of Combinatorics, 2022, 29 (2), pp.#P2.43. ⟨10.37236/10738⟩ Article dans une revue lirmm-03799962v1
Avoiding square-free words on free groups Golnaz Badkobeh,Tero Harju,Pascal Ochem,Matthieu Rosenfeld Theoretical Computer Science, 2022, 922, pp.206-217. ⟨10.1016/j.tcs.2022.04.025⟩ Article dans une revue hal-03751878v1
Homomorphisms of planar $(m,n)$-colored-mixed graphs to planar targets Fabien Jacques,Pascal Ochem Discrete Mathematics, 2021, 344 (12), pp.#112600. ⟨10.1016/j.disc.2021.112600⟩ Article dans une revue lirmm-03371159v1
A family of formulas with reversal of arbitrarily high avoidability index Pascal Ochem Theoretical Computer Science, 2021, 896, pp.168-170. ⟨10.1016/j.tcs.2021.10.013⟩ Article dans une revue lirmm-03405898v1
Avoidability of Palindrome Patterns Pascal Ochem,Matthieu Rosenfeld The Electronic Journal of Combinatorics, 2021, 28 (1), pp.#1.4. ⟨10.37236/9593⟩ Article dans une revue lirmm-03371500v1
On non-repetitive sequences of arithmetic progressions: The cases k ∈ { 4 , 5 , 6 , 7 , 8 } Borut Lužar,Martina Mockovčiaková,Pascal Ochem,Alexandre Pinlou,Roman Sotak Discrete Applied Mathematics, 2020, 279, pp.106-117. ⟨10.1016/j.dam.2019.10.013⟩ Article dans une revue lirmm-02349883v1
Complexity of planar signed graph homomorphisms to cycles François Dross,Florent Foucaud,Valia Mitsou,Pascal Ochem,Théo Pierron Discrete Applied Mathematics, 2020, 284, pp.166-178. ⟨10.1016/j.dam.2020.03.029⟩ Article dans une revue hal-02990576v1
Partitioning sparse graphs into an independent set and a graph with bounded size components Ilkyoo Choi,François Dross,Pascal Ochem Discrete Mathematics, 2020, 343 (8), pp.111921. ⟨10.1016/j.disc.2020.111921⟩ Article dans une revue hal-02990588v1
Oriented cliques and colorings of graphs with low maximum degree Janusz Dybizbański,Pascal Ochem,Alexandre Pinlou,Andrzej Szepietowski Discrete Mathematics, 2020, 343 (5), pp.#111829. ⟨10.1016/j.disc.2020.111829⟩ Article dans une revue lirmm-02938614v1
Avoiding conjugacy classes on the 5-letter alphabet Golnaz Badkobeh,Pascal Ochem RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2020, 54 (2), pp.1-4. ⟨10.1051/ita/2020003⟩ Article dans une revue hal-02903902v1
Vertex partitions of ($C 3 , C 4 , C 6$) -free planar graphs François Dross,Pascal Ochem Discrete Mathematics, 2019, 342 (11), pp.3229-3236. ⟨10.1016/j.disc.2019.07.002⟩ Article dans une revue hal-02990467v1
On some interesting ternary formulas Pascal Ochem,Matthieu Rosenfeld The Electronic Journal of Combinatorics, 2019, 26 (1), pp.P1.12. ⟨10.37236/7901⟩ Article dans une revue lirmm-02083616v1
Oriented incidence colourings of digraphs Christopher Duffy,Gary Macgillivray,Pascal Ochem,André Raspaud Discussiones Mathematicae Graph Theory, 2019, 39 (1), pp.191-210. ⟨10.7151/dmgt.2076⟩ Article dans une revue lirmm-02011333v1
On the Kőnig-Egerváry theorem for $k$-paths Stéphane Bessy,Pascal Ochem,Dieter Rautenbach Journal of Graph Theory, 2019, 91 (1), pp.73-87. ⟨10.1002/jgt.22421⟩ Article dans une revue lirmm-02078255v1
Repetition avoidance in products of factors Pamela Fleischmann,Pascal Ochem,Kamellia Reshadi Theoretical Computer Science, 2019, 791, pp.123-126. ⟨10.1016/j.tcs.2019.04.013⟩ Article dans une revue lirmm-02500480v1
Some further results on squarefree arithmetic progressions in infinite words James Currie,Tero Harju,Pascal Ochem,Narad Rampersad Theoretical Computer Science, 2019, 799, pp.140-148. ⟨10.1016/j.tcs.2019.10.006⟩ Article dans une revue lirmm-02349876v1
Avoidability of circular formulas Guilhem Gamard,Pascal Ochem,Gwenaël Richomme,Patrice Séébold Theoretical Computer Science, 2018, 726, pp.1-4. ⟨10.1016/j.tcs.2017.11.014⟩ Article dans une revue lirmm-01692716v1
On repetition thresholds of caterpillars and trees of bounded degree Borut Lužar,Pascal Ochem,Alexandre Pinlou The Electronic Journal of Combinatorics, 2018, 25 (1), pp.#P1.61. ⟨10.37236/6793⟩ Article dans une revue lirmm-01730276v1
2-subcoloring is NP-complete for planar comparability graphs Pascal Ochem Information Processing Letters, 2017, 128, pp.46-48. ⟨10.1016/j.ipl.2017.08.004⟩ Article dans une revue lirmm-01692394v1
Avoidability of Formulas with Two Variables Pascal Ochem,Matthieu Rosenfeld The Electronic Journal of Combinatorics, 2017, 24 (4), pp.#P4.30. ⟨10.37236/6536⟩ Article dans une revue lirmm-01897592v1
Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms Nazanin Movarraei,Pascal Ochem Information Processing Letters, 2017, 123, pp.42-46. ⟨10.1016/j.ipl.2017.02.009⟩ Article dans une revue lirmm-02083721v1
Bounds on the exponential domination number Stéphane Bessy,Pascal Ochem,Dieter Rautenbach Discrete Mathematics, 2017, 340 (3), pp.494-503. ⟨10.1016/j.disc.2016.08.024⟩ Article dans une revue lirmm-01692753v1
Homomorphisms of 2-edge-colored triangle-free planar graphs Pascal Ochem,Alexandre Pinlou,Sagnik Sen Journal of Graph Theory, 2017, 85 (1), pp.258-277. ⟨10.1002/jgt.22059⟩ Article dans une revue lirmm-01376130v1
The complexity of partitioning into disjoint cliques and a triangle-free graph Marin Bougeret,Pascal Ochem Discrete Applied Mathematics, 2017, 217, pp.438-445. ⟨10.1016/j.dam.2016.10.004⟩ Article dans une revue lirmm-02078169v1
On interval representations of graphs Aquiles Braga de Queiroz,Valentin Garnero,Pascal Ochem Discrete Applied Mathematics, 2016, 202, pp.30-36. ⟨10.1016/j.dam.2015.08.022⟩ Article dans une revue lirmm-01348411v1
A short proof that shuffle squares are 7-avoidable Guillaume Guégan,Pascal Ochem RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2016, 50 (1), pp.101-103. ⟨10.1051/ita/2016007⟩ Article dans une revue istex lirmm-01347424v1
Doubled patterns are 3-avoidable Pascal Ochem The Electronic Journal of Combinatorics, 2016, 23 (1), pp.P1.19. ⟨10.37236/5618⟩ Article dans une revue lirmm-01375763v1
Exponential Domination in Subcubic Graphs Stéphane Bessy,Pascal Ochem,Dieter Rautenbach The Electronic Journal of Combinatorics, 2016, 23 (4), pp.#P4.42. ⟨10.37236/5711⟩ Article dans une revue lirmm-01997215v1
Islands in graphs on surfaces Louis Esperet,Pascal Ochem SIAM Journal on Discrete Mathematics, 2016, 30 (1), pp.206-219. ⟨10.1137/140957883⟩ Article dans une revue hal-01119804v1
Near-colorings: non-colorable graphs and NP-completeness Mickaël Montassier,Pascal Ochem The Electronic Journal of Combinatorics, 2015, 22 (1), pp.#P1.57. ⟨10.37236/3509⟩ Article dans une revue lirmm-01263770v1
Characterization of some binary words with few squares Golnaz Badkobeh,Pascal Ochem Theoretical Computer Science, 2015, 588, pp.73-80. ⟨10.1016/j.tcs.2015.03.044⟩ Article dans une revue lirmm-01263844v1
Complexity dichotomy for oriented homomorphism of planar graphs with large girth Guillaume Guégan,Pascal Ochem Theoretical Computer Science, 2015, 596, pp.142-148. ⟨10.1016/j.tcs.2015.06.041⟩ Article dans une revue lirmm-01263869v1
The Maximum Clique Problem in Multiple Interval Graphs Mathew C. Francis,Daniel Gonçalves,Pascal Ochem Algorithmica, 2015, 71 (4), pp.812-836. ⟨10.1007/s00453-013-9828-6⟩ Article dans une revue lirmm-01263898v1
Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar Graphs Pascal Ochem,Alexandre Pinlou Graphs and Combinatorics, 2014, 30 (2), pp.439-453. ⟨10.1007/s00373-013-1283-2⟩ Article dans une revue lirmm-00780910v1
Another remark on the radical of an ODD perfect number Pascal Ochem,Michaël Rao The Fibonacci Quarterly, 2014, 52 (3), pp.215-217 Article dans une revue lirmm-01349855v1
On the number of prime factors of an odd perfect number Pascal Ochem,Michael Rao Mathematics of Computation, 2014, 83 (289), pp.2435-2439. ⟨10.1090/S0025-5718-2013-02776-7⟩ Article dans une revue lirmm-01263897v1
More on square-free words obtained from prefixes by permutations Pascal Ochem Fundamenta Informaticae, 2014, Russian-Finnish Symposium in Discrete Mathematics, 132 (1), pp.109-112. ⟨10.3233/FI-2014-1035⟩ Article dans une revue lirmm-01375793v1
Binary patterns in binary cube-free words: Avoidability and growth Robert Mercaş,Pascal Ochem,Alexey V. Samsonov,Arseny M. Shur RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2014, 48 (4), pp.369-389. ⟨10.1051/ita/2014015⟩ Article dans une revue lirmm-01263848v1
Application of entropy compression in pattern avoidance Pascal Ochem,Alexandre Pinlou The Electronic Journal of Combinatorics, 2014, 21 (2), pp.1-12. ⟨10.37236/3038⟩ Article dans une revue lirmm-01233448v1
Strong edge-colouring and induced matchings Hervé Hocquard,Pascal Ochem,Petru Valicov Information Processing Letters, 2013, 113 (19-21), pp.836-843. ⟨10.1016/j.ipl.2013.07.026⟩ Article dans une revue hal-00609454v4
Vertex Partitions of Graphs into Cographs and Stars Paul Dorbec,Mickael Montassier,Pascal Ochem Journal of Graph Theory, 2013, 75, pp.75-90. ⟨10.1002/jgt.21724⟩ Article dans une revue istex hal-00911272v1
A Complexity Dichotomy for the Coloring of Sparse Graphs Louis Esperet,Mickaël Montassier,Pascal Ochem,Alexandre Pinlou Journal of Graph Theory, 2013, 73 (1), pp.85-102. ⟨10.1002/jgt.21659⟩ Article dans une revue istex lirmm-00736468v1
Repetition Thresholds for Subdivided Graphs and Trees Pascal Ochem,Elise Vaslet RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2012, 46 (1), pp.123-130. ⟨10.1051/ita/2011122⟩ Article dans une revue istex lirmm-00739384v1
Locally identifying coloring of graphs Louis Esperet,Sylvain Gravier,Mickael Montassier,Pascal Ochem,Aline Parreau The Electronic Journal of Combinatorics, 2012, 19 (2), pp.40. ⟨10.37236/2417⟩ Article dans une revue hal-00529640v2
Odd Perfect Numbers are Greater than 10^1500 Pascal Ochem,Michael Rao Mathematics of Computation, 2012, 81 (279), pp.1869-1877. ⟨10.1090/S0025-5718-2012-02563-4⟩ Article dans une revue lirmm-00739245v1
Sieve Methods for Odd Perfect Numbers S. Adam Fletcher,P. Nielsen Pace,Pascal Ochem Mathematics of Computation, 2012, 81, pp.1753-1776. ⟨10.1090/S0025-5718-2011-02576-7⟩ Article dans une revue lirmm-00739250v1
Thue choosability of trees Francesca Fiorenzi,Pascal Ochem,Patrice Ossona de Mendez,Xuding Zhu Discrete Applied Mathematics, 2011, 159, pp.2045-2049. ⟨10.1016/j.dam.2011.07.017⟩ Article dans une revue istex hal-00656797v1
Bounds for the Generalized Repetition Threshold Francesca Fiorenzi,Pascal Ochem,Elise Vaslet Theoretical Computer Science, 2011, 412 (27), pp.2955-2963. ⟨10.1016/j.tcs.2010.10.009⟩ Article dans une revue istex lirmm-00739391v1
Homomorphisms of 2-edge-colored graphs Amanda Montejano,Pascal Ochem,Alexandre Pinlou,André Raspaud,Eric Sopena Discrete Applied Mathematics, 2010, 158 (12), pp.1365-1379. ⟨10.1016/j.dam.2009.09.017⟩ Article dans une revue istex lirmm-00433039v1
Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k O.V. Borodin,A.O. Ivanova,Mickael Montassier,Pascal Ochem,André Raspaud Journal of Graph Theory, 2010, 65 (2), pp.83-93. ⟨10.1002/jgt.20467⟩ Article dans une revue hal-00377372v1
Planar Graphs Have 1-string Representations Jérémie Chalopin,Daniel Gonçalves,Pascal Ochem Discrete and Computational Geometry, 2010, 43 ((3)), pp.626-647. ⟨10.1007/s00454-009-9196-9⟩ Article dans une revue lirmm-00433091v1
On circle graphs with girth at least five Louis Esperet,Pascal Ochem Discrete Mathematics, 2009, 309 (8), pp.2217-2222 Article dans une revue hal-00451863v1
On Star and Caterpillar Arboricity Daniel Gonçalves,Pascal Ochem Discrete Mathematics, 2009, 309 (11), pp.3694-3702. ⟨10.1016/j.disc.2008.01.041⟩ Article dans une revue istex lirmm-00338327v1
Strong Oriented Chromatic Number of Planar Graphs without Short Cycles Mickaël Montassier,Pascal Ochem,Alexandre Pinlou Discrete Mathematics and Theoretical Computer Science, 2008, Vol. 10 no. 1 (1), pp.1-24. ⟨10.46298/dmtcs.418⟩ Article dans une revue lirmm-00184811v1
On induced-universal graphs for the class of bounded-degree graphs Louis Esperet,Arnaud Labourel,Pascal Ochem Information Processing Letters, 2008, 108 (5), pp.255-260. ⟨10.1016/j.ipl.2008.04.020⟩ Article dans une revue hal-00368277v1
Oriented Colorings of Partial 2-trees Pascal Ochem,Alexandre Pinlou Information Processing Letters, 2008, 108, pp.82-86. ⟨10.1016/j.ipl.2008.04.007⟩ Article dans une revue istex lirmm-00314715v1
On the Oriented Chromatic Index of Oriented Graphs Pascal Ochem,Alexandre Pinlou,Eric Sopena Journal of Graph Theory, 2008, 57 (4), pp.313-332. ⟨10.1002/jgt.20286⟩ Article dans une revue istex lirmm-00195956v1
Dejean's conjecture and letter frequency Jérémie Chalopin,Pascal Ochem RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2008, 42, pp.477-480. ⟨10.1051/ita:2008013⟩ Article dans une revue hal-00432200v1
Oriented coloring of 2-outerplanar graphs Louis Esperet,Pascal Ochem Information Processing Letters, 2007, 101, pp.215--219 Article dans une revue hal-00307156v1
On the acyclic choosability of graphs Mickael Montassier,Pascal Ochem,André Raspaud Journal of Graph Theory, 2006, 51, pp.281--300 Article dans une revue hal-00307137v1
Oriented colorings of triangle-free planar graphs Pascal Ochem Information Processing Letters, 2004, 92, pp.71-76 Article dans une revue hal-00307124v1
On the interval number of special graphs József Balogh,Pascal Ochem,András Pluhár Journal of Graph Theory, 2004, 46 (4), pp.241-253 Article dans une revue hal-00307641v1
How many square occurrences must a binary sequence contain? Gregory Kucherov,Pascal Ochem,Michael Rao The Electronic Journal of Combinatorics, 2003, 10 (1), 11 p. ⟨10.37236/1705⟩ Article dans une revue inria-00099596v1
How Many Square Occurrences Must a Binary Sequence Contain? Gregory Kucherov,Pascal Ochem,Michael Rao The Electronic Journal of Combinatorics, 2003, 10, pp.R12 Article dans une revue hal-00307205v1

Communication dans un congrès (18)

On Some Interesting Ternary Formulas Pascal Ochem,Matthieu Rosenfeld WORDS 2017 - 11th International Conference on Combinatorics on Words, Sep 2017, Montreal, Canada. pp.30-35, ⟨10.1007/978-3-319-66396-8_4⟩ Communication dans un congrès lirmm-02078252v1
Avoidability of Formulas with Two Variables Pascal Ochem,Matthieu Rosenfeld 20th International Conference on Developments in Language Theory (DLT 2016), Laboratoire de combinatoire et d'informatique mathématique (LaCIM), Université du Québec à Montréal, Jul 2016, Montréal, Canada. pp.344-354, ⟨10.1007/978-3-662-53132-7_28⟩ Communication dans un congrès lirmm-01375829v1
On a conjecture on k-Thue sequences Borut Lužar,Martina Mockovčiaková,Pascal Ochem,Alexandre Pinlou,Roman Soták BGW: Bordeaux Graph Workshop, Nov 2016, Bordeaux, France Communication dans un congrès lirmm-01730302v1
The Maximum Clique Problem in Multiple Interval Graphs Mathew C. Francis,Daniel Gonçalves,Pascal Ochem WG 2012 - 38th International Workshop on Graph Theoretic-Concepts in Computer Science, Jun 2012, Jerusalem, Israel. pp.57-68 Communication dans un congrès lirmm-00738525v1
Bounds and complexity results for strong edge colouring of subcubic graphs Hervé Hocquard,Pascal Ochem,Petru Valicov EuroComb'11, Aug 2011, Budapest, Hungary. A paraitre Communication dans un congrès hal-00592130v1
Sur la difficulté de séparer un graphe par des plus courts chemins Emilie Diot,Cyril Gavoille,Pascal Ochem 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France Communication dans un congrès inria-00588312v1
Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar Graphs Pascal Ochem,Alexandre Pinlou LAGOS'11: VI Latin-American Algorithms, Graphs and Optimization Symposium, Mar 2011, Bariloche, Argentina. pp.123-128, ⟨10.1016/j.endm.2011.05.022⟩ Communication dans un congrès lirmm-00530543v1
Identifying colorings of graphs Louis Esperet,Sylvain Gravier,Mickaël Montassier,Pascal Ochem,Aline Parreau 8FCC, 2010, Orsay, France Communication dans un congrès lirmm-01264347v1
Homomorphisms of 2-Edge-Colored Graphs Amanda Montejano,Pascal Ochem,Alexandre Pinlou,André Raspaud,Eric Sopena IV Latin American Algorithms, Graphs, and Optimization Symposium, Nov 2007, Puerto Varas, Chile. pp.33-38, ⟨10.1016/j.endm.2008.01.007⟩ Communication dans un congrès istex lirmm-00196757v1
Avoiding approximate squares Dalia Krieger,Pascal Ochem,Narad Rampersad,Jeffrey Shallit DLT 2007, 2007, Finland. pp.278-289 Communication dans un congrès hal-00307153v1
Planar graphs are in 1-string Jérémie Chalopin,Daniel Gonçalves,Pascal Ochem SODA 2007, 2007, United States. pp.609--617 Communication dans un congrès hal-00308130v1
Oriented vertex and arc-colorings of partial 2-trees Pascal Ochem,Alexandre Pinlou Eurocomb07 - European Conference on Combinatorics, Graph Theory and Applications, Sep 2007, Spain. pp.195--199 Communication dans un congrès hal-00307125v1
Unequal letter frequencies in ternary square-free words Pascal Ochem WORDS 2007, 2007, France. pp.388-392 Communication dans un congrès hal-00307123v1
Strong Oriented Chromatic Number of Planar Graphs without Cycles of Specific Lengths Mickael Montassier,Pascal Ochem,Alexandre Pinlou LAGOS: Latin-American Algorithms, Graphs, and Optimization Symposium, Nov 2007, Puerto Varas, Chile. pp.27-32, ⟨10.1016/j.endm.2008.01.006⟩ Communication dans un congrès istex lirmm-00196741v1
Negative results on acyclic improper colorings Pascal Ochem 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.357-362, ⟨10.46298/dmtcs.3441⟩ Communication dans un congrès hal-01184430v1
A generalization of repetition threshold Lucian Ilie,Pascal Ochem,Jeffrey Shallit MFCS, 2004, Czech Republic. pp.818-826 Communication dans un congrès hal-00307256v1
A generator of morphisms for infinite words Pascal Ochem Proceedings of the Workshop on Words avoidability, complexity and morphisms - Edited by G. Richomme, 2004, Finland. pp.427-441 Communication dans un congrès hal-00307126v1
On the acyclic choosability of graphs Mickaël Montassier,Pascal Ochem,André Raspaud GT: Graph Theory, 2004, Paris, France Communication dans un congrès lirmm-01264370v1

Poster de conférence (1)

Pattern Avoidance and HDOL Words Pascal Ochem WORDS 2011 - 8th International Conference on Combinatorics on Words, Sep 2011, Prague, Czech Republic. , 2011 Poster de conférence lirmm-00626116v1

Chapitre d'ouvrage (1)

Avoiding or limiting regularities in words Pascal Ochem,Michaël Rao,Matthieu Rosenfeld Sequences, Groups and Number Theory, pp.177-212, 2018, 978-3-319-69151-0. ⟨10.1007/978-3-319-69152-7_5⟩ Chapitre d'ouvrage lirmm-02083655v1

Pré-publication, Document de travail (6)

Doubled patterns with reversal and square-free doubled patterns Antoine Domenech,Pascal Ochem 2023 Pré-publication, Document de travail lirmm-03799694v1
Complement Avoidance in Binary Words James Currie,Pascal Ochem,Narad Rampersad,Jeffrey Shallit 2023 Pré-publication, Document de travail lirmm-03799678v1
Contact graphs of boxes with unidirectional contacts Daniel Gonçalves,Vincent Limouzy,Pascal Ochem 2023 Pré-publication, Document de travail hal-04216379v1
Pseudoperiodic Words and a Question of Shevelev Joseph Meleshko,Pascal Ochem,Jeffrey Shallit,Sonja Linghui Shan 2023 Pré-publication, Document de travail lirmm-03799690v1
Properties of a Ternary Infinite Word James Currie,Pascal Ochem,Narad Rampersad,Jeffrey Shallit 2022 Pré-publication, Document de travail lirmm-03799692v1
Avoiding large squares in trees and planar graphs Daniel Gonçalves,Pascal Ochem,Matthieu Rosenfeld 2021 Pré-publication, Document de travail lirmm-03452602v1

Rapport (3)

Homomorphisms of 2-Edge-Colored Graphs Amanda Montejano,Pascal Ochem,Alexandre Pinlou,André Raspaud,Eric Sopena RR-08008, 2008, pp.26 Rapport lirmm-00266540v1
Oriented Colorings of Partial 2-trees Pascal Ochem,Alexandre Pinlou RR-07026, 2007, pp.7 Rapport lirmm-00190875v1
How many square occurrences must a binary sequence contain Gregory Kucherov,Pascal Ochem,Michael Rao [Intern report] A02-R-277 || kucherov02a, 2002, 9 p Rapport inria-00101070v1

HDR (1)

Evitement de motif Pascal Ochem Informatique [cs]. Université de Montpellier, 2019 HDR tel-04988003v1