Pascal Ochem

ORCID

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 55

Top Venues

Publications

L'ubomíra Dvoráková, Pascal Ochem, Daniela Opocenská
Critical Exponent of Binary Words with Few Distinct Palindromes. Electron. J. Comb. 31 (2) (2024)
Daniel Gonçalves, Vincent Limouzy, Pascal Ochem
Contact graphs of boxes with unidirectional contacts. CoRR (2023)
L'ubomíra Dvoráková, Pascal Ochem, Daniela Opocenská
Critical exponent of binary words with few distinct palindromes. CoRR (2023)
James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
Properties of a ternary infinite word. RAIRO Theor. Informatics Appl. 57 (2023)
Antoine Domenech, Pascal Ochem
Doubled Patterns with Reversal and Square-Free Doubled Patterns. Electron. J. Comb. 30 (1) (2023)
James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
Complement Avoidance in Binary Words. CoRR (2022)
Joseph Meleshko, Pascal Ochem, Jeffrey O. Shallit, Sonja Linghui Shan
Pseudoperiodic Words and a Question of Shevelev. CoRR (2022)
Christoph Brause, Petr A. Golovach, Barnaby Martin, Pascal Ochem, Daniël Paulusma, Siani Smith
Acyclic, Star, and Injective Colouring: Bounding the Diameter. Electron. J. Comb. 29 (2) (2022)
Aseem R. Baranwal, James D. Currie, Lucas Mol, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
Antisquares and Critical Exponents. CoRR (2022)
James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
Properties of a Ternary Infinite Word. CoRR (2022)
Golnaz Badkobeh, Tero Harju, Pascal Ochem, Matthieu Rosenfeld
Avoiding square-free words on free groups. Theor. Comput. Sci. 922 (2022)
Fabien Jacques, Pascal Ochem
)-colored-mixed graphs to planar targets. Discret. Math. 344 (12) (2021)
Pascal Ochem, Matthieu Rosenfeld
Avoidability of Palindrome Patterns. Electron. J. Comb. 28 (1) (2021)
Pascal Ochem
A family of formulas with reversal of arbitrarily high avoidability index. Theor. Comput. Sci. 896 (2021)
Pascal Ochem
Doubled Patterns with Reversal Are 3-Avoidable. WORDS (2021)
Borut Luzar, Martina Mockovciaková, Pascal Ochem, Alexandre Pinlou, Roman Soták
On non-repetitive sequences of arithmetic progressions: The cases k∈{4, 5, 6, 7, 8}. Discret. Appl. Math. 279 (2020)
Ilkyoo Choi, François Dross, Pascal Ochem
Partitioning sparse graphs into an independent set and a graph with bounded size components. Discret. Math. 343 (8) (2020)
Janusz Dybizbanski, Pascal Ochem, Alexandre Pinlou, Andrzej Szepietowski
Oriented cliques and colorings of graphs with low maximum degree. Discret. Math. 343 (5) (2020)
Golnaz Badkobeh, Pascal Ochem
Avoiding conjugacy classes on the 5-letter alphabet. RAIRO Theor. Informatics Appl. 54 (2020)
François Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem, Théo Pierron
Complexity of planar signed graph homomorphisms to cycles. Discret. Appl. Math. 284 (2020)
François Dross, Pascal Ochem
Vertex partitions of (C3, C4, C6)-free planar graphs. Discret. Math. 342 (11) (2019)
James D. Currie, Tero Harju, Pascal Ochem, Narad Rampersad
Some further results on squarefree arithmetic progressions in infinite words. CoRR (2019)
Pascal Ochem, Alexandre Pinlou
Oriented coloring of graphs with low maximum degree. CoRR (2019)
Tim Ng, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
New Results on Pseudosquare Avoidance. WORDS (2019)
James D. Currie, Tero Harju, Pascal Ochem, Narad Rampersad
Some further results on squarefree arithmetic progressions in infinite words. Theor. Comput. Sci. 799 (2019)
Tim Ng, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
New results on pseudosquare avoidance. CoRR (2019)
François Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem, Théo Pierron
Complexity of planar signed graph homomorphisms to cycles. CoRR (2019)
Stéphane Bessy, Pascal Ochem, Dieter Rautenbach
On the Kőnig?Egerváry theorem for k?paths. J. Graph Theory 91 (1) (2019)
Pascal Ochem, Matthieu Rosenfeld
On Some Interesting Ternary Formulas. Electron. J. Comb. 26 (1) (2019)
Ilkyoo Choi, François Dross, Pascal Ochem
Partitioning sparse graphs into an independent set and a graph with bounded size components. CoRR (2019)
Pamela Fleischmann, Pascal Ochem, Kamellia Reshadi
Repetition avoidance in products of factors. Theor. Comput. Sci. 791 (2019)
Christopher Duffy, Gary MacGillivray, Pascal Ochem, André Raspaud
Oriented incidence colourings of digraphs. Discuss. Math. Graph Theory 39 (1) (2019)
Borut Luzar, Pascal Ochem, Alexandre Pinlou
On Repetition Thresholds of Caterpillars and Trees of Bounded Degree. Electron. J. Comb. 25 (1) (2018)
Guilhem Gamard, Pascal Ochem, Gwénaël Richomme, Patrice Séébold
Avoidability of circular formulas. Theor. Comput. Sci. 726 (2018)
Pamela Fleischmann, Pascal Ochem, Kamellia Reshadi
Repetition avoidance in products of factors. CoRR (2018)
Golnaz Badkobeh, Pascal Ochem
Avoiding conjugacy classes on the 5-letter alphabet. CoRR (2018)
Pascal Ochem
2-subcoloring is NP-complete for planar comparability graphs. Inf. Process. Lett. 128 (2017)
Borut Luzar, Pascal Ochem, Alexandre Pinlou
On repetition thresholds of caterpillars and trees of bounded degree. CoRR (2017)
Pascal Ochem, Matthieu Rosenfeld
Avoidability of Formulas with Two Variables. Electron. J. Comb. 24 (4) (2017)
Pascal Ochem
2-subcoloring is NP-complete for planar comparability graphs. CoRR (2017)
Pascal Ochem, Matthieu Rosenfeld
On some interesting ternary formulas. CoRR (2017)
Marin Bougeret, Pascal Ochem
The complexity of partitioning into disjoint cliques and a triangle-free graph. Discret. Appl. Math. 217 (2017)
Pascal Ochem, Alexandre Pinlou, Sagnik Sen
Homomorphisms of 2-Edge-Colored Triangle-Free Planar Graphs. J. Graph Theory 85 (1) (2017)
Pascal Ochem, Nazanin Movarraei
Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms. Inf. Process. Lett. 123 (2017)
Pascal Ochem, Matthieu Rosenfeld
On Some Interesting Ternary Formulas. WORDS (2017)
François Dross, Pascal Ochem
)-free planar graphs. CoRR (2017)
Stéphane Bessy, Pascal Ochem, Dieter Rautenbach
Bounds on the exponential domination number. Discret. Math. 340 (3) (2017)
Pascal Ochem, Matthieu Rosenfeld
Avoidability of formulas with two variables. CoRR (2016)
Louis Esperet, Pascal Ochem
Islands in Graphs on Surfaces. SIAM J. Discret. Math. 30 (1) (2016)
Stéphane Bessy, Pascal Ochem, Dieter Rautenbach
Exponential Domination in Subcubic Graphs. Electron. J. Comb. 23 (4) (2016)
Pascal Ochem, Matthieu Rosenfeld
Avoidability of Formulas with Two Variables. DLT (2016)
Pascal Ochem
Doubled Patterns are 3-Avoidable. Electron. J. Comb. 23 (1) (2016)
Guillaume Guégan, Pascal Ochem
A short proof that shuffle squares are 7-avoidable. RAIRO Theor. Informatics Appl. 50 (1) (2016)
Aquiles Braga de Queiroz, Valentin Garnero, Pascal Ochem
On interval representations of graphs. Discret. Appl. Math. 202 (2016)
Guilhem Gamard, Pascal Ochem, Gwénaël Richomme, Patrice Séébold
Avoidability of circular formulas. CoRR (2016)
Guillaume Guégan, Pascal Ochem
Complexity dichotomy for oriented homomorphism of planar graphs with large girth. Theor. Comput. Sci. 596 (2015)
Mathew C. Francis, Daniel Gonçalves, Pascal Ochem
The Maximum Clique Problem in Multiple Interval Graphs. Algorithmica 71 (4) (2015)
Pascal Ochem
Doubled patterns are 3-avoidable. CoRR (2015)
Golnaz Badkobeh, Pascal Ochem
Characterization of some binary words with few squares. Theor. Comput. Sci. 588 (2015)
Mickaël Montassier, Pascal Ochem
Near-Colorings: Non-Colorable Graphs and NP-Completeness. Electron. J. Comb. 22 (1) (2015)
Marin Bougeret, Pascal Ochem
The complexity of partitioning into disjoint cliques and a triangle-free graph. CoRR (2015)
Pascal Ochem, Michaël Rao
On the number of prime factors of an odd perfect number. Math. Comput. 83 (289) (2014)
Paul Dorbec, Mickaël Montassier, Pascal Ochem
Vertex Partitions of Graphs into Cographs and Stars. J. Graph Theory 75 (1) (2014)
Pascal Ochem, Alexandre Pinlou
Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar Graphs. Graphs Comb. 30 (2) (2014)
Pascal Ochem, Alexandre Pinlou
Application of Entropy Compression in Pattern Avoidance. Electron. J. Comb. 21 (2) (2014)
Pascal Ochem, Alexandre Pinlou, Sagnik Sen
Homomorphisms of signed planar graphs. CoRR (2014)
Pascal Ochem
More on Square-free Words Obtained from Prefixes by Permutations. Fundam. Informaticae 132 (1) (2014)
Robert Mercas, Pascal Ochem, Alexey V. Samsonov, Arseny M. Shur
Binary patterns in binary cube-free words: Avoidability and growth. RAIRO Theor. Informatics Appl. 48 (4) (2014)
Louis Esperet, Mickaël Montassier, Pascal Ochem, Alexandre Pinlou
A Complexity Dichotomy for the Coloring of Sparse Graphs. J. Graph Theory 73 (1) (2013)
Hervé Hocquard, Pascal Ochem, Petru Valicov
Strong edge-colouring and induced matchings. Inf. Process. Lett. 113 (19-21) (2013)
Pascal Ochem, Alexandre Pinlou
Application of entropy compression in pattern avoidance CoRR (2013)
Robert Mercas, Pascal Ochem, Alexey V. Samsonov, Arseny M. Shur
Binary Patterns in Binary Cube-Free Words: Avoidability and Growth CoRR (2013)
Mathew C. Francis, Daniel Gonçalves, Pascal Ochem
The Maximum Clique Problem in Multiple Interval Graphs CoRR (2012)
Pascal Ochem, Elise Vaslet
Repetition thresholds for subdivided graphs and trees. RAIRO Theor. Informatics Appl. 46 (1) (2012)
Louis Esperet, Sylvain Gravier, Mickaël Montassier, Pascal Ochem, Aline Parreau
Locally Identifying Coloring of Graphs. Electron. J. Comb. 19 (2) (2012)
S. Adam Fletcher, Pace P. Nielsen, Pascal Ochem
Sieve methods for odd perfect numbers. 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)
Pascal Ochem, Michaël Rao
. Math. Comput. 81 (279) (2012)
Francesca Fiorenzi, Pascal Ochem, Patrice Ossona de Mendez, Xuding Zhu
Thue choosability of trees. Discret. Appl. Math. 159 (17) (2011)
Hervé Hocquard, Pascal Ochem, Petru Valicov
Bounds and complexity results for strong edge colouring of subcubic graphs. Electron. Notes Discret. Math. 38 (2011)
Francesca Fiorenzi, Pascal Ochem, Elise Vaslet
Bounds for the generalized repetition threshold. Theor. Comput. Sci. 412 (27) (2011)
Pascal Ochem, Alexandre Pinlou
Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs. Electron. Notes Discret. Math. 37 (2011)
Jérémie Chalopin, Daniel Gonçalves, Pascal Ochem
Planar Graphs Have 1-string Representations. Discret. Comput. Geom. 43 (3) (2010)
Louis Esperet, Sylvain Gravier, Mickaël Montassier, Pascal Ochem, Aline Parreau
Locally identifying coloring of graphs CoRR (2010)
Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, Pascal Ochem, André Raspaud
. J. Graph Theory 65 (2) (2010)
Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Éric Sopena
Homomorphisms of 2-edge-colored graphs. Discret. Appl. Math. 158 (12) (2010)
Roman Kolpakov, Gregory Kucherov, Pascal Ochem
On maximal repetitions of arbitrary exponent. Inf. Process. Lett. 110 (7) (2010)
Pascal Ochem
Binary words avoiding the pattern AABBCABBA. RAIRO Theor. Informatics Appl. 44 (1) (2010)
Daniel Gonçalves, Pascal Ochem
On star and caterpillar arboricity. Discret. Math. 309 (11) (2009)
Louis Esperet, Pascal Ochem
On circle graphs with girth at least five. Discret. Math. 309 (8) (2009)
Roman Kolpakov, Gregory Kucherov, Pascal Ochem
On maximal repetitions of arbitrary exponent CoRR (2009)
Louis Esperet, Arnaud Labourel, Pascal Ochem
On induced-universal graphs for the class of bounded-degree graphs. Inf. Process. Lett. 108 (5) (2008)
Jérémie Chalopin, Pascal Ochem
Dejean's conjecture and letter frequency. RAIRO Theor. Informatics Appl. 42 (3) (2008)
Mickaël Montassier, Pascal Ochem, Alexandre Pinlou
Strong Oriented Chromatic Number of Planar Graphs without Short Cycles. Discret. Math. Theor. Comput. Sci. 10 (1) (2008)
Pascal Ochem, Alexandre Pinlou
Oriented colorings of partial 2-trees. Inf. Process. Lett. 108 (2) (2008)
Mickaël Montassier, Pascal Ochem, Alexandre Pinlou
Strong oriented chromatic number of planar graphs without cycles of specific lengths. Electron. Notes Discret. Math. 30 (2008)
Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
Avoiding Approximate Squares. Int. J. Found. Comput. Sci. 19 (3) (2008)
Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Éric Sopena
Homomorphisms of 2-edge-colored graphs. Electron. Notes Discret. Math. 30 (2008)
Pascal Ochem, Alexandre Pinlou, Éric Sopena
On the oriented chromatic index of oriented graphs. J. Graph Theory 57 (4) (2008)
Jérémie Chalopin, Daniel Gonçalves, Pascal Ochem
Planar graphs are in 1-STRING. SODA (2007)

Pascal Ochem.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Pascal Ochem