2 citations · 3 across the 6 of their papers we have counts for
8 papers
Structural Tractability Frontiers for Metric Repair
Asaf Etgar, Anna C. Gilbert, Jamie Tucker-Foltz
Given a graph labeled with positive distances on each edge, what is the fewest number of edge distances that must be modified for to become a metric? It is known that this…
The Balanced Up-Down Walk
Hugo A. Akitaya, Sarah Cannon, Gregory Herschlag +3
Markov chains based on spanning trees have been hugely influential in algorithms for assessing fairness in political redistricting. The input graph represents the geographic buildi…
Sampling Tree-Weighted Partitions Without Sampling Trees
Sarah Cannon, Topher Pankow, Wesley Pegden +1
This paper gives a new algorithm for sampling tree-weighted partitions of a large class of planar graphs. Formally, the tree-weighted distribution on -partitions of a graph weig…
Sampling Balanced Forests of Grids in Polynomial Time
Sarah Cannon, Wesley Pegden, Jamie Tucker-Foltz
We prove that a polynomial fraction of the set of -component forests in the grid graph have equal numbers of vertices in each component, for any constant . This…
Locked Polyomino Tilings
Jamie Tucker-Foltz
A locked -omino tiling is a grid tiling by -ominoes such that, if you remove any pair of tiles, the only way to fill in the remaining grid cells with -ominoes is to u…
Approximating Constraint Satisfaction Problems Symmetrically
Jamie Tucker-Foltz
This thesis investigates the extent to which the optimal value of a constraint satisfaction problem (CSP) can be approximated by some sentence of fixed point logic with counting (F…