Skip to Main content
Number of documents

78

CV de Pascal Ochem


Journal articles55 documents

  • Golnaz Badkobeh, Pascal Ochem. Avoiding conjugacy classes on the 5-letter alphabet. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 2020, 54 (2), pp.1-4. ⟨10.1051/ita/2020003⟩. ⟨hal-02903902⟩
  • Pascal Ochem, Matthieu Rosenfeld. On some interesting ternary formulas. The Electronic Journal of Combinatorics, Open Journal Systems, 2019, 26 (1), pp.P1.12. ⟨10.37236/7901⟩. ⟨lirmm-02083616⟩
  • Borut Lužar, Martina Mockovčiaková, Pascal Ochem, Alexandre Pinlou, Roman Sotak. On non-repetitive sequences of arithmetic progressions: The cases k ∈ { 4 , 5 , 6 , 7 , 8 }. Discrete Applied Mathematics, Elsevier, In press, ⟨10.1016/j.dam.2019.10.013⟩. ⟨lirmm-02349883⟩
  • Stéphane Bessy, Pascal Ochem, Dieter Rautenbach. On the Kőnig-Egerváry theorem for $k$-paths. Journal of Graph Theory, Wiley, 2019, 91 (1), pp.73-87. ⟨10.1002/jgt.22421⟩. ⟨lirmm-02078255⟩
  • Christopher Duffy, Gary Macgillivray, Pascal Ochem, André Raspaud. Oriented incidence colourings of digraphs. Discussiones Mathematicae Graph Theory, University of Zielona Góra, 2019, 39 (1), pp.191-210. ⟨10.7151/dmgt.2076⟩. ⟨lirmm-02011333⟩
  • James Currie, Tero Harju, Pascal Ochem, Narad Rampersad. Some further results on squarefree arithmetic progressions in infinite words. Theoretical Computer Science, Elsevier, 2019, 799, pp.140-148. ⟨10.1016/j.tcs.2019.10.006⟩. ⟨lirmm-02349876⟩
  • Pamela Fleischmann, Pascal Ochem, Kamellia Reshadi. Repetition avoidance in products of factors. Theoretical Computer Science, Elsevier, 2019, 791, pp.123-126. ⟨10.1016/j.tcs.2019.04.013⟩. ⟨lirmm-02500480⟩
  • Borut Lužar, Pascal Ochem, Alexandre Pinlou. On repetition thresholds of caterpillars and trees of bounded degree. The Electronic Journal of Combinatorics, Open Journal Systems, 2018, 25 (1), pp.#P1.61. ⟨lirmm-01730276⟩
  • Guilhem Gamard, Pascal Ochem, Gwenaël Richomme, Patrice Séébold. Avoidability of circular formulas. Theoretical Computer Science, Elsevier, 2018, 726, pp.1-4. ⟨10.1016/j.tcs.2017.11.014⟩. ⟨lirmm-01692716⟩
  • Stéphane Bessy, Pascal Ochem, Dieter Rautenbach. Bounds on the exponential domination number. Discrete Mathematics, Elsevier, 2017, 340 (3), pp.494-503. ⟨10.1016/j.disc.2016.08.024⟩. ⟨lirmm-01692753⟩
  • Marin Bougeret, Pascal Ochem. The complexity of partitioning into disjoint cliques and a triangle-free graph. Discrete Applied Mathematics, Elsevier, 2017, 217, pp.438-445. ⟨10.1016/j.dam.2016.10.004⟩. ⟨lirmm-02078169⟩
  • Pascal Ochem, Matthieu Rosenfeld. Avoidability of Formulas with Two Variables. The Electronic Journal of Combinatorics, Open Journal Systems, 2017, 24 (4), pp.#P4.30. ⟨lirmm-01897592⟩
  • Pascal Ochem, Alexandre Pinlou, Sagnik Sen. Homomorphisms of 2-edge-colored triangle-free planar graphs. Journal of Graph Theory, Wiley, 2017, 85 (1), pp.258-277. ⟨10.1002/jgt.22059⟩. ⟨lirmm-01376130⟩
  • Pascal Ochem. 2-subcoloring is NP-complete for planar comparability graphs. Information Processing Letters, Elsevier, 2017, 128, pp.46-48. ⟨10.1016/j.ipl.2017.08.004⟩. ⟨lirmm-01692394⟩
  • Nazanin Movarraei, Pascal Ochem. Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms. Information Processing Letters, Elsevier, 2017, 123, pp.42-46. ⟨10.1016/j.ipl.2017.02.009⟩. ⟨lirmm-02083721⟩
  • Stéphane Bessy, Pascal Ochem, Dieter Rautenbach. Exponential Domination in Subcubic Graphs. The Electronic Journal of Combinatorics, Open Journal Systems, 2016, 23 (4), pp.#P4.42. ⟨lirmm-01997215⟩
  • Aquiles Braga de Queiroz, Valentin Garnero, Pascal Ochem. On interval representations of graphs. Discrete Applied Mathematics, Elsevier, 2016, 202, pp.30-36. ⟨10.1016/j.dam.2015.08.022⟩. ⟨lirmm-01348411⟩
  • Pascal Ochem. Doubled patterns are 3-avoidable. The Electronic Journal of Combinatorics, Open Journal Systems, 2016, 23 (1), pp.P1.19. ⟨lirmm-01375763⟩
  • Louis Esperet, Pascal Ochem. Islands in graphs on surfaces. SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2016, 30 (1), pp.206-219. ⟨10.1137/140957883⟩. ⟨hal-01119804⟩
  • Guillaume Guégan, Pascal Ochem. A short proof that shuffle squares are 7-avoidable. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 2016, 50 (1), pp.101-103. ⟨10.1051/ita/2016007⟩. ⟨lirmm-01347424⟩
  • Mickaël Montassier, Pascal Ochem. Near-colorings: non-colorable graphs and NP-completeness. The Electronic Journal of Combinatorics, Open Journal Systems, 2015, 22 (1), pp.#P1.57. ⟨lirmm-01263770⟩
  • Golnaz Badkobeh, Pascal Ochem. Characterization of some binary words with few squares. Theoretical Computer Science, Elsevier, 2015, 588, pp.73-80. ⟨10.1016/j.tcs.2015.03.044⟩. ⟨lirmm-01263844⟩
  • Guillaume Guégan, Pascal Ochem. Complexity dichotomy for oriented homomorphism of planar graphs with large girth. Theoretical Computer Science, Elsevier, 2015, 596, pp.142-148. ⟨10.1016/j.tcs.2015.06.041⟩. ⟨lirmm-01263869⟩
  • Mathew C. Francis, Daniel Gonçalves, Pascal Ochem. The Maximum Clique Problem in Multiple Interval Graphs. Algorithmica, Springer Verlag, 2015, 71 (4), pp.812-836. ⟨10.1007/s00453-013-9828-6⟩. ⟨lirmm-01263898⟩
  • Pascal Ochem, Michaël Rao. Another remark on the radical of an ODD perfect number. The Fibonacci Quarterly, Dalhousie University, 2014, 52 (3). ⟨lirmm-01349855⟩
  • Pascal Ochem, Alexandre Pinlou. Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar Graphs. Graphs and Combinatorics, Springer Verlag, 2014, 30 (2), pp.439-453. ⟨10.1007/s00373-013-1283-2⟩. ⟨lirmm-00780910⟩
  • Pascal Ochem, Alexandre Pinlou. Application of entropy compression in pattern avoidance. The Electronic Journal of Combinatorics, Open Journal Systems, 2014, 21 (2), pp.1-12. ⟨lirmm-01233448⟩
  • Pascal Ochem. More on square-free words obtained from prefixes by permutations. Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2014, Russian-Finnish Symposium in Discrete Mathematics, 132 (1), pp.109-112. ⟨10.3233/FI-2014-1035⟩. ⟨lirmm-01375793⟩
  • Pascal Ochem, Michael Rao. On the number of prime factors of an odd perfect number. Mathematics of Computation, American Mathematical Society, 2014, 83 (289), pp.2435-2439. ⟨10.1090/S0025-5718-2013-02776-7⟩. ⟨lirmm-01263897⟩
  • Robert Mercaş, Pascal Ochem, Alexey V. Samsonov, Arseny M. Shur. Binary patterns in binary cube-free words: Avoidability and growth. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 2014, 48 (4), pp.369-389. ⟨10.1051/ita/2014015⟩. ⟨lirmm-01263848⟩
  • Paul Dorbec, Mickael Montassier, Pascal Ochem. Vertex Partitions of Graphs into Cographs and Stars. Journal of Graph Theory, Wiley, 2013, 75, pp.75-90. ⟨10.1002/jgt.21724⟩. ⟨hal-00911272⟩
  • Louis Esperet, Mickaël Montassier, Pascal Ochem, Alexandre Pinlou. A Complexity Dichotomy for the Coloring of Sparse Graphs. Journal of Graph Theory, Wiley, 2013, 73 (1), pp.85-102. ⟨10.1002/jgt.21659⟩. ⟨lirmm-00736468⟩
  • Hervé Hocquard, Pascal Ochem, Petru Valicov. Strong edge-colouring and induced matchings. Information Processing Letters, Elsevier, 2013, 113 (19-21), pp.836-843. ⟨10.1016/j.ipl.2013.07.026⟩. ⟨hal-00609454v4⟩
  • Louis Esperet, Sylvain Gravier, Mickael Montassier, Pascal Ochem, Aline Parreau. Locally identifying coloring of graphs. The Electronic Journal of Combinatorics, Open Journal Systems, 2012, 19 (2), pp.40. ⟨hal-00529640v2⟩
  • S. Adam Fletcher, P. Nielsen Pace, Pascal Ochem. Sieve Methods for Odd Perfect Numbers. Mathematics of Computation, American Mathematical Society, 2012, 81, pp.1753-1776. ⟨lirmm-00739250⟩
  • Pascal Ochem, Michael Rao. Odd Perfect Numbers are Greater than 10^1500. Mathematics of Computation, American Mathematical Society, 2012, 81 (279), pp.1869-1877. ⟨lirmm-00739245⟩
  • Pascal Ochem, Elise Vaslet. Repetition Thresholds for Subdivided Graphs and Trees. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 2012, 46 (1), pp.123-130. ⟨lirmm-00739384⟩
  • Francesca Fiorenzi, Pascal Ochem, Patrice Ossona de Mendez, Xuding Zhu. Thue choosability of trees. Discrete Applied Mathematics, Elsevier, 2011, 159, pp.2045-2049. ⟨10.1016/j.dam.2011.07.017⟩. ⟨hal-00656797⟩
  • Francesca Fiorenzi, Pascal Ochem, Elise Vaslet. Bounds for the Generalized Repetition Threshold. Theoretical Computer Science, Elsevier, 2011, 412 (27), pp.2955-2963. ⟨lirmm-00739391⟩
  • Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Eric Sopena. Homomorphisms of 2-edge-colored graphs. Discrete Applied Mathematics, Elsevier, 2010, 158 (12), pp.1365-1379. ⟨10.1016/j.dam.2009.09.017⟩. ⟨lirmm-00433039⟩
  • Jérémie Chalopin, Daniel Gonçalves, Pascal Ochem. Planar Graphs Have 1-string Representations. Discrete and Computational Geometry, Springer Verlag, 2010, 43 ((3)), pp.626-647. ⟨10.1007/s00454-009-9196-9⟩. ⟨lirmm-00433091⟩
  • O.V. Borodin, A.O. Ivanova, Mickael 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, Wiley, 2010, 65 (2), pp.83-93. ⟨hal-00377372⟩
  • Louis Esperet, Pascal Ochem. On circle graphs with girth at least five. Discrete Mathematics, Elsevier, 2009, 309 (8), pp.2217-2222. ⟨hal-00451863⟩
  • Daniel Gonçalves, Pascal Ochem. On Star and Caterpillar Arboricity. Discrete Mathematics, Elsevier, 2009, 309 (11), pp.3694-3702. ⟨10.1016/j.disc.2008.01.041⟩. ⟨lirmm-00338327⟩
  • Pascal Ochem, Alexandre Pinlou, Eric Sopena. On the Oriented Chromatic Index of Oriented Graphs. Journal of Graph Theory, Wiley, 2008, 57 (4), pp.313--332. ⟨10.1002/jgt.20286⟩. ⟨lirmm-00195956⟩
  • Mickaël Montassier, Pascal Ochem, Alexandre Pinlou. Strong Oriented Chromatic Number of Planar Graphs without Short Cycles. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2008, 10 (1), pp.1-24. ⟨lirmm-00184811⟩
  • Pascal Ochem, Alexandre Pinlou. Oriented Colorings of Partial 2-trees. Information Processing Letters, Elsevier, 2008, 108, pp.82-86. ⟨10.1016/j.ipl.2008.04.007⟩. ⟨lirmm-00314715⟩
  • Louis Esperet, Arnaud Labourel, Pascal Ochem. On induced-universal graphs for the class of bounded-degree graphs. Information Processing Letters, Elsevier, 2008, 108 (5), pp.255-260. ⟨10.1016/j.ipl.2008.04.020⟩. ⟨hal-00368277⟩
  • Jérémie Chalopin, Pascal Ochem. Dejean's conjecture and letter frequency. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 2008, 42, pp.477-480. ⟨10.1051/ita:2008013⟩. ⟨hal-00432200⟩
  • Louis Esperet, Pascal Ochem. Oriented coloring of 2-outerplanar graphs. Information Processing Letters, Elsevier, 2007, 101, pp.215--219. ⟨hal-00307156⟩
  • Mickael Montassier, Pascal Ochem, André Raspaud. On the acyclic choosability of graphs. Journal of Graph Theory, Wiley, 2006, 51, pp.281--300. ⟨hal-00307137⟩
  • József Balogh, Pascal Ochem, András Pluhár. On the interval number of special graphs. Journal of Graph Theory, Wiley, 2004, 46 (4), pp.241-253. ⟨hal-00307641⟩
  • Pascal Ochem. Oriented colorings of triangle-free planar graphs. Information Processing Letters, Elsevier, 2004, 92, pp.71-76. ⟨hal-00307124⟩
  • Gregory Kucherov, Pascal Ochem, Michael Rao. How Many Square Occurrences Must a Binary Sequence Contain?. The Electronic Journal of Combinatorics, Open Journal Systems, 2003, 10, pp.R12. ⟨hal-00307205⟩
  • Gregory Kucherov, Pascal Ochem, Michael Rao. How many square occurrences must a binary sequence contain?. The Electronic Journal of Combinatorics, Open Journal Systems, 2003, 10 (1), 11 p. ⟨inria-00099596⟩

Conference papers19 documents

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

Book sections1 document

Reports3 documents

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