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

• 2019
• 
  Shareef Ahmed, Shin-Ichi Nakano, Md. Saidur Rahman:
  r-Gatherings on a Star. WALCOM 2019: 31-42
• 
  Javier T. Akagi, Carlos F. Gaona, Fabricio Mendoza, Manjil P. Saikia, Marcos Villagra:
  Hard and Easy Instances of L-Tromino Tilings. WALCOM 2019: 82-95
• 
  Ali Alatabbi, Jacqueline W. Daykin, Neerja Mhaskar, M. Sohel Rahman, W. F. Smyth:
  Applications of V-Order: Suffix Arrays, the Burrows-Wheeler Transform & the FM-index. WALCOM 2019: 329-338
• 
  Helmut Alt, Otfried Cheong, Ji-won Park, Nadja Scharf:
  Packing 2D Disks into a 3D Container. WALCOM 2019: 369-380
• 
  Sang Won Bae, Arpita Baral, Priya Ranjan Sinha Mahapatra:
  Maximum-Width Empty Square and Rectangular Annulus. WALCOM 2019: 69-81
• 
  Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, Chirag Sodani:
  A Two Query Adaptive Bitprobe Scheme Storing Five Elements. WALCOM 2019: 317-328
• 
  Max Bannach, Malte Skambath, Till Tantau:
  Towards Work-Efficient Parallel Parameterized Algorithms. WALCOM 2019: 341-353
• 
  Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
  Graph Profile Realizations and Applications to Social Networks. WALCOM 2019: 3-14
• 
  Lukas Barth, Guido Brückner, Paul Jungeblut, Marcel Radermacher:
  Multilevel Planarity. WALCOM 2019: 219-231
• 
  Ajinkya Borle, Samuel J. Lomonaco:
  Analyzing the Quantum Annealing Approach for Solving Linear Least Squares Problems. WALCOM 2019: 289-301
• 
  Kaustav Bose, Ranendu Adhikary, Manash Kumar Kundu, Buddhadeb Sau:
  Arbitrary Pattern Formation on Infinite Grid by Asynchronous Oblivious Robots. WALCOM 2019: 354-366
• 
  Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Timothy W. Randolph, Alessandra Tappini:
  (k, p)-Planarity: A Relaxation of Hybrid Planarity. WALCOM 2019: 148-159
• 
  Ivor van der Hoog, Marc J. van Kreveld, Wouter Meulemans, Kevin Verbeek, Jules Wulms:
  Topological Stability of Kinetic k-centers. WALCOM 2019: 43-55
• 
  Satyabrata Jana, Supantha Pandit:
  Covering and Packing of Rectilinear Subdivision. WALCOM 2019: 381-393
• 
  Yiyang Jia, Yoshihiro Kanamori, Jun Mitani:
  Flat-Foldability for 1 × n Maps with Square/Diagonal Grid Patterns. WALCOM 2019: 135-147
• 
  Shuji Jimbo, Akira Maruoka:
  The Upper Bound on the Eulerian Recurrent Lengths of Complete Graphs Obtained by an IP Solver. WALCOM 2019: 199-208
• 
  Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora:
  Weighted Upper Edge Cover: Complexity and Approximability. WALCOM 2019: 235-247
• 
  Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora:
  Correction to: Weighted Upper Edge Cover: Complexity and Approximability. WALCOM 2019
• 
  Stefan Klootwijk, Bodo Manthey, Sander K. Visser:
  Probabilistic Analysis of Optimization Problems on Generalized Random Shortest Path Metrics. WALCOM 2019: 108-120
• 
  Soh Kumabe, Takanori Maehara, Ryoma Sin'ya:
  Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem. WALCOM 2019: 248-260
• 
  Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter, Nina Zimbel:
  Drawing Clustered Graphs on Disk Arrangements. WALCOM 2019: 160-171
• 
  Pawan K. Mishra, Sangram Kishor Jena, Gautam K. Das, S. V. Rao:
  Capacitated Discrete Unit Disk Cover. WALCOM 2019: 407-418
• 
  Joseph S. B. Mitchell, Supantha Pandit:
  Minimum Membership Covering and Hitting. WALCOM 2019: 394-406
• 
  Koichi Mizunashi, Takashi Horiyama, Ryuhei Uehara:
  Efficient Algorithm for Box Folding. WALCOM 2019: 277-288
• 
  Masahiro Okubo, Tesshu Hanaka, Hirotaka Ono:
  Optimal Partition of a Tree with Social Distance. WALCOM 2019: 121-132
• 
  Fahad Panolan, Saket Saurabh, Meirav Zehavi:
  Parameterized Computational Geometry via Decomposition Theorems. WALCOM 2019: 15-27
• 
  Anik Sarker, Wing-Kin Sung, M. Sohel Rahman:
  A Linear Time Algorithm for the r-Gathering Problem on the Line (Extended Abstract). WALCOM 2019: 56-66
• 
  Christian Scheffer:
  The Prefix Fréchet Similarity. WALCOM 2019: 96-107
• 
  Wing-Kin Sung:
  Greedy Consensus Tree and Maximum Greedy Consensus Tree Problems. WALCOM 2019: 305-316
• 
  Takuya Tamori, Kei Kimura:
  A Fast Algorithm for Unbounded Monotone Integer Linear Systems with Two Variables per Inequality via Graph Decomposition. WALCOM 2019: 209-218

skipping 4 more matches