Остановите войну!
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 1,535 matches
- 2024
- Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir:
On reverse shortest paths in geometric proximity graphs. Comput. Geom. 117: 102053 (2024) - Franz J. Brandenburg:
Straight-line drawings of 1-planar graphs. Comput. Geom. 116: 102036 (2024) - Justin Curry, Jordan DeSha, Adélie Garin, Kathryn Hess, Lida Kanari, Brendan Mallery:
From trees to barcodes and back again II: Combinatorial and probabilistic aspects of a topological inverse problem. Comput. Geom. 116: 102031 (2024) - Emily Fox, Hongyao Huang, Benjamin Raichel:
Clustering with faulty centers. Comput. Geom. 117: 102052 (2024) - David Glickenstein:
Geometric triangulations and discrete Laplacians on manifolds: An update. Comput. Geom. 118: 102063 (2024) - Meng He, Don Sheehy:
Guest editorial: Special issue on the 33rd Canadian Conference on Computational Geometry (CCCG). Comput. Geom. 116: 102035 (2024) - Sushovan Majhi, Jeffrey Vitter, Carola Wenk:
Approximating Gromov-Hausdorff distance in Euclidean space. Comput. Geom. 116: 102034 (2024) - Sushovan Majhi, Carola Wenk:
Distance measures for geometric graphs. Comput. Geom. 118: 102056 (2024) - Goran Malic, Ileana Streinu:
Enumerating combinatorial resultant trees. Comput. Geom. 118: 102064 (2024) - Abolfazl Poureidi, Mohammad Farshi:
On algorithmic complexity of imprecise spanners. Comput. Geom. 117: 102051 (2024) - Manuel Radons:
Edge-unfolding nested prismatoids. Comput. Geom. 116: 102033 (2024) - Christian Rieck, Christian Scheffer:
The dispersive art gallery problem. Comput. Geom. 117: 102054 (2024) - 2023
- A. Karim Abu-Affash, Paz Carmi, Meytal Maman:
Piercing pairwise intersecting geodesic disks by five points. Comput. Geom. 109: 101947 (2023) - Peyman Afshani, Rasmus Killmann:
Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions. Comput. Geom. 111: 101959 (2023) - Pankaj K. Agarwal, Tzvika Geft, Dan Halperin, Erin Taylor:
Multi-robot motion planning for unit discs with revolving areas. Comput. Geom. 114: 102019 (2023) - Oswin Aichholzer, David Eppstein, Eva-Maria Hainzl:
Geometric dominating sets - a minimum version of the No-Three-In-Line Problem. Comput. Geom. 108: 101913 (2023) - Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir:
Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model. Comput. Geom. 109: 101945 (2023) - Boris Aronov, Esther Ezra, Micha Sharir, Guy Zigdon:
Time and space efficient collinearity indexing. Comput. Geom. 110: 101963 (2023) - Stav Ashur, Matthew J. Katz:
A 4-approximation of the 2π3-MST. Comput. Geom. 108: 101914 (2023) - Ziv Bakhajian, Ohad Noy Feldheim:
Drawing outerplanar graphs using thirteen edge lengths. Comput. Geom. 110: 101964 (2023) - Martin Balko, Adam Sheffer, Ruiwen Tang:
The constant of point-line incidence constructions. Comput. Geom. 114: 102009 (2023) - Aritra Banik, Rajiv Raman, Saurabh Ray:
On the geometric priority set cover problem. Comput. Geom. 112: 101984 (2023) - Gill Barequet, Bar Magal:
Automatic generation of formulae for polyominoes with a fixed perimeter defect. Comput. Geom. 108: 101919 (2023) - Markus Baumeister, Leif Kobbelt:
How close is a quad mesh to a polycube? Comput. Geom. 111: 101978 (2023) - Sarita de Berg, Frank Staals:
Dynamic data structures for k-nearest neighbor queries. Comput. Geom. 111: 101976 (2023) - Daniel Bertschinger, Meghana M. Reddy, Enrico Mann:
Lions and contamination: Monotone clearings. Comput. Geom. 110: 101961 (2023) - Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu:
Untangling circular drawings: Algorithms and complexity. Comput. Geom. 111: 101975 (2023) - Ahmad Biniaz, Prosenjit Bose, Yunkai Wang:
Simple linear time algorithms for piercing pairwise intersecting disks. Comput. Geom. 114: 102011 (2023) - Carla Binucci, Walter Didimo, Fabrizio Montecchiani:
1-planarity testing and embedding: An experimental study. Comput. Geom. 108: 101900 (2023) - Thomas Bläsius, Tobias Friedrich, Martin S. Krejca, Louise Molitor:
The impact of geometry on monochrome regions in the flip Schelling process. Comput. Geom. 108: 101902 (2023)
skipping 1,505 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-03 02:49 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