default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 50 matches
- 2022
- Aaron Abrams, Jamie Pommersheim:
Generalized Dissections and Monsky's Theorem. Discret. Comput. Geom. 67(3): 947-983 (2022) - 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. Discret. Comput. Geom. 67(1): 258-286 (2022) - Gergely Ambrus, Máté Matolcsi:
Density Estimates of 1-Avoiding Sets via Higher Order Correlations. Discret. Comput. Geom. 67(4): 1245-1256 (2022) - János Barát, Géza Tóth:
Improvement on the Crossing Number of Crossing-Critical Graphs. Discret. Comput. Geom. 67(2): 595-604 (2022) - 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. Discret. Comput. Geom. 67(3): 743-786 (2022) - Bojan Basic, Anna Slivková:
Asymptotical Unboundedness of the Heesch Number in ${\mathbb {E}}d$ for $d\rightarrow \infty $. Discret. Comput. Geom. 67(1): 328-337 (2022) - Nicolas Bédaride, Thomas Fernique:
Density of Binary Disc Packings: The Nine Compact Packings. Discret. Comput. Geom. 67(3): 787-810 (2022) - Paul C. Bell, Igor Potapov:
Towards Uniform Online Spherical Tessellations. Discret. Comput. Geom. 67(4): 1124-1146 (2022) - Clément Berenfeld, John Harvey, Marc Hoffmann, Krishnan Shankar:
Estimating the Reach of a Manifold via its Convexity Defect Function. Discret. Comput. Geom. 67(2): 403-438 (2022) - Leo Betthauser, Peter Bubenik, Parker B. Edwards:
Graded Persistence Diagrams and Persistence Landscapes. Discret. Comput. Geom. 67(1): 203-230 (2022) - Ahmad Biniaz:
Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios. Discret. Comput. Geom. 67(1): 311-327 (2022) - Ranita Biswas, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Morteza Saghafian:
Continuous and Discrete Radius Functions on Voronoi Tessellations and Delaunay Mosaics. Discret. Comput. Geom. 67(3): 811-842 (2022) - Pavle V. M. Blagojevic, Aleksandra Dimitrijevic Blagojevic, Roman N. Karasev, Jonathan Kliem:
More Bisections by Hyperplane Arrangements. Discret. Comput. Geom. 67(1): 33-64 (2022) - Tristram Bogart, João Gouveia, Juan Camilo Torres:
An Algebraic Approach to Projective Uniqueness with an Application to Order Polytopes. Discret. Comput. Geom. 67(2): 462-491 (2022) - Sergiy V. Borodachov:
Polarization Problem on a Higher-Dimensional Sphere for a Simplex. Discret. Comput. Geom. 67(2): 525-542 (2022) - Sergio Cabello, Timothy M. Chan:
Computing Shapley Values in the Plane. Discret. Comput. Geom. 67(3): 843-881 (2022) - Johannes Carmesin, Lyuben Lichev:
New Constructions Related to the Polynomial Sphere Recognition Problem. Discret. Comput. Geom. 67(4): 1097-1123 (2022) - Somnath Chakraborty, Hariharan Narayanan:
Generating an Equidistributed Net on a Sphere Using Random Rotations. Discret. Comput. Geom. 67(1): 231-257 (2022) - Giulia Codenotti, Francisco Santos, Matthias Schymura:
The Covering Radius and a Discrete Surface Area for Non-Hollow Simplices. Discret. Comput. Geom. 67(1): 65-111 (2022) - Aram Dermenjian, Christophe Hohlweg, Thomas McConville, Vincent Pilaud:
The Facial Weak Order on Hyperplane Arrangements. Discret. Comput. Geom. 67(1): 166-202 (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. Discret. Comput. Geom. 67(3): 631-697 (2022) - Stefan Felsner, Alexander Pilz, Patrick Schnider:
Arrangements of Approaching Pseudo-Lines. Discret. Comput. Geom. 67(2): 380-402 (2022) - Nóra Frankl:
Large Equilateral Sets in Subspaces of ℓ ∞ n of Small Codimension. Discret. Comput. Geom. 67(3): 882-893 (2022) - Nóra Frankl:
Correction to: Large Equilateral Sets in Subspaces of ℓ ∞ n of Small Codimension. Discret. Comput. Geom. 67(3): 894 (2022) - Ansgar Freyer, Martin Henk:
Bounds on the Lattice Point Enumerator via Slices and Projections. Discret. Comput. Geom. 67(3): 895-918 (2022) - Frederik Garbe, Jan Hladký, Joonkyung Lee:
Two Remarks on Graph Norms. Discret. Comput. Geom. 67(3): 919-929 (2022) - Emeric Gioan:
Complete Graph Drawings up to Triangle Mutations. Discret. Comput. Geom. 67(4): 985-1022 (2022) - Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn, Eunjin Oh, Micha Sharir:
The Maximum-Level Vertex in an Arrangement of Lines. Discret. Comput. Geom. 67(2): 439-461 (2022) - Anthony Harrison, Jenya Soprunova:
Lattice Size and Generalized Basis Reduction in Dimension Three. Discret. Comput. Geom. 67(1): 287-310 (2022) - Daniel Hug, Rolf Schneider:
Threshold Phenomena for Random Cones. Discret. Comput. Geom. 67(2): 564-594 (2022)
skipping 20 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2025-01-18 07:15 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint