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

• 1985
• 
  Alphonse Baartmans, Mohan S. Shrikhande:
  A characterization of the extensions of symmetric designs. Discret. Math. 57(3): 301-305 (1985)
• 
  Bhaskar Bagchi, N. S. Narasimha Sastry:
  Minimum weight words of binary codes associated with finite projective geometries. Discret. Math. 57(3): 307-310 (1985)
• 
  Alexander R. Bednarek, Robert E. Osteen:
  A characterization of graphical covers. Discret. Math. 57(1-2): 155-158 (1985)
• 
  Neal Brand:
  Isomorphic designs that are not multiplier equivalent. Discret. Math. 57(1-2): 159-165 (1985)
• 
  Dominique Buset:
  Orbits on vertices and edges of finite graphs. Discret. Math. 57(3): 297-299 (1985)
• 
  Alan R. Camina:
  Automorphism groups of block designs which are block transitive. Discret. Math. 57(1-2): 1-7 (1985)
• 
  Walter Alexandre Carnielli:
  On covering and coloring problems for rook domains. Discret. Math. 57(1-2): 9-16 (1985)
• 
  Alberto Cavicchioli:
  Lins-Mandel crystallizations. Discret. Math. 57(1-2): 17-37 (1985)
• 
  Theodore Chadjipantelis, Stratis Kounias:
  Supplementary difference sets and D-optimal designs for n == 2 mod 4. Discret. Math. 57(3): 211-216 (1985)
• 
  C. R. J. Clapham:
  The bipartite tournament associated with a fabric. Discret. Math. 57(1-2): 195-197 (1985)
• 
  Martin G. Everett, Stephen B. Seidman:
  The hull number of a graph. Discret. Math. 57(3): 217-223 (1985)
• 
  A. W. Goodman:
  Triangles in a complete chromatic graph with three colors. Discret. Math. 57(3): 225-235 (1985)
• 
  I. P. Goulden:
  A bijective proof of the q-Saalschütz theorem. Discret. Math. 57(1-2): 39-44 (1985)
• 
  David Haussler:
  Another generalization of Higman's well quasi order result on Sigma^*. Discret. Math. 57(3): 237-243 (1985)
• 
  Glenn Hopkins, William Staton:
  Graphs with unique maximum independent sets. Discret. Math. 57(3): 245-251 (1985)
• 
  F. T. Howard:
  Degenerate weighted Stirling numbers. Discret. Math. 57(1-2): 45-58 (1985)
• 
  Bill Jackson, Oscar Ordaz:
  A Chvátal-Erdös condition for (1, 1)-factors in digraphs. Discret. Math. 57(1-2): 199-201 (1985)
• 
  Václav Koubek, J. Rajlich:
  Combinatorics of the separaion by binary matrices. Discret. Math. 57(1-2): 203-208 (1985)
• 
  Jenö Lehel:
  A characterization of totally balanced hypergraphs. Discret. Math. 57(1-2): 59-65 (1985)
• 
  Pierre Leroux, Volker Strehl:
  Jacobi polynomials: Combinatorics of the basic identities. Discret. Math. 57(1-2): 167-187 (1985)
• 
  Sóstenes Lins:
  A simple proof of Gagliardi's handle recognition theorem. Discret. Math. 57(3): 253-260 (1985)
• 
  Sóstenes Lins, Arnaldo Mandel:
  Graph-encoded 3-manifolds. Discret. Math. 57(3): 261-284 (1985)
• 
  Russell W. Myers:
  1-homogeneous graphs. Discret. Math. 57(1-2): 67-88 (1985)
• 
  Andrew M. Odlyzko, Janos Pintz, Kenneth B. Stolarsky:
  Partitions of planar sets into small triangles. Discret. Math. 57(1-2): 89-97 (1985)
• 
  Erwin Pesch, Werner Poguntke:
  A characterization of absolute retracts of n-chromatic graphs. Discret. Math. 57(1-2): 99-104 (1985)
• 
  Christoph Peter-Orth:
  All solutions of the Soma cube puzzle. Discret. Math. 57(1-2): 105-121 (1985)
• 
  Bruce Reznick, Prasoon Tiwari, Douglas B. West:
  Decomposition of product graphs into complete bipartite subgraphs. Discret. Math. 57(1-2): 189-193 (1985)
• 
  Sergio Ruiz:
  Randomly decomposable graphs. Discret. Math. 57(1-2): 123-128 (1985)
• 
  Hannu Tarnanen:
  On character sums and codes. Discret. Math. 57(3): 285-295 (1985)
• 
  Aleksander Torgasev:
  On graphs with a fixed number of negative eigenvalues. Discret. Math. 57(3): 311-317 (1985)

skipping 2 more matches