default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Geometry: Theory and Applications, Volume 57
Volume 57, August 2016
- Pegah Kamousi, Sylvain Lazard, Anil Maheshwari, Stefanie Wuhrer:
Analysis of farthest point sampling for approximating geodesics in a graph. 1-7 - Michal Adamaszek
, Juraj Stacho:
Complexity of simplicial homology and independence complexes of chordal graphs. 8-18 - Nicolas Ariel Capitelli:
The non-pure version of the simplex and the boundary of the simplex. 19-26 - Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon. 27-39
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.
last updated on 2026-06-09 22:38 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:
