Остановите войну!
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 54 matches
- 2005
- (Informal) Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005. Technische Universiteit Eindhoven 2005 [contents]
- Mohammad Ali Abam, Mark de Berg:
Lower bounds for kinetic sorting. EuroCG 2005: 171-174 - Manuel Abellanas, Prosenjit Bose, Jesús García-López, Ferran Hurtado, Mariano Nicolás, Pedro A. Ramos:
On properties of higher-order Delaunay graphs with applications. EuroCG 2005: 119-122 - Oswin Aichholzer, Franz Aurenhammer, Clemens Huemer, Hannes Krasser:
Transforming spanning trees and pseudo-triangulations. EuroCG 2005: 81-84 - Oswin Aichholzer, Clemens Huemer, Sarah Renkl, Bettina Speckmann, Csaba D. Tóth:
On pseudo-convex decompositions, partitions, and coverings. EuroCG 2005: 89-92 - Oswin Aichholzer, Hannes Krasser:
Abstract order type extension and new results on the rectilinear crossing number. EuroCG 2005: 61-64 - Lyuba Alboul, Gilberto Echeverria, Marcos A. Rodrigues:
Discrete curvatures and Gauss maps for polyhedral surfaces. EuroCG 2005: 69-72 - Helmut Alt, Maike Buchin:
Semi-computability of the Fréchet distance between surfaces. EuroCG 2005: 45-48 - Franz Aurenhammer, Hannes Krasser:
Pseudo-tetrahedral complexes. EuroCG 2005: 85-88 - Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff:
Constructing interference-minimal networks. EuroCG 2005: 203-206 - Marcin Bienkowski, Valentina Damerow, Friedhelm Meyer auf der Heide, Christian Sohler:
Average case complexity of Voronoi diagrams of n sites from the unit cube. EuroCG 2005: 167-170 - Imma Boada, Narcís Coll, Narcis Madern, Joan Antoni Sellarès:
Approximations of 3D generalized Voronoi diagrams. EuroCG 2005: 163-166 - Sebastian Böcker, Veli Mäkinen:
Maximum line-pair stabbing problem and its variations. EuroCG 2005: 183-186 - René Brandenberg, Thorsten Theobald:
Exact analysis of optimal configurations in radii computations. EuroCG 2005: 135-138 - Kevin Buchin:
Incremental construction along space-filling curves. EuroCG 2005: 17-20 - Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote:
Matching point sets with respect to the Earth mover's distance. EuroCG 2005: 57-60 - Sergio Cabello, Bojan Mohar, Arjana Zitnik:
Homotopic spanners. EuroCG 2005: 25-28 - Jean Cardinal, Sébastien Collette, Stefan Langerman:
Region counting graphs. EuroCG 2005: 21-24 - Paz Carmi, Matthew J. Katz:
The minimum area spanning tree problem. EuroCG 2005: 191-194 - Narcís Coll, Marta Fort, Joan Antoni Sellarès:
Approximate multi-visibility map computation. EuroCG 2005: 97-100 - Carmen Cortés, Alberto Márquez, Atsuhiro Nakamoto, Jesus Valenzuela:
Quadrangulations and 2-colorations. EuroCG 2005: 65-68 - José Miguel Díaz-Báñez, Carlos Seara, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura:
Covering point sets with two convex objects. EuroCG 2005: 179-182 - Darko Dimitrov, Christian Knauer, Klaus Kriegel:
Matching surfaces with characteristic points. EuroCG 2005: 49-51 - Adrian Dumitrescu, Ansgar Grüne, Günter Rote:
Improved lower bound on the geometric dilation of point sets. EuroCG 2005: 37-40 - Ioannis Z. Emiris, George M. Tzoumas:
Algebraic study of the Apollonius circle of three ellipses. EuroCG 2005: 147-150 - Andrea Eubeler, Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen:
Competitive online searching for a ray in the plane. EuroCG 2005: 107-110 - Mohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson:
Finding the best shortcut in a geometric network. EuroCG 2005: 29-32 - Corinne Feremans, Alexander Grigoriev:
Approximation schemes for the generalized geometric problems with geographic clustering. EuroCG 2005: 101-102 - Emilio Di Giacomo, Giuseppe Liotta:
A note on simultaneous embedding of planar graphs. EuroCG 2005: 207-210 - Robert Görke, Alexander Wolff:
Constructing the city Voronoi diagram faster. EuroCG 2005: 155-158
skipping 24 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-04-25 07:10 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