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

• 2001
• 
  Arie Bialostocki, William Voxman:
  Generalizations of some Ramsey-type theorems for matchings. Discret. Math. 239(1-3): 101-107 (2001)
• 
  Ezra Brown, Theresa P. Vaughan:
  Cycles of directed graphs defined by matrix multiplication (mod n). Discret. Math. 239(1-3): 109-120 (2001)
• 
  Masaaki Harada:
  An extremal ternary self-dual [28, 14, 9] code with a trivial automorphism group. Discret. Math. 239(1-3): 121-125 (2001)
• 
  Jochen Harant, Mirko Hornák, Zdzislaw Skupien:
  Separating 3-cycles in plane triangulations. Discret. Math. 239(1-3): 127-136 (2001)
• 
  Wenjie He, Yufa Shen, Lixin Wang, Yanxun Chang, Qingde Kang, Xinkai Yu:
  The integral sum number of complete bipartite graphs K_{r, s}. Discret. Math. 239(1-3): 137-146 (2001)
• 
  Tara S. Holm:
  On majority domination in graphs. Discret. Math. 239(1-3): 1-12 (2001)
• 
  Karina Marcus, András Sebö:
  Integer multiflows and metric packings beyond the cut condition. Discret. Math. 239(1-3): 13-31 (2001)
• 
  Dhruv Mubayi, Todd G. Will, Douglas B. West:
  Realizing degree imbalances in directed graphs. Discret. Math. 239(1-3): 147-153 (2001)
• 
  Erich Neuwirth:
  Recursively defined combinatorial functions: extending Galton's board. Discret. Math. 239(1-3): 33-51 (2001)
• 
  Artem V. Pyatkin:
  New formula for the sum number for the complete bipartite graphs. Discret. Math. 239(1-3): 155-160 (2001)
• 
  Romeo Rizzi:
  On the recognition of P₄-indifferent graphs. Discret. Math. 239(1-3): 161-169 (2001)
• 
  Jean-Luc Rullière, Stéphan Thomassé:
  Countable alpha-extendable graphs. Discret. Math. 239(1-3): 53-67 (2001)
• 
  Sara Nadiv Soffer:
  Graphs with many large degrees. Discret. Math. 239(1-3): 171-177 (2001)
• 
  Yan Wang, Bolian Liu:
  The sum number and integral sum number of complete bipartite graphs. Discret. Math. 239(1-3): 69-82 (2001)
• 
  Rudolf Winkel:
  A combinatorial derivation of the Poincare' polynomials of the finite irreducible Coxeter groups. Discret. Math. 239(1-3): 83-99 (2001)
• 
  Baogen Xu:
  On signed edge domination numbers of graphs. Discret. Math. 239(1-3): 179-189 (2001)
• 
  Jian-Zhou Zhang, Zhi-Sheng You, Zheng-Liang Li:
  Enumeration of binary orthogonal arrays of strength 1. Discret. Math. 239(1-3): 191-198 (2001)