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

• 2004
• 
  Gábor Bacsó, Sylvain Gravier, András Gyárfás, Myriam Preissmann, András Sebö:
  Coloring the Maximal Cliques of Graphs. SIAM J. Discret. Math. 17(3): 361-376 (2004)
• 
  William D. Banks, Alessandro Conflitti, Igor E. Shparlinski:
  Number Theoretic Designs for Directed Regular Graphs of Small Diameter. SIAM J. Discret. Math. 17(3): 377-383 (2004)
• 
  Francisco Barahona:
  Fractional Packing of T-Joins. SIAM J. Discret. Math. 17(4): 661-669 (2004)
• 
  Alexander Barg, Gilles Zémor:
  Error Exponents of Expander Codes under Linear-Complexity Decoding. SIAM J. Discret. Math. 17(3): 426-445 (2004)
• 
  Andreas Brandstädt, Van Bang Le:
  Split-Perfect Graphs: Characterizations and Algorithmic Use. SIAM J. Discret. Math. 17(3): 341-360 (2004)
• 
  Moses Charikar, Jon M. Kleinberg, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai, Andrew Tomkins:
  Minimizing Wirelength in Zero and Bounded Skew Clock Trees. SIAM J. Discret. Math. 17(4): 582-595 (2004)
• 
  W. R. Chen, Frank K. Hwang, Xuding Zhu:
  Equivalence of the 1-Rate Model to the Classical Model on Strictly Nonblocking Switching Networks. SIAM J. Discret. Math. 17(3): 446-452 (2004)
• 
  Christine T. Cheng:
  Improved Approximation Algorithms for the Demand Routing and Slotting Problem with Unit Demands on Rings. SIAM J. Discret. Math. 17(3): 384-402 (2004)
• 
  Valentino Crespi:
  Exact Formulae for the Lova'sz Theta Function of Sparse Circulant Graphs. SIAM J. Discret. Math. 17(4): 670-674 (2004)
• 
  Randall Dougherty, Vance Faber:
  The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case. SIAM J. Discret. Math. 17(3): 478-519 (2004)
• 
  Michele Flammini, Stéphane Pérennes:
  Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols. SIAM J. Discret. Math. 17(4): 521-540 (2004)
• 
  Stefanie Gerke, Colin McDiarmid:
  Graph Imperfection with a Co-Site Constraint. SIAM J. Discret. Math. 17(3): 403-425 (2004)
• 
  Jack E. Graver:
  Encoding Fullerenes and Geodesic Domes. SIAM J. Discret. Math. 17(4): 596-614 (2004)
• 
  Hal A. Kierstead, Yingxian Zhu:
  Radius Three Trees in Graphs with Large Chromatic Number. SIAM J. Discret. Math. 17(4): 571-581 (2004)
• 
  Guy Kindler, Dan Romik:
  On Distributions Computable by Random Walks on Graphs. SIAM J. Discret. Math. 17(4): 624-633 (2004)
• 
  Andrei A. Krokhin, Peter Jeavons, Peter Jonsson:
  Constraint Satisfaction Problems on Intervals and Length. SIAM J. Discret. Math. 17(3): 453-477 (2004)
• 
  C. Robert Miers, Frank Ruskey:
  Counting Strings with Given Elementary Symmetric Function Evaluations I: Strings over Z_p with p Prime. SIAM J. Discret. Math. 17(4): 675-685 (2004)
• 
  Nabil H. Mustafa, Aleksandar Pekec:
  Listen to Your Neighbors: How (Not) to Reach a Consensus. SIAM J. Discret. Math. 17(4): 634-660 (2004)
• 
  Erik Ordentlich, Ron M. Roth:
  Independent Sets in Regular Hypergraphs and Multidimensional Runlength-Limited Constraints. SIAM J. Discret. Math. 17(4): 615-623 (2004)
• 
  Vu Dong Tô, Reihaneh Safavi-Naini:
  On the Maximal Codes of Length 3 with the 2-Identifiable Parent Property. SIAM J. Discret. Math. 17(4): 548-570 (2004)
• 
  Luca Trevisan:
  On Local Versus Global Satisfiability. SIAM J. Discret. Math. 17(4): 541-547 (2004)
• 2003
• 
  M. Cemil Azizouglu, Ömer Eugeciouglu:
  Extremal Sets Minimizing Dimension-Normalized Boundary in Hamming Graphs. SIAM J. Discret. Math. 17(2): 219-236 (2003)
• 
  André Barbé, Fritz von Haeseler:
  Symmetric Codes over Rings. SIAM J. Discret. Math. 17(2): 254-263 (2003)
• 
  Walid Ben-Ameur, Éric Gourdin:
  Internet Routing and Related Topology Issues. SIAM J. Discret. Math. 17(1): 18-49 (2003)
• 
  Jesús Mario Bilbao:
  Cooperative Games under Augmenting Systems. SIAM J. Discret. Math. 17(1): 122-133 (2003)
• 
  Ronald Fagin, Ravi Kumar, D. Sivakumar:
  Comparing Top k Lists. SIAM J. Discret. Math. 17(1): 134-160 (2003)
• 
  Tomás Feder, Pavol Hell, Bojan Mohar:
  Acyclic Homomorphisms and Circular Colorings of Digraphs. SIAM J. Discret. Math. 17(1): 161-169 (2003)
• 
  John P. Georges, David W. Mauro:
  On Regular Graphs Optimally Labeled with a Condition at Distance Two. SIAM J. Discret. Math. 17(2): 320-331 (2003)
• 
  Eric Gottlieb:
  On the Homology of the h, k-Equal Dowling Lattice. SIAM J. Discret. Math. 17(1): 50-71 (2003)
• 
  Tibor Jordán:
  Constrained Edge-Splitting Problems. SIAM J. Discret. Math. 17(1): 88-102 (2003)

skipping 12 more matches