default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete & Computational Geometry, Volume 70
Volume 70, Number 1, July 2023
- David Cohen-Steiner, André Lieutier
, Julien Vuillamy:
Delaunay and Regular Triangulations as Lexicographic Optimal Chains. 1-50 - Arturo Merino, Torsten Mütze:
Combinatorial Generation via Permutation Languages. III. Rectangulations. 51-122 - Hana Dal Poz Kourimská:
Discrete Yamabe Problem for Polyhedral Surfaces. 123-153 - Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Pawel Rzazewski:
Completeness for the Complexity Class $\forall \exists \mathbb {R}$ and Area-Universality. 154-188 - Yuri Malykhin, Evgeny V. Shchepin:
Search of Fractal Space-Filling Curves with Minimal Dilation. 189-213 - Hidefumi Ohsugi, Akiyoshi Tsuchiya:
PQ-Type Adjacency Polytopes of Join Graphs. 214-235 - Christian Bingane:
Tight Bounds on the Maximal Area of Small Polygons: Improved Mossinghoff Polygons. 236-248 - Paolo Amore, Tenoch Morales:
Efficient Algorithms for the Dense Packing of Congruent Circles Inside a Square. 249-267 - Pavel Hrubes, Navid Talebanfard:
On the Extension Complexity of Polytopes Separating Subsets of the Boolean Cube. 268-278 - Tomasz Kobos:
A Uniform Lower Bound on the Norms of Hyperplane Projections of Spherical Polytopes. 279-296 - Eran Nevo:
Embedding Divisor and Semi-Prime Testability in f-Vectors of Polytopes. 297-303
Volume 70, Number 2, September 2023
- Kevin Buchin, Éric Colin de Verdière:
Guest Editors' Foreword. 305-306 - Ranendu Adhikary, Kaustav Bose, Satwik Mukherjee, Bodhayan Roy:
Complexity of Maximum Cut on Interval Graphs. 307-322 - Erin Wolf Chambers, Francis Lazarus, Arnaud de Mesmay, Salman Parsa:
Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries. 323-354 - Timothy M. Chan:
Faster Algorithms for Largest Empty Rectangles and Boxes. 355-375 - René Corbet, Michael Kerber, Michael Lesnick, Georg Osang:
Computing the Multicover Bifiltration. 376-405 - Aditi Laddha, Santosh S. Vempala:
Convergence of Gibbs Sampling: Coordinate Hit-and-Run Mixes Fast. 406-425 - Haitao Wang:
An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons. 426-454
Volume 70, Number 3, October 2023
- Nóra Frankl, Andrey Kupavskii:
Nearly k-Distance Sets. 455-494 - Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Vincent Despré, Darryl Hill, Michiel Smid:
Improved Routing on the Delaunay Triangulation. 495-549 - Édouard Bonnet, Sergio Cabello, Wolfgang Mulzer:
Maximum Matchings in Geometric Intersection Graphs. 550-579 - Álvaro Torras-Casas:
Distributing Persistent Homology via Spectral Sequences. 580-619 - Guotai Deng, Chuntai Liu, Sze-Man Ngai:
Self-Affine Tiles Generated by a Finite Number of Matrices. 620-644 - Ippei Obayashi, Michio Yoshiwaki:
Field Choice Problem in Persistent Homology. 645-670 - Pim van der Hoorn, Gabor Lippner, Carlo A. Trugenberger, Dmitri Krioukov:
Ollivier Curvature of Random Geometric Graphs Converges to Ricci Curvature of Their Riemannian Manifolds. 671-712 - Colin Defant:
Fertilitopes. 713-752 - Nóra Frankl, Tamás Hubai, Dömötör Pálvölgyi:
Almost-Monochromatic Sets and the Chromatic Number of the Plane. 753-772 - C. J. Argue, Anupam Gupta, Marco Molinaro:
Lipschitz Selectors May Not Yield Competitive Algorithms for Convex Body Chasing. 773-789 - Brett Leroux, Luis Rademacher:
Improved Bounds for the Expected Number of k-Sets. 790-815 - Mason Pember, Denis Polly, Masashi Yasumoto:
Discrete Weierstrass-Type Representations. 816-844 - Matthias Schymura, Ina Seidel, Stefan Weltge:
Lifts for Voronoi Cells of Lattices. 845-865 - Marek Filakovský, Lukás Vokrínek:
Computing Homotopy Classes for Diagrams. 866-920 - Roman N. Karasev, Arkadiy Skopenkov:
Some 'Converses' to Intrinsic Linking Theorems. 921-930 - Vladimir Yu. Protasov, Tatyana Zaitseva:
Complete Characterization of Polyhedral Self-Affine Tiles. 931-950 - Christian Buchta:
The Duality of the Volumes and the Numbers of Vertices of Random Polytopes. 951-959 - Ida Kantor:
Lines in the Plane with the L1 Metric. 960-974 - Heng Guo, Mark Jerrum:
Counting Vertices of Integral Polytopes Defined by Facets. 975-990 - Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Vincenzo Roselli:
Morphing Triangle Contact Representations of Triangulations. 991-1024 - Audie Warren, James Wheeler:
Incidences of Möbius Transformations in ${\mathbb {F}}_p$. 1025-1037 - Jörg Rambau:
The Visible-Volume Function of a Set of Cameras is Continuous, Piecewise Rational, Locally Lipschitz, and Semi-Algebraic in All Dimensions. 1038-1058 - Florestan Brunck:
Iterated Medial Triangle Subdivision in Surfaces of Constant Curvature. 1059-1089 - Christopher J. Bishop:
Uniformly Acute Triangulations of PSLGs. 1090-1120 - Helena Bergold, Stefan Felsner, Manfred Scheucher, Felix Schröder, Raphael Steiner:
Topological Drawings Meet Classical Theorems from Convex Geometry. 1121-1143
Volume 70, Number 4, December 2023
- Jerome Alex, Karsten Große-Brauckmann:
Periodic Steiner Networks Minimizing Length. 1145-1168 - Dan Halperin, Micha Sharir, Itay Yehuda:
Throwing a Sofa Through the Window. 1169-1220 - Richard Ehrenborg, Sophie Morel, Margaret A. Readdy:
Pizza and 2-Structures. 1221-1244 - Alexander E. Black, Jesús A. De Loera:
Monotone Paths on Cross-Polytopes. 1245-1265 - Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Jens Vygen:
Approximating Maximum Integral Multiflows on Bounded Genus Graphs. 1266-1291 - Lukas Barth, Benjamin Niedermann, Ignaz Rutter, Matthias Wolf:
A Topology-Shape-Metrics Framework for Ortho-Radial Graph Drawing. 1292-1355 - Taylor Brysiewicz, Holger Eble, Lukas Kühne:
Computing Characteristic Polynomials of Hyperplane Arrangements with Symmetries. 1356-1377 - Facundo Mémoli, Axel Munk, Zhengchao Wan, Christoph Weitkamp:
The Ultrametric Gromov-Wasserstein Distance. 1378-1450 - Léo Mathis, Chiara Meroni:
Fiber Convex Bodies. 1451-1475 - Zakhar Kabluchko:
An Identity for the Coefficients of Characteristic Polynomials of Hyperplane Arrangements. 1476-1498 - Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara:
Efficient Folding Algorithms for Convex Polyhedra. 1499-1522 - James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak:
Grounded L-Graphs Are Polynomially χ-Bounded. 1523-1550 - David Conlon, Jeck Lim:
Fixing a Hole. 1551-1570 - Christopher J. Bishop:
Uniformly Acute Triangulations of Polygons. 1571-1592 - Rafael S. González D'León, Christopher R. H. Hanusa, Alejandro H. Morales, Martha Yip:
Column-Convex Matrices, G-Cyclic Orders, and Flow Polytopes. 1593-1631 - Debsoumya Chakraborti, Jaehoon Kim, Jinha Kim, Minki Kim, Hong Liu:
Fractional Helly Theorem for Cartesian Products of Convex Sets. 1632-1651 - Rachel Greenfeld, Terence Tao:
Undecidable Translational Tilings with Only Two Tiles, or One Nonabelian Tile. 1652-1706 - Víctor Hugo Almendra-Hernández, Gergely Ambrus, Matthew Kendall:
Quantitative Helly-Type Theorems via Sparse Approximation. 1707-1714 - Henry L. Fleischmann, Hongyi B. Hu, Faye Jackson, Steven J. Miller, Eyvindur A. Palsson, Ethan Pesikoff, Charles Wolf:
Distinct Angle Problems and Variants. 1715-1740 - Jesús Jerónimo-Castro, Francisco G. Jimenez-Lopez, Efrén Morales-Amaya:
Some Results About Equichordal Convex Bodies. 1741-1750 - Paz Carmi, Matthew J. Katz, Pat Morin:
Stabbing Pairwise Intersecting Disks by Four Points. 1751-1784 - Gabe Cunningham, Daniel Pellicer:
Finite 3-Orbit Polyhedra in Ordinary Space I. 1785-1819 - Thomas Doehrman, David Glickenstein:
Determinant of the Finite Volume Laplacian. 1820-1839 - Nancy Abdallah, Hal Schenck:
Nets in $\mathbb {P}^2$ and Alexander Duality. 1840-1861 - David Bryant, Katharina T. Huber, Vincent Moulton, Paul F. Tupper:
Diversities and the Generalized Circumradius. 1862-1883
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-02 23:37 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:
