5 citations · 5 across the 4 of their papers we have counts for
4 papers
A Faster Randomized Algorithm for Vertex Cover: An Automated Approach
Katie Clinch, Serge Gaspers, Tao Zixu He +2
This work introduces two techniques for the design and analysis of branching algorithms, illustrated through the case study of the Vertex Cover problem. First, we present a method…
Sharp thresholds for NAC-colourings and stable cuts in random graphs
Katie Clinch, John Haslegrave, Tony Huynh +1
NAC-colourings of graphs correspond to flexible quasi-injective realisations in . A special class of NAC-colourings are those that arise from stable cuts. We give s…
Product structure of graph classes with bounded treewidth
Rutger Campbell, Katie Clinch, Marc Distel +8
We show that many graphs with bounded treewidth can be described as subgraphs of the strong product of a graph with smaller treewidth and a bounded-size complete graph. To this end…
Global rigidity of 2-dimensional direction-length frameworks with connected rigidity matroids
Katie Clinch
A two-dimensional direction-length framework consists of a multigraph whose edge set is formed of "direction" edges and "length" edges , and a realisatio…