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

• 2010
• 
  Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Micha Sharir, Binhai Zhu:
  Guarding a Terrain by Two Watchtowers. Algorithmica 58(2): 352-390 (2010)
• 
  Susanne Albers:
  New Results on Web Caching with Request Reordering. Algorithmica 58(2): 461-477 (2010)
• 
  Katerina Asdre, Stavros D. Nikolopoulos:
  The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval Graphs. Algorithmica 58(3): 679-710 (2010)
• 
  Omer Barkol, Yuval Ishai, Enav Weinreb:
  On Locally Decodable Codes, Self-Correctable Codes, and t-Private PIR. Algorithmica 58(4): 831-859 (2010)
• 
  Mohsen Bayati, Jeong Han Kim, Amin Saberi:
  A Sequential Algorithm for Generating Random Graphs. Algorithmica 58(4): 860-910 (2010)
• 
  Péter Biró, Eric McDermid:
  Three-Sided Stable Matchings with Cyclic Preferences. Algorithmica 58(1): 5-18 (2010)
• 
  Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Giancarlo Mauri:
  Fingerprint Clustering with Bounded Number of Missing Values. Algorithmica 58(2): 282-303 (2010)
• 
  Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid:
  Computing the Greedy Spanner in Near-Quadratic Time. Algorithmica 58(3): 711-729 (2010)
• 
  Tian-Ming Bu, Li Liang, Qi Qi:
  On Robustness of Forward-looking in Sponsored Search Auction. Algorithmica 58(4): 970-989 (2010)
• 
  Sergio Cabello, Herman J. Haverkort, Marc J. van Kreveld, Bettina Speckmann:
  Algorithmic Aspects of Proportional Symbol Maps. Algorithmica 58(3): 543-565 (2010)
• 
  Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stéphane Pérennes, Hervé Rivano:
  Fractional Path Coloring in Bounded Degree Trees with Applications. Algorithmica 58(2): 516-540 (2010)
• 
  Katarína Cechlárová, Tamás Fleiner:
  Housing Markets Through Graphs. Algorithmica 58(1): 19-33 (2010)
• 
  Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Yong Zhang:
  Absolute and Asymptotic Bounds for Online Frequency Allocation in Cellular Networks. Algorithmica 58(2): 498-515 (2010)
• 
  Ho-Leung Chan, Tak Wah Lam, Wing-Kin Sung, Siu-Lung Tam, Swee-Seong Wong:
  Compressed Indexes for Approximate String Matching. Algorithmica 58(2): 263-281 (2010)
• 
  Yiling Chen, Stanko Dimitrov, Rahul Sami, Daniel M. Reeves, David M. Pennock, Robin D. Hanson, Lance Fortnow, Rica Gonen:
  Gaming Prediction Markets: Equilibrium Strategies with a Market Maker. Algorithmica 58(4): 930-969 (2010)
• 
  Christine T. Cheng:
  Understanding the Generalized Median Stable Matchings. Algorithmica 58(1): 34-51 (2010)
• 
  Christophe Crespelle, Christophe Paul:
  Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs. Algorithmica 58(2): 405-432 (2010)
• 
  John Dabney, Brian C. Dean:
  An Efficient Algorithm for Batch Stability Testing. Algorithmica 58(1): 52-58 (2010)
• 
  Brian C. Dean, Siddharth Munshi:
  Faster Algorithms for Stable Allocation Problems. Algorithmica 58(1): 59-81 (2010)
• 
  Xiaotie Deng, Fan Chung Graham:
  Introduction to the Special Section on Internet and Network Economics. Algorithmica 58(4): 928-929 (2010)
• 
  Florian Diedrich, Klaus Jansen, Fanny Pascual, Denis Trystram:
  Approximation Algorithms for Scheduling with Reservations. Algorithmica 58(2): 391-404 (2010)
• 
  Benjamin Doerr, Frank Neumann:
  In Memoriam: Ingo Wegener. Algorithmica 58(3): 541-542 (2010)
• 
  Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin:
  Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions. Algorithmica 58(3): 790-810 (2010)
• 
  Karim Douïeb, Stefan Langerman:
  Near-Entropy Hotlink Assignments. Algorithmica 58(2): 221-244 (2010)
• 
  James Allen Fill, Takéhiko Nakama:
  Analysis of the Expected Number of Bit Comparisons Required by Quickselect. Algorithmica 58(3): 730-769 (2010)
• 
  Tamás Fleiner:
  The Stable Roommates Problem with Choice Functions. Algorithmica 58(1): 82-101 (2010)
• 
  Patrik Floréen, Petteri Kaski, Valentin Polishchuk, Jukka Suomela:
  Almost Stable Matchings by Truncating the Gale-Shapley Algorithm. Algorithmica 58(1): 102-118 (2010)
• 
  Naveen Garg, Telikepalli Kavitha, Amit Kumar, Kurt Mehlhorn, Julián Mestre:
  Assigning Papers to Referees. Algorithmica 58(1): 119-136 (2010)
• 
  Anders Gidenstam, Marina Papatriantafilou, Philippas Tsigas:
  NBmalloc: Allocating Memory in a Lock-Free Manner. Algorithmica 58(2): 304-338 (2010)
• 
  Mira Gonen, Dana Ron:
  On the Benefits of Adaptivity in Property Testing of Dense Graphs. Algorithmica 58(4): 811-830 (2010)

skipping 17 more matches