default search action
Manuel Wettstein
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j6]Daniel Rutschmann
, Manuel Wettstein
Chains, Koch Chains, and Point Sets with Many Triangulations. J. ACM 70(3): 18:1-18:26 (2023) - [i7]Bernd Gärtner, Manuel Wettstein:
A Note on the Faces of the Dual Koch Arrangement. CoRR abs/2302.14125 (2023) - 2022
- [c5]Daniel Rutschmann, Manuel Wettstein:
Chains, Koch Chains, and Point Sets with Many Triangulations. SoCG 2022: 59:1-59:18 - [i6]Daniel Rutschmann, Manuel Wettstein:
Chains, Koch Chains, and Point Sets with many Triangulations. CoRR abs/2203.07584 (2022) - 2020
- [j5]Alexander Pilz, Emo Welzl, Manuel Wettstein
From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices. Discret. Comput. Geom. 64(3): 1067-1097 (2020)
2010 – 2019
- 2018
- [j4]Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, Manuel Wettstein:
Arc diagrams, flip distances, and Hamiltonian triangulations. Comput. Geom. 68: 206-225 (2018) - [i5]Alexander Pilz, Emo Welzl, Manuel Wettstein:
From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices. CoRR abs/1812.01595 (2018) - 2017
- [j3]Manuel Wettstein
Trapezoidal Diagrams, Upward Triangulations, and Prime Catalan Numbers. Discret. Comput. Geom. 58(3): 505-525 (2017) - [j2]Oswin Aichholzer, Vincent Kusters, Wolfgang Mulzer, Alexander Pilz, Manuel Wettstein:
An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings. Int. J. Comput. Geom. Appl. 27(1-2): 57-84 (2017) - [j1]Manuel Wettstein:
Counting and enumerating crossing-free geometric graphs. J. Comput. Geom. 8(1): 47-77 (2017) - [c4]Alexander Pilz, Emo Welzl, Manuel Wettstein:
From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices. SoCG 2017: 54:1-54:16 - 2016
- [i4]Manuel Wettstein:
Trapezoidal Diagrams, Upward Triangulations, and Prime Catalan Numbers. CoRR abs/1602.07235 (2016) - [i3]Manuel Wettstein:
Counting and Enumerating Crossing-free Geometric Graphs. CoRR abs/1604.05350 (2016) - [i2]Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, Manuel Wettstein:
Arc diagrams, flip distances, and Hamiltonian triangulations. CoRR abs/1611.02541 (2016) - 2015
- [c3]Oswin Aichholzer, Vincent Kusters, Wolfgang Mulzer
An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings. ISAAC 2015: 505-516 - [c2]Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, Manuel Wettstein:
Arc Diagrams, Flip Distances, and Hamiltonian Triangulations. STACS 2015: 197-210 - [i1]Oswin Aichholzer, Vincent Kusters, Wolfgang Mulzer, Alexander Pilz, Manuel Wettstein:
An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings. CoRR abs/1507.08080 (2015) - 2014
- [c1]Manuel Wettstein:
Counting and Enumerating Crossing-free Geometric Graphs. SoCG 2014: 1
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-04-25 05:54 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: