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

• 2009
• 
  Sarmad Abbasi, Patrick Healy, Aimal Rextin:
  An Improved Upward Planarity Testing Algorithm and Related Applications. WALCOM 2009: 334-344
• 
  Mustaq Ahmed, Anna Lubiw, Anil Maheshwari:
  Shortest Gently Descending Paths. WALCOM 2009: 59-70
• 
  Helmut Alt, Ludmila Scharf:
  Shape Matching by Random Sampling. WALCOM 2009: 381-393
• 
  Sang Won Bae, Matias Korman, Takeshi Tokuyama:
  All Farthest Neighbors in the Presence of Highways and Obstacles. WALCOM 2009: 71-82
• 
  Sang Won Bae, Chunseok Lee, Sunghee Choi:
  On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem. WALCOM 2009: 105-116
• 
  Balasubramanian Sivan, S. Harini, C. Pandu Rangan:
  Core and Conditional Core Path of Specified Length in Special Classes of Graphs. WALCOM 2009: 262-273
• 
  Guillaume Blin, Guillaume Fertin, Florian Sikora, Stéphane Vialette:
  The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated. WALCOM 2009: 357-368
• 
  Alessandro Borri, Tiziana Calamoneri, Rossella Petreschi:
  Recognition of Unigraphs through Superposition of Graphs (Extended Abstract). WALCOM 2009: 165-176
• 
  Michael Brinkmeier:
  Minimum Cuts of Simple Graphs in Almost Always Linear Time. WALCOM 2009: 226-237
• 
  Otfried Cheong:
  Line Transversals and Pinning Numbers. WALCOM 2009: 44-46
• 
  Gautam K. Das, Debapriyay Mukhopadhyay, Subhas C. Nandy:
  Improved Algorithm for a Widest 1-Corner Corridor. WALCOM 2009: 83-92
• 
  Brian C. Dean, Namrata Swar:
  The Generalized Stable Allocation Problem. WALCOM 2009: 238-249
• 
  Michael Dom, Michael R. Fellows, Frances A. Rosamond:
  Parameterized Complexity of Stabbing Rectangles and Squares in the Plane. WALCOM 2009: 298-309
• 
  Jacob Fox, János Pach:
  A Separator Theorem for String Graphs and Its Applications. WALCOM 2009: 1-14
• 
  Takuro Fukunaga, Hiroshi Nagamochi:
  Network Design with Weighted Degree Constraints. WALCOM 2009: 214-225
• 
  Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda:
  Algorithms for Computing Diffuse Reflection Paths in Polygons. WALCOM 2009: 47-58
• 
  Luca Grilli, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
  Matched Drawability of Graph Pairs and of Graph Triples. WALCOM 2009: 322-333
• 
  Mahdieh Hasheminezhad, S. Mehdi Hashemi, Brendan D. McKay:
  Spherical-Rectangular Drawings. WALCOM 2009: 345-356
• 
  Mahdieh Hasheminezhad, Brendan D. McKay, Tristan Reeves:
  Recursive Generation of 5-Regular Planar Graphs. WALCOM 2009: 129-140
• 
  Miki Hermann, Florian Richoux:
  On the Computational Complexity of Monotone Constraint Satisfaction Problems. WALCOM 2009: 286-297
• 
  Louis Ibarra:
  A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs. WALCOM 2009: 190-201
• 
  Kyriaki Ioannidou, Stavros D. Nikolopoulos:
  Colinear Coloring on Graphs. WALCOM 2009: 117-128
• 
  Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi:
  Minmax Tree Cover in the Euclidean Space. WALCOM 2009: 202-213
• 
  Muhammad Rezaul Karim, Md. Jawaherul Alam, Md. Saidur Rahman:
  Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(nlogn) Area (Extended Abstract). WALCOM 2009: 310-321
• 
  Philip Little, Amitabh Chaudhary:
  Object Caching for Queries and Updates. WALCOM 2009: 394-405
• 
  Meena Mahajan, Prajakta Nimbhorkar, Kasturi R. Varadarajan:
  The Planar k-Means Problem is NP-Hard. WALCOM 2009: 274-285
• 
  Tamara Mchedlidze, Antonios Symvonis:
  Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings. WALCOM 2009: 250-261
• 
  Xavier Muñoz, Sebastian Seibert, Walter Unger:
  The Minimal Manhattan Network Problem in Three Dimensions. WALCOM 2009: 369-380
• 
  Mohammad Tanvir Parvez, Md. Saidur Rahman, Shin-Ichi Nakano:
  Generating All Triangulations of Plane Graphs (Extended Abstract). WALCOM 2009: 151-164
• 
  Md. Muhibur Rasheed, Masud Hasan, M. Sohel Rahman:
  Maximum Neighbour Voronoi Games. WALCOM 2009: 93-104

skipping 5 more matches