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

• 1985
• 
  IJsbrand Jan Aalbersberg, Grzegorz Rozenberg:
  Traces, dependency graphs and DNLC grammars. Discret. Appl. Math. 11(3): 299-306 (1985)
• 
  Julián Aráoz, Jack Edmonds:
  A case of non-convergent dual changes in assignment problems. Discret. Appl. Math. 11(2): 95-102 (1985)
• 
  Ronald I. Becker, Yehoshua Perl:
  Finding the two-core of a tree. Discret. Appl. Math. 11(2): 103-113 (1985)
• 
  Peter Butkovic, Ferdinand Hevery:
  A condition for the strong regularity of matrices in the minimax algebra. Discret. Appl. Math. 11(3): 209-222 (1985)
• 
  János Demetrovics, Zoltán Füredi, Gyula O. H. Katona:
  Minimum matrix representation of closure operations. Discret. Appl. Math. 11(2): 115-128 (1985)
• 
  Ulrich Derigs:
  Some basic exchange properties in combinatorial optimization and their application to constructing the K-best solutions. Discret. Appl. Math. 11(2): 129-141 (1985)
• 
  Mohamed H. El-Zahar, I. Rival:
  Greedy linear extensions to minimize jumps. Discret. Appl. Math. 11(2): 143-156 (1985)
• 
  David Gale, Marilda Sotomayor:
  Some remarks on the stable matching problem. Discret. Appl. Math. 11(3): 223-232 (1985)
• 
  Georg Gunther:
  Neighbour-connectivity in regular graphs. Discret. Appl. Math. 11(3): 233-243 (1985)
• 
  Tor Helleseth:
  On the covering radius of cyclic linear codes and arithmetic codes. Discret. Appl. Math. 11(2): 157-173 (1985)
• 
  Iiro S. Honkala, Heikki O. Hämäläinen, Markku K. Kaikkonen:
  A modification of the Zinoviev lower bound for constant weight codes. Discret. Appl. Math. 11(3): 307-310 (1985)
• 
  Teruo Masuda, Hiroaki Ishii, Toshio Nishida:
  The mixed shop scheduling problem. Discret. Appl. Math. 11(2): 175-186 (1985)
• 
  Truc T. Nguyen, Allan R. Sampson:
  Counting the number of p × q integer matrices more concordant than a given matrix. Discret. Appl. Math. 11(2): 187-205 (1985)
• 
  Yves Robert, Maurice Tchuenté:
  Connection-graph and iteration-graph of monotone boolean functions. Discret. Appl. Math. 11(3): 245-253 (1985)
• 
  G. Saviozzi:
  On degeneracy in linear complementarity problems. Discret. Appl. Math. 11(3): 311-314 (1985)
• 
  Patrice Séébold:
  Sequences generated by infinitely iterated morphisms. Discret. Appl. Math. 11(3): 255-264 (1985)
• 
  Suvrajeet Sen, Hanif D. Sherali:
  A branch and bound algorithm for extreme point mathematical programming problems. Discret. Appl. Math. 11(3): 265-280 (1985)
• 
  George Steiner:
  A compact labeling scheme for series-parallel graphs. Discret. Appl. Math. 11(3): 281-297 (1985)