default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete & Computational Geometry, Volume 58
Volume 58, Number 1, July 2017
- Michael Gene Dobbins, Andreas F. Holmsen, Alfredo Hubard:
Realization Spaces of Arrangements of Convex Bodies. 1-29 - Jin Akiyama, Kiyoko Matsunaga:
Generalization of Haberdasher's Puzzle. 30-50 - Ruy Fabila Monroy
, Clemens Huemer:
Carathéodory's Theorem in Depth. 51-66 - Bruno Federici, Agelos Georgakopoulos:
Hyperbolicity vs. Amenability for Planar Graphs. 67-79 - Maxim Arnold, Dmitry Fuchs, Ivan Izmestiev, Serge Tabachnikov, Emmanuel Tsukerman:
Iterating Evolutes and Involutes. 80-143 - Nicolas Ariel Capitelli, Elias Gabriel Minian:
A Simplicial Complex is Uniquely Determined by Its Set of Discrete Morse Functions. 144-157 - Nikita Kalinin:
Tropical Approach to Nagata's Conjecture in Positive Characteristic. 158-179 - Kevin Buchin, Maike Buchin, Wouter Meulemans, Wolfgang Mulzer:
Four Soviets Walk the Dog: Improved Bounds for Computing the Fréchet Distance. 180-216 - Michael D. Plummer, Dong Ye, Xiaoya Zha:
Connectivity and Wv -Paths in Polyhedral Maps on Surfaces. 217-231 - Larry Guth, Joshua Zahl:
Curves in R4 and Two-Rich Points. 232-253
Volume 58, Number 2, September 2017
- Amir Yehudayoff:
An Elementary Exposition of Topological Overlap in the Plane. 255-264 - Chris D. Godsil, David E. Roberson, Brendan Rooney, Robert Sámal, Antonios Varvitsiotis:
Universal Completability, Least Eigenvalue Frameworks, and Vector Colorings. 265-292 - Giovanni Paolini:
An Algorithm for Canonical Forms of Finite Subsets of Zd up to Affinities. 293-312 - Iyad A. Kanj, Eric Sedgwick, Ge Xia:
Computing the Flip Distance Between Triangulations. 313-344 - Biplab Basak:
3-Regular Colored Graphs and Classification of Surfaces. 345-354 - Boulos El Hilany:
Characterization of Circuits Supporting Polynomial Systems with the Maximal Number of Positive Solutions. 355-370 - Dennis Amelunxen, Martin Lotz:
Intrinsic Volumes of Polyhedral Cones: A Combinatorial Perspective. 371-409 - Luis A. Goddyn, Yian Xu:
On the Bounds of Conway's Thrackles. 410-416 - Zakhar Kabluchko, Günter Last, Dmitry Zaporozhets:
Inclusion-Exclusion Principles for Convex Hulls and the Euler Relation. 417-434 - Jesús A. De Loera, Reuben N. La Haye, David Rolnick, Pablo Soberón:
Quantitative Tverberg Theorems Over Lattices and Other Discrete Sets. 435-448 - Maria Dostert, Cristóbal Guzmán, Fernando Mário de Oliveira Filho, Frank Vallentin:
New Upper Bounds for the Density of Translative Packings of Three-Dimensional Convex Bodies with Tetrahedral Symmetry. 449-481 - Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perkovic, André van Renssen:
Upper and Lower Bounds for Online Routing on Delaunay Triangulations. 482-504
Volume 58, Number 3, October 2017
- Manuel Wettstein:
Trapezoidal Diagrams, Upward Triangulations, and Prime Catalan Numbers. 505-525 - Michal Adamaszek, Florian Frick, Adrien Vakili:
On Homotopy Types of Euclidean Rips Complexes. 526-542 - Martin Nöllenburg, Roman Prutkin:
Euclidean Greedy Drawings of Trees. 543-579 - Marc Lackenby:
Some Conditionally Hard Problems on Links and 3-Manifolds. 580-595 - Pierre-Antoine Guihéneuf, Émilien Joly:
A Minkowski Theorem for Quasicrystals. 596-613 - Robert Connelly, Matthew Funkhouser, Vivian Kuperberg, Evan Solomonides:
Packings of Equal Disks in a Square Torus. 614-642 - Francisco Criado, Francisco Santos:
The Maximum Diameter of Pure Simplicial Complexes and Pseudo-manifolds. 643-649 - Ron Aharoni, Ron Holzman, Shira Zerbib:
Edge-Covers in d-Interval Hypergraphs. 650-662 - Bernardo González Merino, Matthias Schymura:
On Densities of Lattice Arrangements Intersecting Every i-Dimensional Affine Subspace. 663-685 - Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara:
Complexity of Tiling a Polygon with Trominoes or Bars. 686-704 - Pankaj K. Agarwal, Alon Efrat, Swaminathan Sankararaman, Wuzhou Zhang:
Nearest-Neighbor Searching Under Uncertainty I. 705-745 - Natalia García-Colín, Miguel Raggi, Edgardo Roldán-Pensado:
A Note on the Tolerant Tverberg Theorem. 746-754
Volume 58, Number 4, December 2017
- Sándor P. Fekete, Anna Lubiw:
Guest Editors' Foreword. 755-756 - Eyal Ackerman, Balázs Keszegh, Máté Vizer:
Coloring Points with Respect to Squares. 757-784 - Hugo A. Akitaya, Greg Aloupis, Jeff Erickson, Csaba D. Tóth:
Recognizing Weakly Simple Polygons. 785-821 - Sarah R. Allen, Luis Barba, John Iacono, Stefan Langerman:
Incremental Voronoi Diagrams. 822-848 - Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
On the Combinatorial Complexity of Approximating Polytopes. 849-870 - Benjamin A. Burton, Arnaud de Mesmay, Uli Wagner:
Finding Non-orientable Surfaces in 3-Manifolds. 871-888 - Hsien-Chih Chang, Jeff Erickson:
Untangling Planar Curves. 889-920 - Alfredo Hubard, Vojtech Kaluza, Arnaud de Mesmay, Martin Tancer:
Shortest Path Embeddings of Graphs on Surfaces. 921-945 - Benjamin Raichel, C. Seshadhri:
Avoiding the Global Sort: A Faster Contour Tree Algorithm. 946-985 - Orit E. Raz:
Configurations of Lines in Space and Combinatorial Rigidity. 986-1009
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-01-09 19:36 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:
