| A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves | 10 | 0.70 | 2017 |
| Independent Set Reconfiguration in Cographs and their Generalizations | 0 | 0.34 | 2016 |
| Using Contracted Solution Graphs for Solving Reconfiguration Problems | 1 | 0.36 | 2015 |
| Reconfiguring Independent Sets in Claw-Free Graphs. | 20 | 1.05 | 2014 |
| The Complexity of Bounded Length Graph Recoloring. | 1 | 0.36 | 2014 |
| The Fine Details of Fast Dynamic Programming over Tree Decompositions. | 1 | 0.37 | 2013 |
| Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement. | 9 | 0.51 | 2013 |
| The complexity of finding uniform sparsest cuts in various graph classes | 1 | 0.36 | 2012 |
| Improved bounds for spanning trees with many leaves | 1 | 0.36 | 2012 |
| Counting Hexagonal Patches and Independent Sets in Circle Graphs | 1 | 0.39 | 2012 |
| Extremal graphs having no matching cuts. | 2 | 0.46 | 2012 |
| The complexity of rerouting shortest paths | 28 | 1.31 | 2012 |
| Rerouting shortest paths in planar graphs | 12 | 0.72 | 2012 |
| Feedback vertex set in mixed graphs | 6 | 0.44 | 2011 |
| A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths | 27 | 0.96 | 2011 |
| Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree | 7 | 0.47 | 2011 |
| Surface Split Decompositions and Subgraph Isomorphism in Graphs on Surfaces | 4 | 0.38 | 2011 |
| A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs | 11 | 0.55 | 2011 |
| Most balanced minimum cuts | 4 | 0.52 | 2010 |
| The complexity status of problems related to sparsest cuts | 2 | 0.37 | 2010 |
| Max-leaves spanning tree is APX-hard for cubic graphs | 5 | 0.44 | 2009 |
| The complexity of the matching-cut problem for planar graphs and other graph classes | 7 | 0.75 | 2009 |
| Finding Fullerene Patches in Polynomial Time | 3 | 0.45 | 2009 |
| Spanning trees with many leaves in graphs without diamonds and blossoms | 12 | 0.65 | 2008 |
| Finding Paths between Graph Colourings: Computational Complexity and Possible Distances | 5 | 0.64 | 2007 |
| Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances | 58 | 3.74 | 2007 |
| Sparsest cuts and concurrent flows in product graphs | 5 | 0.50 | 2004 |
| The Complexity of the Matching-cut Problem for Various Graph Classes | 0 | 0.34 | 2003 |
| Edge-cuts leaving components of order at least three | 44 | 1.98 | 2002 |
