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

• 1979
• 
  Jin Akiyama, Takashi Hamada:
  The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests. Discret. Math. 26(3): 203-208 (1979)
• 
  Frank W. Barnes:
  Packing the maximum number of m × n tiles in a large p × q rectangle. Discret. Math. 26(2): 93-100 (1979)
• 
  Gerd Blind:
  Decomposition of a convex polygon into convex polygons. Discret. Math. 26(1): 1-15 (1979)
• 
  Izak Broere, Christina M. Mynhardt:
  Remarks on the critical graph conjecture. Discret. Math. 26(3): 209-212 (1979)
• 
  Vasek Chvátal, Ronald L. Graham, André F. Perold, Sue Whitesides:
  Combinatorial designs related to the strong perfect graph conjecture. Discret. Math. 26(2): 83-92 (1979)
• 
  Raul Cordovil, Michel Las Vergnas:
  Geometries simpliciales unimodulaires. Discret. Math. 26(3): 213-217 (1979)
• 
  Joseph G. Deken:
  Some limit results for longest common subsequences. Discret. Math. 26(1): 17-31 (1979)
• 
  Andrzej Ehrenfeucht, D. M. Silberger:
  Periodicity and unbordered segments of words. Discret. Math. 26(2): 101-109 (1979)
• 
  Peter Frankl:
  Families of finite sets satisfying a union condition. Discret. Math. 26(2): 111-118 (1979)
• 
  Harold N. Gabow:
  Algorithmic proofs of two relations between connectivity and the 1-factors of a graph. Discret. Math. 26(1): 33-40 (1979)
• 
  Rick Giles, Dirk Hausmann:
  Characterizations of adjacency on the branching polyhedron. Discret. Math. 26(3): 219-226 (1979)
• 
  Basil Gordon, Lorne Houten:
  Notes on plane partitions VI. Discret. Math. 26(1): 41-45 (1979)
• 
  Yahya Ould Hamidoune:
  Sur les parcours hamiltoniens dans les graphes orientes. Discret. Math. 26(3): 227-234 (1979)
• 
  B. R. Handa, Sri Gopal Mohanty:
  Enumeration of higher-dimensional paths under restrictions. Discret. Math. 26(2): 119-128 (1979)
• 
  Frank Harary, Helene J. Kommel:
  The graphs with only self-dual signings. Discret. Math. 26(3): 235-241 (1979)
• 
  I. J. Holyer, Ernest J. Cockayne:
  On the sum of cardinalities of extremum maximal independent sets. Discret. Math. 26(3): 243-246 (1979)
• 
  W. Cary Huffman:
  The biweight enumerator of self-orthogonal binary codes. Discret. Math. 26(2): 129-143 (1979)
• 
  S. A. Joni:
  The multi-indexed partitional. Discret. Math. 26(2): 145-163 (1979)
• 
  Christopher J. Mitchell:
  An infinite family of symmetric designs. Discret. Math. 26(3): 247-250 (1979)
• 
  John W. Moon:
  Some enumeration problems for similarity relations. Discret. Math. 26(3): 251-260 (1979)
• 
  Vladimír Müller:
  On colorings of graphs without short cycles. Discret. Math. 26(2): 165-176 (1979)
• 
  Alexander Schrijver, Paul D. Seymour:
  Solution of two fractional packing problems of lovász. Discret. Math. 26(2): 177-184 (1979)
• 
  P. R. Stein, Michael S. Waterman:
  On some new sequences generalizing the Catalan and Motzkin numbers. Discret. Math. 26(3): 261-272 (1979)
• 
  Maciej M. Syslo:
  Characterizations of outerplanar graphs. Discret. Math. 26(1): 47-53 (1979)
• 
  Michael Tarsi:
  Decomposition of complete multigraphs into stars. Discret. Math. 26(3): 273-278 (1979)
• 
  Takao Ueda:
  On the fixing group for a totally pre-ordered Boolean function. Discret. Math. 26(3): 293-295 (1979)
• 
  Gérard Viennot:
  Permutations ayant une forme donnee. Discret. Math. 26(3): 279-284 (1979)
• 
  Hansjoachim Walther:
  Remark on a paper of J. Zaks. Discret. Math. 26(3): 297-301 (1979)
• 
  Harold N. Ward:
  Combinatorial polarization. Discret. Math. 26(2): 185-197 (1979)
• 
  Andrew Wohlgemuth:
  Labeled reaction matrices, a histocompatibility model. Discret. Math. 26(3): 285-292 (1979)

skipping 1 more match