Остановите войну!
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 232 matches
- 2013
- Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg:
On inducing polygons and related problems. Comput. Geom. 46(7): 861-878 (2013) - Boris Aronov, Muriel Dulieu, Ferran Hurtado:
Witness Gabriel graphs. Comput. Geom. 46(7): 894-908 (2013) - Prosenjit Bose, Michiel H. M. Smid:
On plane geometric spanners: A survey and open problems. Comput. Geom. 46(7): 818-830 (2013) - Sébastien Collette, Stefan Langerman:
Editorial. Comput. Geom. 46(7): 817 (2013) - Panos Giannopoulos, Christian Knauer, Günter Rote, Daniel Werner:
Fixed-parameter tractability and lower bounds for stabbing problems. Comput. Geom. 46(7): 839-860 (2013) - Andreas Razen, Emo Welzl:
On the number of crossing-free partitions. Comput. Geom. 46(7): 879-893 (2013) - Christian Wulff-Nilsen:
Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time. Comput. Geom. 46(7): 831-838 (2013) - 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) - Mark de Berg, Chris Gray:
Decompositions and boundary coverings of non-convex fat polyhedra. Comput. Geom. 43(2): 73-83 (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) - Chao Chen, Daniel Freedman:
Measuring and computing natural generators for homology groups. Comput. Geom. 43(2): 169-181 (2010) - Gautam K. Das, Sandip Das, Subhas C. Nandy:
Homogeneous 2-hop broadcast in 2D. Comput. Geom. 43(2): 182-190 (2010) - Sándor P. Fekete, Christiane Schmidt:
Polygon exploration with time-discrete vision. Comput. Geom. 43(2): 148-168 (2010) - Herman J. Haverkort, Freek van Walderveen:
Locality and bounding-box quality of two-dimensional space-filling curves. Comput. Geom. 43(2): 131-147 (2010) - Seok-Hee Hong, Hiroshi Nagamochi:
An algorithm for constructing star-shaped drawings of plane graphs. Comput. Geom. 43(2): 191-206 (2010) - Sylvain Lazard:
Editorial. Comput. Geom. 43(2): 67 (2010) - Domagoj Matijevic, Ralf Osbild:
Finding the Theta-guarded region. Comput. Geom. 43(2): 207-218 (2010) - Reinhard Steffens, Thorsten Theobald:
Mixed volume techniques for embeddings of Laman graphs. Comput. Geom. 43(2): 84-93 (2010) - Christian Wulff-Nilsen:
Computing the dilation of edge-augmented graphs in metric spaces. Comput. Geom. 43(2): 68-72 (2010) - 2009
- Oswin Aichholzer, Franz Aurenhammer:
Editorial. Comput. Geom. 42(8): 723 (2009) - Kevin Buchin, Andreas Razen, Takeaki Uno, Uli Wagner:
Transforming spanning trees: A lower bound. Comput. Geom. 42(8): 724-730 (2009) - Siddhartha Chaudhuri, Vladlen Koltun:
Smoothed analysis of probabilistic roadmaps. Comput. Geom. 42(8): 731-747 (2009) - Erik D. Demaine, Martin L. Demaine, John Iacono, Stefan Langerman:
Wrapping spheres with flat paper. Comput. Geom. 42(8): 748-757 (2009) - Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel:
On the complexity of umbra and penumbra. Comput. Geom. 42(8): 758-771 (2009) - Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote:
Bounds on the quality of the PCA bounding boxes. Comput. Geom. 42(8): 772-789 (2009) - David Eppstein, Marc J. van Kreveld, Elena Mumford, Bettina Speckmann:
Edges and switches, tunnels and bridges. Comput. Geom. 42(8): 790-802 (2009) - Rodrigo I. Silveira, Marc J. van Kreveld:
Optimal higher order Delaunay triangulations of polygons. Comput. Geom. 42(8): 803-813 (2009) - 2008
- Boris Aronov, Mark de Berg, Chris Gray:
Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. Comput. Geom. 41(1-2): 68-76 (2008)
skipping 202 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-07 12:41 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