Journals in DBLP

Combinatorics, Probability & Computing
2007, volume: 16, number: 1

1. 
   The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments. [Citation Graph (, )][DBLP]
   
   
2. 
   Strong Refutation Heuristics for Random k-SAT. [Citation Graph (, )][DBLP]
   
   
3. 
   Positive Influence and Negative Dependence. [Citation Graph (, )][DBLP]
   
   
4. 
   The Complexity of Ferromagnetic Ising with Local Fields. [Citation Graph (, )][DBLP]
   
   
5. 
   The Expected Length of a Minimal Spanning Tree of a Cylinder Graph. [Citation Graph (, )][DBLP]
   
   
6. 
   Zero-Free Intervals for Flow Polynomials of Near-Cubic Graphs. [Citation Graph (, )][DBLP]
   
   
7. 
   Rainbow Turán Problems. [Citation Graph (, )][DBLP]
   
   
8. 
   On an Online Spanning Tree Problem in Randomly Weighted Graphs. [Citation Graph (, )][DBLP]
   
   
9. 
   List Set Colouring: Bounds and Algorithms. [Citation Graph (, )][DBLP]
   
   
10. 
    Cutsets in Infinite Graphs. [Citation Graph (, )][DBLP]
    
    
11. 
    Ore-type graph packing problems. [Citation Graph (, )][DBLP]
    
    
12. 
    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. [Citation Graph (, )][DBLP]