default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Frishberg
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2023
[b1]Daniel Frishberg:
Flow-Based Decomposition for Geometric and Combinatorial Markov Chain Mixing. University of California, Irvine, USA, 2023
Journal Articles
- 2023
- [j2]David Eppstein, Daniel Frishberg, Martha C. Osegueda
:
Angles of arc-polygons and Lombardi drawings of cacti. Comput. Geom. 112: 101982 (2023) - 2022
- [j1]David Eppstein, Daniel Frishberg, William Maxwell:
On the treewidth of Hanoi graphs. Theor. Comput. Sci. 906: 1-17 (2022)
Conference and Workshop Papers
- 2023
- [c7]David Eppstein, Daniel Frishberg:
Improved Mixing for the Convex Polygon Triangulation Flip Walk. ICALP 2023: 56:1-56:17 - [c6]David Eppstein, Daniel Frishberg:
Rapid Mixing for the Hardcore Glauber Dynamics and Other Markov Chains in Bounded-Treewidth Graphs. ISAAC 2023: 30:1-30:13 - [c5]Charlie Carlson, Daniel Frishberg, Eric Vigoda:
Improved Distributed Algorithms for Random Colorings. OPODIS 2023: 13:1-13:18 - 2021
- [c4]David Eppstein, Daniel Frishberg, Martha C. Osegueda:
Angles of Arc-Polygons and Lombardi Drawings of Cacti. CCCG 2021: 56-64 - [c3]David Eppstein, Daniel Frishberg, William Maxwell:
On the Treewidth of Hanoi Graphs. FUN 2021: 13:1-13:21 - 2020
- [c2]David Eppstein, Daniel Frishberg, Elham Havvaei:
Simplifying Activity-On-Edge Graphs. SWAT 2020: 24:1-24:14 - 2019
- [c1]Nil Mamano, Alon Efrat, David Eppstein, Daniel Frishberg, Michael T. Goodrich, Stephen G. Kobourov, Pedro Matias, Valentin Polishchuk:
New Applications of Nearest-Neighbor Chains: Euclidean TSP and Motorcycle Graphs. ISAAC 2019: 51:1-51:21
Informal and Other Publications
- 2024
- [i8]William Chang, Colin Defant, Daniel Frishberg:
Mixing on Generalized Associahedra. CoRR abs/2408.05611 (2024) - 2023
- [i7]Charlie Carlson, Daniel Frishberg, Eric Vigoda:
Improved Distributed Algorithms for Random Colorings. CoRR abs/2309.07859 (2023) - 2022
- [i6]David Eppstein, Daniel Frishberg:
Improved mixing for the convex polygon triangulation flip walk. CoRR abs/2207.09972 (2022) - 2021
- [i5]David Eppstein, Daniel Frishberg, Martha C. Osegueda:
Angles of Arc-Polygons and Lombardi Drawings of Cacti. CoRR abs/2107.03615 (2021) - [i4]David Eppstein, Daniel Frishberg:
Rapid mixing of the hardcore Glauber dynamics and other Markov chains in bounded-treewidth graphs. CoRR abs/2111.03898 (2021) - 2020
- [i3]David Eppstein, Daniel Frishberg, Elham Havvaei:
Simplifying Activity-on-Edge Graphs. CoRR abs/2002.01610 (2020) - [i2]David Eppstein, Daniel Frishberg, William Maxwell:
On the treewidth of Hanoi graphs. CoRR abs/2005.00179 (2020) - 2019
- [i1]Alon Efrat, David Eppstein, Daniel Frishberg, Michael T. Goodrich, Stephen G. Kobourov, Nil Mamano, Pedro Matias, Valentin Polishchuk:
Euclidean TSP, Motorcycle Graphs, and Other New Applications of Nearest-Neighbor Chains. CoRR abs/1902.06875 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-30 00:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
