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 19 matches
- 2023
- A. Karim Abu-Affash, Paz Carmi, Meytal Maman:
Piercing pairwise intersecting geodesic disks by five points. Comput. Geom. 109: 101947 (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) - Prosenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi, Fabrizio Montecchiani, Pat Morin, Luís Fernando Schultz Xavier da Silveira:
Geodesic obstacle representation of graphs. Comput. Geom. 109: 101946 (2023) - Kevin Buchin, Maarten Löffler, Tim Ophelders, Aleksandr Popov, Jérôme Urhausen, Kevin Verbeek:
Computing the Fréchet distance between uncertain curves in one dimension. Comput. Geom. 109: 101923 (2023) - Ludovic Calès, Apostolos Chalkis, Ioannis Z. Emiris, Vissarion Fisikopoulos:
Practical volume approximation of high-dimensional convex bodies, applied to modeling portfolio dependencies and financial crises. Comput. Geom. 109: 101916 (2023) - Wojciech Chachólski, Barbara Giunti, Alvin Jin, Claudia Landi:
Decomposing filtered chain complexes: Geometry behind barcoding algorithms. Comput. Geom. 109: 101938 (2023) - Jongmin Choi, Dahye Jeong, Hee-Kap Ahn:
Covering convex polygons by two congruent disks. Comput. Geom. 109: 101936 (2023) - Mirela Damian, Robin Y. Flatland:
Unfolding 3-separated polycube graphs of arbitrary genus. Comput. Geom. 109: 101944 (2023) - Anway De, Thong Vo, Matthew Wright:
Value-offset bifiltrations for digital images. Comput. Geom. 109: 101939 (2023) - Günther Eder, Martin Held, Stefan de Lorenzo, Peter Palfrader:
On the recognition and reconstruction of weighted Voronoi diagrams and bisector graphs. Comput. Geom. 109: 101935 (2023) - Rachel Friederich, Anirban Ghosh, Matthew Graham, Brian Hicks, Ronald Shevchenko:
Experiments with unit disk cover algorithms for covering massive pointsets. Comput. Geom. 109: 101925 (2023) - José Fuentes-Sepúlveda, Gonzalo Navarro, Diego Seco:
Navigating planar topologies in near-optimal space and time. Comput. Geom. 109: 101922 (2023) - Ulderico Fugacci, Michael Kerber, Alexander Rolle:
Compression for 2-parameter persistent homology. Comput. Geom. 109: 101940 (2023) - Anil N. Hirani, Kaushik Kalyanaraman, Han Wang, Seth Watts:
Computing discrete harmonic differential forms in a given cohomology class using finite element exterior calculus. Comput. Geom. 109: 101937 (2023) - Anibal M. Medina-Mardones:
New formulas for cup-i products and fast computation of Steenrod squares. Comput. Geom. 109: 101921 (2023) - Martin Raussen:
Connectivity of spaces of directed paths in geometric models for concurrent computation. Comput. Geom. 109: 101942 (2023) - Manfred Scheucher:
Many order types on integer grids of polynomial size. Comput. Geom. 109: 101924 (2023) - Ritesh Seth, Anil Maheshwari, Subhas C. Nandy:
Acrophobic guard watchtower problem. Comput. Geom. 109: 101918 (2023) - Florian Unger, Jonathan Krebs, Michael G. Müller:
Simplex closing probabilities in directed graphs. Comput. Geom. 109: 101941 (2023)
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 2025-01-08 13:34 CET 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