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 43 matches
- 2007
- Lowell Abrams, Donniell E. Fishkind:
The Genus of a Digital Image Boundary Is Determined by Its Foreground, Background, and Reeb Graphs. Discret. Comput. Geom. 37(4): 629-640 (2007) - Dominique Attali, Herbert Edelsbrunner:
Inclusion-Exclusion Formulas from Independent Complexes. Discret. Comput. Geom. 37(1): 59-77 (2007) - Maria Belk:
Realizability of Graphs in Three Dimensions. Discret. Comput. Geom. 37(2): 139-162 (2007) - Maria Belk, Robert Connelly:
Realizability of Graphs. Discret. Comput. Geom. 37(2): 125-137 (2007) - Karl Heinz Borgwardt:
Average-Case Analysis of the Double Description Method and the Beneath-Beyond Algorithm. Discret. Comput. Geom. 37(2): 175-204 (2007) - Károly J. Böröczky, Imre Z. Ruzsa:
Note on an Inequality of Wegner. Discret. Comput. Geom. 37(2): 245-249 (2007) - Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin:
Geodesic Ham-Sandwich Cuts. Discret. Comput. Geom. 37(3): 325-339 (2007) - Hervé Brönnimann, Olivier Devillers, Sylvain Lazard, Frank Sottile:
Lines Tangent to Four Triangles in Three-Dimensional Space. Discret. Comput. Geom. 37(3): 369-380 (2007) - Sergio Cabello, Bojan Mohar:
Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs. Discret. Comput. Geom. 37(2): 213-235 (2007) - Jeremy Carroll, Frank Ruskey, Mark Weston:
Which n-Venn Diagrams Can Be Drawn with Convex k-Gons? Discret. Comput. Geom. 37(4): 619-628 (2007) - Jesús Jerónimo-Castro:
Line Transversals to Translates of Unit Discs. Discret. Comput. Geom. 37(3): 409-417 (2007) - Timothy M. Chan, Eric Y. Chen:
Multi-Pass Geometric Algorithms. Discret. Comput. Geom. 37(1): 79-102 (2007) - Frédéric Chazal, André Lieutier:
Stability and Computation of Topological Invariants of Solids in \Bbb Rn. Discret. Comput. Geom. 37(4): 601-617 (2007) - Otfried Cheong, Alon Efrat, Sariel Har-Peled:
Finding a Guard that Sees Most and a Shop that Sells Most. Discret. Comput. Geom. 37(4): 545-563 (2007) - Otfried Cheong, Mira Lee:
The Hadwiger Number of Jordan Regions Is Unbounded. Discret. Comput. Geom. 37(4): 497-501 (2007) - Victor Chepoi, Bertrand Estellon, Yann Vaxès:
Covering Planar Graphs with a Fixed Number of Balls. Discret. Comput. Geom. 37(2): 237-244 (2007) - Kenneth L. Clarkson, Kasturi R. Varadarajan:
Improved Approximation Algorithms for Geometric Set Cover. Discret. Comput. Geom. 37(1): 43-58 (2007) - David Cohen-Steiner, Herbert Edelsbrunner, John Harer:
Stability of Persistence Diagrams. Discret. Comput. Geom. 37(1): 103-120 (2007) - Alastair Craw, Diane Maclagan:
Fiber Fans and Toric Quotients. Discret. Comput. Geom. 37(2): 251-266 (2007) - Vida Dujmovic, David R. Wood:
Graph Treewidth and Geometric Thickness Parameters. Discret. Comput. Geom. 37(4): 641-670 (2007) - Allan L. Edmonds:
Sommerville's Missing Tetrahedra. Discret. Comput. Geom. 37(2): 287-296 (2007) - Esther Ezra, Micha Sharir:
A Single Cell in an Arrangement of Convex Polyhedra in \Bbb R3. Discret. Comput. Geom. 37(1): 21-41 (2007) - Dirk Frettlöh, Bernd Sing:
Computing Modular Coincidences for Substitution Tilings and Point Sets. Discret. Comput. Geom. 37(3): 381-407 (2007) - Lenny Fukshansky, Sinai Robins:
Frobenius Problem and the Covering Radius of a Lattice. Discret. Comput. Geom. 37(3): 471-483 (2007) - Komei Fukuda, Christophe Weibel:
f-Vectors of Minkowski Additions of Convex Polytopes. Discret. Comput. Geom. 37(4): 503-516 (2007) - Sariel Har-Peled, Akash Kushal:
Smaller Coresets for k-Median and k-Means Clustering. Discret. Comput. Geom. 37(1): 3-19 (2007) - Christophe Hohlweg, Carsten E. M. C. Lange:
Realizations of the Associahedron and Cyclohedron. Discret. Comput. Geom. 37(4): 517-543 (2007) - Andreas F. Holmsen:
The Katchalski-Lewis Transversal Problem in Rn. Discret. Comput. Geom. 37(3): 341-349 (2007) - Anders Nedergaard Jensen:
A Non-Regular Grobner Fan. Discret. Comput. Geom. 37(3): 443-453 (2007) - Wlodzimierz Kuperberg:
Optimal Arrangements in Packing Congruent Balls in a Spherical Container. Discret. Comput. Geom. 37(2): 205-212 (2007)
skipping 13 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-10-02 11:21 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