Publications

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