activity
20242026
most citedA Piecewise Approach for the Analysis of Exact Algorithms

1 citations · 1 across the 6 of their papers we have counts for

collaborators
Showing 2025Show all

2 papers · 1 filter

cs.DS2025

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…

math.CO2025

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…