Остановите войну!
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 74 matches
- 2014
- Lei Xu, Jinhui Xu:
Approximating minimum bending energy path in a simple corridor. Comput. Geom. 47(3): 349-366 (2014) - Mohammad Ali Abam, Shervin Daneshpajouh, Lasse Deleuran, Shayan Ehsani, Mohammad Ghodsi:
Computing homotopic line simplification. Comput. Geom. 47(7): 728-739 (2014) - A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi:
Bottleneck non-crossing matching in the plane. Comput. Geom. 47(3): 447-457 (2014) - Eyal Ackerman, Jacob Fox, János Pach, Andrew Suk:
On grids in topological graphs. Comput. Geom. 47(7): 710-723 (2014) - Hee-Kap Ahn, Siu-Wing Cheng, Hyuk Jun Kweon, Juyoung Yon:
Overlap of convex polytopes under rigid motion. Comput. Geom. 47(1): 15-24 (2014) - Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Ferran Hurtado, Alexander Pilz, Pedro Ramos, Jorge Urrutia, Pavel Valtr, Birgit Vogtenhuber:
On k-convex point sets. Comput. Geom. 47(8): 809-832 (2014) - Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Theta-3 is connected. Comput. Geom. 47(9): 910-917 (2014) - Oswin Aichholzer, Ruy Fabila Monroy, Hernán González-Aguilar, Thomas Hackl, Marco A. Heredia, Clemens Huemer, Jorge Urrutia, Birgit Vogtenhuber:
4-Holes in point sets. Comput. Geom. 47(6): 644-650 (2014) - Oswin Aichholzer, Ruy Fabila Monroy, Thomas Hackl, Clemens Huemer, Alexander Pilz, Birgit Vogtenhuber:
Lower bounds for the number of small convex k-holes. Comput. Geom. 47(5): 605-613 (2014) - Oswin Aichholzer, Tillmann Miltzow, Alexander Pilz:
Reprint of: Extreme point and halving edge search in abstract order types. Comput. Geom. 47(3): 518-526 (2014) - Greg Aloupis, David Bremner:
Editorial. Comput. Geom. 47(2): 111 (2014) - Greg Aloupis, Prosenjit Bose, Vida Dujmovic, Chris Gray, Stefan Langerman, Bettina Speckmann:
Triangulating and guarding realistic polygons. Comput. Geom. 47(2): 296-306 (2014) - Greg Aloupis, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke:
Draining a polygon - or - rolling a ball out of a polygon. Comput. Geom. 47(2): 316-328 (2014) - Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella:
On the area requirements of Euclidean minimum spanning trees. Comput. Geom. 47(2): 200-213 (2014) - Esther M. Arkin, Claudia Dieckmann, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Lena Schlipf, Shang Yang:
Convex transversals. Comput. Geom. 47(2): 224-239 (2014) - Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Günter Rote, André Schulz:
Reprint of: Memory-constrained algorithms for simple polygons. Comput. Geom. 47(3): 469-479 (2014) - Pradeesha Ashok, Umair Azmi, Sathish Govindarajan:
Small strong epsilon nets. Comput. Geom. 47(9): 899-909 (2014) - Sang Won Bae:
Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments. Comput. Geom. 47(8): 779-788 (2014) - Martin Balko:
Reprint of: Grid representations and the chromatic number. Comput. Geom. 47(3): 480-492 (2014) - Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das:
Minimum enclosing circle of a set of fixed points and a mobile point. Comput. Geom. 47(9): 891-898 (2014) - Imre Bárány, Edgardo Roldán-Pensado:
Longest convex lattice chains. Comput. Geom. 47(3): 367-376 (2014) - Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira:
Computing a visibility polygon using few variables. Comput. Geom. 47(9): 918-926 (2014) - Gill Barequet, Alex Goryachev:
Offset polygon and annulus placement problems. Comput. Geom. 47(3): 407-434 (2014) - Mark de Berg, Bettina Speckmann, Vincent van der Weele:
Treemaps with bounded aspect ratio. Comput. Geom. 47(6): 683-693 (2014) - Binay K. Bhattacharya, Qiaosheng Shi:
Improved algorithms to network p-center location problems. Comput. Geom. 47(2): 307-315 (2014) - Therese Biedl, Lesvia Elena Ruiz Velázquez:
Orthogonal cartograms with at most 12 corners per face. Comput. Geom. 47(2): 282-294 (2014) - Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
An optimal algorithm for the Euclidean bottleneck full Steiner tree problem. Comput. Geom. 47(3): 377-380 (2014) - Jürgen Bokowski, Vincent Pilaud:
Enumerating topological (nk)-configurations. Comput. Geom. 47(2): 175-186 (2014) - Prosenjit Bose, Jean-Lou De Carufel:
Minimum-area enclosing triangle with a fixed angle. Comput. Geom. 47(1): 90-109 (2014) - Prosenjit Bose, Dana Jansens, André van Renssen, Maria Saumell, Sander Verdonschot:
Making triangulations 4-connected using flips. Comput. Geom. 47(2): 187-197 (2014)
skipping 44 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 22:58 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