1 citations · 2 across the 5 of their papers we have counts for
5 papers
Overlapping and Robust Edge-Colored Clustering in Hypergraphs
Alex Crane, Brian Lavallee, Blair D. Sullivan +1
A recent trend in data mining has explored (hyper)graph clustering algorithms for data with categorical relationship types. Such algorithms have applications in the analysis of soc…
Parameterized Complexity of Gerrymandering
Andrew Fraser, Brian Lavallee, Blair D. Sullivan
In a representative democracy, the electoral process involves partitioning geographical space into districts which each elect a single representative. These representatives craft a…
Hardness of the Generalized Coloring Numbers
Michael Breen-McKay, Brian Lavallee, Blair D. Sullivan
The generalized coloring numbers of Kierstead and Yang (Order 2003) offer an algorithmically-useful characterization of graph classes with bounded expansion. In this work, we consi…
Approximating Vertex Cover using Structural Rounding
Brian Lavallee, Hayley Russell, Blair D. Sullivan +1
In this work, we provide the first practical evaluation of the structural rounding framework for approximation algorithms. Structural rounding works by first editing to a well-stru…
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class
Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster +5
We develop a new framework for generalizing approximation algorithms from the structural graph algorithm literature so that they apply to graphs somewhat close to that class (a sce…