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

• 2008
• 
  Amotz Bar-Noy, Richard E. Ladner, Tami Tamir:
  Scheduling Techniques for Media-on-Demand. Algorithmica 52(4): 413-439 (2008)
• 
  Andreas Björklund, Thore Husfeldt:
  Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings. Algorithmica 52(2): 226-249 (2008)
• 
  Andreas Brandstädt, Chính T. Hoàng:
  Maximum Induced Matchings for Chordal Graphs in Linear Time. Algorithmica 52(4): 440-447 (2008)
• 
  Christoph Buchheim, Seok-Hee Hong:
  Testing Planarity of Geometric Automorphisms in Linear Time. Algorithmica 52(4): 448-465 (2008)
• 
  Jianer Chen, Iyad A. Kanj:
  Foreword from the Guest Editors. Algorithmica 52(2): 113 (2008)
• 
  Ning Chen, Atri Rudra:
  Walrasian Equilibrium: Hardness, Approximations and Tractable Instances. Algorithmica 52(1): 44-64 (2008)
• 
  Xiaotie Deng, Yinyu Ye:
  Preface. Algorithmica 52(1): 1-2 (2008)
• 
  Vida Dujmovic, Michael R. Fellows, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Sue Whitesides, David R. Wood:
  On the Parameterized Complexity of Layered Graph Drawing. Algorithmica 52(2): 267-292 (2008)
• 
  Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides:
  Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. Algorithmica 52(2): 167-176 (2008)
• 
  Irene Finocchi, Giuseppe F. Italiano:
  Sorting and Searching in Faulty Memories. Algorithmica 52(3): 309-332 (2008)
• 
  Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch:
  Solving Connected Dominating Set Faster than 2 ⁿ . Algorithmica 52(2): 153-166 (2008)
• 
  Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin, Igor Razgon:
  On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms. Algorithmica 52(2): 293-307 (2008)
• 
  Jiong Guo, Rolf Niedermeier, Daniel Raible:
  Improved Algorithms and Complexity Results for Power Domination in Graphs. Algorithmica 52(2): 177-202 (2008)
• 
  Gregory Z. Gutin, Stefan Szeider, Anders Yeo:
  Fixed-Parameter Complexity of Minimum Profile Problems. Algorithmica 52(2): 133-152 (2008)
• 
  Falk Hüffner, Sebastian Wernicke, Thomas Zichner:
  Algorithm Engineering for Color-Coding with Applications to Signaling Pathway Detection. Algorithmica 52(2): 114-132 (2008)
• 
  Morten Skaarup Jensen, Rasmus Pagh:
  Optimality in External Memory Hashing. Algorithmica 52(3): 403-411 (2008)
• 
  Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch:
  An [(O)\tilde](m²n)\tilde{O}(m{2}n) Algorithm for Minimum Cycle Basis of Graphs. Algorithmica 52(3): 333-349 (2008)
• 
  Subhash Khot, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta:
  Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions. Algorithmica 52(1): 3-18 (2008)
• 
  Dong Kyue Kim, Minhwan Kim, Heejin Park:
  Linearized Suffix Tree: an Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays. Algorithmica 52(3): 350-377 (2008)
• 
  Anshul Kothari, Subhash Suri, Yunhong Zhou:
  Bandwidth-Constrained Allocation in Grid Computing. Algorithmica 52(4): 487-501 (2008)
• 
  Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis:
  Cost Sharing Mechanisms for Fair Pricing of Resource Usage. Algorithmica 52(1): 19-43 (2008)
• 
  Mikolaj Morzy:
  New Algorithms for Mining the Reputation of Participants of Online Auctions. Algorithmica 52(1): 95-112 (2008)
• 
  Wai-Yin Ng, Dah Ming Chiu, W. K. Lin:
  Club Formation by Rational Sharing: Content, Viability and Community Structure. Algorithmica 52(1): 80-94 (2008)
• 
  Ojas Parekh, Danny Segev:
  Path Hitting in Acyclic Graphs. Algorithmica 52(4): 466-486 (2008)
• 
  Venkatesh Raman, Saket Saurabh:
  Short Cycles Make W -hard Problems Hard: FPT Algorithms for W -hard Problems in Graphs with no Short Cycles. Algorithmica 52(2): 203-225 (2008)
• 
  Fang Wu, Li Zhang, Bernardo A. Huberman:
  Truth-Telling Reservations. Algorithmica 52(1): 65-79 (2008)
• 
  Minzhu Xie, Jianxin Wang:
  An Improved (and Practical) Parameterized Algorithm for the Individual Haplotyping Problem MFR with Mate-Pairs. Algorithmica 52(2): 250-266 (2008)
• 
  Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kasturi R. Varadarajan:
  Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets. Algorithmica 52(3): 378-402 (2008)