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

• 2008
• 
  Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston:
  A bounded search tree algorithm for parameterized face cover. J. Discrete Algorithms 6(4): 541-552 (2008)
• 
  Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura:
  The on-line asymmetric traveling salesman problem. J. Discrete Algorithms 6(2): 290-298 (2008)
• 
  Cristina Bazgan, Zsolt Tuza:
  Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3. J. Discrete Algorithms 6(3): 510-519 (2008)
• 
  Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette:
  Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. J. Discrete Algorithms 6(4): 618-626 (2008)
• 
  Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger:
  On k-connectivity problems with sharpened triangle inequality. J. Discrete Algorithms 6(4): 605-617 (2008)
• 
  Magnus Bordewich, Catherine McCartin, Charles Semple:
  A 3-approximation algorithm for the subtree distance between phylogenies. J. Discrete Algorithms 6(3): 458-471 (2008)
• 
  Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider:
  Preface. J. Discrete Algorithms 6(4): 539 (2008)
• 
  Massimiliano Caramia, Antonino Sgalambro:
  On the approximation of the single source k-splittable flow problem. J. Discrete Algorithms 6(2): 277-289 (2008)
• 
  Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Guochuan Zhang, Yong Zhang:
  On-line scheduling of parallel jobs on two machines. J. Discrete Algorithms 6(1): 3-10 (2008)
• 
  Nitin, Ashok Subramanian:
  Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties. J. Discrete Algorithms 6(3): 353-380 (2008)
• 
  Claudine Chaouiya, Elisabeth Remy, Denis Thieffry:
  Petri net modelling of biological regulatory networks. J. Discrete Algorithms 6(2): 165-177 (2008)
• 
  Chris Charnes, Ulrich Dempwolff, Josef Pieprzyk:
  The eight variable homogeneous degree three bent functions. J. Discrete Algorithms 6(1): 66-72 (2008)
• 
  Xujin Chen, Xiaodong Hu, Xiaohua Jia:
  Inapproximability and approximability of minimal tree routing and coloring. J. Discrete Algorithms 6(2): 341-351 (2008)
• 
  Zhi-Zhong Chen, Ruka Tanahashi, Lusheng Wang:
  An improved approximation algorithm for maximum edge 2-coloring in simple graphs. J. Discrete Algorithms 6(2): 205-215 (2008)
• 
  Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Kowalski, Alexander A. Shvartsman:
  A robust randomized algorithm to perform independent tasks. J. Discrete Algorithms 6(4): 651-665 (2008)
• 
  Tomek Czajka, Gopal Pandurangan:
  Improved random graph isomorphism. J. Discrete Algorithms 6(1): 85-92 (2008)
• 
  Jurek Czyzowicz, Wojciech Fraczak, Mohammadreza Yazdani:
  Computing the throughput of Concatenation State Machines. J. Discrete Algorithms 6(1): 28-36 (2008)
• 
  Erik D. Demaine, Jeff Erickson, Danny Krizanc, Henk Meijer, Pat Morin, Mark H. Overmars, Sue Whitesides:
  Realizing partitions respecting full and partial order information. J. Discrete Algorithms 6(1): 51-58 (2008)
• 
  Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke:
  Red-blue covering problems and the consecutive ones property. J. Discrete Algorithms 6(3): 393-407 (2008)
• 
  Vida Dujmovic, Henning Fernau, Michael Kaufmann:
  Fixed parameter algorithms for one-sided crossing minimization revisited. J. Discrete Algorithms 6(2): 313-323 (2008)
• 
  Isabelle Fagnot, Gaëlle Lelandais, Stéphane Vialette:
  Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs. J. Discrete Algorithms 6(2): 178-191 (2008)
• 
  Andres Figueroa, Avraham Goldstein, Tao Jiang, Maciej Kurowski, Andrzej Lingas, Mia Persson:
  Approximate clustering of incomplete fingerprints. J. Discrete Algorithms 6(1): 103-108 (2008)
• 
  Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
  Approximating the traffic grooming problem. J. Discrete Algorithms 6(3): 472-479 (2008)
• 
  Fanica Gavril, Ron Y. Pinter, Shmuel Zaks:
  Intersection representations of matrices by subtrees and unicycles on graphs. J. Discrete Algorithms 6(2): 216-228 (2008)
• 
  Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta:
  Radial drawings of graphs: Geometric constraints and trade-offs. J. Discrete Algorithms 6(1): 109-124 (2008)
• 
  Katia S. Guimarães, Marie-France Sagot:
  Editorial. J. Discrete Algorithms 6(2): 163 (2008)
• 
  Jens Gustedt:
  Efficient sampling of random permutations. J. Discrete Algorithms 6(1): 125-139 (2008)
• 
  Jan Holub, William F. Smyth, Shu Wang:
  Fast pattern-matching on indeterminate strings. J. Discrete Algorithms 6(1): 37-50 (2008)
• 
  Costas S. Iliopoulos, Mirka Miller:
  Special Issue of the Sixteenth Australasian Workshop on Combinatorial Algorithms (AWOCA 2005) September 18-21, 2005, Ballarat, Australia. J. Discrete Algorithms 6(1): 1-2 (2008)
• 
  Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki:
  Approximability of partitioning graphs with supply and demand. J. Discrete Algorithms 6(4): 627-650 (2008)

skipping 26 more matches