| Games on interval and permutation graph representations. | 0 | 0.34 | 2016 |
| Equivalence of the filament and overlap graphs of subtrees of limited trees. | 1 | 0.39 | 2015 |
| On List Coloring and List Homomorphism of Permutation and Interval Graphs. | 3 | 0.38 | 2012 |
| 3-List Colouring Permutation Graphs | 0 | 0.34 | 2011 |
| The overlap number of a graph | 2 | 0.53 | 2010 |
| DP-Complete Problems Derived from Extremal NP-Complete Properties | 0 | 0.34 | 2009 |
| The LBFS Structure and Recognition of Interval Graphs | 43 | 1.47 | 2009 |
| Subtree filament graphs are subtree overlap graphs | 10 | 0.56 | 2007 |
| Approximating the minimum clique cover and other hard problems in subtree filament graphs | 9 | 0.64 | 2006 |
| Linear Orderings of Subfamilies of AT-Free Graphs | 5 | 0.44 | 2006 |
| Maximum independent set and maximum clique algorithms for overlap graphs | 9 | 0.69 | 2003 |
| On Subfamilies of AT-Free Graphs | 3 | 0.39 | 2001 |
| Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs | 48 | 3.94 | 1999 |
| LBFS orderings and cocomparability graphs | 2 | 0.42 | 1999 |
| The Ultimate Interval Graph Recognition Algorithm? (Extended Abstract) | 20 | 1.71 | 1998 |
| Asteroidal Triple-Free Graphs | 87 | 6.34 | 1997 |
| Total domination and transformation | 8 | 0.60 | 1997 |
| Computing a Dominating Pair in an Asteroidal Triple-free Graph in Linear Time | 3 | 0.96 | 1995 |
| A linear time algorithm to compute a dominating path in an AT-free graph | 17 | 1.81 | 1995 |
| On cocolourings and cochromatic numbers of graphs | 14 | 1.01 | 1994 |
| Domination on cocomparability graphs | 77 | 4.75 | 1993 |
