• 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.

found 65 matches

• 2021
• 
  A. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel Smid, Shakhar Smorodinsky:
  Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs. Discret. Comput. Geom. 66(4): 1401-1414 (2021)
• 
  Arseniy V. Akopyan, Alexander I. Bobenko, Wolfgang K. Schief, Jan Techter:
  On Mutually Diagonal Nets on (Confocal) Quadrics and 3-Dimensional Webs. Discret. Comput. Geom. 66(3): 938-976 (2021)
• 
  Gennadiy Averkov, Christopher Borger, Ivan Soprunov:
  Classification of Triples of Lattice Polytopes with a Given Mixed Volume. Discret. Comput. Geom. 66(1): 165-202 (2021)
• 
  Sergey Avvakumov, Sergey Kudrya:
  Vanishing of All Equivariant Obstructions and the Mapping Degree. Discret. Comput. Geom. 66(3): 1202-1216 (2021)
• 
  Simeon Ball, Enrique Jimenez:
  On Sets Defining Few Ordinary Solids. Discret. Comput. Geom. 66(1): 68-91 (2021)
• 
  Florent P. Baudier, Pavlos Motakis, Thomas Schlumprecht, András Zsák:
  On the Bi-Lipschitz Geometry of Lamplighter Graphs. Discret. Comput. Geom. 66(1): 203-235 (2021)
• 
  Matthias Beck, Emerson León:
  Binomial Inequalities for Chromatic, Flow, and Tension Polynomials. Discret. Comput. Geom. 66(2): 464-474 (2021)
• 
  Mark C. Bell:
  Simplifying Triangulations. Discret. Comput. Geom. 66(1): 1-11 (2021)
• 
  Håvard Bakke Bjerkevik:
  On the Stability of Interval Decomposable Persistence Modules. Discret. Comput. Geom. 66(1): 92-121 (2021)
• 
  Alexander I. Bobenko, Alexander Y. Fairley:
  Nets of Lines with the Combinatorics of the Square Grid and with Touching Inscribed Conics. Discret. Comput. Geom. 66(4): 1382-1400 (2021)
• 
  Jean-Daniel Boissonnat, Olivier Devillers, Kunal Dutta, Marc Glisse:
  Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets. Discret. Comput. Geom. 66(1): 236-268 (2021)
• 
  Jean-Daniel Boissonnat, Ramsay Dyer, Arijit Ghosh, André Lieutier, Mathijs Wintraecken:
  Local Conditions for Triangulating Submanifolds of Euclidean Space. Discret. Comput. Geom. 66(2): 666-686 (2021)
• 
  Jean-Daniel Boissonnat, Siargey Kachanovich, Mathijs Wintraecken:
  Triangulating Submanifolds: An Elementary and Quantified Version of Whitney's Method. Discret. Comput. Geom. 66(1): 386-434 (2021)
• 
  Michael Boshernitzan, Yaar Solomon:
  On Visibility Problems with an Infinite Discrete Set of Obstacles. Discret. Comput. Geom. 66(2): 590-612 (2021)
• 
  Javier Bracho, Isabel Hubard, Daniel Pellicer:
  Chiral Polyhedra in 3-Dimensional Geometries and from a Petrie-Coxeter Construction. Discret. Comput. Geom. 66(3): 1025-1052 (2021)
• 
  Patricia Cahn, Alexandra Kjuchukova:
  Linking Numbers in Three-Manifolds. Discret. Comput. Geom. 66(2): 435-463 (2021)
• 
  Timothy M. Chan, Sariel Har-Peled:
  Smallest k-Enclosing Rectangle Revisited. Discret. Comput. Geom. 66(2): 769-791 (2021)
• 
  Giulia Codenotti, Lorenzo Venturello:
  Octahedralizing 3-Colorable 3-Polytopes. Discret. Comput. Geom. 66(4): 1429-1445 (2021)
• 
  Robert Connelly, Steven J. Gortler:
  Packing Disks by Flipping and Flowing. Discret. Comput. Geom. 66(4): 1262-1285 (2021)
• 
  Marcos Craizer, Sinésio Pesco:
  Centroaffine Duality for Spatial Polygons. Discret. Comput. Geom. 66(2): 575-589 (2021)
• 
  Francisco Criado, Andrew Newman:
  Randomized Construction of Complexes with Large Diameter. Discret. Comput. Geom. 66(2): 687-700 (2021)
• 
  Sean Dewar:
  Flexible Placements of Periodic Graphs in the Plane. Discret. Comput. Geom. 66(4): 1286-1329 (2021)
• 
  Nikolai P. Dolbilin, Alexey Garber, Undine Leopold, Egon Schulte, Marjorie Senechal:
  On the Regularity Radius of Delone Sets in ${\mathbb {R}}3$. Discret. Comput. Geom. 66(3): 996-1024 (2021)
• 
  Martin Dolezal, Jan Hladký, Jan Kolár, Themis Mitsis, Christos Pelekis, Václav Vlasák:
  A Turán-Type Theorem for Large-Distance Graphs in Euclidean Spaces, and Related Isodiametric Problems. Discret. Comput. Geom. 66(1): 281-300 (2021)
• 
  Daniele Dona:
  Number of Directions Determined by a Set in $\mathbb {F}_{q}{2}$ and Growth in $\mathrm {Aff}(\mathbb {F}_{q})$. Discret. Comput. Geom. 66(4): 1415-1428 (2021)
• 
  Anne Driemel, André Nusser, Jeff M. Phillips, Ioannis Psarros:
  The VC Dimension of Metric Balls under Fréchet and Hausdorff Distances. Discret. Comput. Geom. 66(4): 1351-1381 (2021)
• 
  Ujué Etayo:
  Spherical Cap Discrepancy of the Diamond Ensemble. Discret. Comput. Geom. 66(4): 1218-1238 (2021)
• 
  Chaim Even-Zohar, Michael Farber:
  Random Surfaces with Boundary. Discret. Comput. Geom. 66(4): 1463-1469 (2021)
• 
  Thomas Fernique, Amir Hashemi, Olga Sizova:
  Compact Packings of the Plane with Three Sizes of Discs. Discret. Comput. Geom. 66(2): 613-635 (2021)
• 
  Samuel Fiorini, Tony Huynh, Gwenaël Joret, Carole Muller:
  Unavoidable Minors for Graphs with Large ℓ _p-Dimension. Discret. Comput. Geom. 66(1): 301-343 (2021)

skipping 35 more matches