default search action
Discrete & Computational Geometry, Volume 62
Volume 62, Number 1, July 2019
- Ery Arias-Castro, Thibaut Le Gouic
:
Unconstrained and Curvature-Constrained Shortest-Path Distances and Their Approximation. 1-28 - Francisco Belchí Guillamón
Optimising the Topological Information of the A∞-Persistence Groups. 29-54 - Tianran Chen
Unmixing the Mixed Volume Computation. 55-86 - Christopher Fowler
Homology of Multi-Parameter Random Simplicial Complexes. 87-127 - Karola Mészáros, Alejandro H. Morales
On Flow Polytopes, Order Polytopes, and Certain Faces of the Alternating Sign Matrix Polytope. 128-163 - Nermin Salepci
Asymptotic Measures and Links in Simplicial Complexes. 164-179 - Lev Blechman, Eugenii Shustin
Refined Descendant Invariants of Toric Surfaces. 180-208 - Yibo Gao
The Diameter and Automorphism Group of Gelfand-Tsetlin Polytopes. 209-238 - Balázs Gerencsér
Correction to: Acute Sets of Exponentially Optimal Size. 239
Volume 62, Number 2, September 2019
- Yasushi Nagai
A General Framework for Tilings, Delone Sets, Functions, and Measures and Their Interrelation. 241-291 - José F. Fernando
Complements of Unbounded Convex Polyhedra as Polynomial Images of \({{\mathbb {R}}}^n\). 292-347 - Denis Gorodkov
A 15-Vertex Triangulation of the Quaternionic Projective Plane. 348-373 - Haitao Wang
Quickest Visibility Queries in Polygonal Domains. 374-432 - Andrew Newman
Small Simplicial Complexes with Prescribed Torsion in Homology. 433-460 - Georg Grasegger
Graphs with Flexible Labelings. 461-480 - Evan DeCorte
Lower Bounds for the Measurable Chromatic Number of the Hyperbolic Plane. 481-496
Volume 62, Number 3, October 2019
- Christine Bachoc
On the Density of Sets Avoiding Parallelohedron Distance 1. 497-524 - Haitao Wang
Bicriteria Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane. 525-582 - Matthew Alexander, Matthieu Fradelizi, Artem Zvavitch
Polytopes of Maximal Volume Product. 583-600 - Alex Degtyarev
Lines on Smooth Polarized K3-Surfaces. 601-648 - Dirk Frettlöh, Alexey Garber
Weighted 1 × 1 Cut-and-Project Sets in Bounded Distance to a Lattice. 649-661 - Takahiro Matsushita:
Z2 -Indices and Hedetniemi's Conjecture. 662-673 - Balázs Keszegh, Dömötör Pálvölgyi
Proper Coloring of Geometric Hypergraphs. 674-689 - Noriyoshi Sukegawa
An Asymptotically Improved Upper Bound on the Diameter of Polyhedra. 690-699 - Siu-Wing Cheng
Implicit Manifold Reconstruction. 700-742
Volume 62, Number 4, December 2019
- Sang Won Bae
L1 Geodesic Farthest Neighbors in a Simple Polygon and Related Problems. 743-774 - Balázs Gerencsér
Acute Sets of Exponentially Optimal Size. 775-780 - Alexey A. Glazyrin
Covering a Ball by Smaller Balls. 781-787 - María Isabel Herrero, Gabriela Jeronimo
On the Multiplicity of Isolated Roots of Sparse Polynomial Systems. 788-812 - Alexander Lubotzky
Random Steiner systems and bounded degree coboundary expanders of every dimension. 813-831 - Steven J. Miller, Carsten Peterson:
A Geometric Perspective on the MSTD Question. 832-855 - Sergii Myroshnychenko
On Recognizing Shapes of Polytopes from Their Shadows. 856-864 - Herbert Edelsbrunner, Anton V. Nikitenko
Poisson-Delaunay Mosaics of Order k. 865-878 - Fedor V. Fomin
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. 879-911 - Eric Ramos:
Configuration Spaces of Graphs with Certain Permitted Collisions. 912-944 - Killian Meehan, Andrei Pavlichenko, Jan Segert
On the Structural Theorem of Persistent Homology. 945-989 - Krzysztof Kurdyka, Stanislaw Spodzieja
Correction to: Metric Properties of Semialgebraic Mappings. 990-991
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 2024-12-12 20:49 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: