Остановите войну!
for scientists:
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 29 matches
- 1997
- Manuel Abellanas, Gregorio Hernández-Peñalver, Rolf Klein, Victor Neumann-Lara, Jorge Urrutia:
A Combinatorial Property of Convex Sets. Discret. Comput. Geom. 17(3): 307-318 (1997) - Wojciech Banaszczyk, Stanislaw J. Szarek:
Lattice Coverings and Gaussian Measures of n-Dimensional Convex Bodies. Discret. Comput. Geom. 17(3): 283-286 (1997) - Yuliy M. Baryshnikov:
Gaussian Samples, Regular Simplices, and Exchangeability. Discret. Comput. Geom. 17(3): 257-261 (1997) - Ulrich Betke, Martin Henk, L. Tsintsifa:
Inradii of Simplices. Discret. Comput. Geom. 17(4): 365-375 (1997) - Jürgen Bokowski, Jean-Pierre Roudneff, T.-K. Strempel:
Cell Decompositions of the Projective Plane with Petrie Polygons of Constant Length. Discret. Comput. Geom. 17(4): 377-392 (1997) - Karl Heinz Borgwardt:
Average Complexity of a Gift-Wrapping Algorithm for Determining the Convex Hull of Randomly Given Points. Discret. Comput. Geom. 17(1): 79-109 (1997) - Peter Braß:
On the Quantitative Steinitz Theorem in the Plane. Discret. Comput. Geom. 17(1): 111-117 (1997) - Andreas Brieden, Peter Gritzmann:
On Helly's Theorem: Algorithms and Extensions. Discret. Comput. Geom. 17(4): 393-410 (1997) - Bernard Chazelle:
Lower Bounds for Off-Line Range Searching. Discret. Comput. Geom. 17(1): 53-65 (1997) - T. Dubejko:
Approximation of Analytic Functions with Prescribed Boundary Conditions by Circle-Packing Maps. Discret. Comput. Geom. 17(1): 67-77 (1997) - Rex A. Dwyer:
Voronoi Diagrams of Random Lines and Flats. Discret. Comput. Geom. 17(2): 123-136 (1997) - Paul H. Edelman, Victor Reiner:
Erratum to Free Arrangement and Rhombic Tilings. Discret. Comput. Geom. 17(3): 359 (1997) - Herbert Edelsbrunner, Edgar A. Ramos:
Inclusion - Exclusion Complexes for Pseudodisk Collections. Discret. Comput. Geom. 17(3): 287-306 (1997) - Herbert Edelsbrunner, Pavel Valtr, Emo Welzl:
Cutting Dense Point Sets in Half. Discret. Comput. Geom. 17(3): 243-255 (1997) - David Eppstein, Mike Paterson, F. Frances Yao:
On Nearest-Neighbor Graphs. Discret. Comput. Geom. 17(3): 263-282 (1997) - Chris Freiling, Miklós Laczkovich, Dan Rinne:
Rectangling a Rectangle. Discret. Comput. Geom. 17(2): 217-225 (1997) - Subir Kumar Ghosh:
On Recognizing and Characterizing Visibility Graphs of Simple Polygons. Discret. Comput. Geom. 17(2): 143-162 (1997) - Dima Grigoriev, Marek Karpinski, Nicolai N. Vorobjov Jr.:
Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision and Computation Trees. Discret. Comput. Geom. 17(2): 191-215 (1997) - Peter Gritzmann:
Guest Editor's Foreword. Discret. Comput. Geom. 17(4): 363-364 (1997) - Peter M. Gruber:
Stability of Blaschke's Characterization of Ellipsoids and Radon Norms. Discret. Comput. Geom. 17(4): 411-427 (1997) - Thomas C. Hales:
Sphere Packings, I. Discret. Comput. Geom. 17(1): 1-51 (1997) - Xin He:
Grid Embedding of 4-Connected Plane Graphs. Discret. Comput. Geom. 17(3): 339-358 (1997) - Andreas Hefner, Peter Kleinschmidt:
A Polyhedral Approach for a Constrained Matching Problem. Discret. Comput. Geom. 17(4): 429-437 (1997) - Birkett Huber, Bernd Sturmfels:
Bernstein's Theorem in Affine Space. Discret. Comput. Geom. 17(2): 137-141 (1997) - Katsunori Iwasaki:
Polytopes and the Mean Value Property. Discret. Comput. Geom. 17(2): 163-189 (1997) - Klara Kedem, Micha Sharir, Sivan Toledo:
On Critical Orientations in the Kedem-Sharir Motion Planning Algorithm. Discret. Comput. Geom. 17(2): 227-239 (1997) - Ulrich Kortenkamp, Jürgen Richter-Gebert, Aravamuthan Sarangarajan, Günter M. Ziegler:
Extremal Properties of 0/1-Polytopes. Discret. Comput. Geom. 17(4): 439-448 (1997) - Peter McMullen, Egon Schulte:
Regular Polytopes in Ordinary Space. Discret. Comput. Geom. 17(4): 449-478 (1997) - Marco Pellegrini:
Monte Carlo Approximation of Form Factors with Error Bounded a Priori. Discret. Comput. Geom. 17(3): 319-337 (1997)
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-04-25 01:17 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