Publications

Graphs with large minimum degree and no short odd cycles are 3-colourable
Böttcher, J. ORCID logo , Frankl, N. , Mergoni Cecchelli, D., Parczyk, O. & Skokan, J. ORCID logo (2026). Graphs with large minimum degree and no short odd cycles are 3-colourable. Combinatorial Theory, [In Press]
Reaching univalency with subquadratic communication
Lewis-Pye, A. (2026). Reaching univalency with subquadratic communication. In Proceedings of ACM Symposium on Principles of Distributed Computing 2026 . Association for Computing Machinery. [In Press]
Perpetual American compound lookback and integral options with floating strikes
Gapeev, P. V. ORCID logo (2026). Perpetual American compound lookback and integral options with floating strikes. Methodology and Computing in Applied Probability, 28(2). https://doi.org/10.1007/s11009-026-10269-8
The economic limits of permissionless consensus
Budish, E., Lewis-Pye, A. & Roughgarden, T. (2026). The economic limits of permissionless consensus. SIAM Journal on Computing, [In Press]
TFP-Net: a temporal-feature-prototypical network for CRM optimization and cold-start mitigation
Li, Y., Dong, J. & Wang, R. (2026). TFP-Net: a temporal-feature-prototypical network for CRM optimization and cold-start mitigation. PLOS ONE, 21(4). https://doi.org/10.1371/journal.pone.0345461
The Dirac operator and the Bohm-Hiley approach
Robson, C. (2026). The Dirac operator and the Bohm-Hiley approach. Journal of Physics: Conference Series, 3189(1). https://doi.org/10.1088/1742-6596/3189/1/012002
Convergence of the sum-of-squares hierarchy for quadratic optimization over roots-of-unity
Al-Sulami, A., Fawzi, H. & Sun, S. (2026). Convergence of the sum-of-squares hierarchy for quadratic optimization over roots-of-unity. Optimization Letters, https://doi.org/10.1007/s11590-026-02289-7
The New Digital Enlightenment: Ehud Shapiro on Rethinking the Internet
Shapiro, E. & Saona, R. (26 February 2026) The New Digital Enlightenment: Ehud Shapiro on Rethinking the Internet. Maths at LSE.
Dynamically optimal portfolios for montone mean-variance preferences
Černý, A., Ruf, J. ORCID logo & Schweizer, M. (2026). Dynamically optimal portfolios for montone mean-variance preferences. Mathematics of Operations Research, https://doi.org/10.1287/moor.2025.1136
Testing hypotheses generated by constraint
Larsson, M., Ramdas, A. & Ruf, J. ORCID logo (2026). Testing hypotheses generated by constraint. Mathematics of Operations Research, [In Press]
The pipes model for latency and throughput analysis
Lewis-Pye, A. , Nayak, K. & Shrestha, N. (2026). The pipes model for latency and throughput analysis. In 2026 IEEE Symposium on Security and Privacy (SP) . IEEE. [In Press]
Monotonic decompositions of submodular set functions
Bérczi, K., Gehér, B., Imolay, A., Lovász, L. & Schwarcz, T. (2026). Monotonic decompositions of submodular set functions. SIAM Journal on Discrete Mathematics, 40(1), 308 - 335. https://doi.org/10.1137/24M1675357
Leaf-to-leaf paths and cycles in degree-critical graphs
Braccio, F. D. , Katsamaktsis, K., Ma, J., Malekshahian, A. & Zhao, Z. (2026). Leaf-to-leaf paths and cycles in degree-critical graphs. Combinatorica, 46(2). https://doi.org/10.1007/s00493-026-00205-2
Cosigning crossing families and outer-planar gadgets
Abdi, A. ORCID logo , Dalirrooyfard, M. & Neuwohner, M. ORCID logo (2026). Cosigning crossing families and outer-planar gadgets. In Proceedings of the 9th International Symposium on Combinatorial Optimization . Springer. [In Press]
Stochastic homogenization of HJ equations: a differential game approach
Davini, A., Saona, R. & Ziliotto, B. (2026). Stochastic homogenization of HJ equations: a differential game approach. Annales de l'Institut Henri Poincaré C: Analyse non linéaire, https://doi.org/10.4171/aihpc/174
Meet the academic: Professor Ryan Martin
Saona, R. (22 January 2026) Meet the academic: Professor Ryan Martin. Maths@LSE Blog.
Universality for graphs of bounded degeneracy
Allen, P. ORCID logo , Böttcher, J. ORCID logo & Liebenau, A. (2026). Universality for graphs of bounded degeneracy. Random Structures and Algorithms, 68(2). https://doi.org/10.1002/rsa.70055
Dirac's theorem for graphs of bounded bandwidth
Diaz, A. E., Gupta, P., Cecchelli, D. M., Parczyk, O. & Sgueglia, A. (2026). Dirac's theorem for graphs of bounded bandwidth. Electronic Journal of Combinatorics, 33(1). https://doi.org/10.37236/13474
An optimal stopping problem for reflecting Brownian motions
Gapeev, P. V. ORCID logo & Peskir, G. (2026). An optimal stopping problem for reflecting Brownian motions. Stochastic Processes and Their Applications, 196, https://doi.org/10.1016/j.spa.2026.104902
On the faithful flatness of some modules arising in analysis
Sasane, A. ORCID logo (2026). On the faithful flatness of some modules arising in analysis. Nagoya Mathematical Journal, 261, https://doi.org/10.1017/nmj.2026.10103
The APS approach for undiscounted quitting games
Ashkenazi-Golan, G. ORCID logo , Krasikov, I., Rainer, C. & Solan, E. (2026). The APS approach for undiscounted quitting games. International Journal of Game Theory, 55(1). https://doi.org/10.1007/s00182-026-00982-6
A risk-sensitive ergodic singular stochastic control problem
Gwee, J. & Zervos, M. ORCID logo (2026). A risk-sensitive ergodic singular stochastic control problem. SIAM Journal on Control and Optimization, [In Press]
Interaction between skew-representability, tensor products, extension properties, and rank inequalities
Bérczi, K., Gehér, B., Imolay, A., Lovász, L., Padró, C. & Schwarcz, T. (2026). Interaction between skew-representability, tensor products, extension properties, and rank inequalities. In Green Larsen, K. & Saha, B. (Eds.), Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2026 (pp. 328 - 354). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611978971.15
A better-than-2 approximation for the directed tree augmentation problem
Neuwohner, M. ORCID logo , Silina, O. & Zlatin, M. (2026). A better-than-2 approximation for the directed tree augmentation problem. In Green Larsen, K. & Saha, B. (Eds.), Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2026 (pp. 1536 - 1569). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611978971.56
Grassroots platforms with atomic transactions: social graphs, cryptocurrencies, and democratic federations
Shapiro, E. (2026). Grassroots platforms with atomic transactions: social graphs, cryptocurrencies, and democratic federations. In Yasumoto, K., Keidar, I., Yamaguchi, H., Silvestri, S. & Gramoli, V. (Eds.), ICDCN '26: Proceedings of the 27th International Conference on Distributed Computing and Networking (pp. 71 - 81). Association for Computing Machinery. https://doi.org/10.1145/3772290.3772309
On Banach subalgebras of the Dirichlet Hardy algebra ℋ ∞ consisting of lacunary Dirichlet series
Sasane, A. ORCID logo (2026). On Banach subalgebras of the Dirichlet Hardy algebra ℋ ∞ consisting of lacunary Dirichlet series. Integral Equations and Operator Theory, 98(1). https://doi.org/10.1007/s00020-026-02825-1
Continuity, uniqueness and long-term behavior of Nash flows over time
Olver, N. ORCID logo , Sering, L. & Vargas Koch, L. (2026). Continuity, uniqueness and long-term behavior of Nash flows over time. Operations Research, https://doi.org/10.1287/opre.2024.1007
Edge isoperimetry of lattices
Strachan, C. & Swanepoel, K. ORCID logo (2026). Edge isoperimetry of lattices. Annals of Combinatorics, https://doi.org/10.1007/s00026-025-00801-x
Collateralized networks with two interacting channels of fire sales
Pang, R. & Veraart, L. A. M. ORCID logo (2026). Collateralized networks with two interacting channels of fire sales. SIAM Journal on Financial Mathematics, 17(2), 545 - 564. https://doi.org/10.1137/25M1764189
The Condorcet dimension of metric spaces
Lassota, A., Vetta, A. & von Stengel, B. ORCID logo (2026). The Condorcet dimension of metric spaces. Operations Research Letters, 65, https://doi.org/10.1016/j.orl.2025.107396
Revealing POMDPs: qualitative and quantitative analysis for parity objectives
Asadi, A., Chatterjee, K., Lurie, D. & Saona, R. (2026). Revealing POMDPs: qualitative and quantitative analysis for parity objectives. Proceedings of the AAAI Conference on Artificial Intelligence, 40(43), 36146 - 36154. https://doi.org/10.1609/aaai.v40i43.40932
Reconfiguration of basis pairs in regular matroids
Bérczi, K., Mátravölgyi, B. & Schwarcz, T. (2026). Reconfiguration of basis pairs in regular matroids. Journal of Combinatorial Theory, Series B, 177, 105 - 142. https://doi.org/10.1016/j.jctb.2025.10.009
Approximating maximum-size properly colored forests
Bai, Y., Bérczi, K., Csáji, G. & Schwarcz, T. (2026). Approximating maximum-size properly colored forests. European Journal of Combinatorics, 132, https://doi.org/10.1016/j.ejc.2025.104269
Order routing and market quality: who benefits from internalization?
Cetin, U. ORCID logo & Danilova, A. ORCID logo (2026). Order routing and market quality: who benefits from internalization? Mathematical Finance, 36(2), 397 - 421. https://doi.org/10.1111/mafi.70014
Post-trade netting and contagion
Veraart, L. A. M. ORCID logo & Zhang, Y. (2026). Post-trade netting and contagion. Operations Research, 74(2), 667-681. https://doi.org/10.1287/opre.2021.0800
A first order method for linear programming parameterized by circuit imbalance
Cole, R., Hertrich, C. ORCID logo , Tao, Y. & Vegh, L. A. ORCID logo (2026). A first order method for linear programming parameterized by circuit imbalance. Mathematical Programming, 216(1-2), 339-377. https://doi.org/10.1007/s10107-025-02264-7
A 4/3-approximation for the maximum leaf spanning arborescence problem in DAGs
Neuwohner, M. ORCID logo (2026). A 4/3-approximation for the maximum leaf spanning arborescence problem in DAGs. Mathematical Programming, 216(1-2), 111 - 133. https://doi.org/10.1007/s10107-025-02233-0
Optimal stopping zero-sum games in continuous hidden Markov models
Gapeev, P. V. ORCID logo (2026). Optimal stopping zero-sum games in continuous hidden Markov models. Advances in Applied Probability, 58(1), 170 - 213. https://doi.org/10.1017/apr.2025.10018
Regular matchstick graphs on the sphere
Swanepoel, K. ORCID logo (2026). Regular matchstick graphs on the sphere. American Mathematical Monthly, https://doi.org/10.1080/00029890.2025.2599752
Frosty: bringing strong liveness guarantees to the Snow family of consensus protocols
Buchwald, A., Buttolph, S., Lewis-Pye, A. , O'Grady, P. & Sekniqi, K. (2026). Frosty: bringing strong liveness guarantees to the Snow family of consensus protocols. In Garman, C. & Moreno-Sanchez, P. (Eds.), Financial Cryptography and Data Security: 29th International Conference, FC 2025,Miyakojima, Japan, April 14–18, 2025, Revised Selected Papers, Part II (pp. 91 - 107). Springer. https://doi.org/10.1007/978-3-032-07035-7_6

Publications

Below is the list of the Department's recent research publications. This information is generated by an RSS feed from LSE Research Online, and shows the most recent 20 publications (either published, or accepted for publication).

CDAM Research Report Series from 1991 - 2009