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

• 2014
• 
  Selim G. Akl, Robert Benkoczi, Daya Ram Gaur, Hossam S. Hassanein, Shahadat Hossain, Mark Thom:
  On a Class of Covering Problems with Variable Capacities in Wireless Networks. WALCOM 2014: 138-150
• 
  Ali Alatabbi, Jacqueline W. Daykin, M. Sohel Rahman, William F. Smyth:
  Simple Linear Comparison of Strings in V-Order - (Extended Abstract). WALCOM 2014: 80-89
• 
  Patrizio Angelini, Giordano Da Lozzo, Daniel Neuwirth:
  On Some $\mathcal{NP}$ -complete SEFE Problems. WALCOM 2014: 200-212
• 
  Jean-François Baffier, Vorapong Suppakitpaisarn:
  A (k + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow. WALCOM 2014: 68-79
• 
  Nikhil Balaji, Samir Datta:
  Collapsing Exact Arithmetic Hierarchies. WALCOM 2014: 273-285
• 
  Alka Bhushan, Sajith Gopalan:
  I/O Efficient Algorithms for the Minimum Cut Problem on Unweighted Undirected Graphs. WALCOM 2014: 188-199
• 
  Carla Binucci, Walter Didimo:
  Quasi-Upward Planar Drawings of Mixed Graphs with Few Bends: Heuristics and Exact Methods. WALCOM 2014: 298-309
• 
  Tiziana Calamoneri, Rossella Petreschi:
  On Dilworth k Graphs and Their Pairwise Compatibility. WALCOM 2014: 213-224
• 
  Da-Jung Cho, Yo-Sub Han, Hwee Kim:
  Alignment with Non-overlapping Inversions on Two Strings. WALCOM 2014: 261-272
• 
  Peter Damaschke, Olof Mogren:
  Editing the Simplest Graphs. WALCOM 2014: 249-260
• 
  Norie Fu:
  ℓ1-Embeddability of 2-Dimensional ℓ1-Rigid Periodic Graphs. WALCOM 2014: 349-360
• 
  Satoshi Fujita:
  Optimal Serial Broadcast of Successive Chunks. WALCOM 2014: 102-113
• 
  Subir Kumar Ghosh, Bodhayan Roy:
  Some Results on Point Visibility Graphs. WALCOM 2014: 163-175
• 
  Jiong Guo, Yash Raj Shrestha:
  Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs. WALCOM 2014: 286-297
• 
  Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh:
  Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity. WALCOM 2014: 125-137
• 
  Wing-Kai Hon, Ton Kloks, Ching-Hao Liu, Hsiang-Hsuan Liu, Sheung-Hung Poon, Yue-Li Wang:
  Results on Independent Sets in Categorical Products of Graphs, the Ultimate Categorical Independence Ratio and the Ultimate Categorical Independent Domination Ratio. WALCOM 2014: 237-248
• 
  Zhi-Dong Huang, Sheung-Hung Poon, Chun-Cheng Lin:
  Boundary Labeling with Flexible Label Positions. WALCOM 2014: 44-55
• 
  Nils M. Kriege, Petra Mutzel, Till Schäfer:
  SAHN Clustering in Arbitrary Metric Spaces Using Heuristic Nearest Neighbor Search. WALCOM 2014: 90-101
• 
  Kurt Mehlhorn:
  Algorithms for Equilibrium Prices in Linear Market Models. WALCOM 2014: 1-4
• 
  Nadeem Moidu, Jatin Agarwal, Sankalp Khare, Kishore Kothapalli, Kannan Srinathan:
  On Generalized Planar Skyline and Convex Hull Range Queries. WALCOM 2014: 34-43
• 
  Apurva Mudgal, Supantha Pandit:
  Generalized Class Cover Problem with Axis-Parallel Strips. WALCOM 2014: 8-21
• 
  Asish Mukhopadhyay, S. V. Rao, Sidharth Pardeshi, Srinivas Gundlapalli:
  Linear Layouts of Weakly Triangulated Graphs. WALCOM 2014: 322-336
• 
  J. Ian Munro:
  In as Few Comparisons as Possible. WALCOM 2014: 5-6
• 
  Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama:
  Efficient Algorithms for Sorting k-Sets in Bins. WALCOM 2014: 225-236
• 
  N. S. Narayanaswamy, G. Ramakrishna:
  On Minimum Average Stretch Spanning Trees in Polygonal 2-Trees. WALCOM 2014: 310-321
• 
  B. S. Panda, Arti Pandey:
  Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs. WALCOM 2014: 151-162
• 
  Jazmín Romero, Alejandro López-Ortiz:
  The ${\mathcal{G}}$ -Packing with t-Overlap Problem. WALCOM 2014: 114-124
• 
  Khaled Mahmud Shahriar, Md. Saidur Rahman:
  Bichromatic Point-Set Embeddings of Trees with Fewer Bends - (Extended Abstract). WALCOM 2014: 337-348
• 
  Tong-Wook Shinn, Tadao Takaoka:
  Some Extensions of the Bottleneck Paths Problem. WALCOM 2014: 176-187
• 
  Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno:
  Approximating the Bipartite TSP and Its Biased Generalization. WALCOM 2014: 56-67

skipping 3 more matches