| Publication | Date of Publication | Type |
|---|
Antisquares and critical exponents
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2024-09-06 | Paper |
Contact graphs of boxes with unidirectional contacts
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2024-09-06 | Paper |
Pseudoperiodic words and a question of Shevelev
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2024-09-06 | Paper |
Critical exponent of binary words with few distinct palindromes
The Electronic Journal of Combinatorics | 2024-07-18 | Paper |
| More characterizations of morphic words | 2023-12-17 | Paper |
Properties of a ternary infinite word
RAIRO - Theoretical Informatics and Applications | 2023-05-25 | Paper |
Doubled patterns with reversal and square-free doubled patterns
The Electronic Journal of Combinatorics | 2023-04-19 | Paper |
| Complement Avoidance in Binary Words | 2022-09-20 | Paper |
Acyclic, star, and injective colouring: bounding the diameter
The Electronic Journal of Combinatorics | 2022-06-13 | Paper |
Avoiding square-free words on free groups
Theoretical Computer Science | 2022-06-13 | Paper |
Doubled patterns with reversal are 3-avoidable
(available as arXiv preprint) | 2022-05-20 | Paper |
A family of formulas with reversal of arbitrarily high avoidability index
Theoretical Computer Science | 2021-11-18 | Paper |
Homomorphisms of planar \((m,n)\)-colored-mixed graphs to planar targets
Discrete Mathematics | 2021-09-30 | Paper |
| Avoiding large squares in trees and planar graphs | 2021-06-02 | Paper |
Doubled patterns with reversal and square-free doubled patterns
(available as arXiv preprint) | 2021-05-10 | Paper |
Avoiding Square-Free Words on Free Groups
(available as arXiv preprint) | 2021-04-14 | Paper |
A family of formulas with reversal of arbitrarily high avoidability index
(available as arXiv preprint) | 2021-03-13 | Paper |
Avoidability of palindrome patterns
The Electronic Journal of Combinatorics | 2021-01-29 | Paper |
Avoiding conjugacy classes on the 5-letter alphabet
RAIRO - Theoretical Informatics and Applications | 2020-07-21 | Paper |
Complexity of planar signed graph homomorphisms to cycles
Discrete Applied Mathematics | 2020-07-07 | Paper |
Partitioning sparse graphs into an independent set and a graph with bounded size components
Discrete Mathematics | 2020-06-08 | Paper |
On non-repetitive sequences of arithmetic progressions: the cases \(k\in\{4,5,6,7,8\}\)
Discrete Applied Mathematics | 2020-05-18 | Paper |
| Nice formulas, $xyx$-formulas, and palindrome patterns | 2020-05-11 | Paper |
Oriented cliques and colorings of graphs with low maximum degree
Discrete Mathematics | 2020-03-20 | Paper |
Some further results on squarefree arithmetic progressions in infinite words
Theoretical Computer Science | 2019-11-13 | Paper |
New results on pseudosquare avoidance
(available as arXiv preprint) | 2019-11-06 | Paper |
Vertex partitions of \((C_3, C_4, C_6)\)-free planar graphs
Discrete Mathematics | 2019-09-11 | Paper |
Repetition avoidance in products of factors
Theoretical Computer Science | 2019-09-10 | Paper |
On the Kőnig‐Egerváry theorem for ‐paths
Journal of Graph Theory | 2019-06-14 | Paper |
| Oriented coloring of graphs with low maximum degree | 2019-05-29 | Paper |
On some interesting ternary formulas
The Electronic Journal of Combinatorics | 2019-03-05 | Paper |
Avoiding or limiting regularities in words
Trends in Mathematics | 2019-01-24 | Paper |
Oriented incidence colourings of digraphs
Discussiones Mathematicae Graph Theory | 2018-12-05 | Paper |
On repetition thresholds of caterpillars and trees of bounded degree
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
On repetition thresholds of caterpillars and trees of bounded degree
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
Avoidability of circular formulas
Theoretical Computer Science | 2018-04-16 | Paper |
On some interesting ternary formulas
Lecture Notes in Computer Science | 2017-11-15 | Paper |
Avoidability of formulas with two variables
The Electronic Journal of Combinatorics | 2017-11-10 | Paper |
2-subcoloring is NP-complete for planar comparability graphs
Information Processing Letters | 2017-09-19 | Paper |
Homomorphisms of 2-edge-colored triangle-free planar graphs
Journal of Graph Theory | 2017-06-30 | Paper |
Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms
Information Processing Letters | 2017-04-20 | Paper |
The complexity of partitioning into disjoint cliques and a triangle-free graph
Discrete Applied Mathematics | 2017-03-15 | Paper |
Exponential domination in subcubic graphs
The Electronic Journal of Combinatorics | 2017-01-18 | Paper |
Exponential domination in subcubic graphs
The Electronic Journal of Combinatorics | 2017-01-18 | Paper |
Bounds on the exponential domination number
Discrete Mathematics | 2016-12-22 | Paper |
Avoidability of formulas with two variables
Developments in Language Theory | 2016-08-30 | Paper |
A short proof that shuffle squares are 7-avoidable
RAIRO - Theoretical Informatics and Applications | 2016-08-12 | Paper |
On interval representations of graphs
Discrete Applied Mathematics | 2016-02-12 | Paper |
Doubled patterns are 3-avoidable
The Electronic Journal of Combinatorics | 2016-02-11 | Paper |
Doubled patterns are 3-avoidable
The Electronic Journal of Combinatorics | 2016-02-11 | Paper |
Islands in graphs on surfaces
SIAM Journal on Discrete Mathematics | 2016-02-05 | Paper |
Complexity dichotomy for oriented homomorphism of planar graphs with large girth
Theoretical Computer Science | 2015-07-24 | Paper |
The maximum clique problem in multiple interval graphs
Algorithmica | 2015-06-25 | Paper |
Characterization of some binary words with few squares
Theoretical Computer Science | 2015-06-11 | Paper |
Near-colorings: non-colorable graphs and NP-completeness
The Electronic Journal of Combinatorics | 2015-03-11 | Paper |
Near-colorings: non-colorable graphs and NP-completeness
The Electronic Journal of Combinatorics | 2015-03-11 | Paper |
More on Square-free Words Obtained from Prefixes by Permutations
Fundamenta Informaticae | 2014-12-22 | Paper |
| scientific article; zbMATH DE number 6381690 (Why is no real title available?) | 2014-12-18 | Paper |
Binary patterns in binary cube-free words: avoidability and growth
RAIRO - Theoretical Informatics and Applications | 2014-12-12 | Paper |
| Another remark on the radical of an odd perfect number | 2014-10-01 | Paper |
Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs
Graphs and Combinatorics | 2014-09-19 | Paper |
On the number of prime factors of an odd perfect number
Mathematics of Computation | 2014-09-10 | Paper |
Application of entropy compression in pattern avoidance
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
Application of entropy compression in pattern avoidance
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
Strong edge-colouring and induced matchings
Information Processing Letters | 2014-04-14 | Paper |
Vertex partitions of graphs into cographs and stars
Journal of Graph Theory | 2014-01-28 | Paper |
| Homomorphisms of signed planar graphs | 2014-01-14 | Paper |
| Bounds and complexity results for strong edge colouring of subcubic graphs | 2013-11-01 | Paper |
Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
A Complexity Dichotomy for the Coloring of Sparse Graphs
Journal of Graph Theory | 2013-05-21 | Paper |
The maximum clique problem in multiple interval graphs (extended abstract)
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Locally identifying coloring of graphs
The Electronic Journal of Combinatorics | 2012-10-24 | Paper |
Locally identifying coloring of graphs
The Electronic Journal of Combinatorics | 2012-10-24 | Paper |
Repetition thresholds for subdivided graphs and trees
RAIRO. Theoretical Informatics and Applications | 2012-08-31 | Paper |
Repetition thresholds for subdivided graphs and trees
RAIRO. Theoretical Informatics and Applications | 2012-08-31 | Paper |
Odd perfect numbers are greater than \(10^{1500}\)
Mathematics of Computation | 2012-06-29 | Paper |
Sieve methods for odd perfect numbers
Mathematics of Computation | 2012-06-29 | Paper |
Thue choosability of trees
Discrete Applied Mathematics | 2012-04-30 | Paper |
Bounds for the generalized repetition threshold
Theoretical Computer Science | 2011-06-16 | Paper |
Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most \(k\)
Journal of Graph Theory | 2010-11-10 | Paper |
On maximal repetitions of arbitrary exponent
Information Processing Letters | 2010-09-07 | Paper |
Homomorphisms of 2-edge-colored graphs
Discrete Applied Mathematics | 2010-08-13 | Paper |
| Negative results on acyclic improper colorings | 2010-07-30 | Paper |
Oriented colorings of partial 2-trees
Information Processing Letters | 2010-06-09 | Paper |
On induced-universal graphs for the class of bounded-degree graphs
Information Processing Letters | 2010-06-09 | Paper |
Planar graphs have 1-string representations
Discrete & Computational Geometry | 2010-04-12 | Paper |
Binary words avoiding the pattern AABBCABBA
RAIRO - Theoretical Informatics and Applications | 2010-03-12 | Paper |
Binary words avoiding the pattern AABBCABBA
RAIRO - Theoretical Informatics and Applications | 2010-03-12 | Paper |
Oriented colorings of 2-outerplanar graphs
Information Processing Letters | 2010-01-29 | Paper |
Oriented colorings of triangle-free planar graphs
Information Processing Letters | 2009-08-27 | Paper |
On circle graphs with girth at least five
Discrete Mathematics | 2009-06-19 | Paper |
On star and caterpillar arboricity
Discrete Mathematics | 2009-06-19 | Paper |
AVOIDING APPROXIMATE SQUARES
International Journal of Foundations of Computer Science | 2008-11-24 | Paper |
Dejean's conjecture and letter frequency
RAIRO - Theoretical Informatics and Applications | 2008-09-25 | Paper |
Oriented vertex and arc colorings of partial 2-trees
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
On circle graphs with girth at least five
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Homomorphisms of 2-edge-colored graphs
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Strong oriented chromatic number of planar graphs without cycles of specific lengths
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
| Strong oriented chromatic number of planar graphs without short cycles | 2008-05-27 | Paper |
On the oriented chromatic index of oriented graphs
Journal of Graph Theory | 2008-05-14 | Paper |
Avoiding Approximate Squares
Developments in Language Theory | 2007-11-28 | Paper |
Letter frequency in infinite repetition-free words
Theoretical Computer Science | 2007-07-16 | Paper |
On some arboricities in planar graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Dejean's conjecture and letter frequency
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
A generator of morphisms for infinite words
RAIRO - Theoretical Informatics and Applications | 2007-02-08 | Paper |
A generator of morphisms for infinite words
RAIRO - Theoretical Informatics and Applications | 2007-02-08 | Paper |
A generator of morphisms for infinite words
RAIRO - Theoretical Informatics and Applications | 2007-02-08 | Paper |
On the acyclic choosability of graphs
Journal of Graph Theory | 2006-05-16 | Paper |
A generalization of repetition threshold
Theoretical Computer Science | 2005-12-06 | Paper |
A generalization of repetition threshold
Lecture Notes in Computer Science | 2005-08-22 | Paper |
On the interval number of special graphs
Journal of Graph Theory | 2004-08-16 | Paper |
How many square occurrences must a binary sequence contain?
The Electronic Journal of Combinatorics | 2003-05-07 | Paper |
How many square occurrences must a binary sequence contain?
The Electronic Journal of Combinatorics | 2003-05-07 | Paper |
Antisquares and Critical Exponents
(available as arXiv preprint) | N/A | Paper |
Pseudoperiodic Words and a Question of Shevelev
(available as arXiv preprint) | N/A | Paper |
Contact graphs of boxes with unidirectional contacts
(available as arXiv preprint) | N/A | Paper |
Critical exponent of binary words with few distinct palindromes
(available as arXiv preprint) | N/A | Paper |
