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 37 matches
- 2020
- Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi:
Minimum Perimeter-Sum Partitions in the Plane. Discret. Comput. Geom. 63(2): 483-505 (2020) - Pankaj K. Agarwal, Jiangwei Pan:
Near-Linear Algorithms for Geometric Hitting Sets and Set Covers. Discret. Comput. Geom. 63(2): 460-482 (2020) - Xavier Allamigeon, Stéphane Gaubert, Mateusz Skomra:
Tropical Spectrahedra. Discret. Comput. Geom. 63(3): 507-548 (2020) - Alexei Andreanov, Yoav Kallus:
Locally Optimal 2-Periodic Sphere Packings. Discret. Comput. Geom. 63(1): 182-208 (2020) - Sayan Bandyapadhyay, Santanu Bhowmick, Tanmay Inamdar, Kasturi R. Varadarajan:
Capacitated Covering Problems in Geometric Spaces. Discret. Comput. Geom. 63(4): 768-798 (2020) - Károly Bezdek, Zsolt Lángi:
Bounds for Totally Separable Translative Packings in the Plane. Discret. Comput. Geom. 63(1): 49-72 (2020) - Alexander I. Bobenko, Helmut Pottmann, Thilo Rörig:
Multi-Nets. Classification of Discrete and Smooth Surfaces with Characteristic Properties on Arbitrary Parameter Rectangles. Discret. Comput. Geom. 63(3): 624-655 (2020) - Peter A. Brooksbank, J. T. Ferrara, Dimitri Leemans:
Orthogonal Groups in Characteristic 2 Acting on Polytopes of High Rank. Discret. Comput. Geom. 63(3): 656-669 (2020) - Timothy M. Chan:
Tree Drawings Revisited. Discret. Comput. Geom. 63(4): 799-820 (2020) - Jérémy Cochoy, Steve Oudot:
Decomposition of Exact pfd Persistence Bimodules. Discret. Comput. Geom. 63(2): 255-293 (2020) - Bruno Durand, Alexander Shen, Nikolai K. Vereshchagin:
On the Structure of Ammann A2 Tilings. Discret. Comput. Geom. 63(3): 577-606 (2020) - Desamparados Fernández-Ternero, Enrique Macías-Virgós, Nicholas A. Scoville, José Antonio Vilches:
Strong Discrete Morse Theory and Simplicial L-S Category: A Discrete Version of the Lusternik-Schnirelmann Theorem. Discret. Comput. Geom. 63(3): 607-623 (2020) - Ximena Fernández, Elias Gabriel Minian:
The Cylinder of a Relation and Generalized Versions of the Nerve Theorem. Discret. Comput. Geom. 63(3): 549-559 (2020) - Dejan Govc, Waclaw Marzantowicz, Petar Pavesic:
Estimates of Covering Type and the Number of Vertices of Minimal Triangulations. Discret. Comput. Geom. 63(1): 31-48 (2020) - Sariel Har-Peled, Mitchell Jones:
On Separating Points by Lines. Discret. Comput. Geom. 63(3): 705-730 (2020) - Eran Iceland, Alex Samorodnitsky:
On Coset Leader Graphs of Structured Linear Codes. Discret. Comput. Geom. 63(3): 560-576 (2020) - Grigory Ivanov:
On the Volume of the John-Löwner Ellipsoid. Discret. Comput. Geom. 63(2): 455-459 (2020) - Joseph W. Iverson, John Jasper, Dustin G. Mixon:
Optimal Line Packings from Nonabelian Groups. Discret. Comput. Geom. 63(3): 731-763 (2020) - Michael R. Jimenez, Christian Müller, Helmut Pottmann:
Discretizations of Surfaces with Constant Ratio of Principal Curvatures. Discret. Comput. Geom. 63(3): 670-704 (2020) - Chaya Keller, Shakhar Smorodinsky:
From a (p, 2)-Theorem to a Tight (p, q)-Theorem. Discret. Comput. Geom. 63(4): 821-847 (2020) - Kolja Knauer, Tilen Marc:
On Tope Graphs of Complexes of Oriented Matroids. Discret. Comput. Geom. 63(2): 377-417 (2020) - Khazhgali Kozhasov, Antonio Lerario:
On the Number of Flats Tangent to Convex Hypersurfaces in Random Position. Discret. Comput. Geom. 63(1): 229-254 (2020) - Reynald Lercier, Christophe Ritzenthaler, Jeroen Sijsling:
Reconstructing Plane Quartics from Their Invariants. Discret. Comput. Geom. 63(1): 73-113 (2020) - Gaku Liu:
Flip-Connectivity of Triangulations of the Product of a Tetrahedron and Simplex. Discret. Comput. Geom. 63(1): 1-30 (2020) - Galyna V. Livshyts, Konstantin E. Tikhomirov:
Cube is a Strict Local Maximizer for the Illumination Number. Discret. Comput. Geom. 63(1): 209-228 (2020) - Giordano Da Lozzo, Anthony D'Angelo, Fabrizio Frati:
On Planar Greedy Drawings of 3-Connected Planar Graphs. Discret. Comput. Geom. 63(1): 114-157 (2020) - Leonardo Martínez-Sandoval, Edgardo Roldán-Pensado, Natan Rubin:
Further Consequences of the Colorful Helly Hypothesis. Discret. Comput. Geom. 63(4): 848-866 (2020) - Assaf Naor, Gilles Pisier, Gideon Schechtman:
Impossibility of Dimension Reduction in the Nuclear Norm. Discret. Comput. Geom. 63(2): 319-345 (2020) - Anthony Nixon, Stephen C. Power:
Double-Distance Frameworks and Mixed Sparsity Graphs. Discret. Comput. Geom. 63(2): 294-318 (2020) - Eunjin Oh, Hee-Kap Ahn:
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon. Discret. Comput. Geom. 63(2): 418-454 (2020)
skipping 7 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 2024-10-10 20:57 CEST 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