default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete & Computational Geometry, Volume 61
Volume 61, Number 1, January 2019
- Sylvain E. Cappell, Edward Y. Miller:
Enumerative Combinatorics of Simplicial and Cell Complexes: Kirchhoff and Trent Type Theorems. 1-41 - Aruni Choudhary
, Michael Kerber, Sharath Raghvendra:
Polynomial-Sized Topological Approximations Using the Permutahedron. 42-80 - Igor Balla, Benny Sudakov:
Equiangular Subspaces in Euclidean Spaces. 81-90 - Patrick O'neil, Thomas Wanner:
Analyzing the Squared Distance-to-Measure Gradient Flow System with k-Order Voronoi Diagrams. 91-119 - Ferenc Szöllösi:
A Remark on a Construction of D.S. Asche. 120-122 - Albrecht Böttcher, Simon Eisenbarth, Lenny Fukshansky, Stephan Ramon Garcia, Hiren Maharaj:
Spherical 2-Designs and Lattices from Abelian Groups. 123-135 - Elina Robeva, Bernd Sturmfels, Caroline Uhler:
Geometry of Log-Concave Density Estimation. 136-160 - Fidel Barrera-Cruz, Penny Haxell, Anna Lubiw:
Morphing Schnyder Drawings of Planar Triangulations. 161-184 - Daisuke Suyama, Shuhei Tsujie:
Vertex-Weighted Graphs and Freeness of ψ-Graphical Arrangements. 185-197 - Yong Lin, Shuang Liu, Hongye Song:
Ultracontractivity and Functional Inequalities on Infinite Graphs. 198-211 - Dmitriy Zakharov:
Acute Sets. 212-217 - David Conlon, Jacob Fox:
Lines in Euclidean Ramsey Theory. 218-225
Volume 61, Number 2, March 2019
- Dan Cristofaro-Gardiner, Teresa Xueshan Li, Richard P. Stanley:
Irrational Triangles with Polynomial Ehrhart Functions. 227-246 - Joshua Cruz, Chad Giusti, Vladimir Itskov, Bill Kronholm:
On Open and Closed Convex Codes. 247-270 - Patric R. J. Östergård, Antti Pöllänen:
New Results on Tripod Packings. 271-284 - Joseph Doolittle, Eran Nevo, Guillermo Pineda-Villavicencio, Julien Ugon, David T. Yost:
On the Reconstruction of Polytopes. 285-302 - Grigoriy Blekherman, Rainer Sinn:
Maximum Likelihood Threshold and Generic Completion Rank of Graphs. 303-324 - Martin Balko, Josef Cibulka, Pavel Valtr:
Covering Lattice Points by Subspaces and Counting Point-Hyperplane Incidences. 325-354 - Pavle V. M. Blagojevic, Günter Rote, Johanna K. Steinmeyer, Günter M. Ziegler:
Convex Equipartitions of Colored Point Sets. 355-363 - Martina Juhnke-Kubitzke, Satoshi Murai, Richard Sieg:
Local h-Vectors of Quasi-Geometric and Barycentric Subdivisions. 364-379 - Ulrike Bücking:
On Rigidity and Convergence of Circle Patterns. 380-420 - Ervin Györi, Tamás Róbert Mezei:
Mobile versus Point Guards. 421-451 - Arkadiy Skopenkov, Martin Tancer:
Hardness of almost embedding simplicial complexes in Rd. 452-463
Volume 61, Number 3, April 2019
- Jim Lawrence:
Dual-Antiprisms and Partitions of Powers of 2 into Powers of 2. 465-478 - Tom Hutchcroft:
Harmonic Dirichlet Functions on Planar Graphs. 479-506 - Thibault Manneville, Vincent Pilaud:
Geometric Realizations of the Accordion Complex of a Dissection. 507-540 - Steven Klee, Eran Nevo, Isabella Novik, Hailun Zheng:
A Lower Bound Theorem for Centrally Symmetric Simplicial Polytopes. 541-561 - Sándor P. Fekete, Sebastian Morr, Christian Scheffer:
Split Packing: Algorithms for Packing Circles with Optimal Worst-Case Density. 562-594 - Dominique Attali, Tuong-Bach Nguyen, Isabelle Sivignon:
(δ, ε)-Ball Approximation of a Shape: Definition and Complexity. 595-625 - Shigeki Akiyama, Jonathan Caalim, Katsunobu Imai, Hajime Kaneko:
Corona Limits of Tilings: Periodic Case. 626-652 - Yaroslav Shitov:
Euclidean Distance Matrices and Separations in Communication Complexity Theory. 653-660 - Benjamin Schröter:
Multi-splits and Tropical Linear Spaces from Nested Matroids. 661-685 - Márton Naszódi:
Approximating a Convex Body by a Polytope Using the Epsilon-Net Theorem. 686-693
Volume 61, Number 4, June 2019
- Boris Aronov, Matthew J. Katz:
Guest Editors' Foreword. 695-697 - Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon:
Subquadratic Algorithms for Algebraic 3SUM. 698-734 - Esther Ezra, Micha Sharir:
A Nearly Quadratic Bound for Point-Location in Hyperplane Arrangements, in the Linear Decision Tree Model. 735-755 - Kunal Dutta, Arijit Ghosh, Bruno Jartoux, Nabil H. Mustafa:
Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and Polynomial Partitioning. 756-777 - Abdul Basit, Zeev Dvir, Shubhangi Saraf, Charles Wolf:
On the Number of Ordinary Lines Determined by Sets in Complex Space. 778-808 - Jacob Fox, János Pach, Andrew Suk:
Erdős-Hajnal Conjecture for Graphs with Bounded VC-Dimension. 809-829 - Alexandre Rok, Bartosz Walczak:
Coloring Curves that Cross a Fixed Curve. 830-851 - Michael Kerber, Hannah Schreiber:
Barcodes of Towers and a Streaming Algorithm for Persistent Homology. 852-879 - Anna Lubiw, Zuzana Masárová, Uli Wagner:
A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations. 880-898 - Timothy M. Chan:
Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back. 899-922
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-04 01:29 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:
