Publications

 
  • The parameterised complexity of counting connected subgraphs and graph motifs
    Jerrum M Meeks K
    Journal of Computer and System Sciences vol. 81 (4), 702-716.  
    24-11-2014
  • Transfer of Siegel cusp forms of degree 2
    Pitale A Saha A Schmidt R
    Memoirs of The American Mathematical Society, American Mathematical Society vol. 232 (1090) 
    01-11-2014
  • Set Systems Containing Many Maximal Chains
    JOHNSON JR LEADER I RUSSELL PA
    Combinatorics Probability Computing, Cambridge University Press (Cup) vol. 24 (3), 480-485.  
    09-10-2014
  • Mixing of the Glauber dynamics for the ferromagnetic Potts model
    Bordewich M Greenhill C Patel V
    Random Structures and Algorithms, Wiley vol. 48 (1), 21-52.  
    04-09-2014
  • BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region
    Cai JY Galanis A Goldberg LA Guo H Jerrum M
    Leibniz International Proceedings in Informatics Lipics. vol. 28, 582-595.  
    01-09-2014
  • Tight inequalities among set hitting times in Markov chains
    Griffiths S Kang RJ Oliveira RI Patel V
    Proceedings of The American Mathematical Society, American Mathematical Society (Ams) vol. 142 (9), 3285-3298.  
    21-05-2014
  • The Complexity of Approximately Counting Tree Homomorphisms
    Goldberg LA Jerrum M
    Acm Transactions on Computation Theory, Association For Computing Machinery (Acm) vol. 6 (2), 1-31.  
    01-05-2014
  • Fibrations of topological stacks
    Noohi B
    Advances in Mathematics, Elsevier vol. 252, 612-640.  
    15-02-2014
  • A generalisation of core partitions
    Fayers M
    Journal of Combinatorial Theory Series A vol. 127, 58-84.  
    01-01-2014
  • Finding Shortest Paths Between Graph Colourings
    Johnson M Kratsch D Kratsch S Patel V Paulusma D
    Lecture Notes in Computer Science. vol. 8894, 221-233.  
    01-01-2014
  • LIM is not slim
    Fink A Fraenkel AS Santos C
    International Journal of Game Theory vol. 43 (2), 269-281.  
    01-01-2014
  • Minimal Retentive Sets in Tournaments
    Brandt F Brill M Fischer F Harrenstein P
    Social Choice and Welfare vol. 42 
    01-01-2014
  • Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments
    Kuehn D Lapinskas J Osthus D Patel V
    Proceedings of The London Mathematical Society vol. 109, 733-762.  
    01-01-2014
  • The Complexity of Computing the Sign of the Tutte Polynomial
    Goldberg LA Jerrum M
    Siam Journal on Computing, Society For Industrial & Applied Mathematics (Siam) vol. 43 (6), 1921-1952.  
    01-01-2014