default search action
Discrete & Computational Geometry, Volume 65
Volume 65, Number 1, January 2021
- Astrid Kousholt, Julia Schulte
:
Reconstruction of Convex Bodies from Moments. 1-42 - Oleg Karpenkov
The Combinatorial Geometry of Stresses in Frameworks. 43-89 - Paxton Turner
Discrete Equidecomposability and Ehrhart Theory of Polygons. 90-115 - Selim Bahadir
On the Number of Weakly Connected Subdigraphs in Random kNN Digraphs. 116-142 - Pei Wu
A Counterexample to Las Vergnas' Strong Map Conjecture on Realizable Oriented Matroids. 143-149 - Tingran Gao
The Geometry of Synchronization Problems and Learning Group Actions. 150-211 - Gennadiy Averkov
Equality Case in van der Corput's Inequality and Collisions in Multiple Lattice Tilings. 212-226 - Cristina G. Fernandes
Cubic Graphs, Their Ehrhart Quasi-Polynomials, and a Scissors Congruence Phenomenon. 227-243 - Peter G. Boyvalenkov
Upper Energy Bounds for Spherical Designs of Relatively Small Cardinalities. 244-260 - Stefan Felsner
Arrangements of Pseudocircles: Triangles and Drawings. 261-278 - Si Tiep Ðinh, Zbigniew Jelonek
Thom Isotopy Theorem for Nonproper Maps and Computation of Sets of Stratified Generalized Critical Values. 279-304
Volume 65, Number 2, March 2021
- José Collins, Antonio Montero
Equivelar Toroids with Few Flag-Orbits. 305-330 - Benjamin Schweinhart
Persistent Homology and the Upper Box Dimension. 331-364 - Matthias Beck, Paul E. Gunnells
Weighted Lattice Point Sums in Lattice Polytopes, Unifying Dehn-Sommerville and Ehrhart-Macdonald. 365-384 - Oleg Ogievetsky, Senya B. Shlosman
The Six Cylinders Problem: $\mathbb {D}_{3}$-Symmetry Approach. 385-404 - Danny Nguyen
On the Number of Integer Points in Translated and Expanded Polyhedra. 405-424 - Chaya Keller
Blockers for Simple Hamiltonian Paths in Convex Geometric Graphs of Odd Order. 425-449 - Mark de Berg
Removing Depth-Order Cycles Among Triangles: An Algorithm Generating Triangular Fragments. 450-469 - Árpád Kurusa
Finding Needles in a Haystack. 470-475 - John Mackenzie Gallagher, Walter D. Morris Jr.
A Proof of the Strict Monotone 5-Step Conjecture. 476-488 - Alexandros Eskenazis
On Extremal Sections of Subspaces of Lp. 489-509 - Sylvie Corteel, Jang Soo Kim, Karola Mészáros:
Volumes of Generalized Chan-Robbins-Yuen Polytopes. 510-530 - Basudeb Datta, Subhojoy Gupta
Semi-regular Tilings of the Hyperbolic Plane. 531-553 - Facundo Mémoli, Osman Berat Okutan
Quantitative Simplification of Filtered Simplicial Complexes. 554-583 - Arkadiy Skopenkov:
A Short Exposition of Salman Parsa's Theorems on Intrinsic Linking and Non-realizability. 584-585
Volume 65, Number 3, April 2021
- Samuel Fiorini, Marco Macchia, Kanstantsin Pashkovich:
Bounds on the Number of 2-Level Polytopes, Cones, and Configurations. 587-600 - Guillaume Chapuy, Guillem Perarnau
On the Number of Coloured Triangulations of d-Manifolds. 601-617 - Federico Ardila, Anna Schindler, Andrés R. Vindas-Meléndez
The Equivariant Volumes of the Permutahedron. 618-635 - Koyo Hayashi:
A Polynomial Time Algorithm to Compute Geodesics in CAT(0) Cubical Complexes. 636-654 - Sean Dewar
Equivalence of Continuous, Local and Infinitesimal Rigidity in Normed Spaces. 655-679 - Vuong Bui
On the Carathéodory Number for Strong Convexity. 680-692 - Daniel Lütgehetmann, David Recio-Mitter
Topological Complexity of Configuration Spaces of Fully Articulated Graphs and Banana Graphs. 693-712 - Yun Xu
On Monotone Translation-Projection Covariant Minkowski Valuations. 713-729 - Steven Hoehner
A Concentration Inequality for Random Polytopes, Dirichlet-Voronoi Tiling Numbers and the Geometric Balls and Bins Problem. 730-763 - Grigoriy Blekherman, Cordian Riener
Symmetric Non-Negative Forms and Sums of Squares. 764-799 - Sébastien Labbé
Substitutive Structure of Jeandel-Rao Aperiodic Tilings. 800-855 - Jérémie Chalopin, Victor Chepoi
Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs. 856-892 - David Garber, Uzi Vishne
Property Testing and Expansion in Cubical Complexes. 893-915 - Jesús A. De Loera, Thomas A. Hogan
Tverberg-Type Theorems with Altered Intersection Patterns (Nerves). 916-937 - Frieder Ladisch
Lattices of Finite Abelian Groups. 938-951
Volume 65, Number 4, June 2021
- Mark A. Iwen, Felix Krahmer, Sara Krause-Solberg, Johannes Maly
On Recovery Guarantees for One-Bit Compressed Sensing on Manifolds. 953-998 - Vida Dujmovic, Fabrizio Frati
Every Collinear Set in a Planar Graph is Free. 999-1027 - Roman Prosanov
On a Relation Between Packing and Covering Densities of Convex Bodies. 1028-1037 - Lukasz Patryk Michalak
Combinatorial Modifications of Reeb Graphs and the Realization Problem. 1038-1060 - Mario Huicochea:
On the Number of Monochromatic Lines in $\pmb {\mathbb {R}}^d$. 1061-1086 - Gabriele Balletti
Enumeration of Lattice Polytopes by Their Volume. 1087-1122 - Lon H. Mitchell
The Colin de Verdière Number and Joins of Graphs. 1123-1135 - Pankaj K. Agarwal, Haim Kaplan, Micha Sharir:
Union of Hypercubes and 3D Minkowski Sums with Random Sizes. 1136-1165 - Adam Brown, Bei Wang:
Sheaf-Theoretic Stratification Learning from Geometric and Topological Perspectives. 1166-1198 - Nicolas Chevallier, Augustin Fruchard, Dominique Schmitt, Jean-Claude Spehner:
Separation by Convex Pseudo-Circles. 1199-1231 - Mozhgan Mirzaei
On Grids in Point-Line Arrangements in the Plane. 1232-1243 - Chenglin Fan, Benjamin Raichel
Computing the Fréchet Gap Distance. 1244-1274 - Filip D. Jevtic
Polytopal Bier Spheres and Kantorovich-Rubinstein Polytopes of Weighted Cycles. 1275-1286 - Thomas Fernique:
Compact Packings of Space with Two Sizes of Spheres. 1287-1295 - Herbert Edelsbrunner
The Multi-Cover Persistence of Euclidean Balls. 1296-1313 - Leon Zhang
Computing Min-Convex Hulls in the Affine Building of $\hbox {SL}_d$. 1314-1336 - Chaya Keller
Conflict-Free Coloring of String Graphs. 1337-1372
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-16 22:17 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: