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 36 matches
- 1991
- Colin Adams, William Sherman:
Minimum Ideal Triangulations of Hyperbolic 3-Manifolds. Discret. Comput. Geom. 6: 135-153 (1991) - Fernando Affentranger, John A. Wieacker:
On the Convex Hull of Uniform Randowm Points in a Simple d-polytope. Discret. Comput. Geom. 6: 291-305 (1991) - Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf:
Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. Discret. Comput. Geom. 6: 407-422 (1991) - Boris Aronov, Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Rephael Wenger:
Points and Triangles in the Plane and Halving Planes in Space. Discret. Comput. Geom. 6: 435-442 (1991) - Margaret M. Bayer, Andrew Klapper:
A New Index for Polytopes. Discret. Comput. Geom. 6: 33-47 (1991) - Danièle Beauquier, Maurice Nivat:
On Translating One Polyomino to Tile the Plane. Discret. Comput. Geom. 6: 575-592 (1991) - Riccardo Benedetti, François Loeser, Jean-Jacques Risler:
Bounding the Number of Connected Components of a Real Algebraic Set. Discret. Comput. Geom. 6: 191-209 (1991) - András Bezdek, Wlodzimierz Kuperberg, E. Makai:
Maximum Density Space Packing with Parallel Strings of Spheres. Discret. Comput. Geom. 6: 277-283 (1991) - Daniel Bienstock:
Some Provably Hard Crossing Number Problems. Discret. Comput. Geom. 6: 443-459 (1991) - Louis J. Billera, Lauren L. Rose:
A Dimension Series for Multivariate Splines. Discret. Comput. Geom. 6: 107-128 (1991) - R. S. Booth:
Analytic Formulas for Full Steiner Trees. Discret. Comput. Geom. 6: 69-82 (1991) - John F. Canny, Ashutosh Rege, John H. Reif:
An Exact Algorithm for Kinodynamic Planning in the Plane. Discret. Comput. Geom. 6: 461-484 (1991) - Bernard Chazelle:
Triangulating a Simple Polygon in Linear Time. Discret. Comput. Geom. 6: 485-524 (1991) - Wei-pang Chin, Simeon C. Ntafos:
Shortest Watchman Routes in Simple Polygons. Discret. Comput. Geom. 6: 9-31 (1991) - Rex A. Dwyer:
Higher-Dimensional Voronoi Diagrams in Linear Expected Time. Discret. Comput. Geom. 6: 343-367 (1991) - Zoltán Füredi:
The Densest Packing of Equal Circles into a Parallel Strip. Discret. Comput. Geom. 6: 95-106 (1991) - Mark D. Haiman:
A Simple and Relatively Efficient Triangulation of the n-Cube. Discret. Comput. Geom. 6: 287-289 (1991) - Michael E. Houle:
Theorems on the Existence of Separating Surfaces. Discret. Comput. Geom. 6: 49-56 (1991) - Ralph Kopperman, Paul R. Meyer, Richard G. Wilson:
A Jordan Surface Theorem for Three-Dimensional Digital Spaces. Discret. Comput. Geom. 6: 155-161 (1991) - Marek Lassak, Jixian Zhang:
An On-line Potato-Sack Theorem. Discret. Comput. Geom. 6: 1-7 (1991) - Hiroshi Maehara:
Dispersed Points and Geometric Embedding of Complete Bipartite Graphs. Discret. Comput. Geom. 6: 57-67 (1991) - Hiroshi Maehara:
On Graver's Conjecture Concerning the Rigidity Problem of Graphs. Discret. Comput. Geom. 6: 339-342 (1991) - Horst Martini:
Convex Polytopes Whose Projection Bodies and Difference Set Are Polars. Discret. Comput. Geom. 6: 83-91 (1991) - Jirí Matousek:
Lower Bounds on the Length of Monotone Paths in Arrangement. Discret. Comput. Geom. 6: 129-134 (1991) - Jirí Matousek:
Cutting Hyperplane Arrangements. Discret. Comput. Geom. 6: 385-406 (1991) - Kurt Mehlhorn, Stefan Meiser, Colm Ó'Dúnlaing:
On the Construction of Abstract Voronoi Diagrams. Discret. Comput. Geom. 6: 211-224 (1991) - Ketan Mulmuley:
On Levels in Arrangement and Voronoi Diagrams. Discret. Comput. Geom. 6: 307-338 (1991) - Lee R. Nackman, Vijay Srinivasan:
Bisectors of Linearly Separable Sets. Discret. Comput. Geom. 6: 263-275 (1991) - Peter Schmitt:
Disks with Special Properties of Densest Packings. Discret. Comput. Geom. 6: 181-190 (1991) - Alexander Schrijver:
Disjoint Homotopic Paths and Trees in a Planar Graph. Discret. Comput. Geom. 6: 527-574 (1991)
skipping 6 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-08 04:04 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