Nombre de documents

60

CV de Pascal Ochem


Article dans une revue40 documents

  • Pascal Ochem. Doubled patterns are 3-avoidable. Electronic Journal of Combinatorics, Electronic Journal of Combinatorics, 2016, 23 (1), pp.P1.19. 〈http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i1p19/pdf〉. 〈lirmm-01375763〉
  • 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〉
  • 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〉
  • Pascal Ochem, Alexandre Pinlou, Sagnik Sen. Homomorphisms of 2-edge-colored triangle-free planar graphs. Journal of Graph Theory, Wiley, 2016, to appear, 〈10.1002/jgt.22059〉. 〈lirmm-01376130〉
  • 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〉
  • 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〉
  • Golnaz Badkobeh, Pascal Ochem. Characterization of some binary words with few squares. Journal of Theoretical Computer Science (TCS), 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. Journal of Theoretical Computer Science (TCS), Elsevier, 2015, 596, pp.142-148. 〈10.1016/j.tcs.2015.06.041〉. 〈lirmm-01263869〉
  • Mickaël Montassier, Pascal Ochem. Near-colorings: non-colorable graphs and NP-completeness. Electronic Journal of Combinatorics, Electronic Journal of Combinatorics, 2015, 22 (1), pp.#P1.57. 〈lirmm-01263770〉
  • Pascal Ochem, Alexandre Pinlou. Application of entropy compression in pattern avoidance. Electronic Journal of Combinatorics, Electronic Journal of Combinatorics, 2014, 21 (2), pp.1-12. 〈http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i2p7〉. 〈lirmm-01233448〉
  • 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〉
  • 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, Michaël Rao. Another remark on the radical of an ODD perfect number. The Fibonacci Quarterly, Dalhousie University, 2014, 52 (3), 〈315-317〉. 〈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, Michaël 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〉
  • 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. 〈http://dx.doi.org/10.1002/jgt.21659〉. 〈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. Electronic Journal of Combinatorics, Electronic Journal of Combinatorics, 2012, 19 (2), pp.40. 〈hal-00529640v2〉
  • 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〉
  • 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〉
  • Francesca Fiorenzi, Pascal Ochem, Elise Vaslet. Bounds for the Generalized Repetition Threshold. Theoretical Computer Science, Elsevier, 2011, 412 (27), pp.2955-2963. 〈lirmm-00739391〉
  • 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〉
  • 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〉
  • 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〉
  • Louis Esperet, Pascal Ochem. On circle graphs with girth at least five. Discrete Mathematics, Elsevier, 2009, 309 (8), pp.2217-2222. 〈hal-00451863〉
  • 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〉
  • 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〉
  • 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〉
  • 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〉
  • 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, 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?. Electronic Journal of Combinatorics, Electronic Journal of Combinatorics, 2003, 10 (1), 11 p. 〈inria-00099596〉
  • Gregory Kucherov, Pascal Ochem, Michael Rao. How Many Square Occurrences Must a Binary Sequence Contain?. Electronic Journal of Combinatorics, Electronic Journal of Combinatorics, 2003, 10, pp.R12. 〈hal-00307205〉

Communication dans un congrès17 documents

  • Pascal Ochem, Matthieu Rosenfeld. Avoidability of Formulas with Two Variables. DLT: Developments in Language Theory, Jul 2016, Montréal, Canada. 20th International Conference on Developments in Language Theory, LNCS (9840), pp.344-354, 2016, Developments in Language Theory. 〈http://dlt2016.lacim.uqam.ca〉. 〈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. LNCS (7551), pp.57-68, 2012. 〈lirmm-00738525〉
  • Emilie Diot, Cyril Gavoille, Pascal Ochem. Sur la difficulté de séparer un graphe par des plus courts chemins. Ducourthial, Bertrand et Felber, Pascal. 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France. 2011. 〈inria-00588312〉
  • Pascal Ochem. Pattern Avoidance and HDOL Words. WORDS'11: 8th International Conference on Combinatorics on Words, Czech Republic. 2011, 〈http://words2011.fjfi.cvut.cz/〉. 〈lirmm-00626116〉
  • Pascal Ochem, Alexandre Pinlou. Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar Graphs. Flavia Bonomo, Thomas Liebling, Javier Marenco, Jayme Szwarcfiter, Mario Valencia-Pabon. LAGOS'11: VI Latin-American Algorithms, Graphs and Optimization Symposium, Mar 2011, Bariloche, Argentina. 37, pp.123-128, 2011, Electronic Notes in Discrete Mathematics. 〈http://www-2.dc.uba.ar/lagos2011/〉. 〈10.1016/j.endm.2011.05.022〉. 〈lirmm-00530543〉
  • 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, 2011. 〈hal-00592130〉
  • Louis Esperet, Sylvain Gravier, Mickaël Montassier, Pascal Ochem, Aline Parreau. Identifying colorings of graphs. 8FCC, 2010, Orsay, France. 〈lirmm-01264347〉
  • Jérémie Chalopin, Daniel Gonçalves, Pascal Ochem. Planar graphs are in 1-string. SODA 2007, 2007, United States. pp.609--617, 2007. 〈hal-00308130〉
  • Pascal Ochem. Unequal letter frequencies in ternary square-free words. WORDS 2007, 2007, France. pp.388-392, 2007. 〈hal-00307123〉
  • Dalia Krieger, Pascal Ochem, Narad Rampersad, Jeffrey Shallit. Avoiding approximate squares. DLT 2007, 2007, Finland. pp.278-289, 2007. 〈hal-00307153〉
  • 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. 29, pp.195--199, 2007. 〈hal-00307125〉
  • 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. 30, pp.27-32, 2007, Electronic Notes in Discrete Mathematics. 〈http://www.dii.uchile.cl/~lagos07〉. 〈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, 30, pp.33-38, 2008, Electronic Notes in Discrete Mathematics. 〈http://www.dii.uchile.cl/~lagos07〉. 〈10.1016/j.endm.2008.01.007〉. 〈lirmm-00196757〉
  • Pascal Ochem. Negative results on acyclic improper colorings. Stefan Felsner. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), pp.357-362, 2005, DMTCS Proceedings. 〈hal-01184430〉
  • Lucian Ilie, Pascal Ochem, Jeffrey Shallit. A generalization of repetition threshold. MFCS, 2004, Czech Republic. pp.818-826, 2004. 〈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, 2004. 〈hal-00307126〉
  • Mickaël Montassier, Pascal Ochem, André Raspaud. On the acyclic choosability of graphs. GT: Graph Theory, 2004, Paris, France. 2004. 〈lirmm-01264370〉

Rapport3 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〉