| Describing hereditary properties by forbidden circular orderings | 0 | 0.34 | 2023 |
| Min Orderings and List Homomorphism Dichotomies for Signed and Unsigned Graphs. | 0 | 0.34 | 2022 |
| Strong Chordality Of Graphs With Possible Loops | 0 | 0.34 | 2021 |
| Hamiltonian cycles in covering graphs of trees | 1 | 0.36 | 2020 |
| Minimal obstructions to 2-polar cographs | 0 | 0.34 | 2019 |
| Distance-two colourings of Barnette graphs | 0 | 0.34 | 2018 |
| Interval-Like Graphs and Digraphs. | 1 | 0.35 | 2018 |
| The complexity of tropical graph homomorphisms. | 1 | 0.36 | 2017 |
| The complexity of signed graph and edge-coloured graph homomorphisms. | 1 | 0.35 | 2017 |
| Strict chordal and strict split digraphs. | 1 | 0.63 | 2017 |
| Ferrers dimension of grid intersection graphs | 1 | 0.36 | 2017 |
| Bi-Arc Digraphs and Conservative Polymorphisms. | 2 | 0.37 | 2016 |
| Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy | 1 | 0.36 | 2015 |
| The complexity of signed graph and 2-edge-coloured graph homomorphisms | 0 | 0.34 | 2015 |
| Join colourings of chordal graphs | 1 | 0.36 | 2015 |
| Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm. | 2 | 0.38 | 2015 |
| Matrix partitions of split graphs. | 1 | 0.38 | 2014 |
| On the complexity of the 3-kernel problem in some classes of digraphs. | 3 | 0.45 | 2014 |
| Blocking Quadruple: A New Obstruction to Circular-Arc Graphs. | 1 | 0.36 | 2014 |
| Intersection Dimension of Bipartite Graphs. | 3 | 0.39 | 2014 |
| Complexity of Coloring Graphs without Paths and Cycles. | 8 | 0.65 | 2014 |
| Semilattice polymorphisms and chordal graphs | 0 | 0.34 | 2014 |
| Recognition and Characterization of Chronological Interval Digraphs. | 2 | 0.37 | 2013 |
| Obstructions to chordal circular-arc graphs of small independence number | 0 | 0.34 | 2013 |
| Graphs Admitting k-NU Operations. Part 1: The Reflexive Case. | 0 | 0.34 | 2013 |
| Small H-coloring problems for bounded degree digraphs | 1 | 0.35 | 2013 |
| A simple combinatorial interpretation of certain generalized Bell and Stirling numbers. | 3 | 0.95 | 2013 |
| Space complexity of list H-colouring: a dichotomy | 5 | 0.42 | 2013 |
| Influence Diffusion in Social Networks under Time Window Constraints | 9 | 0.51 | 2013 |
| Counting Partitions of Graphs. | 0 | 0.34 | 2012 |
| Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms | 12 | 0.68 | 2012 |
| Monotone Proper Interval Digraphs and Min-Max Orderings. | 2 | 0.36 | 2012 |
| Partitioning Chordal Graphs. | 1 | 0.36 | 2011 |
| The dichotomy of list homomorphisms for digraphs | 14 | 0.63 | 2011 |
| Retractions to Pseudoforests | 11 | 0.55 | 2010 |
| Faithful representations of graphs by islands in the extended grid | 3 | 0.47 | 2010 |
| Adjusted Interval Digraphs | 4 | 0.42 | 2009 |
| Generalizations of Interval Graphs | 0 | 0.34 | 2009 |
| Colouring, constraint satisfaction, and complexity | 24 | 0.91 | 2008 |
| A dichotomy for minimum cost graph homomorphisms | 26 | 0.91 | 2008 |
| On realizations of point determining graphs, and obstructions to full homomorphisms | 15 | 0.93 | 2008 |
| The structure of bi-arc trees | 0 | 0.34 | 2007 |
| List homomorphisms of graphs with bounded degrees | 15 | 0.65 | 2007 |
| On the Density of Trigraph Homomorphisms | 0 | 0.34 | 2007 |
| Full Constraint Satisfaction Problems | 27 | 1.20 | 2006 |
| Independent packings in structured graphs | 20 | 0.80 | 2006 |
| The k-piece packing problem | 10 | 0.75 | 2006 |
| A generalization of the theorem of Lekkerkerker and Boland | 0 | 0.34 | 2005 |
| List matrix partitions of chordal graphs | 16 | 0.92 | 2005 |
| List Partitions of Chordal Graphs | 0 | 0.34 | 2004 |
