![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.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 55 matches
- 2009
- Mohammad Ali Abam, Mark de Berg:
Kinetic spanners in Rd. SCG 2009: 43-50 - Eyal Ackerman, Jacob Fox, János Pach, Andrew Suk:
On grids in topological graphs. SCG 2009: 403-412 - Peyman Afshani, Chris H. Hamilton, Norbert Zeh:
Cache-oblivious range reporting with optimal queries requires superlinear space. SCG 2009: 277-286 - Peyman Afshani, Chris H. Hamilton, Norbert Zeh:
A general approach for cache-oblivious range reporting and approximate range counting. SCG 2009: 287-295 - Pankaj K. Agarwal, Esther Ezra, Micha Sharir:
Near-linear approximation algorithms for geometric hitting sets. SCG 2009: 23-32 - Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Thomas Hackl, Bert Jüttler
, Elisabeth Pilgerstorfer, Margot Rabl:
Divide-and-conquer for Voronoi diagrams revisited. SCG 2009: 189-197 - Roel Apfelbaum, Micha Sharir:
An improved bound on the number of unit area triangles. SCG 2009: 135-140 - Sang Won Bae
, Kyung-Yong Chwa:
The geodesic farthest-site Voronoi diagram in a polygonal domain with holes. SCG 2009: 198-207 - Gill Barequet, Amir Vaxman:
Straight skeletons of three-dimensional polyhedra. SCG 2009: 100-101 - Vicente H. F. Batista, David L. Millman, Sylvain Pion, Johannes Singler:
Parallel geometric algorithms for multi-core computers. SCG 2009: 217-226 - Mark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis:
Visibility maps of realistic terrains have linear smoothed complexity. SCG 2009: 163-168 - Mark de Berg, Fred van Nijnatten
, Bettina Speckmann
, Kevin Verbeek:
Rectangular cartograms: the game. SCG 2009: 96-97 - Jean-Daniel Boissonnat, Olivier Devillers
, Samuel Hornus:
Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension. SCG 2009: 208-216 - Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos:
Randomly removing g handles at once. SCG 2009: 371-376 - Boris Bukh, Jirí Matousek, Gabriel Nivasch
:
Lower bounds for weak epsilon-nets and stair-convexity. SCG 2009: 1-10 - Gunnar E. Carlsson, Vin de Silva, Dmitriy Morozov:
Zigzag persistent homology and real-valued functions. SCG 2009: 247-256 - Erin W. Chambers
, Jeff Erickson, Amir Nayyeri:
Minimum cuts and shortest homologous cycles. SCG 2009: 377-385 - Timothy M. Chan, Eric Y. Chen:
Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection. SCG 2009: 80-87 - Timothy M. Chan, Sariel Har-Peled
:
Approximation algorithms for maximum independent set of pseudo-disks. SCG 2009: 333-340 - Frédéric Chazal, David Cohen-Steiner, Marc Glisse, Leonidas J. Guibas, Steve Oudot
:
Proximity of persistence modules and their diagrams. SCG 2009: 237-246 - Bernard Chazelle, Wolfgang Mulzer
:
Computing hereditary convex structures. SCG 2009: 61-70 - Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled
:
On the set multi-cover problem in geometric settings. SCG 2009: 341-350 - Jin-San Cheng, Sylvain Lazard, Luis Mariano Peñaranda, Marc Pouget
, Fabrice Rouillier, Elias P. Tsigaridas:
On the topology of planar algebraic curves. SCG 2009: 361-370 - Francis Y. L. Chin, Zeyu Guo, He Sun:
Minimum Manhattan network is NP-complete. SCG 2009: 393-402 - Marcelo C. Couto, Pedro Jussieu de Rezende, Cid C. de Souza
:
An IP solution to the art gallery problem. SCG 2009: 88-89 - Tamal K. Dey, Kuiyu Li:
Cut locus and topology from surface point data. SCG 2009: 125-134 - Matthew T. Dickerson, David Eppstein:
Animating a continuous family of two-site Voronoi diagrams (and a proof of a bound on the number of regions). SCG 2009: 92-93 - Friedrich Eisenbrand, Nicolai Hähnle, Thomas Rothvoß:
Diameter of polyhedra: limits of abstraction. SCG 2009: 386-392 - David Eppstein, Elena Mumford, Bettina Speckmann
, Kevin Verbeek
:
Area-universal rectangular layouts. SCG 2009: 267-276 - Sándor P. Fekete, Dietmar Fey, Marcus Komann, Alexander Kröller, Marc Reichenbach
, Christiane Schmidt
:
Distributed vision with smart pixels. SCG 2009: 257-266
skipping 25 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.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-17 15:48 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