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

• 1992
• 
  Gerhard Albers, Thomas Roos:
  Voronoi Diagrams of Moving Points in Higher Dimensional Spaces. SWAT 1992: 399-409
• 
  Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg:
  Low-Diameter Graph Decomposition is in NC. SWAT 1992: 83-93
• 
  Mark de Berg, Marc J. van Kreveld, Jack Snoeyink:
  Two- and Three-Dimensional Point Location in Rectangular Subdivisions (Extended Abstract). SWAT 1992: 352-363
• 
  Paola Bertolazzi, Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis:
  How to Draw a Series-Parallel Digraph (Extended Abstract). SWAT 1992: 272-283
• 
  Joan Boyar, Kim S. Larsen:
  Efficient Rebalancing of Chromatic Search Trees. SWAT 1992: 151-164
• 
  Bernard Chazelle, Leonidas Palios:
  Decomposing the Boundary of a Nonconvex Polyhedron. SWAT 1992: 364-375
• 
  L. Paul Chew, Klara Kedem:
  Improvements on Geometric Pattern Matching Problems. SWAT 1992: 318-325
• 
  Walter Cunto, Vicente Yriarte:
  GKD-Trees: Binary Trees that Combine Multi-dimensional Data Handling, Node Size and Fringe Reorganization. SWAT 1992: 192-211
• 
  Artur Czumaj:
  An Optimal Parallel Algorithm for Computing a Near-Optimal Order of Matrix Multiplications. SWAT 1992: 62-72
• 
  Paul F. Dietz:
  Heap Construction in the Parallel Comparison Tree Model. SWAT 1992: 140-150
• 
  David Fernández-Baca, Giora Slutzki:
  Parametric Problems on Graphs of Bounded Tree-Width. SWAT 1992: 304-316
• 
  Faith E. Fich, Miroslaw Kowaluk, Krzysztof Lorys, Miroslaw Kutylowski, Prabhakar Ragde:
  Retrieval of scattered information by EREW, CREW and CRCW PRAMs. SWAT 1992: 30-41
• 
  Rusins Freivalds, Carl H. Smith:
  Memory Limited Inductive Inference Machines. SWAT 1992: 19-29
• 
  Martin Fürer, C. R. Subramanian:
  Coloring Random Graphs. SWAT 1992: 284-291
• 
  Alexandros V. Gerbessiotis, Leslie G. Valiant:
  Direct Bulk-Synchronous Parallel Algorithms. SWAT 1992: 1-18
• 
  Subir Kumar Ghosh, Anil Maheshwari:
  Parallel Algorithms for All Minimum Link Paths and Link Center Problems. SWAT 1992: 106-117
• 
  Dora Giammarresi, Giuseppe F. Italiano:
  Dynamic 2- and 3-Connectivity on Planar Graphs (Preliminary Version). SWAT 1992: 221-232
• 
  Mordecai J. Golin:
  Dynamic Closest Pairs - A Probabilistic Approach. SWAT 1992: 340-351
• 
  Gaston H. Gonnet:
  Efficient Two-dimensional Searching. SWAT 1992: 317
• 
  Xin He:
  Parallel Algorithm for Cograph Recognition with Applications. SWAT 1992: 94-105
• 
  John Hershberger, Monika Rauch, Subhash Suri:
  Fully Dynamic 2-Edge-Connectivity in Planar Graphs. SWAT 1992: 233-244
• 
  John Hershberger, Jack Snoeyink:
  Convex Polygons Made from Few Lines and Convex Decompositions of Polyhedra. SWAT 1992: 376-387
• 
  Andreas Jakoby, Rüdiger Reischuk:
  The Complexity of Scheduling Problems with Communication Delays for Trees. SWAT 1992: 165-177
• 
  Deborah Joseph, Joao Meidanis, Prasoon Tiwari:
  Determining DNA Sequence Similarity Using Maximum Independent Set Algorithms for Interval Graphs. SWAT 1992: 326-337
• 
  Goos Kant, Hans L. Bodlaender:
  Triangulating Planar Graphs While Minimizing the Maximum Degree. SWAT 1992: 258-271
• 
  Jyrki Katajainen, Tomi Pasanen:
  Sorting Multisets Stably in Minimum Space. SWAT 1992: 410-421
• 
  Michael Kaufmann, Jop F. Sibeyn:
  Optimal Multi-Packet Routing on the Torus. SWAT 1992: 118-129
• 
  Ton Kloks, Hans L. Bodlaender:
  Testing Superperfection of k-Trees. SWAT 1992: 292-303
• 
  Guy Kortsarz, David Peleg:
  Generating Sparse 2-spanners. SWAT 1992: 73-82
• 
  Hans-Peter Lenhof, Michiel H. M. Smid:
  Maintaining the Visibility Map of Spheres while Moving the Viewpoint on a Circle at Infinity. SWAT 1992: 388-398

skipping 9 more matches