1 citations · 1 across the 6 of their papers we have counts for
4 papers · 1 filter
Stable cuts, NAC-colourings and flexible realisations of graphs
Katie Clinch, Dániel Garamvölgyi, John Haslegrave +3
A (2-dimensional) realisation of a graph is a pair , where maps the vertices of to . A realisation is flexible if it can be continuously deformed w…
Triangulated spheres with holes in triangulated surfaces
Katie Clinch, Sean Dewar, Niloufar Fuladi +6
Let denote a sphere with holes. Given a triangulation of a surface , we consider the question of when contains a spanning subgraph such t…
Constructions, bounds, and algorithms for peaceable queens
Katie Clinch, Matthew Drescher, Tony Huynh +1
The peaceable queens problem asks to determine the maximum number such that there is a placement of white queens and black queens on an chessboard…
A Piecewise Approach for the Analysis of Exact Algorithms
Katie Clinch, Serge Gaspers, Zixu He +2
To analyze the worst-case running time of branching algorithms, the majority of work in exponential time algorithms focuses on designing complicated branching rules over developing…