Publications

 
  • Optimal approximation for submodular and supermodular optimization with bounded curvature
    Sviridenko M Vondrák J Ward J
    Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms., 1134-1148.  
    22-12-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
  • Henneberg moves on mechanisms
    Jackson B Jordán T Servatius B Servatius H
    BeiträGe Zur Algebra Und Geometrie / Contributions to Algebra and Geometry, Springer Nature vol. 56 (2), 587-591.  
    09-09-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
  • Modularity lifting results in parallel weight one and applications to the Artin conjecture: the tamely ramified case
    KASSAEI PL SASAKI S TIAN Y
    Forum of Mathematics Sigma, Cambridge University Press (Cup) vol. 2 
    01-07-2014
  • Expressiveness and robustness of first-price position auctions
    Proceedings of the fifteenth ACM conference on Economics and computation., 57-74.  
    01-06-2014
  • Optimal impartial selection
    Proceedings of the fifteenth ACM conference on Economics and computation., 803-820.  
    01-06-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
  • Combinatorial Conditions for the Unique Completability of Low-Rank Matrices
    Jackson B Jordán T Tanigawa S-I
    Siam Journal on Discrete Mathematics, Society For Industrial & Applied Mathematics (Siam) vol. 28 (4), 1797-1819.  
    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
  • Globally linked pairs of vertices in rigid frameworks
    Jackson B Jordán T Szabadka Z
    Fields Institute Communications vol. 70, 177-203.  
    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
  • Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search
    Filmus Y Ward J
    Siam Journal on Computing, Society For Industrial & Applied Mathematics (Siam) vol. 43 (2), 514-542.  
    01-01-2014
  • Necessary Conditions for the Generic Global Rigidity of Frameworks on Surfaces
    Jackson B McCourt TA Nixon A
    Discrete & Computational Geometry vol. 52 (2), 344-360.  
    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
  • Submodular Stochastic Probing on Matroids
    Adamczyk M Sviridenko M Ward J Mayr EW Portier N
    31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), STACS 2014, March 5-8, 2014, Lyon, France. vol. 25, 29-40.  
    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