default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete & Computational Geometry, Volume 67
Volume 67, Number 1, January 2022
- Viktória E. Kaszanitzky, Csaba Király
, Bernd Schulze:
Sufficient Conditions for the Global Rigidity of Periodic Graphs. 1-16 - Zur Luria, Yuval Peled:
On Simple Connectivity of Random 2-Complexes. 17-32 - Pavle V. M. Blagojevic, Aleksandra Dimitrijevic Blagojevic, Roman N. Karasev, Jonathan Kliem:
More Bisections by Hyperplane Arrangements. 33-64 - Giulia Codenotti, Francisco Santos, Matthias Schymura:
The Covering Radius and a Discrete Surface Area for Non-Hollow Simplices. 65-111 - Gregory Lupton, John Oprea, Nicholas A. Scoville:
Homotopy Theory in Digital Topology. 112-165 - Aram Dermenjian, Christophe Hohlweg, Thomas McConville, Vincent Pilaud:
The Facial Weak Order on Hyperplane Arrangements. 166-202 - Leo Betthauser, Peter Bubenik, Parker B. Edwards:
Graded Persistence Diagrams and Persistence Landscapes. 203-230 - Somnath Chakraborty, Hariharan Narayanan:
Generating an Equidistributed Net on a Sphere Using Random Rotations. 231-257 - Jorge Aguilar-Guzmán, Jesús González, Teresa I. Hoekstra-Mendoza:
Farley-Sabalka's Morse-Theory Model and the Higher Topological Complexity of Ordered Configuration Spaces on Trees. 258-286 - Anthony Harrison, Jenya Soprunova:
Lattice Size and Generalized Basis Reduction in Dimension Three. 287-310 - Ahmad Biniaz:
Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios. 311-327 - Bojan Basic, Anna Slivková:
Asymptotical Unboundedness of the Heesch Number in ${\mathbb {E}}^d$ for $d\rightarrow \infty $. 328-337 - István Tomon:
A Sharp Threshold Phenomenon in String Graphs. 338-359
Volume 67, Number 2, March 2022
- Bruno Jartoux, Nabil H. Mustafa:
A Tight Analysis of Geometric Local Search. 361-379 - Stefan Felsner, Alexander Pilz, Patrick Schnider:
Arrangements of Approaching Pseudo-Lines. 380-402 - Clément Berenfeld, John Harvey, Marc Hoffmann, Krishnan Shankar:
Estimating the Reach of a Manifold via its Convexity Defect Function. 403-438 - Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn, Eunjin Oh, Micha Sharir:
The Maximum-Level Vertex in an Arrangement of Lines. 439-461 - Tristram Bogart, João Gouveia, Juan Camilo Torres:
An Algebraic Approach to Projective Uniqueness with an Application to Order Polytopes. 462-491 - Rowan Rowlands:
Reconstructing d-Manifold Subcomplexes of Cubes from Their $(\lfloor d/2 \rfloor + 1)$-Skeletons. 492-502 - Alberto Del Pia, Carla Michini:
Short Simplex Paths in Lattice Polytopes. 503-524 - Sergiy V. Borodachov:
Polarization Problem on a Higher-Dimensional Sphere for a Simplex. 525-542 - Yoshiki Jikumaru:
On the Stability Problem of Equilibrium Discrete Planar Curves. 543-563 - Daniel Hug, Rolf Schneider:
Threshold Phenomena for Random Cones. 564-594 - János Barát, Géza Tóth:
Improvement on the Crossing Number of Crossing-Critical Graphs. 595-604 - Brett Leroux, Luis Rademacher:
Algebraic k-Sets and Generally Neighborly Embeddings. 605-629
Volume 67, Number 3, April 2022
- Daouda Niang Diatta, Sény Diatta, Fabrice Rouillier, Marie-Françoise Roy, Michael Sagraloff:
Bounds for Polynomials on Algebraic Numbers and Application to Curve Topology. 631-697 - Gregory Lupton, John Oprea, Nicholas A. Scoville:
Subdivision of Maps of Digital Images. 698-742 - Fidel Barrera-Cruz, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
How to Morph a Tree on a Small Grid. 743-786 - Nicolas Bédaride, Thomas Fernique:
Density of Binary Disc Packings: The Nine Compact Packings. 787-810 - Ranita Biswas, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Morteza Saghafian:
Continuous and Discrete Radius Functions on Voronoi Tessellations and Delaunay Mosaics. 811-842 - Sergio Cabello, Timothy M. Chan:
Computing Shapley Values in the Plane. 843-881 - Nóra Frankl:
Large Equilateral Sets in Subspaces of ℓ ∞ n of Small Codimension. 882-893 - Nóra Frankl:
Correction to: Large Equilateral Sets in Subspaces of ℓ ∞ n of Small Codimension. 894 - Ansgar Freyer, Martin Henk:
Bounds on the Lattice Point Enumerator via Slices and Projections. 895-918 - Frederik Garbe, Jan Hladký, Joonkyung Lee:
Two Remarks on Graph Norms. 919-929 - Anna Klick, Nicolae Strungaru, Adi Tcaciuc:
On Arithmetic Progressions in Model Sets. 930-946 - Aaron Abrams, Jamie Pommersheim:
Generalized Dissections and Monsky's Theorem. 947-983
Volume 67, Number 4, June 2022
- Emeric Gioan:
Complete Graph Drawings up to Triangle Mutations. 985-1022 - Kevin P. Knudson, Bei Wang:
Discrete Stratified Morse Theory. 1023-1052 - Ata Firat Pir, Frank Sottile:
Irrational Toric Varieties and Secondary Polytopes. 1053-1079 - Omer Lavi:
Optimal Finite Homogeneous Sphere Approximation. 1080-1096 - Johannes Carmesin, Lyuben Lichev:
New Constructions Related to the Polynomial Sphere Recognition Problem. 1097-1123 - Paul C. Bell, Igor Potapov:
Towards Uniform Online Spherical Tessellations. 1124-1146 - Jonathan Kliem, Christian Stump:
A New Face Iterator for Polyhedra and for More General Finite Locally Branched Lattices. 1147-1173 - Claus Scheiderer:
Extreme Points of Gram Spectrahedra of Binary Forms. 1174-1190 - Márton Naszódi, Moritz Venzin:
Covering Convex Bodies and the Closest Vector Problem. 1191-1210 - Jin Li, Dan Ma, Wei Wang:
SL(n) Contravariant Vector Valuations. 1211-1228 - Matthew Kahle, Andrew Newman:
Topology and Geometry of Random 2-Dimensional Hypertrees. 1229-1244 - Gergely Ambrus, Máté Matolcsi:
Density Estimates of 1-Avoiding Sets via Higher Order Correlations. 1245-1256 - Zhongzi Wang:
The Minimal Dimension of a Sphere with an Equivariant Embedding of the Bouquet of g Circles is 2g-1. 1257-1265
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-09-23 00:21 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:
