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 52 matches
- 2012
- Bernardo M. Ábrego, Mario Cetina, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar:
On ≤k-Edges, Crossings, and Halving Lines of Geometric Drawings of K n. Discret. Comput. Geom. 48(1): 192-215 (2012) - Christoph Aistleitner, Johann S. Brauchart, Josef Dick:
Point Sets on the Sphere S2 with Small Spherical Cap Discrepancy. Discret. Comput. Geom. 48(4): 990-1024 (2012) - Deepak Ajwani, Khaled M. Elbassioni, Sathish Govindarajan, Saurabh Ray:
Conflict-Free Coloring for Rectangle Ranges Using O(n .382) Colors. Discret. Comput. Geom. 48(1): 39-52 (2012) - Shigeki Akiyama:
A Note on Aperiodic Ammann Tiles. Discret. Comput. Geom. 48(3): 702-710 (2012) - Arseniy V. Akopyan, Roman N. Karasev:
Kadets-Type Theorems for Partitions of a Convex Body. Discret. Comput. Geom. 48(3): 766-776 (2012) - Nina Amenta, Dominique Attali, Olivier Devillers:
A Tight Bound for the Delaunay Triangulation of Points on a Polyhedron. Discret. Comput. Geom. 48(1): 19-38 (2012) - Laura Anderson, Emanuele Delucchi:
Foundations for a Theory of Complex Matroids. Discret. Comput. Geom. 48(4): 807-846 (2012) - Boris Aronov, Mark de Berg:
Unions of Fat Convex Polytopes Have Short Skeletons. Discret. Comput. Geom. 48(1): 53-64 (2012) - Gennadiy Averkov, Barbara Langfeld:
On the Reconstruction of Planar Lattice-Convex Sets from the Covariogram. Discret. Comput. Geom. 48(1): 216-238 (2012) - Bhaskar Bagchi, Basudeb Datta:
A Triangulation of ℂP 3 as Symmetric Cube of S 2. Discret. Comput. Geom. 48(2): 310-329 (2012) - Imre Bárány, Roman N. Karasev:
Notes About the Carathéodory Number. Discret. Comput. Geom. 48(3): 783-792 (2012) - Olivia Beckwith, Matthew Grimm, Jenya Soprunova, Bradley Weaver:
Minkowski Length of 3D Lattice Polytopes. Discret. Comput. Geom. 48(4): 1137-1158 (2012) - Eric Berberich, Dan Halperin, Michael Kerber, Roza Pogalnikova:
Deconstructing Approximate Offsets. Discret. Comput. Geom. 48(4): 964-989 (2012) - Károly Bezdek:
Contact Numbers for Congruent Sphere Packings in Euclidean 3-Space. Discret. Comput. Geom. 48(2): 298-309 (2012) - Therese Biedl, Mohammad Tanvir Irfan, Justin Iwerks, Joondong Kim, Joseph S. B. Mitchell:
The Art Gallery Theorem for Polyominoes. Discret. Comput. Geom. 48(3): 711-720 (2012) - Louis J. Billera, Eran Nevo:
Nonpolytopal Nonsimplicial Lattice Spheres with Nonnegative Toric g-Vector. Discret. Comput. Geom. 48(4): 1048-1057 (2012) - Timothy M. Chan:
On Levels in Arrangements of Surfaces in Three Dimensions. Discret. Comput. Geom. 48(1): 1-18 (2012) - Timothy M. Chan, Sariel Har-Peled:
Approximation Algorithms for Maximum Independent Set of Pseudo-Disks. Discret. Comput. Geom. 48(2): 373-392 (2012) - Elizabeth R. Chen:
Mandelbrot Set + Symmetry Groups ∗ Higher Dimensions = ? Discret. Comput. Geom. 48(4): 1074-1109 (2012) - Filip Cools:
Linear Pencils of Tropical Plane Curves. Discret. Comput. Geom. 48(2): 453-466 (2012) - Marcos Craizer, Ralph Teixeira, Moacyr A. H. B. da Silva:
Affine Properties of Convex Equal-Area Polygons. Discret. Comput. Geom. 48(3): 580-595 (2012) - Michael Cuntz:
Simplicial Arrangements with up to 27 Lines. Discret. Comput. Geom. 48(3): 682-701 (2012) - Hristo N. Djidjev, Imrich Vrt'o:
Planar Crossing Numbers of Graphs of Bounded Genus. Discret. Comput. Geom. 48(2): 393-415 (2012) - Anne Driemel, Sariel Har-Peled, Carola Wenk:
Approximating the Fréchet Distance for Realistic Curves in Near Linear Time. Discret. Comput. Geom. 48(1): 94-127 (2012) - Samuel Fiorini, Thomas Rothvoß, Hans Raj Tiwary:
Extended Formulations for Polygons. Discret. Comput. Geom. 48(3): 658-668 (2012) - Matthieu Fradelizi, Mathieu Meyer, Artem Zvavitch:
An Application of Shadow Systems to Mahler's Conjecture. Discret. Comput. Geom. 48(3): 721-734 (2012) - Lenny Fukshansky, Glenn Henshaw, Philip Liao, Matthew Prince, Xun Sun, Samuel Whitehead:
On Integral Well-rounded Lattices in the Plane. Discret. Comput. Geom. 48(3): 735-748 (2012) - Richard J. Gardner, Paolo Gronchi, Thorsten Theobald:
Determining a Rotation of a Tetrahedron from a Projection. Discret. Comput. Geom. 48(3): 749-765 (2012) - Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou:
Triangle Contact Representations and Duality. Discret. Comput. Geom. 48(1): 239-254 (2012) - Nick Gravin, Jean B. Lasserre, Dmitrii V. Pasechnik, Sinai Robins:
The Inverse Moment Problem for Convex Polytopes. Discret. Comput. Geom. 48(3): 596-621 (2012)
skipping 22 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-11-03 21:10 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