• 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 37 matches

• 1990
• 
  Pankaj K. Agarwal, Boris Aronov, Joseph O'Rourke, Catherine A. Schevon:
  Star Unfolding of a Polytope with Applications (Extended Abstract). SWAT 1990: 251-263
• 
  Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph:
  Generating Sparse Spanners for Weighted Graphs. SWAT 1990: 26-37
• 
  Arne Andersson, Tony W. Lai:
  Fast Updating of Well-Balanced Trees. SWAT 1990: 111-121
• 
  Stefan Arnborg, Andrzej Proskurowski:
  Canonical Representation of Partial 2- and 3-Trees. SWAT 1990: 310-319
• 
  Mikhail J. Atallah:
  A Faster Parallel Algorithm for a Matrix Searching Problem. SWAT 1990: 192-200
• 
  Ricardo A. Baeza-Yates, Gaston H. Gonnet, Nivio Ziviani:
  Expected Behaviour Analysis of AVL Trees. SWAT 1990: 143-159
• 
  Ricardo A. Baeza-Yates, Mireille Régnier:
  Fast Algorithms for Two Dimensional and Multiple Pattern Matching (Preliminary Version). SWAT 1990: 332-347
• 
  Samuel W. Bent:
  Ranking Trees Generated by Rotations. SWAT 1990: 132-142
• 
  Mark de Berg:
  Translating Polygons with Applications to Hidden Surface Removal. SWAT 1990: 60-70
• 
  Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars:
  Finding Shortest Paths in the Presence of Orthogonal Obstacles Using a Combined L1 and Link Metric. SWAT 1990: 213-224
• 
  Hans L. Bodlaender, Rolf H. Möhring:
  The Pathwidth and Treewidth of Cographs. SWAT 1990: 301-309
• 
  Ravi B. Boppana, Magnús M. Halldórsson:
  Approximating Maximum Independent Sets by Excluding Subgraphs. SWAT 1990: 13-25
• 
  Paul F. Dietz, Ju Zhang:
  Lower Bounds for Monotonic List Labeling. SWAT 1990: 173-180
• 
  David Eppstein:
  Finding the k Smallest Spanning Trees. SWAT 1990: 38-47
• 
  David Fernández-Baca:
  Space-Sweep Algorithms for Parametric Optimization (Extended Abstract). SWAT 1990: 264-275
• 
  David Fernández-Baca, Mark A. Williams:
  On Matroids and Hierarchical Graphs. SWAT 1990: 320-331
• 
  Joseph Friedman, John Hershberger, Jack Snoeyink:
  Input-Sensitive Compliant Motion in the Plane. SWAT 1990: 225-237
• 
  Per Grape:
  Complete Problems With L-samplable Distributions. SWAT 1990: 360-367
• 
  Juris Hartmanis, Richard Chang, Desh Ranjan, Pankaj Rohatgi:
  Structural Complexity Theory: recent Surprises. SWAT 1990: 1-12
• 
  John Hershberger:
  Upper Envelope Onion Peeling. SWAT 1990: 368-379
• 
  John Hershberger, Subhash Suri:
  Applications of a Semi-Dynamic Convex Hull Algorithm. SWAT 1990: 380-392
• 
  David S. Johnson:
  Data Structures for Traveling Salesmen (Abstract). SWAT 1990: 287
• 
  Goos Kant, Jan van Leeuwen:
  The File Distribution Problem for Processor Networks. SWAT 1990: 48-59
• 
  Nickolay M. Korneenko, Horst Martini:
  Approximating Finite Weighted Point Sets by Hyperplanes. SWAT 1990: 276-286
• 
  Marc J. van Kreveld, Mark H. Overmars, Pankaj K. Agarwal:
  Intersection Queries in Sets of Disks. SWAT 1990: 393-403
• 
  Christos Levcopoulos, Andrzej Lingas:
  Fast Algorithms for Greedy Triangulation. SWAT 1990: 238-250
• 
  Christos Levcopoulos, Ola Petersson:
  Sorting Shuffled Monotone Sequences. SWAT 1990: 181-191
• 
  Thomas Ottmann, Derick Wood:
  How to Update a Balanced Binary Tree with a Constant Number of Rotations. SWAT 1990: 122-131
• 
  Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis:
  Efficient Parallel Algorithms for Shortest Paths in Planar Graphs. SWAT 1990: 288-300
• 
  Thomas Papadakis, J. Ian Munro, Patricio V. Poblete:
  Analysis of the Expected Search Cost in Skip Lists. SWAT 1990: 160-172

skipping 7 more matches