Browser does not support script.

- Find
- Programmes
- Research
- Events
- News

- Information for
- Prospective students
- Current students
- Alumni
- Staff
- Businesses

- Information about
- Departments
- Institutes
- Divisions
- Research centres
- Supporting LSE
- Term dates
- LSE Vacations

- Useful links
- Library
- Careers
- Accommodation
- Media relations
- LSE Jobs
- LSE Blogs

- Finding tight hamilton cycles in random hypergraphs faster

Allen, Peter and Koch, Christoph and Parczyk, Olaf and Person, Yury (2018) Finding tight hamilton cycles in random hypergraphs faster. In: Bender, M. and Farach-Colton, M. and Mosteiro, M., (eds.) LATIN 2018: theoretical informatics. Lecture Notes in Computer Science (10807). Springer, Cham, Switzerland, pp. 28-36. ISBN 9783319774039 - Local martingales in discrete time

Prokaj, Vilmos and Ruf, Johannes (2018) Local martingales in discrete time. Electronic Communications in Probability, 23 (31). ISSN 1083-589X - Bounding the size of an almost-equidistant set in Euclidean space

Kupavskii, Andrey and Mustafa, Nabil H. and Swanepoel, Konrad (2018) Bounding the size of an almost-equidistant set in Euclidean space. Combinatorics, Probability and Computing. ISSN 0963-5483 (In Press) - Large width nearest prototype classification on general distance spaces

Anthony, Martin and Ratsaby, Joel (2018) Large width nearest prototype classification on general distance spaces. Theoretical Computer Science. ISSN 0304-3975 (In Press) - The distribution of minimum-weight cliques and other subgraphs in graphs with random edge weights

Frieze, Alan and Pegden, Wesley and Sorkin, Gregory B. (2018) The distribution of minimum-weight cliques and other subgraphs in graphs with random edge weights. SIAM Journal on Discrete Mathematics. ISSN 0895-4801 (In Press) - Improper colourings inspired by Hadwiger’s conjecture

van den Heuvel, Jan and Wood, David R. (2018) Improper colourings inspired by Hadwiger’s conjecture. Journal of the London Mathematical Society. ISSN 0024-6107 - Large-width bounds for learning half-spaces on distance spaces

Anthony, Martin and Ratsaby, Joel (2018) Large-width bounds for learning half-spaces on distance spaces. Discrete Applied Mathematics. ISSN 0166-218X (In Press) - Preferences under ignorance

Gossner, Olivier and Kuzmics, Christoph (2018) Preferences under ignorance. International Economic Review. ISSN 0020-6598 (In Press) - Arrangements of homothets of a convex body II

Naszódi, Márton and Swanepoel, Konrad (2017) Arrangements of homothets of a convex body II. Discrete Mathematics. ISSN 0012-365X (In Press) - Extinction times in the subcritical stochastic SIS logistic epidemic

Brightwell, Graham and House, Thomas and Luczak, Malwina J. (2018) Extinction times in the subcritical stochastic SIS logistic epidemic. Journal of Mathematical Biology. ISSN 0303-6812 - Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion

van den Heuvel, Jan and Kreutzer, Stephan and Pilipczuk, Michal and Quiroz, Daniel and Rabinovich, Roman and Siebertz, Sebastian (2017) Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion. In: 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 20-23 June 2017, Reykjavik, Iceland. - On the average size of independent sets in triangle-free graphs

Davies, Ewan and Jenssen, Matthew and Perkins, Will and Roberts, Barnaby (2017) On the average size of independent sets in triangle-free graphs. Proceedings of the American Mathematical Society, 146 (1). pp. 111-124. ISSN 0002-9939 - Independent sets, matchings, and occupancy fractions

Davies, Ewan and Jenssen, Matthew and Perkins, Will and Roberts, Barnaby (2017) Independent sets, matchings, and occupancy fractions. Journal of the London Mathematical Society, 96 (1). pp. 47-66. ISSN 0024-6107 - Geometric rescaling algorithms for submodular function minimization

Dadush, Daniel and Végh, László A. and Zambelli, Giacomo (2018) Geometric rescaling algorithms for submodular function minimization. In: Czumaj, Artur, (ed.) Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. Proceedings. Society for Industrial and Applied Mathematics, Philadelphia, USA, pp. 832-848. ISBN 978-611975031 - Digital morphogenesis via Schelling segregation

Barmpalias, George and Elwes, Richard and Lewis-Pye, Andrew (2018) Digital morphogenesis via Schelling segregation. Nonlinearity, 31 (4). ISSN 0951-7715 - Modularity and greed in double auctions

Dütting, Paul and Talgam-Cohen, Inbal and Roughgarden, Tim (2014) Modularity and greed in double auctions. In: Babaioff, Moshe and Conitzer, Vincent and Easley, David, (eds.) EC '14: Proceedings of the Fifteenth ACM Conference on Economics and Computation. Association for Computing Machinery, New York, USA, pp. 241-258. ISBN 9781450325653 - On some functionals of the first passage times in models with switching stochastic volatility

Gapeev, Pavel V. and Brockhaus, Olivier and Dubois, Mathieu (2018) On some functionals of the first passage times in models with switching stochastic volatility. International Journal of Theoretical and Applied Finance. ISSN 0219-0249 - Decomposable submodular function minimization: discrete and continuous

Ene, Alina and Nguyen, Huy and Végh, László A. (2017) Decomposable submodular function minimization: discrete and continuous. In: Guyon, I. and Luxburg, U. V. and Bengio, S. and Wallach, H. and Fergus, R. and Vishwanathan, S. and Garnett, R., (eds.) Advances in Neural Information Processing Systems 30 (NIPS 2017) pre-proceedings. Neural Information Processing Systems Foundation, Long Beach, USA. - The centroid as an estimate for the quadratic min-power centre

Brazil, M. and Ras, C.J. and Swanepoel, Konrad J. and Thomas, D. A. (2014) The centroid as an estimate for the quadratic min-power centre. In: Proceedings of the 21st International Symposium on Mathematical Theory of Networks and Systems. University of Groningen, Groningen, Netherlands, pp. 800-803. ISBN 9789036763219 - Approximating minimum cost connectivity orientation and augmentation

Singh, Mohit and Végh, László A. (2017) Approximating minimum cost connectivity orientation and augmentation. SIAM Journal on Computing. ISSN 0097-5397 (In Press)

Browser does not support script.

Browser does not support script.

Browser does not support script.

Browser does not support script.

Browser does not support script.

Browser does not support script.