Остановите войну!
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 26 matches
- 1995
- James Abello, Ömer Egecioglu, Krishna Kumar:
Visibility Graphs of Staircase Polygons and the Weak Bruhat Order, I: from Visibility Graphs to Maximal Chains. Discret. Comput. Geom. 14(3): 331-358 (1995) - Mark de Berg, Katrin Dobrindt, Otfried Schwarzkopf:
On Lazy Randomized Incremental Construction. Discret. Comput. Geom. 14(3): 261-286 (1995) - Mark de Berg, Jirí Matousek, Otfried Schwarzkopf:
Piecewise Linear Paths Among Convex Obstacles. Discret. Comput. Geom. 14(1): 9-29 (1995) - Marshall W. Bern, Scott A. Mitchell, Jim Ruppert:
Linear-Size Nonobtuse Triangulation of Polygons. Discret. Comput. Geom. 14(4): 411-428 (1995) - Peter G. Boyvalenkov:
Extremal Polynomials for Obtaining Bounds for Spherical Codes and Designs. Discret. Comput. Geom. 14(2): 167-183 (1995) - Hervé Brönnimann, Michael T. Goodrich:
Almost Optimal Set Covers in Finite VC-Dimension. Discret. Comput. Geom. 14(4): 463-479 (1995) - Bernard Chazelle, Nadia Shouraboura:
Bounds on the Size of Tetrahedralizations. Discret. Comput. Geom. 14(4): 429-444 (1995) - Tamal K. Dey, Haijo Schipper:
A New Technique To Compute Polygonal Schema for 2-Manifolds with Application to Null-homotopy Detection. Discret. Comput. Geom. 14(1): 93-110 (1995) - Andrei Gabrielov, Nicolai N. Vorobjov Jr.:
Complexity of Stratifications of Semi-Pfaffian Sets. Discret. Comput. Geom. 14(1): 71-91 (1995) - Alfredo García Olaverri, Javier Tejel:
The Order of Points on the Second Convex Hull of a Simple Polygon. Discret. Comput. Geom. 14(2): 185-205 (1995) - Michael T. Goodrich:
Efficient Piecewise-Linear Function Approximation Using the Uniform Metric. Discret. Comput. Geom. 14(4): 445-462 (1995) - Leonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir:
Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. Discret. Comput. Geom. 14(2): 113-122 (1995) - Dan Halperin, Micha Sharir:
Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions. Discret. Comput. Geom. 14(4): 385-410 (1995) - Zheng-Xu He, O. Schramm:
Hyperbolic and Parabolic Packings. Discret. Comput. Geom. 14(2): 123-149 (1995) - Gábor Hetyei:
On the Stanley Ring of a Cubical Complex. Discret. Comput. Geom. 14(3): 305-330 (1995) - János Kincses:
On Polytopes Cut by Flats. Discret. Comput. Geom. 14(3): 287-294 (1995) - J. C. Lagarias, David Moews:
Acknowledgment of Priority Concerning Polytopes that Fill Rn and Scissors Congruence. Discret. Comput. Geom. 14(3): 359-360 (1995) - Jirí Matousek:
On Geometric Optimization with Few Violated Constraints. Discret. Comput. Geom. 14(4): 365-384 (1995) - Kurt Mehlhorn:
Guest Editor's Foreword. Discret. Comput. Geom. 14(4): 363 (1995) - Nagabhushana Prabhu:
Facet-Reducing Cuts of a Convex Polytope. Discret. Comput. Geom. 14(3): 295-300 (1995) - Nagabhushana Prabhu:
Hamiltonian Simple Polytopes. Discret. Comput. Geom. 14(3): 301-304 (1995) - Gabriel Robins, Jeffrey S. Salowe:
Low-Degree Minimum Spanning Trees. Discret. Comput. Geom. 14(2): 151-165 (1995) - Nicolau C. Saldanha, Carlos Tomei, M. A. Casarin Jr., D. Romualdo:
Spaces of Domino Tilings. Discret. Comput. Geom. 14(2): 207-233 (1995) - Neil J. A. Sloane, Ronald H. Hardin, T. D. S. Duff, John H. Conway:
Minimal-Energy Clusters of Hard Spheres. Discret. Comput. Geom. 14(3): 237-259 (1995) - Le Tu Quoc Thang:
Local Rules for Pentagonal Quasi-Crystals. Discret. Comput. Geom. 14(1): 31-70 (1995) - Gábor Fejes Tóth:
Densest Packing of Typical Convex Sets are Nont Lattice-Like. Discret. Comput. Geom. 14(1): 1-8 (1995)
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 02:50 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