research
∙
09/14/2023
Improved Distributed Algorithms for Random Colorings
Markov Chain Monte Carlo (MCMC) algorithms are a widely-used algorithmic...
share
research
∙
07/20/2022
Improved mixing for the convex polygon triangulation flip walk
We prove that the well-studied triangulation flip walk on a convex point...
research
∙
11/06/2021
Rapid mixing of the hardcore Glauber dynamics and other Markov chains in bounded-treewidth graphs
We give a new rapid mixing result for a natural random walk on the indep...
research
∙
07/08/2021
Angles of Arc-Polygons and Lombardi Drawings of Cacti
We characterize the triples of interior angles that are possible in non-...
research
∙
05/01/2020
On the treewidth of Hanoi graphs
The objective of the well-known Towers of Hanoi puzzle is to move a set ...
research
∙
02/05/2020
Simplifying Activity-on-Edge Graphs
We formalize the simplification of activity-on-edge graphs used for visu...
research
∙
02/19/2019
