New Applications of Nearest-Neighbor Chains: Euclidean TSP and Motorcycle Graphs. - Nil Mamano; Alon Efrat; David Eppstein; Daniel Frishberg; Michael T. Goodrich; Stephen G. Kobourov; Pedro Matias 001; Valentin Polishchuk (ISAAC, 2019)

Euclidean TSP, Motorcycle Graphs, and Other New Applications of Nearest-Neighbor Chains. - Alon Efrat; David Eppstein; Daniel Frishberg; Michael T. Goodrich; Stephen G. Kobourov; Nil Mamano; Pedro Matias 001; Valentin Polishchuk (CoRR, 2019)

Simplifying Activity-On-Edge Graphs. - David Eppstein; Daniel Frishberg; Elham Havvaei (SWAT, 2020)

On the treewidth of Hanoi graphs. - David Eppstein; Daniel Frishberg; William Maxwell (Theor. Comput. Sci., 2022)

Improved Mixing for the Convex Polygon Triangulation Flip Walk. - David Eppstein; Daniel Frishberg (ICALP, 2023)

Rapid Mixing for the Hardcore Glauber Dynamics and Other Markov Chains in Bounded-Treewidth Graphs. - David Eppstein; Daniel Frishberg (ISAAC, 2023)

Improved Distributed Algorithms for Random Colorings. - Charlie Carlson; Daniel Frishberg; Eric Vigoda (OPODIS, 2023)

Flow-Based Decomposition for Geometric and Combinatorial Markov Chain Mixing - Daniel Frishberg (2023)

Angles of arc-polygons and Lombardi drawings of cacti. - David Eppstein; Daniel Frishberg; Martha C. Osegueda (Comput. Geom., 2023)

Mixing on Generalized Associahedra. - William Chang; Colin Defant; Daniel Frishberg (CoRR, 2024)