Publications

 
  • THE IRREDUCIBLE REPRESENTATIONS OF THE ALTERNATING GROUP WHICH REMAIN IRREDUCIBLE IN CHARACTERISTIC p
    Fayers M
    Transactions of The American Mathematical Society vol. 368 (8), 5807-5855.  
    03-12-2015
  • #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 Vigoda E
    Journal of Computer and System Sciences vol. 82 (5), 690-711.  
    02-12-2015
  • Developments in the Khintchine-Meinardus Probabilistic Method for Asymptotic Enumeration
    Granovsky BL Stark D
    The Electronic Journal of Combinatorics, The Electronic Journal of Combinatorics vol. 22 (4) 
    27-11-2015
  • On a Ramsey-type problem of Erdős and Pach
    Kang RJ Patel V Regts G
    Electronic Notes in Discrete Mathematics, Elsevier vol. 49, 821-827.  
    01-11-2015
  • A domination algorithm for {0,1}‐instances of the travelling salesman problem
    Kühn D Osthus D Patel V
    Random Structures and Algorithms, Wiley vol. 48 (3), 427-453.  
    08-10-2015
  • Stiefel tropical linear spaces
    Fink A Rincón F
    Journal of Combinatorial Theory Series A, Elsevier vol. 135, 291-331.  
    01-10-2015
  • Optimal Impartial Selection
    Fischer F Klimm M
    Siam Journal on Computing, Society For Industrial and Applied Mathematics vol. 44 (5), 1263-1285.  
    01-10-2015
  • Large Values of Newforms on GL(2) with Highly Ramified Central Character
    Saha A
    International Mathematics Research Notices vol. 2016 (13), 4103-4131.  
    01-10-2015
  • A complexity classification of spin systems with an external field.
    Goldberg LA
    Proceedings of The National Academy of Sciences of The United States of America vol. 112 (43), 13161-13166.  
    01-10-2015
  • Some Hard Families of Parameterized Counting Problems
    Jerrum M Meeks K
    Acm Transactions on Computation Theory, Association For Computing Machinery (Acm) vol. 7 (3), 1-18.  
    09-07-2015
  • Positroids and non-crossing partitions
    Ardila F Rincón F
    Transactions of The American Mathematical Society, American Mathematical Society (Ams) vol. 368 (1), 337-363.  
    29-05-2015
  • Finding Shortest Paths Between Graph Colourings
    Johnson M Kratsch D Kratsch S Patel V Paulusma D
    Algorithmica, Springer Nature vol. 75 (2), 295-321.  
    12-05-2015
  • Mix and Match: A Strategyproof Mechanism for Multi-Hospital Kidney Exchange
    Ashlagi I Fischer F Kash IA Procaccia AD
    Games and Economic Behavior, Elsevier vol. 91, 284-296.  
    01-05-2015
  • The complexity of parity graph homomorphism: An initial investigation
    Faben J Jerrum M
    Theory of Computing vol. 11, 35-57.  
    14-03-2015
  • Poset limits can be totally ordered
    Hladký J Máthé A Patel V Pikhurko O
    Transactions of The American Mathematical Society, American Mathematical Society (Ams) vol. 367 (6), 4319-4337.  
    03-02-2015
  • The complexity of approximating conservative counting CSPs
    Chen X Goldberg LA Jerrum M Lu P McQuillan C
    Journal of Computer and System Sciences vol. 81 (1), 311-329.  
    01-02-2015
  • Galois stratification and ACFA
    TOMASIC I
    Annals of Pure and Applied Logic 
    31-01-2015
  • Representations of SL_2(R) and nearly holomorphic modular forms
    Pitale A Saha A Schmidt R
     
    02-01-2015
  • Approximately Counting H-Colourings is #BIS-Hard
    Galanis A Goldberg LA Jerrum M
    Lecture Notes in Computer Science. vol. 9134, 529-541.  
    01-01-2015
  • Possible and Necessary Winners of Partial Tournaments
    Aziz H Brill M Fischer F Harrenstein P Lang J Seedig HG
    Journal of Artificial Intelligence Research vol. 54, 493-534.  
    01-01-2015
  • Payment Rules through Discriminant-Based Classifiers
    Dütting P Fischer F Jirapinyo P Lai J Lubin B Parkes DC
    Acm Transactions on Economics and Computation vol. 3, 5:1-5:41.  
    01-01-2015
  • Approximating the partition function of planar two-state spin systems.
    Goldberg LA Jerrum M McQuillan C
    J. Comput. Syst. Sci. vol. 81, 330-358.  
    01-01-2015
  • Approximately Counting H-Colourings is #\mathrm BIS # BIS -Hard.
    Galanis A Goldberg LA Halldórsson MM Iwama K Kobayashi N Speckmann B
    ICALP (1). vol. 9134, 529-541.  
    01-01-2015
  • A Precise Threshold for Quasi-Ramsey Numbers
    Kang RJ Pach J Patel V Regts G
    Siam Journal on Discrete Mathematics, Society For Industrial & Applied Mathematics (Siam) vol. 29 (3), 1670-1682.  
    01-01-2015