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

• 1991
• 
  Martin Aigner, Dwight Duffus, Daniel J. Kleitman:
  Partitioning a power set into union-free classes. Discret. Math. 88(2-3): 113-119 (1991)
• 
  Martin Aigner, Rudolf Wille:
  Preface. Discret. Math. 88(2-3): 111 (1991)
• 
  Robert E. L. Aldred, Bill Jackson, Dingjun Lou, Akira Saito:
  Partitioning regular graphs into equicardinal linear forests. Discret. Math. 88(1): 1-9 (1991)
• 
  Thomas Andreae:
  A search problem on graphs which generalizes some group testing problems with two defectives. Discret. Math. 88(2-3): 121-127 (1991)
• 
  Thomas Andreae, Martin Schughart, Zsolt Tuza:
  Clique-transversal sets of line graphs and complements of line graphs. Discret. Math. 88(1): 11-20 (1991)
• 
  Graham R. Brightwell, Jaroslav Nesetril:
  Reorientations of covering graphs. Discret. Math. 88(2-3): 129-132 (1991)
• 
  Vincent Duquenne:
  The core of finite lattices. Discret. Math. 88(2-3): 133-147 (1991)
• 
  Bernhard Ganter, Hans-Dietrich O. F. Gronau:
  Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions. Discret. Math. 88(2-3): 149-155 (1991)
• 
  Gerhard Gierz, Ferdinand Hergert:
  The bandwidth problem for distributive lattices of breadth 3. Discret. Math. 88(2-3): 157-177 (1991)
• 
  Daniel Grieser:
  Some results on the complexity of families of sets. Discret. Math. 88(2-3): 179-192 (1991)
• 
  Jerrold R. Griggs:
  Iterated exponentials of two numbers. Discret. Math. 88(2-3): 193-209 (1991)
• 
  Michel Habib, David Kelly, Rolf H. Möhring:
  Interval dimension is a comparability invariant. Discret. Math. 88(2-3): 211-229 (1991)
• 
  Konrad J. Heuvers, Daniel S. Moak:
  The solution of the Binet-Cauchy functional equation for square matrices. Discret. Math. 88(1): 21-32 (1991)
• 
  Hal A. Kierstead:
  A polynomial time approximation algorithm for dynamic storage allocation. Discret. Math. 88(2-3): 231-237 (1991)
• 
  C. J. Knickerbocker, Patti Frazer Lock, Michael Sheard:
  On the structure of graphs uniquely hamiltonian-connected from a vertex. Discret. Math. 88(1): 33-48 (1991)
• 
  Christos Koukouvinos, Stratis Kounias, Jennifer Seberry:
  Supplementary difference sets and optimal designs. Discret. Math. 88(1): 49-58 (1991)
• 
  Esther R. Lamken:
  3-complementary frames and doubly near resolvable (v, 3, 2)- BIBDs. Discret. Math. 88(1): 59-78 (1991)
• 
  Chiang Lin:
  The dimension of the cartesian product of posets. Discret. Math. 88(1): 79-92 (1991)
• 
  Wei-Ping Liu, Ivan Rival:
  Enumerating orientations of ordered sets. Discret. Math. 88(2-3): 239-247 (1991)
• 
  Peter Luksch:
  Distributive lattices freely generated by an ordered set of width two. Discret. Math. 88(2-3): 249-258 (1991)
• 
  Tom Madej, Douglas B. West:
  The interval inclusion number of a partially ordered set. Discret. Math. 88(2-3): 259-277 (1991)
• 
  Oliver Pretzel, Dale Youngs:
  Balanced graphs and noncovering graphs. Discret. Math. 88(2-3): 279-287 (1991)
• 
  Klaus Reuter:
  The jump number and the lattice of maximal antichains. Discret. Math. 88(2-3): 289-307 (1991)
• 
  Rodica Simion:
  Trees with 1-factors and oriented trees. Discret. Math. 88(1): 93-104 (1991)
• 
  Rudolf Wille:
  The skeletons of free distributive lattices. Discret. Math. 88(2-3): 309-320 (1991)