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 40 matches
- 1999
- A. A'Campo-Neuen:
On Generalized h -Vectors of Rational Polytopes with a Symmetry of Prime Order. Discret. Comput. Geom. 22(2): 259-268 (1999) - Pankaj K. Agarwal, Boris Aronov, Micha Sharir:
Motion Planning for a Convex Polygon in a Polygonal Environment. Discret. Comput. Geom. 22(2): 201-221 (1999) - Christina Ahrens, Gary Gordon, Elizabeth W. McMahon:
Convexity and the Beta Invariant. Discret. Comput. Geom. 22(3): 411-424 (1999) - A. El Kacimi Alaoui, R. Parthasarathy:
Coloring Quasicrystals with Prescribed Symmetries and Frequencies. Discret. Comput. Geom. 22(3): 459-475 (1999) - Jorge L. Ramírez Alfonsín:
Spatial Graphs and Oriented Matroids: the Trefoil. Discret. Comput. Geom. 22(1): 149-158 (1999) - Nina Amenta, Marshall W. Bern:
Surface Reconstruction by Voronoi Filtering. Discret. Comput. Geom. 22(4): 481-504 (1999) - Boris Aronov, Mark de Berg, A. Frank van der Stappen, Petr Svestka, Jules Vleugels:
Motion Planning for Multiple Robots. Discret. Comput. Geom. 22(4): 505-525 (1999) - G. David Bailey:
Coherence and Enumeration of Tilings of 3-Zonotopes. Discret. Comput. Geom. 22(1): 119-147 (1999) - Saugata Basu:
On Bounding the Betti Numbers and Computing the Euler Characteristic of Semi-Algebraic Sets. Discret. Comput. Geom. 22(1): 1-18 (1999) - C. Bauer:
Infinitesimal Rigidity of Convex Polytopes. Discret. Comput. Geom. 22(2): 177-192 (1999) - Karl-Friedrich Böhringer, Bruce Randall Donald, Dan Halperin:
On the Area Bisectors of a Polygon. Discret. Comput. Geom. 22(2): 269-285 (1999) - Vladimir G. Boltyanski, Horst Martini, Valeriu Soltan:
On Grünbaum's Conjecture about Inner Illumination of Convex Bodies. Discret. Comput. Geom. 22(3): 403-410 (1999) - Hervé Brönnimann:
Degenerate Convex Hulls On-Line in Any Fixed Dimension. Discret. Comput. Geom. 22(4): 527-545 (1999) - Svante Carlsson, Håkan Jonsson, Bengt J. Nilsson:
Finding the Shortest Watchman Route in a Simple Polygon. Discret. Comput. Geom. 22(3): 377-402 (1999) - Timothy M. Chan:
Geometric Applications of a Randomized Optimization Technique. Discret. Comput. Geom. 22(4): 547-567 (1999) - Yunhi Cho, Hyuk Kim:
On the Volume Formula for Hyperbolic Tetrahedra. Discret. Comput. Geom. 22(3): 347-366 (1999) - Kenneth L. Clarkson:
Nearest Neighbor Queries in Metric Spaces. Discret. Comput. Geom. 22(1): 63-93 (1999) - Kenneth L. Clarkson:
Guest Editor's Foreword. Discret. Comput. Geom. 22(4): 479-480 (1999) - John H. Conway, Charles Radin, Lorenzo Sadun:
On Angles Whose Squared Trigonometric Functions Are Rational. Discret. Comput. Geom. 22(3): 321-332 (1999) - Luc Devroye, Philippe Flajolet, Ferran Hurtado, Marc Noy, William L. Steiger:
Properties of Random Triangulations and Trees. Discret. Comput. Geom. 22(1): 105-117 (1999) - T. Dubejko:
Discrete Solutions of Dirichlet Problems, Finite Volumes, and Circle Packings. Discret. Comput. Geom. 22(1): 19-39 (1999) - David Eppstein, Jeff Erickson:
Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions. Discret. Comput. Geom. 22(4): 569-592 (1999) - Stefan Felsner, Klaus Kriegel:
Triangles in Euclidean Arrangements. Discret. Comput. Geom. 22(3): 429-438 (1999) - Steven Fortune:
Vertex-Rounding a Three-Dimensional Polyhedral Subdivision. Discret. Comput. Geom. 22(4): 593-618 (1999) - Hubert de Fraysseix, Patrice Ossona de Mendez:
On a Characterization of Gauss Codes. Discret. Comput. Geom. 22(2): 287-295 (1999) - Masahiro Hachimori:
Nonconstructible Simplicial Balls and a Way of Testing Constructibility. Discret. Comput. Geom. 22(2): 223-230 (1999) - Ferran Hurtado, Marc Noy, Jorge Urrutia:
Flipping Edges in Triangulations. Discret. Comput. Geom. 22(3): 333-346 (1999) - Denis Jordan, Marcel Steiner:
Configuration Spaces of Mechanical Linkages. Discret. Comput. Geom. 22(2): 297-315 (1999) - André Kündgen:
Art Galleries with Interior Walls. Discret. Comput. Geom. 22(2): 249-258 (1999) - Krystyna Trybulec Kuperberg, Wlodzimierz Kuperberg, Jirí Matousek, Pavel Valtr:
Almost-Tiling the Plane by Ellipses. Discret. Comput. Geom. 22(3): 367-375 (1999)
skipping 10 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-21 02:16 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