Остановите войну!
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 63 matches
- 2010
- Mohammad Ali Abam, Mark de Berg, Joachim Gudmundsson:
A simple and efficient kinetic spanner. Comput. Geom. 43(3): 251-256 (2010) - Peyman Afshani, Chris H. Hamilton, Norbert Zeh:
A general approach for cache-oblivious range reporting and approximate range counting. Comput. Geom. 43(8): 700-712 (2010) - Hee-Kap Ahn, Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin:
Covering a simple polygon by monotone directions. Comput. Geom. 43(5): 514-523 (2010) - Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Elisabeth Pilgerstorfer, Margot Rabl:
Divide-and-conquer for Voronoi diagrams revisited. Comput. Geom. 43(8): 688-699 (2010) - Laurent Alonso, Edward M. Reingold:
Bounds for cops and robber pursuit. Comput. Geom. 43(9): 749-766 (2010) - Greg Aloupis, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke, Belén Palop:
Highway hull revisited. Comput. Geom. 43(2): 115-130 (2010) - Helmut Alt, Ludmila Scharf, Daria Schymura:
Probabilistic matching of planar regions. Comput. Geom. 43(2): 99-114 (2010) - Victor Alvarez, Raimund Seidel:
Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric. Comput. Geom. 43(2): 94-98 (2010) - Esther M. Arkin, Joseph S. B. Mitchell, Valentin Polishchuk:
Maximum thick paths in static and dynamic environments. Comput. Geom. 43(3): 279-294 (2010) - Roberto Bagnara, Patricia M. Hill, Enea Zaffanella:
Exact join detection for convex polyhedra and other numerical abstractions. Comput. Geom. 43(5): 453-473 (2010) - Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfraz Raza:
Centerpoints and Tverberg's technique. Comput. Geom. 43(6-7): 593-600 (2010) - Vicente H. F. Batista, David L. Millman, Sylvain Pion, Johannes Singler:
Parallel geometric algorithms for multi-core computers. Comput. Geom. 43(8): 663-677 (2010) - Ken Been, Martin Nöllenburg, Sheung-Hung Poon, Alexander Wolff:
Optimizing active ranges for consistent dynamic map labeling. Comput. Geom. 43(3): 312-328 (2010) - Itay Ben-Dan, Rom Pinchasi, Ran Ziv:
On a problem about quadrant-depth. Comput. Geom. 43(6-7): 587-592 (2010) - Eric Berberich, Michael Kerber, Michael Sagraloff:
An efficient algorithm for the stratification and triangulation of an algebraic surface. Comput. Geom. 43(3): 257-278 (2010) - Mark de Berg, Otfried Cheong, Herman J. Haverkort, Jung Gun Lim, Laura Toma:
The complexity of flow on fat terrains and its i/o-efficient computation. Comput. Geom. 43(4): 331-356 (2010) - Mark de Berg, Chris Gray:
Decompositions and boundary coverings of non-convex fat polyhedra. Comput. Geom. 43(2): 73-83 (2010) - Mark de Berg, Chris Gray:
Computing the visibility map of fat objects. Comput. Geom. 43(4): 410-418 (2010) - Mark de Berg, Herman J. Haverkort, Shripad Thite, Laura Toma:
Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions. Comput. Geom. 43(5): 493-513 (2010) - Carla Binucci, Emilio Di Giacomo, Walter Didimo, Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G. Kobourov, Giuseppe Liotta:
Upward straight-line embeddings of directed graphs into point sets. Comput. Geom. 43(2): 219-232 (2010) - Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos:
Randomly removing g handles at once. Comput. Geom. 43(8): 655-662 (2010) - Karl Bringmann, Tobias Friedrich:
Approximating the volume of unions and intersections of high-dimensional geometric objects. Comput. Geom. 43(6-7): 601-610 (2010) - Hamish A. Carr, Jack Snoeyink, Michiel van de Panne:
Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree. Comput. Geom. 43(1): 42-58 (2010) - Matthew Cary, Atri Rudra, Ashish Sabharwal, Erik Vee:
Floodlight illumination of infinite wedges. Comput. Geom. 43(1): 23-34 (2010) - Elvan Ceyhan:
Extension of one-dimensional proximity regions to higher dimensions. Comput. Geom. 43(9): 721-748 (2010) - Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Sylvain Lazard, Francis Lazarus, Shripad Thite:
Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time. Comput. Geom. 43(3): 295-311 (2010) - Timothy M. Chan:
A (slightly) faster algorithm for Klee's measure problem. Comput. Geom. 43(3): 243-250 (2010) - Timothy M. Chan, Eric Y. Chen:
Optimal in-place and cache-oblivious algorithms for 3-d convex hulls and 2-d segment intersection. Comput. Geom. 43(8): 636-646 (2010) - Chao Chen, Daniel Freedman:
Measuring and computing natural generators for homology groups. Comput. Geom. 43(2): 169-181 (2010) - Nikolai I. Chernov, Yu. G. Stoyan, Tatiana E. Romanova:
Mathematical model and efficient algorithms for object packing problem. Comput. Geom. 43(5): 535-553 (2010)
skipping 33 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 10:34 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