Pascal Ochem
101
Documents
Publications
On Some Interesting Ternary FormulasWORDS 2017 - 11th International Conference on Combinatorics on Words, Sep 2017, Montreal, Canada. pp.30-35, ⟨10.1007/978-3-319-66396-8_4⟩
Conference papers
lirmm-02078252v1
|
|
On a conjecture on k-Thue sequencesBGW: Bordeaux Graph Workshop, Nov 2016, Bordeaux, France
Conference papers
lirmm-01730302v1
|
|
|
Avoidability of Formulas with Two Variables20th 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⟩
Conference papers
lirmm-01375829v1
|
The Maximum Clique Problem in Multiple Interval GraphsWG 2012 - 38th International Workshop on Graph Theoretic-Concepts in Computer Science, Jun 2012, Jerusalem, Israel. pp.57-68
Conference papers
lirmm-00738525v1
|
|
|
Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar GraphsLAGOS'11: VI Latin-American Algorithms, Graphs and Optimization Symposium, Mar 2011, Bariloche, Argentina. pp.123-128, ⟨10.1016/j.endm.2011.05.022⟩
Conference papers
lirmm-00530543v1
|
|
Sur la difficulté de séparer un graphe par des plus courts chemins13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France
Conference papers
inria-00588312v1
|
|
Bounds and complexity results for strong edge colouring of subcubic graphsEuroComb'11, Aug 2011, Budapest, France. A paraitre
Conference papers
hal-00592130v1
|
Identifying colorings of graphs8FCC, 2010, Orsay, France
Conference papers
lirmm-01264347v1
|
|
Strong Oriented Chromatic Number of Planar Graphs without Cycles of Specific LengthsLAGOS: Latin-American Algorithms, Graphs, and Optimization Symposium, Nov 2007, Puerto Varas, Chile. pp.27-32, ⟨10.1016/j.endm.2008.01.006⟩
Conference papers
lirmm-00196741v1
|
|
Planar graphs are in 1-stringSODA 2007, 2007, United States. pp.609--617
Conference papers
hal-00308130v1
|
|
|
Unequal letter frequencies in ternary square-free wordsWORDS 2007, 2007, France. pp.388-392
Conference papers
hal-00307123v1
|
Oriented vertex and arc-colorings of partial 2-treesEurocomb07 - European Conference on Combinatorics, Graph Theory and Applications, Sep 2007, Spain. pp.195--199
Conference papers
hal-00307125v1
|
|
Homomorphisms of 2-Edge-Colored GraphsIV Latin American Algorithms, Graphs, and Optimization Symposium, Nov 2007, Puerto Varas, Chile, pp.33-38, ⟨10.1016/j.endm.2008.01.007⟩
Conference papers
lirmm-00196757v1
|
|
|
Avoiding approximate squaresDLT 2007, 2007, Finland. pp.278-289
Conference papers
hal-00307153v1
|
|
Negative results on acyclic improper colorings2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.357-362, ⟨10.46298/dmtcs.3441⟩
Conference papers
hal-01184430v1
|
On the acyclic choosability of graphsGT: Graph Theory, 2004, Paris, France
Conference papers
lirmm-01264370v1
|
|
A generator of morphisms for infinite wordsProceedings of the Workshop on Words avoidability, complexity and morphisms - Edited by G. Richomme, 2004, Finland. pp.427-441
Conference papers
hal-00307126v1
|
|
A generalization of repetition thresholdMFCS, 2004, Czech Republic. pp.818-826
Conference papers
hal-00307256v1
|
|
Pattern Avoidance and HDOL WordsWORDS 2011 - 8th International Conference on Combinatorics on Words, Sep 2011, Prague, Czech Republic. , 2011
Conference poster
lirmm-00626116v1
|
Avoiding or limiting regularities in wordsSequences, Groups and Number Theory, pp.177-212, 2018, 978-3-319-69151-0. ⟨10.1007/978-3-319-69152-7_5⟩
Book sections
lirmm-02083655v1
|
|
Contact graphs of boxes with unidirectional contacts2023
Preprints, Working Papers, ...
hal-04216379v1
|
|
Pseudoperiodic Words and a Question of Shevelev2023
Preprints, Working Papers, ...
lirmm-03799690v1
|
|
Doubled patterns with reversal and square-free doubled patterns2023
Preprints, Working Papers, ...
lirmm-03799694v1
|
|
Complement Avoidance in Binary Words2023
Preprints, Working Papers, ...
lirmm-03799678v1
|
Properties of a Ternary Infinite Word2022
Preprints, Working Papers, ...
lirmm-03799692v1
|
|
Avoiding large squares in trees and planar graphs2021
Preprints, Working Papers, ...
lirmm-03452602v1
|
Homomorphisms of 2-Edge-Colored GraphsRR-08008, 2008, pp.26
Reports
lirmm-00266540v1
|
|
|
Oriented Colorings of Partial 2-treesRR-07026, 2007, pp.7
Reports
lirmm-00190875v1
|
How many square occurrences must a binary sequence contain[Intern report] A02-R-277 || kucherov02a, 2002, 9 p
Reports
inria-00101070v1
|