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

• 2011
• 
  A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Gila Morgenstern:
  Multi Cover of a Polygon Minimizing the Sum of Areas. WALCOM 2011: 134-145
• 
  Sourabh Aryabhatta, Tonmoy Guha Roy, Md. Mohsin Uddin, Md. Saidur Rahman:
  On Graceful Labelings of Trees - (Extended Abstract). WALCOM 2011: 214-220
• 
  Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das:
  Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point. WALCOM 2011: 98-109
• 
  Annabell Berger, Matthias Müller-Hannemann, Steffen Rechner, Alexander Zock:
  Efficient Computation of Time-Dependent Centralities in Air Transportation Networks. WALCOM 2011: 77-88
• 
  Gautam K. Das, Robert Fraser, Alejandro López-Ortiz, Bradford G. Nickerson:
  On the Discrete Unit Disk Cover Problem. WALCOM 2011: 146-157
• 
  Tamal Krishna Dey:
  Geometry and Topology from Point Cloud Data. WALCOM 2011: 1
• 
  David Duris, Yann Strozecki:
  The Complexity of Acyclic Subhypergraph Problems. WALCOM 2011: 45-56
• 
  Martin Fink, Joachim Spoerhase:
  Maximum Betweenness Centrality: Approximability and Tractable Cases. WALCOM 2011: 9-20
• 
  Esha Ghosh, N. S. Narayanaswamy, C. Pandu Rangan:
  A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs. WALCOM 2011: 191-201
• 
  Neelima Gupta, Aditya Pancholi, Yogish Sabharwal:
  Clustering with Internal Connectedness. WALCOM 2011: 158-169
• 
  Martin Harrigan, Patrick Healy:
  k-Level Crossing Minimization Is NP-Hard for Trees. WALCOM 2011: 70-76
• 
  Ken-ichi Kawarabayashi:
  The Disjoint Paths Problem: Algorithm and Structure. WALCOM 2011: 2-7
• 
  Sebastian Kniesburges, Christian Scheideler:
  Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems. WALCOM 2011: 170-181
• 
  Mrinal Kumar, Sounaka Mishra, N. Safina Devi, Saket Saurabh:
  Approximation Algorithms for Minimum Chain Vertex Deletion. WALCOM 2011: 21-32
• 
  Kurt Mehlhorn:
  The Physarum Computer. WALCOM 2011: 8
• 
  Debajyoti Mondal, Muhammad Jawaherul Alam, Md. Saidur Rahman:
  Minimum-Layer Drawings of Trees - (Extended Abstract). WALCOM 2011: 221-232
• 
  Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos:
  Counting Spanning Trees in Graphs Using Modular Decomposition. WALCOM 2011: 202-213
• 
  Mourad El Ouali, Antje Fretwurst, Anand Srivastav:
  Inapproximability of b-Matching in k-Uniform Hypergraphs. WALCOM 2011: 57-69
• 
  Saladi Rahul, Ananda Swarup Das, Krishnan Sundara Rajan, Kannan Srinathan:
  Range-Aggregate Queries Involving Geometric Aggregation Operations. WALCOM 2011: 122-133
• 
  Saladi Rahul, Prosenjit Gupta, Ravi Janardan, Krishnan Sundara Rajan:
  Efficient Top-k Queries for Orthogonal Ranges. WALCOM 2011: 110-121
• 
  Joe Sawada, Brett Stevens, Aaron Williams:
  De Bruijn Sequences for the Binary Strings with Maximum Density. WALCOM 2011: 182-190
• 
  Michael Schneider:
  Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in Lattices. WALCOM 2011: 89-97
• 
  Srinivasagopalan Srivathsan, Costas Busch, S. Sitharama Iyengar:
  Oblivious Buy-at-Bulk in Planar Graphs. WALCOM 2011: 33-44
• 
  Naoki Katoh, Amit Kumar:
  WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings. Lecture Notes in Computer Science 6552, Springer 2011, ISBN 978-3-642-19093-3 [contents]