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

• 2007
• 
  Noga Alon, Vera Asodi:
  Edge Colouring with Delays. Comb. Probab. Comput. 16(2): 173-191 (2007)
• 
  Harout K. Aydinian, Péter L. Erdös:
  All Maximum Size Two-Part Sperner Systems: In Short. Comb. Probab. Comput. 16(4): 553-555 (2007)
• 
  Norman Biggs:
  Topics in Algebraic Graph Theory, by Lowell W. Beineke and Robin J. Wilson (Academic Consultant: Peter J. Cameron), Encyclopedia of Mathematics and its Applications 102, CUP 2005, 257pp., GBP 50.00/$95.00. Comb. Probab. Comput. 16(1): 171-172 (2007)
• 
  Tom Bohman, Alan M. Frieze, Tomasz Luczak, Oleg Pikhurko, Clifford D. Smyth, Joel Spencer, Oleg Verbitsky:
  First-Order Definability of Trees and Sparse Random Graphs. Comb. Probab. Comput. 16(3): 375-400 (2007)
• 
  Joseph E. Bonin, Omer Giménez:
  Multi-Path Matroids. Comb. Probab. Comput. 16(2): 193-217 (2007)
• 
  Brian H. Bowditch:
  The Angel Game in the Plane. Comb. Probab. Comput. 16(3): 345-362 (2007)
• 
  Peter J. Cameron, Koko Kalambay Kayibi:
  Orbital Chromatic and Flow Roots. Comb. Probab. Comput. 16(3): 401-407 (2007)
• 
  Mei-Chu Chang:
  Additive and Multiplicative Structure in Matrix Spaces. Comb. Probab. Comput. 16(2): 219-238 (2007)
• 
  Pierre Charbit, Stéphan Thomassé:
  Graphs with Large Girth Not Embeddable in the Sphere. Comb. Probab. Comput. 16(6): 829-832 (2007)
• 
  Pierre Charbit, Stéphan Thomassé, Anders Yeo:
  The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments. Comb. Probab. Comput. 16(1): 1-4 (2007)
• 
  Amin Coja-Oghlan:
  Colouring Semirandom Graphs. Comb. Probab. Comput. 16(4): 515-552 (2007)
• 
  Amin Coja-Oghlan:
  On the Laplacian Eigenvalues of G_{n, p}. Comb. Probab. Comput. 16(6): 923-946 (2007)
• 
  Amin Coja-Oghlan, Andreas Goerdt, André Lanka:
  Strong Refutation Heuristics for Random k-SAT. Comb. Probab. Comput. 16(1): 5-28 (2007)
• 
  Colin Cooper, Martin E. Dyer, Catherine S. Greenhill:
  Sampling Regular Graphs and a Peer-to-Peer Network. Comb. Probab. Comput. 16(4): 557-593 (2007)
• 
  Béla Csaba:
  On the Bollobás-Eldridge Conjecture for Bipartite Graphs. Comb. Probab. Comput. 16(5): 661-691 (2007)
• 
  Bill Cuckler:
  Hamiltonian Cycles in Regular Tournaments. Comb. Probab. Comput. 16(2): 239-249 (2007)
• 
  Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Markou, Andrzej Pelc:
  Searching for a Black Hole in Synchronous Tree Networks. Comb. Probab. Comput. 16(4): 595-619 (2007)
• 
  Devdatt P. Dubhashi, Johan Jonasson, Desh Ranjan:
  Positive Influence and Negative Dependence. Comb. Probab. Comput. 16(1): 29-41 (2007)
• 
  Richard M. Dudley:
  The Generic Chaining: Upper and Lower Bounds of Stochastic Processes, by Michel Talagrand , Springer-Verlag, 2005. Comb. Probab. Comput. 16(4): 659-660 (2007)
• 
  Joanna A. Ellis-Monaghan, Irasema Sarmiento:
  Distance Hereditary Graphs and the Interlace Polynomial. Comb. Probab. Comput. 16(6): 947-973 (2007)
• 
  Dvir Falik, Alex Samorodnitsky:
  Edge-Isoperimetric Inequalities and Influences. Comb. Probab. Comput. 16(5): 693-712 (2007)
• 
  G. E. Farr:
  On the Ashkin-Teller Model and Tutte-Whitney Functions. Comb. Probab. Comput. 16(2): 251-260 (2007)
• 
  Abraham D. Flaxman, Alan M. Frieze, Juan Vera:
  Adversarial Deletion in a Scale-Free Random Graph Process. Comb. Probab. Comput. 16(2): 261-270 (2007)
• 
  Abraham D. Flaxman, Alan M. Frieze, Juan Carlos Vera:
  On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem. Comb. Probab. Comput. 16(5): 713-732 (2007)
• 
  Alan M. Frieze, Michael Krivelevich, Cliff Smyth:
  On the Chromatic Number of Random Graphs with a Fixed Degree Sequence. Comb. Probab. Comput. 16(5): 733-746 (2007)
• 
  Dalibor Froncek, Janja Jerebic, Sandi Klavzar, Petr Kovár:
  Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem. Comb. Probab. Comput. 16(2): 271-275 (2007)
• 
  Alexander V. Gnedin, Jim Pitman:
  Poisson Representation of a Ewens Fragmentation Process. Comb. Probab. Comput. 16(6): 819-827 (2007)
• 
  Leslie Ann Goldberg, Mark Jerrum:
  The Complexity of Ferromagnetic Ising with Local Fields. Comb. Probab. Comput. 16(1): 43-61 (2007)
• 
  Norbert Hegyvári, François Hennecart, Alain Plagne:
  Answer to a Question by Burr and Erdös on Restricted Addition, and Related Results. Comb. Probab. Comput. 16(5): 747-756 (2007)
• 
  Kevin R. Hutson, Thomas M. Lewis:
  The Expected Length of a Minimal Spanning Tree of a Cylinder Graph. Comb. Probab. Comput. 16(1): 63-83 (2007)

skipping 27 more matches