| Homomorphisms of planar (m, n)-colored-mixed graphs to planar targets | 0 | 0.34 | 2021 |
| A family of formulas with reversal of arbitrarily high avoidability index | 0 | 0.34 | 2021 |
| Partitioning sparse graphs into an independent set and a graph with bounded size components | 0 | 0.34 | 2020 |
| Complexity of planar signed graph homomorphisms to cycles | 1 | 0.35 | 2020 |
| Oriented cliques and colorings of graphs with low maximum degree | 1 | 0.41 | 2020 |
| Oriented coloring of graphs with low maximum degree. | 0 | 0.34 | 2019 |
| Oriented incidence colourings of digraphs. | 0 | 0.34 | 2019 |
| On the Kőnig-Egerváry theorem for k-paths: BESSY et al. | 0 | 0.34 | 2019 |
| New Results On Pseudosquare Avoidance | 0 | 0.34 | 2019 |
| Partitioning sparse graphs into an independent set and a graph with bounded size components. | 0 | 0.34 | 2019 |
| Some further results on squarefree arithmetic progressions in infinite words. | 1 | 0.41 | 2019 |
| Vertex partitions of (C3, C4, C6)-free planar graphs. | 0 | 0.34 | 2019 |
| Avoiding conjugacy classes on the 5-letter alphabet | 0 | 0.34 | 2018 |
| On repetition thresholds of caterpillars and trees of bounded degree. | 0 | 0.34 | 2018 |
| Repetition avoidance in products of factors. | 0 | 0.34 | 2018 |
| Avoidability of circular formulas. | 1 | 0.40 | 2018 |
| On some interesting ternary formulas | 0 | 0.34 | 2017 |
| Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms. | 0 | 0.34 | 2017 |
| Bounds on the Exponential Domination Number | 3 | 0.57 | 2017 |
| The complexity of partitioning into disjoint cliques and a triangle-free graph. | 1 | 0.35 | 2017 |
| 2-subcoloring is NP-complete for planar comparability graphs. | 0 | 0.34 | 2017 |
| Homomorphisms of 2-Edge-Colored Triangle-Free Planar Graphs. | 3 | 0.42 | 2017 |
| A short proof that shuffle squares are 7-avoidable. | 0 | 0.34 | 2016 |
| Doubled Patterns are 3-Avoidable. | 0 | 0.34 | 2016 |
| On interval representations of graphs | 1 | 0.37 | 2016 |
| Exponential Domination In Subcubic Graphs | 2 | 0.53 | 2016 |
| Islands in Graphs on Surfaces. | 2 | 0.37 | 2016 |
| Avoidability of formulas with two variables. | 0 | 0.34 | 2016 |
| Doubled patterns are $3$-avoidable | 5 | 0.67 | 2015 |
| Complexity dichotomy for oriented homomorphism of planar graphs with large girth | 0 | 0.34 | 2015 |
| Characterization of some binary words with few squares | 1 | 0.41 | 2015 |
| More on Square-free Words Obtained from Prefixes by Permutations | 0 | 0.34 | 2014 |
| Vertex Partitions of Graphs into Cographs and Stars. | 3 | 0.43 | 2014 |
| Homomorphisms of signed planar graphs. | 4 | 0.47 | 2014 |
| Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs. | 2 | 0.38 | 2014 |
| A Complexity Dichotomy for the Coloring of Sparse Graphs. | 8 | 0.83 | 2013 |
| Strong edge-colouring and induced matchings | 5 | 0.54 | 2013 |
| Binary patterns in binary cube-free words: Avoidability and growth. | 3 | 0.44 | 2013 |
| Application of entropy compression in pattern avoidance | 9 | 0.76 | 2013 |
| Locally identifying coloring of graphs | 4 | 0.54 | 2012 |
| Odd perfect numbers are greater than 101500. | 3 | 0.62 | 2012 |
| Repetition thresholds for subdivided graphs and trees. | 1 | 0.37 | 2012 |
| The maximum clique problem in multiple interval graphs (extended abstract) | 0 | 0.34 | 2012 |
| Sieve methods for odd perfect numbers. | 0 | 0.34 | 2012 |
| The Maximum Clique Problem in Multiple Interval Graphs | 6 | 0.52 | 2012 |
| Bounds and complexity results for strong edge colouring of subcubic graphs. | 0 | 0.34 | 2011 |
| Thue choosability of trees | 11 | 0.65 | 2011 |
| Bounds for the generalized repetition threshold | 1 | 0.41 | 2011 |
| Planar Graphs Have 1-string Representations | 1 | 0.35 | 2010 |
| Homomorphisms of 2-edge-colored graphs | 5 | 0.53 | 2010 |
