Остановите войну!
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 45 matches
- 2011
- Bernardo M. Ábrego, Ruy Fabila Monroy, Silvia Fernández-Merchant, David Flores-Peñaloza, Ferran Hurtado, Vera Sacristán, Maria Saumell:
On crossing numbers of geometric proximity graphs. Comput. Geom. 44(4): 216-233 (2011) - Hee-Kap Ahn, Sang Won Bae, Erik D. Demaine, Martin L. Demaine, Sang-Sub Kim, Matias Korman, Iris Reinbacher, Wanbin Son:
Covering points by disjoint boxes with outliers. Comput. Geom. 44(3): 178-190 (2011) - Laurent Alonso, Edward M. Reingold:
Improved bounds for cops-and-robber pursuit. Comput. Geom. 44(8): 365-369 (2011) - Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Valentin Polishchuk:
The snowblower problem. Comput. Geom. 44(8): 370-384 (2011) - Boris Aronov, Muriel Dulieu, Ferran Hurtado:
Witness (Delaunay) graphs. Comput. Geom. 44(6-7): 329-344 (2011) - Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz:
Minimum vertex cover in rectangle graphs. Comput. Geom. 44(6-7): 356-364 (2011) - Therese Biedl, Burkay Genç:
Reconstructing orthogonal polyhedra from putative vertex sets. Comput. Geom. 44(8): 409-417 (2011) - Therese Biedl, Masud Hasan, Alejandro López-Ortiz:
Efficient view point selection for silhouettes of convex polyhedra. Comput. Geom. 44(8): 399-408 (2011) - Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel H. M. Smid, Daming Xu:
On a family of strong geometric spanners that admit local routing strategies. Comput. Geom. 44(6-7): 319-328 (2011) - Prosenjit Bose, Otfried Cheong, Vida Dujmovic:
A note on the perimeter of fat objects. Comput. Geom. 44(1): 1-8 (2011) - Prosenjit Bose, Luc Devroye, Maarten Löffler, Jack Snoeyink, Vishal Verma:
Almost all Delaunay triangulations have stretch factor greater than pi/2. Comput. Geom. 44(2): 121-127 (2011) - Prosenjit Bose, Anil Maheshwari, Chang Shu, Stefanie Wuhrer:
A survey of geodesic paths on 3D surfaces. Comput. Geom. 44(9): 486-498 (2011) - Yves Brise, Bernd Gärtner:
Clarkson's algorithm for violator spaces. Comput. Geom. 44(2): 70-81 (2011) - Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Jun Luo:
Finding long and similar parts of trajectories. Comput. Geom. 44(9): 465-476 (2011) - Paz Carmi, Matthew J. Katz, Zvi Lotker, Adi Rosén:
Connectivity guarantees for wireless networks with directional antennas. Comput. Geom. 44(9): 477-485 (2011) - Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na:
Farthest-polygon Voronoi diagrams. Comput. Geom. 44(4): 234-247 (2011) - Mercè Claverol, Delia Garijo, Clara I. Grima, Alberto Márquez, Carlos Seara:
Stabbers of line segments in the plane. Comput. Geom. 44(5): 303-318 (2011) - Atlas F. Cook, Carola Wenk:
Link distance and shortest path problems in the plane. Comput. Geom. 44(8): 442-455 (2011) - Gennaro Cordasco, Rosario De Chiara, Andrew Fish:
Efficient on-line algorithms for Euler diagram region computation. Comput. Geom. 44(1): 52-68 (2011) - Shiliang Cui, Iyad A. Kanj, Ge Xia:
On the stretch factor of Delaunay triangulations of points in convex position. Comput. Geom. 44(2): 104-109 (2011) - Erik D. Demaine, Sándor P. Fekete, Günter Rote, Nils Schweer, Daria Schymura, Mariano Zelke:
Integer point sets minimizing average pairwise L1 distance: What is the optimal shape of a town? Comput. Geom. 44(2): 82-94 (2011) - Olivier Devillers:
Vertex removal in two-dimensional Delaunay triangulation: Speed-up by low degrees optimization. Comput. Geom. 44(3): 169-177 (2011) - Olivier Devillers, Monique Teillaud:
Perturbations for Delaunay and weighted Delaunay 3D triangulations. Comput. Geom. 44(3): 160-168 (2011) - José Miguel Díaz-Báñez, Mario Alberto López, Mercè Mora, Carlos Seara, Inmaculada Ventura:
Fitting a two-joint orthogonal chain to a point set. Comput. Geom. 44(3): 135-147 (2011) - Yann Disser, Matús Mihalák, Peter Widmayer:
A polygon is determined by its angles. Comput. Geom. 44(8): 418-426 (2011) - Christian A. Duncan:
On graph thickness, geometric thickness, and separator theorems. Comput. Geom. 44(2): 95-99 (2011) - Stephane Durocher, Krishnam Raju Jampani, Anna Lubiw, Lata Narayanan:
Modelling gateway placement in wireless networks: Geometric k-centres of unit disc graphs. Comput. Geom. 44(5): 286-302 (2011) - Khaled M. Elbassioni, Hans Raj Tiwary:
On a cone covering problem. Comput. Geom. 44(3): 129-134 (2011) - William Evans:
Guest Editor's foreword. Comput. Geom. 44(2): 69 (2011) - J. Joseph Fowler, Michael Jünger, Stephen G. Kobourov, Michael Schulz:
Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges. Comput. Geom. 44(8): 385-398 (2011)
skipping 15 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-20 02:11 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