Daniel Frishberg
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Daniel Frishberg has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- David Eppstein
Computer Science Department University of California Irvine
3 shared publications David Eppstein
University of California, Irvine, Irvine, CA 92697, United States
2 shared publications- Alon Efrat
Department of Computer Science, University of Arizona, Tucson, USA
1 shared publication Colin Defant
1 shared publication- Duong Hoang Thuy Vu
University of California, Irvine, Irvine, California, USA
1 shared publication - Edward X. Chen
University of California, Irvine, Irvine, California, USA
1 shared publication
Latest Publications
- Open Access
- 17 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 568-574
A Replication Study on Student Expectations on CS Tutors: Understanding Roles and Labors of Tutors
- 17 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 568-574
Open AccessA Replication Study on Student Expectations on CS Tutors: Understanding Roles and Labors of Tutors
- 18 March 2025
- Published by Springer Nature in Annals of Combinatorics
Mixing on Generalized Associahedra
- 18 March 2025
- Published by Springer Nature in Annals of Combinatorics
Mixing on Generalized Associahedra
- Open Access
- 14 January 2023
- Published by Elsevier in Computational Geometry
- Vol. 112, 101982
Angles of arc-polygons and Lombardi drawings of cacti
- 14 January 2023
- Published by Elsevier in Computational Geometry
- Vol. 112, 101982
Open AccessAngles of arc-polygons and Lombardi drawings of cacti
- Open Access
- 1 March 2022
- Published by Elsevier in Theoretical Computer Science
- Vol. 906, 1-17
On the treewidth of Hanoi graphs
- 1 March 2022
- Published by Elsevier in Theoretical Computer Science
- Vol. 906, 1-17
Open AccessOn the treewidth of Hanoi graphs
- Open Access
On the treewidth of Hanoi graphs
The objective of the well-known Towers of Hanoi puzzle is to move a set of disks one at a time from one of a set of pegs to another, while keeping the disks sorted on each peg. We propose an adversarial variation in which the first player forbids a set of states in the puzzle, and the second player must then convert one randomly-selected state to another without passing through forbidden states. Analyzing this version raises the question of the treewidth of Hanoi graphs. We find this number exactly for three-peg puzzles and provide nearly-tight asymptotic bounds for larger numbers of pegs.
Open AccessOn the treewidth of Hanoi graphs
The objective of the well-known Towers of Hanoi puzzle is to move a set of disks one at a time from one of a set of pegs to another, while keeping the disks sorted on each peg. We propose an adversarial variation in which the first player forbids a set of states in the puzzle, and the second player must then convert one randomly-selected state to another without passing through forbidden states. Analyzing this version raises the question of the treewidth of Hanoi graphs. We find this number exactly for three-peg puzzles and provide nearly-tight asymptotic bounds for larger numbers of pegs.
- Open Access
Simplifying Activity-on-Edge Graphs
We formalize the simplification of activity-on-edge graphs used for visualizing project schedules, where the vertices of the graphs represent project milestones, and the edges represent either tasks of the project or timing constraints between milestones. In this framework, a timeline of the project can be constructed as a leveled drawing of the graph, where the levels of the vertices represent the time at which each milestone is scheduled to happen. We focus on the following problem: given an activity-on-edge graph representing a project, find an equivalent activity-on-edge graph (one with the same critical paths) that has the minimum possible number of milestone vertices among all equivalent activity-on-edge graphs. We provide a polynomial-time algorithm for solving this graph minimization problem.
Open AccessSimplifying Activity-on-Edge Graphs
We formalize the simplification of activity-on-edge graphs used for visualizing project schedules, where the vertices of the graphs represent project milestones, and the edges represent either tasks of the project or timing constraints between milestones. In this framework, a timeline of the project can be constructed as a leveled drawing of the graph, where the levels of the vertices represent the time at which each milestone is scheduled to happen. We focus on the following problem: given an activity-on-edge graph representing a project, find an equivalent activity-on-edge graph (one with the same critical paths) that has the minimum possible number of milestone vertices among all equivalent activity-on-edge graphs. We provide a polynomial-time algorithm for solving this graph minimization problem.
- Open Access
Euclidean TSP, Motorcycle Graphs, and Other New Applications of Nearest-Neighbor Chains
We show new applications of the nearest-neighbor chain algorithm, a technique that originated in agglomerative hierarchical clustering. We apply it to a diverse class of geometric problems: we construct the greedy multi-fragment tour for Euclidean TSP in $O(n\log n)$ time in any fixed dimension and for Steiner TSP in planar graphs in $O(n\sqrt{n}\log n)$ time; we compute motorcycle graphs (which are a central part in straight skeleton algorithms) in $O(n^{4/3+\varepsilon})$ time for any $\varepsilon>0$; we introduce a narcissistic variant of the $k$-attribute stable matching model, and solve it in $O(n^{2-4/(k(1+\varepsilon)+2)})$ time; we give a linear-time $2$-approximation for a 1D geometric set cover problem with applications to radio station placement.Open AccessEuclidean TSP, Motorcycle Graphs, and Other New Applications of Nearest-Neighbor Chains
We show new applications of the nearest-neighbor chain algorithm, a technique that originated in agglomerative hierarchical clustering. We apply it to a diverse class of geometric problems: we construct the greedy multi-fragment tour for Euclidean TSP in $O(n\log n)$ time in any fixed dimension and for Steiner TSP in planar graphs in $O(n\sqrt{n}\log n)$ time; we compute motorcycle graphs (which are a central part in straight skeleton algorithms) in $O(n^{4/3+\varepsilon})$ time for any $\varepsilon>0$; we introduce a narcissistic variant of the $k$-attribute stable matching model, and solve it in $O(n^{2-4/(k(1+\varepsilon)+2)})$ time; we give a linear-time $2$-approximation for a 1D geometric set cover problem with applications to radio station placement.