default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Geometry: Theory and Applications, Volume 50
Volume 50, December 2015
- Atlas F. Cook IV, Anne Driemel
, Jessica Sherette, Carola Wenk:
Computing the Fréchet distance between folded polygons. 1-16 - Charl J. Ras:
Survivable minimum bottleneck networks. 17-23 - Andrew Suk, Bartosz Walczak:
New bounds on the maximum number of edges in k-quasi-planar graphs. 24-33 - Patrizio Angelini, Carla Binucci, Giordano Da Lozzo, Walter Didimo, Luca Grilli, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis:
Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs. 34-48
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 2025-12-05 22:23 CET 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:
