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

• 2002
• 
  Noga Alon:
  Covering a hypergraph of subgraphs. Discret. Math. 257(2-3): 249-254 (2002)
• 
  Noga Alon, Tom Bohman, Ron Holzman, Daniel J. Kleitman:
  On partitions of discrete boxes. Discret. Math. 257(2-3): 255-258 (2002)
• 
  Christian Bey, Konrad Engel, Gyula O. H. Katona, Uwe Leck:
  On the average size of sets in intersecting Sperner families. Discret. Math. 257(2-3): 259-266 (2002)
• 
  Alina Beygelzimer, Stanislaw P. Radziszowski:
  On halving line arrangements. Discret. Math. 257(2-3): 267-283 (2002)
• 
  Sergei L. Bezrukov, Oriol Serra:
  A local-global principle for vertex-isoperimetric problems. Discret. Math. 257(2-3): 285-309 (2002)
• 
  Graham R. Brightwell, William T. Trotter:
  A combinatorial approach to correlation inequalities. Discret. Math. 257(2-3): 311-327 (2002)
• 
  Sara Brunetti, Alberto Del Lungo, Francesco Del Ristoro:
  A cycle lemma for permutation inversions. Discret. Math. 257(1): 1-13 (2002)
• 
  Glenn G. Chappell:
  Polyunsaturated posets and graphs and the Greene-Kleitman theorem. Discret. Math. 257(2-3): 329-340 (2002)
• 
  Fan R. K. Chung, Robert B. Ellis:
  A chip-firing game and Dirichlet eigenvalues. Discret. Math. 257(2-3): 341-355 (2002)
• 
  B. Corbas, Graham D. Williams:
  Congruence classes in M₃(F_q) (q even). Discret. Math. 257(1): 15-27 (2002)
• 
  Lenore Cowen, Jerrold R. Griggs, Douglas B. West:
  Foreword. Discret. Math. 257(2-3): 191-192 (2002)
• 
  Andrzej Czygrinow, Henry A. Kierstead:
  2-factors in dense bipartite graphs. Discret. Math. 257(2-3): 357-369 (2002)
• 
  Charles Delorme, Odile Favaron, Dieter Rautenbach:
  On the Randic Image index. Discret. Math. 257(1): 29-38 (2002)
• 
  Ding-Zhu Du, D. Frank Hsu, Hung Quang Ngo, G. W. Peck:
  On connectivity of consecutive-d digraphs. Discret. Math. 257(2-3): 371-384 (2002)
• 
  Suohai Fan:
  Retractions of split graphs and End-orthodox split graph. Discret. Math. 257(1): 161-164 (2002)
• 
  J. M. Fish, Regina Klimmek, Karen Seyffarth:
  Line graphs of complete multipartite graphs have small cycle double covers. Discret. Math. 257(1): 39-61 (2002)
• 
  Zoltán Füredi, András Gyárfás, Miklós Ruszinkó:
  On the maximum size of (p, Q)-free families. Discret. Math. 257(2-3): 385-403 (2002)
• 
  Wayne Goddard:
  4-connected maximal planar graphs are 4-ordered. Discret. Math. 257(2-3): 405-410 (2002)
• 
  Jerrold R. Griggs:
  Intersecting families with minimum volume. Discret. Math. 257(2-3): 411-414 (2002)
• 
  András Gyárfás, André E. Kézdy, Jenö Lehel:
  A finite basis characterization of ?-split colorings. Discret. Math. 257(2-3): 415-421 (2002)
• 
  Peter Hamburger:
  Doodles and doilies, non-simple symmetric Venn diagram. Discret. Math. 257(2-3): 423-439 (2002)
• 
  Tao Jiang:
  Planar Hamiltonian chordal graphs are cycle extendable. Discret. Math. 257(2-3): 441-444 (2002)
• 
  Atsushi Kaneko, Kiyoshi Yoshimoto:
  On a 2-factor with a specified edge in a graph satisfying the Ore condition. Discret. Math. 257(2-3): 445-461 (2002)
• 
  Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yoshiaki Oda, Katsuhiro Ota, Shinsei Tazawa, Mamoru Watanabe:
  On separable self-complementary graphs. Discret. Math. 257(1): 165-168 (2002)
• 
  Aleksey D. Korshunov, Ilya Shmulevich:
  On the distribution of the number of monotone Boolean functions relative to the number of lower units. Discret. Math. 257(2-3): 463-479 (2002)
• 
  Jeffrey C. Lagarias, Joel H. Spencer, Jade P. Vinson:
  Counting dyadic equipartitions of the unit square. Discret. Math. 257(2-3): 481-499 (2002)
• 
  Jian-Guo Lei:
  On large sets of disjoint Kirkman triple systems. Discret. Math. 257(1): 63-81 (2002)
• 
  Mark J. Logan:
  Sperner theory in a difference of Boolean lattices. Discret. Math. 257(2-3): 501-512 (2002)
• 
  Vadim V. Lozin:
  Bipartite graphs without a skew star. Discret. Math. 257(1): 83-100 (2002)
• 
  Lianying Miao, Jianliang Wu:
  Edge-coloring critical graphs with high degree. Discret. Math. 257(1): 169-172 (2002)

skipping 17 more matches