![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 24 matches
- 1991
- Jacob E. Goodman, Richard Pollack, William Steiger:
Discrete and Computational Geometry: Papers from the DIMACS Special Year. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 6, DIMACS/AMS 1991, ISBN 978-0-8218-6595-8 [contents] - 1990
- Pankaj K. Agarwal:
Geometric Partitioning and its Applications. Discrete and Computational Geometry 1990: 1-38 - Antal Balog, Imre Bárány:
On the Convex Hull of the Integer Points in a Disc. Discrete and Computational Geometry 1990: 39-44 - Marshall W. Bern, David Eppstein, Paul E. Plassmann, F. Frances Yao:
Horizon Theorems for Lines and Polygons. Discrete and Computational Geometry 1990: 45-66 - Vasilis Capoyleas, János Pach:
On the Perimeter of a Point Set in the Plane. Discrete and Computational Geometry 1990: 67-76 - Herbert Edelsbrunner:
Lines in Space-A Collection of Results. Discrete and Computational Geometry 1990: 77-94 - Zoltán Füredi, Jeffrey C. Lagarias, Frank Morgan:
Singularities of Minimal Surfaces and Networks and Related Extremal Problems in Minkowski Space. Discrete and Computational Geometry 1990: 95-110 - Giovanni Gallo, Bhubaneswar Mishra:
Wu-Ritt Characteristic Sets and Their Complexity. Discrete and Computational Geometry 1990: 111-136 - Joos Heintz, Tomás Recio, Marie-Françoise Roy:
Algorithms in Real Algebraic Geometry and Applications to Computational Geometry. Discrete and Computational Geometry 1990: 137-164 - Takayuki Hibi:
Ehrhart Polynomials of Convex Polytopes, h-Vectors of Simplicial Complexes, and Nonsingular Projective Toric Varieties. Discrete and Computational Geometry 1990: 165-178 - Peter Kleinschmidt, Zeev Smilansky:
New Results for Simplicial Spherical Polytopes. Discrete and Computational Geometry 1990: 187-198 - Peter Kleinschmidt, Niels Schwartz, Bernd Sturmfels:
Unimodular Fans, Linear Codes, and Toric Manifolds. Discrete and Computational Geometry 1990: 179-186 - Jim Lawrence:
Rational-function-valued Valuations on Polyhedra. Discrete and Computational Geometry 1990: 199-208 - Carl W. Lee:
Winding Numbers and the Generalized Lower-Bound Conjecture. Discrete and Computational Geometry 1990: 209-220 - Jirí Matousek:
Computing the Center of Planar Point Sets. Discrete and Computational Geometry 1990: 221-230 - Peter McMullen, Egon Schulte:
Finite Quotients of Infinite Universal Polytopes. Discrete and Computational Geometry 1990: 231-236 - Nicolai E. Mnëv:
The Universality Theorem on the Oriented Matroid Stratification of the Space of Real Matrices. Discrete and Computational Geometry 1990: 237-244 - David M. Mount:
The Densest Double-Lattice Packing of a Convex Polygon. Discrete and Computational Geometry 1990: 245-262 - Peter Orlik:
Arrangements in Topology. Discrete and Computational Geometry 1990: 263-272 - János Pach:
Notes on Geometric Graph Theory. Discrete and Computational Geometry 1990: 273-286 - James Renegar:
Recent Progress on the Complexity of the Decision Problem for the Reals. Discrete and Computational Geometry 1990: 287-308 - Jack Snoeyink, John Hershberger:
Sweeping Arrangements of Curves. Discrete and Computational Geometry 1990: 309-350 - Helge Tverberg:
On Geometric Permutations and the Katchalski-Lewis Conjecture on Partial Transversals for Translates. Discrete and Computational Geometry 1990: 351-362 - Neil L. White:
Invariant-Theoretic Computation in Projective Geometry. Discrete and Computational Geometry 1990: 363-378
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-24 01:05 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