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 35 matches
- 2001
- Pankaj K. Agarwal, Dan Halperin, Richard Pollack:
Guest Editors' Foreword. Discret. Comput. Geom. 25(4): 505-506 (2001) - Madjid Allili, Tomasz Kaczynski:
Geometric Construction of a Coboundary of a Cycle. Discret. Comput. Geom. 25(1): 125-140 (2001) - Boris Aronov, Tamal K. Dey:
Polytopes in Arrangements. Discret. Comput. Geom. 25(1): 51-63 (2001) - Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir:
On the Number of Regular Vertices of the Union of Jordan Regions. Discret. Comput. Geom. 25(2): 203-220 (2001) - Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger:
A Helly-Type Theorem for Hyperplane Transversals to Well-Separated Convex Sets. Discret. Comput. Geom. 25(4): 507-517 (2001) - Imre Bárány, Jirí Matousek:
Simultaneous Partitions of Measures by k-Fans. Discret. Comput. Geom. 25(3): 317-334 (2001) - Gill Barequet, Matthew Dickerson, Michael T. Goodrich:
Voronoi Diagrams for Convex Polygon-Offset Distance Functions. Discret. Comput. Geom. 25(2): 271-291 (2001) - Alexander I. Barvinok:
A Remark on the Rank of Positive Semidefinite Matrices Subject to Affine Constraints. Discret. Comput. Geom. 25(1): 23-31 (2001) - O. Baues, Norbert Peyerimhoff:
Curvature and Geometry of Tessellating Plane Graphs. Discret. Comput. Geom. 25(1): 141-159 (2001) - Sergei Bespamyatnikh:
An Efficient Algorithm for the Three-Dimensional Diameter Problem. Discret. Comput. Geom. 25(2): 235-255 (2001) - Gerd Blind, Roswitha Blind:
Isoperimetric Quotients for a Decomposed Convex Body. Discret. Comput. Geom. 25(2): 257-270 (2001) - Daciana Bochis, Francisco Santos:
On the Number of Facets of Three-Dimensional Dirichlet Stereohedra I: Groups with Reflections. Discret. Comput. Geom. 25(3): 419-444 (2001) - Károly J. Böröczky:
About the Error Term for Best Approximation with Respect to the Hausdorff Related Metrics. Discret. Comput. Geom. 25(2): 293-309 (2001) - Bernard Chazelle, Alexey Lvov:
The Discrepancy of Boxes in Higher Dimension. Discret. Comput. Geom. 25(4): 519-524 (2001) - Ho-Lun Cheng, Tamal K. Dey, Herbert Edelsbrunner, John Sullivan:
Dynamic Skin Triangulation. Discret. Comput. Geom. 25(4): 525-568 (2001) - C. C. Cheng, Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov:
Drawing Planar Graphs with Circular Arcs. Discret. Comput. Geom. 25(3): 405-418 (2001) - H. S. M. Coxeter, Branko Grünbaum:
Face-Transitive Polyhedra with Rectangular Faces and Icosahedral Symmetry. Discret. Comput. Geom. 25(2): 163-172 (2001) - Veit Elser:
Crystallography and Riemann Surfaces. Discret. Comput. Geom. 25(3): 445-476 (2001) - J. Esch, T. D. Rogers:
The Screensaver Map: Dynamics on Elliptic Curves Arising from Polygonal Folding. Discret. Comput. Geom. 25(3): 477-502 (2001) - Bernd Gärtner, Emo Welzl:
A Simple Sampling Lemma: Analysis and Applications in Geometric Optimization. Discret. Comput. Geom. 25(4): 569-590 (2001) - Leonidas J. Guibas, John Hershberger, Subhash Suri, Li Zhang:
Kinetic Connectivity for Unit Disks. Discret. Comput. Geom. 25(4): 591-610 (2001) - Thomas C. Hales:
The Honeycomb Conjecture. Discret. Comput. Geom. 25(1): 1-22 (2001) - Petr Hlinený:
An Addition to Art Galleries with Interior Walls. Discret. Comput. Geom. 25(2): 311-334 (2001) - R. Holley, Jerome I. Malitz, Seth M. Malitz:
An Approach to Hierarchical Clustering via Level Surfaces and Convexity. Discret. Comput. Geom. 25(2): 221-233 (2001) - Dan Ismailescu:
Inequalities between Lattice Packing and Covering Densities of Centrally Symmetric Plane Convex Bodies. Discret. Comput. Geom. 25(3): 365-388 (2001) - Jeong-Yup Lee, Robert V. Moody:
Lattice Substitution Systems and Model Sets. Discret. Comput. Geom. 25(2): 173-201 (2001) - E. Makai, Vrecica T. Vrecica, Rade T. Zivaljevic:
Plane Sections of Convex Bodies of Maximal Volume. Discret. Comput. Geom. 25(1): 33-49 (2001) - Jirí Matousek:
On Directional Convexity. Discret. Comput. Geom. 25(3): 389-403 (2001) - Walter D. Morris Jr.:
Convex Dimension of Locally Planar Convex Geometries. Discret. Comput. Geom. 25(1): 85-101 (2001) - János Pach, Rom Pinchasi:
On the Number of Balanced Lines. Discret. Comput. Geom. 25(4): 611-628 (2001)
skipping 5 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-11-17 08:01 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