default search action
Pascal Ochem
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j79]L'ubomíra Dvoráková, Pascal Ochem, Daniela Opocenská:
Critical Exponent of Binary Words with Few Distinct Palindromes. Electron. J. Comb. 31(2) (2024) - 2023
- [j78]Antoine Domenech, Pascal Ochem:
Doubled Patterns with Reversal and Square-Free Doubled Patterns. Electron. J. Comb. 30(1) (2023) - [j77]James D. Currie
, Pascal Ochem
Properties of a ternary infinite word. RAIRO Theor. Informatics Appl. 57: 1 (2023) - [i27]Daniel Gonçalves, Vincent Limouzy, Pascal Ochem:
Contact graphs of boxes with unidirectional contacts. CoRR abs/2301.03865 (2023) - [i26]L'ubomíra Dvoráková, Pascal Ochem, Daniela Opocenská:
Critical exponent of binary words with few distinct palindromes. CoRR abs/2311.13003 (2023) - 2022
- [j76]Christoph Brause, Petr A. Golovach, Barnaby Martin, Pascal Ochem, Daniël Paulusma
Acyclic, Star, and Injective Colouring: Bounding the Diameter. Electron. J. Comb. 29(2) (2022) - [j75]Golnaz Badkobeh, Tero Harju
Avoiding square-free words on free groups. Theor. Comput. Sci. 922: 206-217 (2022) - [i25]James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit:
Properties of a Ternary Infinite Word. CoRR abs/2206.01776 (2022) - [i24]Joseph Meleshko, Pascal Ochem, Jeffrey O. Shallit, Sonja Linghui Shan:
Pseudoperiodic Words and a Question of Shevelev. CoRR abs/2207.10171 (2022) - [i23]Aseem R. Baranwal, James D. Currie, Lucas Mol, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit:
Antisquares and Critical Exponents. CoRR abs/2209.09223 (2022) - [i22]James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit:
Complement Avoidance in Binary Words. CoRR abs/2209.09598 (2022) - 2021
- [j74]Pascal Ochem, Matthieu Rosenfeld
Avoidability of Palindrome Patterns. Electron. J. Comb. 28(1): 1 (2021) - [j73]Fabien Jacques, Pascal Ochem
Homomorphisms of planar (m, n)-colored-mixed graphs to planar targets. Discret. Math. 344(12): 112600 (2021) - [j72]Pascal Ochem
A family of formulas with reversal of arbitrarily high avoidability index. Theor. Comput. Sci. 896: 168-170 (2021) - [c8]Pascal Ochem:
Doubled Patterns with Reversal Are 3-Avoidable. WORDS 2021: 153-159 - 2020
- [j71]Borut Luzar, Martina Mockovciaková, Pascal Ochem, Alexandre Pinlou
On non-repetitive sequences of arithmetic progressions: The cases k∈{4, 5, 6, 7, 8}. Discret. Appl. Math. 279: 106-117 (2020) - [j70]François Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem, Théo Pierron:
Complexity of planar signed graph homomorphisms to cycles. Discret. Appl. Math. 284: 166-178 (2020) - [j69]Janusz Dybizbanski
Oriented cliques and colorings of graphs with low maximum degree. Discret. Math. 343(5): 111829 (2020) - [j68]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): 111921 (2020) - [j67]Golnaz Badkobeh, Pascal Ochem:
Avoiding conjugacy classes on the 5-letter alphabet. RAIRO Theor. Informatics Appl. 54: 2 (2020)
2010 – 2019
- 2019
- [j66]Pascal Ochem, Matthieu Rosenfeld
On Some Interesting Ternary Formulas. Electron. J. Comb. 26(1): 1 (2019) - [j65]François Dross, Pascal Ochem:
Vertex partitions of (C3, C4, C6)-free planar graphs. Discret. Math. 342(11): 3229-3236 (2019) - [j64]Christopher Duffy
Oriented incidence colourings of digraphs. Discuss. Math. Graph Theory 39(1): 191-210 (2019) - [j63]Stéphane Bessy, Pascal Ochem, Dieter Rautenbach
On the Kőnig?Egerváry theorem for k?paths. J. Graph Theory 91(1): 73-87 (2019) - [j62]Pamela Fleischmann, Pascal Ochem, Kamellia Reshadi:
Repetition avoidance in products of factors. Theor. Comput. Sci. 791: 123-126 (2019) - [j61]James D. Currie, Tero Harju
Some further results on squarefree arithmetic progressions in infinite words. Theor. Comput. Sci. 799: 140-148 (2019) - [c7]Tim Ng, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit:
New Results on Pseudosquare Avoidance. WORDS 2019: 264-274 - [i21]James D. Currie, Tero Harju, Pascal Ochem, Narad Rampersad:
Some further results on squarefree arithmetic progressions in infinite words. CoRR abs/1901.06351 (2019) - [i20]Tim Ng, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit:
New results on pseudosquare avoidance. CoRR abs/1904.09157 (2019) - [i19]Ilkyoo Choi, François Dross, Pascal Ochem:
Partitioning sparse graphs into an independent set and a graph with bounded size components. CoRR abs/1905.02123 (2019) - [i18]Pascal Ochem, Alexandre Pinlou:
Oriented coloring of graphs with low maximum degree. CoRR abs/1905.12484 (2019) - [i17]François Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem, Théo Pierron
Complexity of planar signed graph homomorphisms to cycles. CoRR abs/1907.03266 (2019) - 2018
- [j60]Borut Luzar, Pascal Ochem, Alexandre Pinlou:
On Repetition Thresholds of Caterpillars and Trees of Bounded Degree. Electron. J. Comb. 25(1): 1 (2018) - [j59]Guilhem Gamard, Pascal Ochem
Avoidability of circular formulas. Theor. Comput. Sci. 726: 1-4 (2018) - [i16]Pamela Fleischmann, Pascal Ochem, Kamellia Reshadi:
Repetition avoidance in products of factors. CoRR abs/1809.01426 (2018) - [i15]Golnaz Badkobeh, Pascal Ochem:
Avoiding conjugacy classes on the 5-letter alphabet. CoRR abs/1811.08231 (2018) - 2017
- [j58]Pascal Ochem, Matthieu Rosenfeld
Avoidability of Formulas with Two Variables. Electron. J. Comb. 24(4): 4 (2017) - [j57]Marin Bougeret
The complexity of partitioning into disjoint cliques and a triangle-free graph. Discret. Appl. Math. 217: 438-445 (2017) - [j56]Stéphane Bessy, Pascal Ochem, Dieter Rautenbach:
Bounds on the exponential domination number. Discret. Math. 340(3): 494-503 (2017) - [j55]Pascal Ochem, Nazanin Movarraei:
Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms. Inf. Process. Lett. 123: 42-46 (2017) - [j54]Pascal Ochem:
2-subcoloring is NP-complete for planar comparability graphs. Inf. Process. Lett. 128: 46-48 (2017) - [j53]Pascal Ochem, Alexandre Pinlou, Sagnik Sen:
Homomorphisms of 2-Edge-Colored Triangle-Free Planar Graphs. J. Graph Theory 85(1): 258-277 (2017) - [c6]Pascal Ochem, Matthieu Rosenfeld:
On Some Interesting Ternary Formulas. WORDS 2017: 30-35 - [i14]Borut Luzar, Pascal Ochem, Alexandre Pinlou:
On repetition thresholds of caterpillars and trees of bounded degree. CoRR abs/1702.01058 (2017) - [i13]Pascal Ochem:
2-subcoloring is NP-complete for planar comparability graphs. CoRR abs/1702.01283 (2017) - [i12]Pascal Ochem, Matthieu Rosenfeld:
On some interesting ternary formulas. CoRR abs/1706.03233 (2017) - [i11]François Dross, Pascal Ochem:
Vertex partitions of (C3, C4, C6)-free planar graphs. CoRR abs/1711.08710 (2017) - 2016
- [j52]Pascal Ochem:
Doubled Patterns are 3-Avoidable. Electron. J. Comb. 23(1): 1 (2016) - [j51]Stéphane Bessy, Pascal Ochem, Dieter Rautenbach:
Exponential Domination in Subcubic Graphs. Electron. J. Comb. 23(4): 4 (2016) - [j50]Aquiles Braga de Queiroz, Valentin Garnero, Pascal Ochem:
On interval representations of graphs. Discret. Appl. Math. 202: 30-36 (2016) - [j49]Guillaume Guégan, Pascal Ochem:
A short proof that shuffle squares are 7-avoidable. RAIRO Theor. Informatics Appl. 50(1): 101-103 (2016) - [j48]Louis Esperet
Islands in Graphs on Surfaces. SIAM J. Discret. Math. 30(1): 206-219 (2016) - [c5]Pascal Ochem, Matthieu Rosenfeld
Avoidability of Formulas with Two Variables. DLT 2016: 344-354 - [i10]Pascal Ochem, Matthieu Rosenfeld:
Avoidability of formulas with two variables. CoRR abs/1606.03955 (2016) - [i9]Guilhem Gamard, Pascal Ochem, Gwénaël Richomme, Patrice Séébold:
Avoidability of circular formulas. CoRR abs/1610.04439 (2016) - 2015
- [j47]Mathew C. Francis, Daniel Gonçalves
The Maximum Clique Problem in Multiple Interval Graphs. Algorithmica 71(4): 812-836 (2015) - [j46]Mickaël Montassier, Pascal Ochem:
Near-Colorings: Non-Colorable Graphs and NP-Completeness. Electron. J. Comb. 22(1): 1 (2015) - [j45]Golnaz Badkobeh, Pascal Ochem:
Characterization of some binary words with few squares. Theor. Comput. Sci. 588: 73-80 (2015) - [j44]Guillaume Guégan, Pascal Ochem:
Complexity dichotomy for oriented homomorphism of planar graphs with large girth. Theor. Comput. Sci. 596: 142-148 (2015) - [i8]Pascal Ochem:
Doubled patterns are 3-avoidable. CoRR abs/1510.01753 (2015) - [i7]Marin Bougeret
The complexity of partitioning into disjoint cliques and a triangle-free graph. CoRR abs/1512.02207 (2015) - 2014
- [j43]Pascal Ochem, Alexandre Pinlou:
Application of Entropy Compression in Pattern Avoidance. Electron. J. Comb. 21(2): 2 (2014) - [j42]Pascal Ochem:
More on Square-free Words Obtained from Prefixes by Permutations. Fundam. Informaticae 132(1): 109-112 (2014) - [j41]Pascal Ochem, Alexandre Pinlou:
Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar Graphs. Graphs Comb. 30(2): 439-453 (2014) - [j40]Robert Mercas
Binary patterns in binary cube-free words: Avoidability and growth. RAIRO Theor. Informatics Appl. 48(4): 369-389 (2014) - [j39]Paul Dorbec
Vertex Partitions of Graphs into Cographs and Stars. J. Graph Theory 75(1): 75-90 (2014) - [j38]Pascal Ochem, Michaël Rao:
On the number of prime factors of an odd perfect number. Math. Comput. 83(289): 2435-2439 (2014) - [i6]Pascal Ochem, Alexandre Pinlou, Sagnik Sen:
Homomorphisms of signed planar graphs. CoRR abs/1401.3308 (2014) - 2013
- [j37]Hervé Hocquard, Pascal Ochem, Petru Valicov:
Strong edge-colouring and induced matchings. Inf. Process. Lett. 113(19-21): 836-843 (2013) - [j36]Louis Esperet
A Complexity Dichotomy for the Coloring of Sparse Graphs. J. Graph Theory 73(1): 85-102 (2013) - [i5]Pascal Ochem, Alexandre Pinlou:
Application of entropy compression in pattern avoidance. CoRR abs/1301.1873 (2013) - [i4]Robert Mercas, Pascal Ochem, Alexey V. Samsonov, Arseny M. Shur:
Binary Patterns in Binary Cube-Free Words: Avoidability and Growth. CoRR abs/1301.4682 (2013) - 2012
- [j35]Louis Esperet, Sylvain Gravier, Mickaël Montassier, Pascal Ochem, Aline Parreau:
Locally Identifying Coloring of Graphs. Electron. J. Comb. 19(2): 40 (2012) - [j34]Pascal Ochem, Elise Vaslet:
Repetition thresholds for subdivided graphs and trees. RAIRO Theor. Informatics Appl. 46(1): 123-130 (2012) - [j33]S. Adam Fletcher, Pace P. Nielsen, Pascal Ochem:
Sieve methods for odd perfect numbers. Math. Comput. 81(279): 1753-1776 (2012) - [j32]Pascal Ochem, Michaël Rao:
Odd perfect numbers are greater than 101500. Math. Comput. 81(279): 1869-1877 (2012) - [c4]Mathew C. Francis, Daniel Gonçalves, Pascal Ochem:
The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract). WG 2012: 57-68 - [i3]Mathew C. Francis, Daniel Gonçalves, Pascal Ochem:
The Maximum Clique Problem in Multiple Interval Graphs. CoRR abs/1201.0043 (2012) - 2011
- [j31]Francesca Fiorenzi, Pascal Ochem, Patrice Ossona de Mendez
Thue choosability of trees. Discret. Appl. Math. 159(17): 2045-2049 (2011) - [j30]Pascal Ochem, Alexandre Pinlou:
Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs. Electron. Notes Discret. Math. 37: 123-128 (2011) - [j29]Hervé Hocquard, Pascal Ochem, Petru Valicov:
Bounds and complexity results for strong edge colouring of subcubic graphs. Electron. Notes Discret. Math. 38: 463-468 (2011) - [j28]Francesca Fiorenzi, Pascal Ochem, Elise Vaslet:
Bounds for the generalized repetition threshold. Theor. Comput. Sci. 412(27): 2955-2963 (2011) - 2010
- [j27]Amanda Montejano
Homomorphisms of 2-edge-colored graphs. Discret. Appl. Math. 158(12): 1365-1379 (2010) - [j26]Jérémie Chalopin, Daniel Gonçalves
Planar Graphs Have 1-string Representations. Discret. Comput. Geom. 43(3): 626-647 (2010) - [j25]Roman Kolpakov
On maximal repetitions of arbitrary exponent. Inf. Process. Lett. 110(7): 252-256 (2010) - [j24]Pascal Ochem:
Binary words avoiding the pattern AABBCABBA. RAIRO Theor. Informatics Appl. 44(1): 151-158 (2010) - [j23]Oleg V. Borodin, Anna O. Ivanova
Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k. J. Graph Theory 65(2): 83-93 (2010) - [i2]Louis Esperet, Sylvain Gravier, Mickaël Montassier, Pascal Ochem, Aline Parreau:
Locally identifying coloring of graphs. CoRR abs/1010.5624 (2010)
2000 – 2009
- 2009
- [j22]Louis Esperet
On circle graphs with girth at least five. Discret. Math. 309(8): 2217-2222 (2009) - [j21]Daniel Gonçalves
On star and caterpillar arboricity. Discret. Math. 309(11): 3694-3702 (2009) - [i1]Roman Kolpakov, Gregory Kucherov, Pascal Ochem:
On maximal repetitions of arbitrary exponent. CoRR abs/0906.4750 (2009) - 2008
- [j20]Mickaël Montassier, Pascal Ochem
Strong Oriented Chromatic Number of Planar Graphs without Short Cycles. Discret. Math. Theor. Comput. Sci. 10(1) (2008) - [j19]Mickaël Montassier, Pascal Ochem, Alexandre Pinlou:
Strong oriented chromatic number of planar graphs without cycles of specific lengths. Electron. Notes Discret. Math. 30: 27-32 (2008) - [j18]Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Éric Sopena:
Homomorphisms of 2-edge-colored graphs. Electron. Notes Discret. Math. 30: 33-38 (2008) - [j17]Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit:
Avoiding Approximate Squares. Int. J. Found. Comput. Sci. 19(3): 633-648 (2008) - [j16]Pascal Ochem, Alexandre Pinlou:
Oriented colorings of partial 2-trees. Inf. Process. Lett. 108(2): 82-86 (2008) - [j15]Louis Esperet
On induced-universal graphs for the class of bounded-degree graphs. Inf. Process. Lett. 108(5): 255-260 (2008) - [j14]Jérémie Chalopin, Pascal Ochem:
Dejean's conjecture and letter frequency. RAIRO Theor. Informatics Appl. 42(3): 477-480 (2008) - [j13]Pascal Ochem, Alexandre Pinlou, Éric Sopena:
On the oriented chromatic index of oriented graphs. J. Graph Theory 57(4): 313-332 (2008) - 2007
- [j12]Jérémie Chalopin, Pascal Ochem:
Dejean's conjecture and letter frequency. Electron. Notes Discret. Math. 28: 501-505 (2007) - [j11]Louis Esperet
On circle graphs with girth at least five. Electron. Notes Discret. Math. 29: 129-133 (2007) - [j10]Pascal Ochem, Alexandre Pinlou:
Oriented vertex and arc colorings of partial 2-trees. Electron. Notes Discret. Math. 29: 195-199 (2007) - [j9]Louis Esperet
Oriented colorings of 2-outerplanar graphs. Inf. Process. Lett. 101(5): 215-219 (2007) - [j8]Pascal Ochem:
Letter frequency in infinite repetition-free words. Theor. Comput. Sci. 380(3): 388-392 (2007) - [c3]Dalia Krieger, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit:
Avoiding Approximate Squares. Developments in Language Theory 2007: 278-289 - [c2]Jérémie Chalopin, Daniel Gonçalves, Pascal Ochem:
Planar graphs are in 1-STRING. SODA 2007: 609-617 - 2006
- [j7]Pascal Ochem:
A generator of morphisms for infinite words. RAIRO Theor. Informatics Appl. 40(3): 427-441 (2006) - [j6]Mickaël Montassier, Pascal Ochem, André Raspaud:
On the acyclic choosability of graphs. J. Graph Theory 51(4): 281-300 (2006) - 2005
- [j5]Daniel Gonçalves, Pascal Ochem:
On some arboricities in planar graphs. Electron. Notes Discret. Math. 22: 427-432 (2005) - [j4]Lucian Ilie
A generalization of repetition threshold. Theor. Comput. Sci. 345(2-3): 359-369 (2005) - 2004
- [j3]Pascal Ochem:
Oriented colorings of triangle-free planar graphs. Inf. Process. Lett. 92(2): 71-76 (2004) - [j2]József Balogh, Pascal Ochem, András Pluhár:
On the interval number of special graphs. J. Graph Theory 46(4): 241-253 (2004) - [c1]Lucian Ilie, Pascal Ochem, Jeffrey O. Shallit:
A Generalization of Repetition Threshold. MFCS 2004: 818-826 - 2003
- [j1]Gregory Kucherov, Pascal Ochem, Michaël Rao:
How Many Square Occurrences Must a Binary Sequence Contain? Electron. J. Comb. 10 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-31 17:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: