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 37 matches
- 2009
- Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson:
Region-Fault Tolerant Geometric Spanners. Discret. Comput. Geom. 41(4): 556-582 (2009) - Bernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, Jorge Urrutia:
Matching Points with Squares. Discret. Comput. Geom. 41(1): 77-95 (2009) - Eyal Ackerman:
On the Maximum Number of Edges in Topological Graphs with no Four Pairwise Crossing Edges. Discret. Comput. Geom. 41(3): 365-375 (2009) - Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, Shakhar Smorodinsky:
Coloring Geometric Range Spaces. Discret. Comput. Geom. 41(2): 348-362 (2009) - Nina Amenta, Otfried Cheong:
Guest Editors' Foreword. Discret. Comput. Geom. 41(3): 363-364 (2009) - Sunil Arya, Theocharis Malamatos, David M. Mount:
The Effect of Corners on the Complexity of Approximate Range Searching. Discret. Comput. Geom. 41(3): 398-443 (2009) - Charles Audet, Pierre Hansen, Frédéric Messine:
Isoperimetric Polygons of Maximum Width. Discret. Comput. Geom. 41(1): 45-60 (2009) - Charles Audet, Pierre Hansen, Frédéric Messine:
Simple Polygons of Maximum Perimeter Contained in a Unit Disk. Discret. Comput. Geom. 41(2): 208-215 (2009) - Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, Ferran Hurtado, Pavel Valtr:
Traversing a Set of Points with a Minimum Number of Turns. Discret. Comput. Geom. 41(4): 513-532 (2009) - Gabriele Bianchi:
Geometric Tomography of Convex Cones. Discret. Comput. Geom. 41(1): 61-76 (2009) - Michelle Bucher-Karlsson:
On Minimal Triangulations of Products of Convex Polygons. Discret. Comput. Geom. 41(2): 328-347 (2009) - Grant Cairns, Yury Nikolayevsky:
Generalized Thrackle Drawings of Non-bipartite Graphs. Discret. Comput. Geom. 41(1): 119-134 (2009) - T.-H. Hubert Chan, Anupam Gupta:
Small Hop-diameter Sparse Spanners for Doubling Metrics. Discret. Comput. Geom. 41(1): 28-44 (2009) - Frédéric Chazal, David Cohen-Steiner, André Lieutier:
A Sampling Theory for Compact Sets in Euclidean Space. Discret. Comput. Geom. 41(3): 461-479 (2009) - Antoine Deza, Tamás Terlaky, Yuriy Zinchenko:
A Continuous d -Step Conjecture for Polytopes. Discret. Comput. Geom. 41(2): 318-327 (2009) - Richard Ehrenborg, Margaret A. Readdy, Michael Slone:
Affine and Toric Hyperplane Arrangements. Discret. Comput. Geom. 41(4): 481-512 (2009) - Esther Ezra, János Pach, Micha Sharir:
On Regular Vertices of the Union of Planar Convex Objects. Discret. Comput. Geom. 41(2): 216-231 (2009) - Eric J. Friedman:
Finding a Simple Polytope from Its Graph in Polynomial Time. Discret. Comput. Geom. 41(2): 249-256 (2009) - Leonid Gurvits:
A Polynomial-Time Algorithm to Approximate the Mixed Volume within a Simply Exponential Factor. Discret. Comput. Geom. 41(4): 533-555 (2009) - Ishay Haviv, Vadim Lyubashevsky, Oded Regev:
A Note on the Distribution of the Distance from a Lattice. Discret. Comput. Geom. 41(1): 162-176 (2009) - Hayley N. Iben, James F. O'Brien, Erik D. Demaine:
Refolding Planar Polygons. Discret. Comput. Geom. 41(3): 444-460 (2009) - Dan Ismailescu:
Circumscribed Polygons of Small Area. Discret. Comput. Geom. 41(4): 583-589 (2009) - Vladlen Koltun, Micha Sharir:
On Overlays and Minimization Diagrams. Discret. Comput. Geom. 41(3): 385-397 (2009) - James R. Lee:
Volume Distortion for Subsets of Euclidean Spaces. Discret. Comput. Geom. 41(4): 590-615 (2009) - Benoit Loridant, Jun Luo:
On a Theorem of Bandt and Wang and Its Extension to p 2-tiles. Discret. Comput. Geom. 41(4): 616-642 (2009) - Piotr Mankiewicz, Nicole Tomczak-Jaegermann:
Stability Properties of Neighbourly Random Polytopes. Discret. Comput. Geom. 41(2): 257-272 (2009) - Kazuyuki Miura, Tetsuya Matsuno, Takao Nishizeki:
Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs. Discret. Comput. Geom. 41(4): 643-670 (2009) - Marian Mrozek, Bogdan Batko:
Coreduction Homology Algorithm. Discret. Comput. Geom. 41(1): 96-118 (2009) - Michael Navon, Alex Samorodnitsky:
Linear Programming Bounds for Codes via a Covering Argument. Discret. Comput. Geom. 41(2): 199-207 (2009) - János Pach, Géza Tóth:
Degenerate Crossing Numbers. Discret. Comput. Geom. 41(3): 376-384 (2009)
skipping 7 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-09-26 22:48 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