Остановите войну!
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 59 matches
- 1996
- Nina Amenta:
K-transversals of Parallel Convex Sets. CCCG 1996: 80-86 - Yosser Atassi:
Visibility Graph of a Set of Line Sements: A Dynamic Sequential Algorithm and Its Parallel Version. CCCG 1996: 246-251 - Thomas Auer, Martin Held:
Heuristics for the Generation of Random Polygons. CCCG 1996: 38-43 - David Avis, Chiu Ming Kong:
Generating Rooted Triangulations with Minimum Degree Four. CCCG 1996: 56-61 - Jay S. Bagga, Laxmi P. Gewali, David Glasser:
The Complexity of Illuminating Polygons by alpha-flood-lights. CCCG 1996: 337-342 - Chandrajit L. Bajaj:
Computational Geometry for Interrogative Visualization. CCCG 1996: 99-100 - Gill Barequet, Barbara Wolfers:
Optimizing a Corridor Between Two Polygons with an Application to Polyhedral Interpolation. CCCG 1996: 32-37 - Antonio Hernández-Barrera:
Finding an o(n2 log n) Algorithm Is Sometimes Hard. CCCG 1996: 289-294 - Mark de Berg, Prosenjit Bose, Katrin Dobrindt, Marc J. van Kreveld, Mark H. Overmars, Marko de Groot, Thomas Roos, Jack Snoeyink, Sidi Yu:
The Complexity of Rivers in Triangulated Terrains. CCCG 1996: 325-330 - Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong:
Computing the Angularity Tolerance. CCCG 1996: 331-336 - Sergei Bespamyatnikh:
An Optimal Algorithm for Dynamic Post-office Problem in R21 and Related Problems. CCCG 1996: 101-106 - Sergei Bespamyatnikh:
Dynamic Algorithms for Approximate Neighbor Searching. CCCG 1996: 252-257 - Joy Bhadury, Ramaswamy Chandrasekaran:
Finding the Set of All Minimal Nested Convex Polygons. CCCG 1996: 26-31 - Therese C. Biedl:
Improved Orthogonal Drawings of 3-graphs. CCCG 1996: 295-299 - Therese C. Biedl:
Optimal Orthogonal Drawings of Connected Plane Graphs. CCCG 1996: 306-311 - Hanspeter Bieri, Peter-Michael Schmidt:
On the Permutations Generated by Rotational Sweeps of Planar Point Sets. CCCG 1996: 179-184 - Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jorge Urrutia, Mariette Yvinec:
Computing Largest Circles Separating Two Sets of Segments. CCCG 1996: 173-178 - Jean-Daniel Boissonnat, Sylvain Lazard:
Convex Hulls of Bounded Curvature. CCCG 1996: 14-19 - Prosenjit Bose, Luc Devroye, William S. Evans:
Diamonds Are Not a Minimum Weight Triangulation's Best Friend. CCCG 1996: 68-73 - Prosenjit Bose, William S. Evans, David G. Kirkpatrick, Michael McAllister, Jack Snoeyink:
Approximating Shortest Paths in Arrangements of Lines. CCCG 1996: 143-148 - Prosenjit Bose, David G. Kirkpatrick, Zaiqing Li:
Efficient Algorithms for Guarding or Illuminating the Surface of a Polyhedral Terrain. CCCG 1996: 217-222 - Leizhen Cai:
Algorithms on Polygonal Embeddings of Graphs. CCCG 1996: 300-305 - Netzahualcoyotl Castañeda, Jorge Urrutia:
Straight Line Embeddings of Planar Graphs on Point Sets. CCCG 1996: 312-318 - Thomas Chadzelek, Jens Eckstein, Elmar Schömer:
Heuristic Motion Planning with Movable Obstacles. CCCG 1996: 131-136 - Thomas Chadzelek, Jens Eckstein, Elmar Schömer:
Heuristic Motion Planning with Many Degrees of Freedom. CCCG 1996: 167-172 - Danny Z. Chen, Ovidiu Daescu:
Maintaining Visibility of a Polygon with a Moving Point of View. CCCG 1996: 240-245 - Danny Z. Chen, Gautam Das, Michiel H. M. Smid:
Lower Bounds for Computing Geometric Spanners and Approximate Shortest Paths. CCCG 1996: 155-160 - Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Jorge Urrutia:
Maximal Length Common Non-intersecting Paths. CCCG 1996: 185-189 - Jurek Czyzowicz, Ivan Stojmenovic, Tomasz Szymacha:
On a Problem of Immobilizing Polygons. CCCG 1996: 283-288 - Karen L. Daniels, Victor J. Milenkovic:
Distance-based Subdivision for Translational LP Containment. CCCG 1996: 196-201
skipping 29 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-06-05 02:47 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