Остановите войну!
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 40 matches
- 2005
- Pankaj K. Agarwal, Robert-Paul Berretty, Anne D. Collins:
A Near-Quadratic Algorithm for Fence Design. Discret. Comput. Geom. 33(3): 463-481 (2005) - Boris Aronov, Vladlen Koltun, Micha Sharir:
Incidences between Points and Circles in Three and Higher Dimensions. Discret. Comput. Geom. 33(2): 185-206 (2005) - Boris Aronov, Vladlen Koltun, Micha Sharir:
Cutting Triangular Cycles of Lines in Space. Discret. Comput. Geom. 33(2): 231-247 (2005) - Imre Bárány, Jirí Matousek:
The Randomized Integer Convex Hull. Discret. Comput. Geom. 33(1): 3-25 (2005) - Yair Bartal, Nathan Linial, Manor Mendel, Assaf Naor:
Some Low Distortion Metric Ramsey Problems. Discret. Comput. Geom. 33(1): 27-41 (2005) - Adam Bliss, Francis Edward Su:
Lower Bounds for Simplicial Covers and Triangulations of Cubes. Discret. Comput. Geom. 33(4): 669-686 (2005) - Jürgen Bokowski, Simon King, Susanne Mock, Ileana Streinu:
The Topological Representation of Oriented Matroids. Discret. Comput. Geom. 33(4): 645-668 (2005) - Károly J. Böröczky:
Finite Coverings in the Hyperbolic Plane. Discret. Comput. Geom. 33(1): 165-180 (2005) - René Brandenberg:
Radii of Regular Polytopes. Discret. Comput. Geom. 33(1): 43-55 (2005) - David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried T. Toussaint:
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. Discret. Comput. Geom. 33(4): 593-604 (2005) - Christian Buchta:
An Identity Relating Moments of Functionals of Convex Hulls. Discret. Comput. Geom. 33(1): 125-142 (2005) - Robert Connelly:
Generic Global Rigidity. Discret. Comput. Geom. 33(4): 549-563 (2005) - Adrian Dumitrescu:
Monotone Paths in Line Arrangements with a Small Number of Directions. Discret. Comput. Geom. 33(4): 687-697 (2005) - Jeff Erickson:
Dense Point Sets Have Sparse Delaunay Triangulations or "... But Not Too Nasty". Discret. Comput. Geom. 33(1): 83-115 (2005) - Geoffrey Exoo:
epsilon-Unit Distance Graphs. Discret. Comput. Geom. 33(1): 117-123 (2005) - Sharona Feldman, Micha Sharir:
An Improved Bound for Joints in Arrangements of Lines in Space. Discret. Comput. Geom. 33(2): 307-320 (2005) - Olaf Delgado-Friedrichs:
Equilibrium Placement of Periodic Graphs and Convexity of Plane Tilings. Discret. Comput. Geom. 33(1): 67-81 (2005) - Andrei Gabrielov, Nicolai N. Vorobjov Jr.:
Betti Numbers of Semialgebraic Sets Defined by Quantifier-Free Formulae. Discret. Comput. Geom. 33(3): 395-401 (2005) - John Gates, Daniel Hug, Rolf Schneider:
Valuations on Convex Sets of Oriented Hyperplanes. Discret. Comput. Geom. 33(1): 57-65 (2005) - Jacob E. Goodman, Richard Pollack:
Editorial Note. Discret. Comput. Geom. 33(1): 1 (2005) - Daniel Hug, Erwin Lutwak, Deane Yang, Gaoyong Zhang:
On the Lp Minkowski Problem for Polytopes. Discret. Comput. Geom. 33(4): 699-715 (2005) - Johan Huisman:
The Space of Unordered Real Line Arrangements. Discret. Comput. Geom. 33(1): 157-163 (2005) - Daniel J. Kleitman, Rom Pinchasi:
A Note on Caterpillar-Embeddings with No Two Parallel Edges. Discret. Comput. Geom. 33(2): 223-229 (2005) - Caroline J. Klivans:
Obstructions to Shiftedness. Discret. Comput. Geom. 33(3): 535-545 (2005) - Stefan Langerman, Pat Morin:
Covering Things with Things. Discret. Comput. Geom. 33(4): 717-729 (2005) - Jim Lawrence:
Oriented Matroids and Associated Valuations. Discret. Comput. Geom. 33(3): 445-462 (2005) - Gábor Megyesi, Frank Sottile:
The Envelope of Lines Meeting a Fixed Line and Tangent to Two Spheres. Discret. Comput. Geom. 33(4): 617-644 (2005) - Hiroshi Nagamochi:
An Improved Bound on the One-Sided Minimum Crossing Number in Two-Layered Drawings. Discret. Comput. Geom. 33(4): 569-591 (2005) - David Orden, Francisco Santos:
The Polytope of Non-Crossing Graphs on a Planar Point Set. Discret. Comput. Geom. 33(2): 275-305 (2005) - Jean-Marc Schlenker:
A Rigidity Criterion for Non-Convex Polyhedra. Discret. Comput. Geom. 33(2): 207-221 (2005)
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-05-04 20:53 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