2 citations · 2 across the 2 of their papers we have counts for
3 papers
Fast Approximation Algorithms for Balanced Edge and Vertex Separators
Vladimir Kolmogorov, Jack Spalding-Jamieson
We present a family of fast pseudo-approximation algorithms for the minimum balanced element cut problem in a graph, which includes vertex and edge separators. Given a graph $G=(V,…
Morphing Planar Graph Drawings via Orthogonal Box Drawings
Therese Biedl, Anna Lubiw, Jack Spalding-Jamieson
We give an algorithm to morph planar graph drawings that achieves small grid size at the expense of allowing a constant number of bends on each edge. The input is an -vertex pla…
Angle Covers: Algorithms and Complexity
William Evans, Ellen Gethner, Jack Spalding-Jamieson +1
Consider a graph with a rotation system, namely, for every vertex, a circular ordering of the incident edges. Given such a graph, an angle cover maps every vertex to a pair of cons…