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 42 matches
- 2007
- Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl:
Pre-Triangulations and Liftable Complexes. Discret. Comput. Geom. 38(4): 701-725 (2007) - Oswin Aichholzer, Jesús García-López, David Orden, Pedro Ramos:
New Lower Bounds for the Number of (<=k)-Edges and the Rectilinear Crossing Number of Kn. Discret. Comput. Geom. 38(1): 1-14 (2007) - Dan Archdeacon, C. Paul Bonnington, Joanna A. Ellis-Monaghan:
How to Exhibit Toroidal Maps in Space. Discret. Comput. Geom. 38(3): 573-594 (2007) - Sanjeev Arora, James R. Lee, Assaf Naor:
Fréchet Embeddings of Negative Type Metrics. Discret. Comput. Geom. 38(4): 726-739 (2007) - Michael Baake, Peter A. B. Pleasants, Ulf Rehmann:
Coincidence Site Modules in 3-Space. Discret. Comput. Geom. 38(1): 111-138 (2007) - Imre Bárány, Jirí Matousek:
Packing Cones and Their Negatives in Space. Discret. Comput. Geom. 38(2): 177-187 (2007) - Imre Bárány, János Pach:
Foreword. Discret. Comput. Geom. 38(2): 175-176 (2007) - Gill Barequet, Alina Shaikhet:
The On-Line Heilbronn's Triangle Problem in d Dimensions. Discret. Comput. Geom. 38(1): 51-60 (2007) - MohammadHossein Bateni, Erik D. Demaine, MohammadTaghi Hajiaghayi, Mohammad Moharrami:
Plane Embeddings of Planar Graph Metrics. Discret. Comput. Geom. 38(3): 615-637 (2007) - Christian Bey, Martin Henk, Jörg M. Wills:
Notes on the Roots of Ehrhart Polynomials. Discret. Comput. Geom. 38(1): 81-98 (2007) - András Bezdek:
On a Generalization of Tarski's Plank Problem. Discret. Comput. Geom. 38(2): 189-200 (2007) - Károly Bezdek, Zsolt Lángi, Márton Naszódi, Peter Papez:
Ball-Polyhedra. Discret. Comput. Geom. 38(2): 201-230 (2007) - Anders Björner, Svante Linusson:
The Number of k-Faces of a Simple d-Polytope. Discret. Comput. Geom. 38(1): 172 (2007) - Alexander I. Bobenko, Boris Springborn:
A Discrete Laplace-Beltrami Operator for Simplicial Surfaces. Discret. Comput. Geom. 38(4): 740-756 (2007) - Károly J. Böröczky, Károly Böröczky Jr.:
Polytopes of Minimal Volume with Respect to a Shell - Another Characterization ofthe Octahedron and the Icosahedron. Discret. Comput. Geom. 38(2): 231-241 (2007) - Benjamin A. Burton:
Enumeration of Non-Orientable 3-Manifolds Using Face-Pairing Graphs and Union-Find. Discret. Comput. Geom. 38(3): 527-571 (2007) - Tamal K. Dey, Rephael Wenger:
Stability of Critical Points with Interval Persistence. Discret. Comput. Geom. 38(3): 479-512 (2007) - Raghavan Dhandapani, Jacob E. Goodman, Andreas F. Holmsen, Richard Pollack, Shakhar Smorodinsky:
Convexity in Topological Affine Planes. Discret. Comput. Geom. 38(2): 243-257 (2007) - Ilya Dumer:
Covering Spheres with Spheres. Discret. Comput. Geom. 38(4): 665-679 (2007) - Zoltán Füredi:
Covering a Triangle with Positive and Negative Homothetic Copies. Discret. Comput. Geom. 38(2): 273-288 (2007) - David Glickenstein:
A Monotonicity Property for Weighted Delaunay Triangulations. Discret. Comput. Geom. 38(4): 651-664 (2007) - Johan Håstad, Svante Linusson, Johan Wästlund:
A Smaller Sleeping Bag for a Baby Snake. Discret. Comput. Geom. 38(1): 171 (2007) - Aladár Heppes:
Proof of the Katchalski-Lewis Transversal Conjecture for T(3)-Families of Congruent Discs. Discret. Comput. Geom. 38(2): 289-304 (2007) - Daniel Hug, Rolf Schneider:
Typical Cells in Poisson Hyperplane Tessellations. Discret. Comput. Geom. 38(2): 305-319 (2007) - Kevin Iga, Randall Maddox:
Pebble Sets in Convex Polygons. Discret. Comput. Geom. 38(4): 680-700 (2007) - Alex Iosevich, Michael Rudnev:
Distance Measures for Well-Distributed Sets. Discret. Comput. Geom. 38(1): 61-80 (2007) - Roman N. Karasev:
Tverberg's Transversal Conjecture and Analogues of Nonembeddability Theorems for Transversals. Discret. Comput. Geom. 38(3): 513-525 (2007) - Jack H. Koolen, Alice Lesser, Vincent Moulton:
Concerning the Relationship between Realizations and Tight Spans of Finite Metrics. Discret. Comput. Geom. 38(3): 605-614 (2007) - Thomas Lam, Alexander Postnikov:
Alcoved Polytopes, I. Discret. Comput. Geom. 38(3): 453-478 (2007) - Hagit Last, Rom Pinchasi:
At Least n - 1 Intersection Points in a Connected Family of n Unit Circles in the Plane. Discret. Comput. Geom. 38(2): 321-354 (2007)
skipping 12 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 2025-01-03 18:19 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