Items where Subject is "Q Science > QA Mathematics"

A

Abdelkhalek, Ahmed, Bilas, Angelos and Michaelides, Alexander (2002) Parallelization and performance of portfolio choice models. In: Ni, Lionel M. and Valero, Mateo, (eds.) Proceedings of the 2001 International Conference on Parallel Processing. IEEE Computer Society, Valencia, Spain, pp. 277-286. ISBN 0769512577

Abdi, Ahmad ORCID: 0000-0002-3008-4167 and Cornuejols, Gerard (2021) The max-flow min-cut property and ±1-resistant sets. Discrete Applied Mathematics, 289. 455 - 476. ISSN 0166-218X

Abdi, Ahmad ORCID: 0000-0002-3008-4167, Cornuejols, Gerard, Huynh, Tony and Lee, Dabeen (2022) Idealness of k-wise intersecting families. Mathematical Programming, 192 (1-2). 29 - 50. ISSN 0025-5610

Abdi, Ahmad ORCID: 0000-0002-3008-4167, Cornuejols, Gerard and Lee, Dabeen (2019) Identically self-blocking clutters. In: Lodi, Andrea and Nagarajan, Viswanath, (eds.) Integer Programming and Combinatorial Optimization - 20th International Conference, IPCO 2019, Proceedings. Lecture Notes in Computer Science,11480. Springer Berlin / Heidelberg, USA, pp. 1-12. ISBN 9783030179526

Abdi, Ahmad ORCID: 0000-0002-3008-4167, Cornuejols, Gerard and Lee, Dabeen (2020) Intersecting restrictions in clutters. Combinatorica, 40 (5). 605 - 623. ISSN 0209-9683

Abdi, Ahmad ORCID: 0000-0002-3008-4167, Cornuejols, Gerard and Zlatin, Michael (2023) On packing dijoins in digraphs and weighted digraphs. SIAM Journal on Discrete Mathematics, 37 (4). 2417 - 2461. ISSN 0895-4801

Abdi, Ahmad ORCID: 0000-0002-3008-4167, Cornuéjols, Gérard, Guenin, Bertrand and Tunçel, Levent (2022) Clean clutters and dyadic fractional packings. SIAM Journal on Discrete Mathematics. ISSN 0895-4801

Abdi, Ahmad ORCID: 0000-0002-3008-4167, Cornuéjols, Gérard, Guenin, Bertrand and Tunçel, Levent (2024) Dyadic linear programming and extensions. Mathematical Programming. ISSN 0025-5610

Abdi, Ahmad ORCID: 0000-0002-3008-4167, Cornuéjols, Gérard, Guenin, Bertrand and Tunçel, Levent (2022) Testing idealness in the filter oracle model. Operations Research Letters, 50 (6). 753 - 755. ISSN 0167-6377

Abdi, Ahmad ORCID: 0000-0002-3008-4167, Cornuéjols, Gérard, Guenin, Bertrand and Tunçel, Levent (2022) Total dual dyadicness and dyadic generating sets. Mathematical Programming. ISSN 0025-5610

Abdi, Ahmad ORCID: 0000-0002-3008-4167, Cornuéjols, Gérard, Guenin, Bertrand and Tunçel, Levent (2022) Total dual dyadicness and dyadic generating sets. In: Aardal, Karen and Sanità, Laura, (eds.) Integer Programming and Combinatorial Optimization - 23rd International Conference, IPCO 2022, Proceedings: book series. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),13265. Springer Science and Business Media Deutschland GmbH, pp. 1-14. ISBN 9783031069000

Abdi, Ahmad ORCID: 0000-0002-3008-4167, Cornuéjols, Gérard, Guričanová, Natália and Lee, Dabeen (2020) Cuboids, a class of clutters. Journal of Combinatorial Theory, Series B, 142. 144 - 209. ISSN 0095-8956

Abdi, Ahmad ORCID: 0000-0002-3008-4167, Cornuéjols, Gérard and Lee, Dabeen (2020) Resistant sets in the unit hypercube. Mathematics of Operations Research, 46 (1). ISSN 0364-765X

Abdi, Ahmad ORCID: 0000-0002-3008-4167, Cornuéjols, Gérard and Superdock, Matt (2022) Clean tangled clutters, simplices, and projective geometries. Journal of Combinatorial Theory, Series B, 154. 60 - 92. ISSN 0095-8956

Abdi, Ahmad ORCID: 0000-0002-3008-4167, Cornuéjols, Gérard and Superdock, Matt (2021) A new infinite class of ideal minimally non-packing clutters. Discrete Mathematics, 344 (7). ISSN 0012-365X

Abdi, Ahmad ORCID: 0000-0002-3008-4167, Cornuéjols, Gérard and Zambelli, Giacomo (2024) Arc connectivity and submodular flows in digraphs. Combinatorica, 44 (5). 1069 - 1090. ISSN 0209-9683

Abdi, Ahmad ORCID: 0000-0002-3008-4167, Cornuéjols, Gérard P. and Palion, Zuzanna (2022) On dyadic fractional packings of T-joins. SIAM Journal on Discrete Mathematics, 36 (3). 2445 - 2451. ISSN 0895-4801

Abdi, Ahmad ORCID: 0000-0002-3008-4167, Feldmann, Andreas Emil, Guenin, Bertrand, Könemann, Jochen and Sanita, Laura (2016) Lehman's theorem and the directed Steiner tree problem. SIAM Journal on Discrete Mathematics, 30 (1). pp. 141-153. ISSN 0895-4801

Abdi, Ahmad ORCID: 0000-0002-3008-4167 and Fukasawa, Ricardo (2016) On the mixing set with a knapsack constraint. Mathematical Programming, 157 (1). pp. 191-217. ISSN 0025-5610

Abdi, Ahmad ORCID: 0000-0002-3008-4167, Fukasawa, Ricardo and Sanitàa, Laura (2018) Opposite elements in clutters. Mathematics of Operations Research, 43 (2). pp. 428-459. ISSN 0364-765X

Abdi, Ahmad ORCID: 0000-0002-3008-4167 and Guenin, Bertrand (2018) Packing odd T-joins with at most two terminals. Journal of Graph Theory, 87 (4). pp. 587-652. ISSN 0364-9024

Abdi, Ahmad ORCID: 0000-0002-3008-4167 and Guenin, Bertrand (2019) The minimally non-ideal binary clutters with a triangle. Combinatorica, 39 (4). 719 - 752. ISSN 0209-9683

Abdi, Ahmad ORCID: 0000-0002-3008-4167 and Guenin, Bertrand (2019) The two-point Fano and ideal binary clutters. Combinatorica, 39 (4). 753 - 777. ISSN 0209-9683

Abdi, Ahmad ORCID: 0000-0002-3008-4167 and Lee, Dabeen (2019) Deltas, extended odd holes and their blockers. Journal of Combinatorial Theory. Series B, 136. pp. 193-203. ISSN 0095-8956

Abdi, Ahmad ORCID: 0000-0002-3008-4167 and Lee, Dabeen (2024) From coordinate subspaces over finite fields to ideal multipartite uniform clutters. Mathematical Programming. ISSN 0025-5610

Abdi, Ahmad ORCID: 0000-0002-3008-4167 and Pashkovich, Kanstantsin (2018) Delta minors, delta free clutters, and entanglement. SIAM Journal on Discrete Mathematics, 32 (3). pp. 1750-1774. ISSN 0895-4801

Abdi, Ahmad ORCID: 0000-0002-3008-4167, Pashkovich, Kanstantsin and Cornuéjols, Gérard (2018) Ideal clutters that do not pack. Mathematics of Operations Research, 43 (2). pp. 533-553. ISSN 0364-765X

Abell, Peter and Ludwig, Mark (2009) Structural balance: a dynamic perspective. Journal of Mathematical Sociology, 33 (2). pp. 129-155. ISSN 0022-250X

Acciaio, B., Backhoff-Veraguas, J. and Zalashko, A. (2020) Causal optimal transport and its links to enlargement of filtrations and continuous-time stochastic optimization. Stochastic Processes and Their Applications, 130 (5). 2918 - 2953. ISSN 0304-4149

Acciaio, B., Beigelböck, M., Penkner, F., Schachermayer, W. and Temme, J. (2013) A trajectorial interpretation of Doob's martingale inequalities. Annals of Applied Probability, 23 (4). pp. 1494-1505. ISSN 1050-5164

Acciaio, Beatrice, Backhoff-Veraguas, J. and Carmona, Rene (2019) Extended mean field control problems: stochastic maximum principle and transport perspective. SIAM Journal on Control and Optimization, 57 (6). 3666 - 3693. ISSN 0363-0129

Acciaio, Beatrice, Beiglböck, M., Penkner, F. and Schachermayer, W. (2016) A model-free version of the fundamental theorem of asset pricing and the super-replication theorem. Mathematical Finance, 26 (2). 233 - 251. ISSN 0960-1627

Acciaio, Beatrice, Fontana, Claudio and Kardaras, Constantinos ORCID: 0000-0001-6903-4506 (2016) Arbitrage of the first kind and filtration enlargements in semimartingale financial models. Stochastic Processes and Their Applications, 126 (6). pp. 1761-1784. ISSN 0304-4149

Acciaio, Beatrice, Föllmer, Hans and Penner, Irina (2012) Risk assessment for uncertain cash flows: model ambiguity, discounting ambiguity, and the role of bubbles. Finance and Stochastics, 16 (4). pp. 669-709. ISSN 0949-2984

Acciaio, Beatrice and Guyon, Julien (2020) Short communication: inversion of convex ordering: local volatility does not maximise the price of VIX futures. SIAM Journal on Financial Mathematics, 11 (1). SC1 - SC13. ISSN 1945-497X

Acciaio, Beatrice, Larsson, Martin and Schachermayer, Walter (2017) The space of outcomes of semi-static trading strategies need not be closed. Finance and Stochastics, 21 (3). pp. 741-751. ISSN 0949-2984

Acciaio, Beatrice and Penner, I. (2016) Characterization of max-continuous local martingales vanishing at infinity. Electronic Communications in Probability, 21 (71). pp. 1-10. ISSN 1083-589X

Acciaio, Beatrice and Svindland, Gregor (2014) On the lower arbitrage bound of American contingent claims. Mathematical Finance, 24 (1). pp. 147-155. ISSN 0960-1627

Acciaio, Beatrice and Svindland, Gregor (2009) Optimal risk sharing with different reference probabilities. Insurance: Mathematics and Economics, 44 (3). pp. 426-433. ISSN 0167-6687

Accominotti, Olivier ORCID: 0009-0005-2682-5064, Lucena-Piquero, Delio and Ugolini, Stefano (2023) Intermediaries’ substitutability and financial network resilience: a hyperstructure approach. Journal of Economic Dynamics and Control, 153. ISSN 0165-1889

Achdou, Yves, Buera, Francisco J., Lasry, Jean Michel, Lions, Pierre Louis and Moll, Benjamin ORCID: 0009-0003-6067-359X (2014) Partial differential equation models in macroeconomics. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 372 (2028). ISSN 1364-503X

Adamaszek, Anna, Allen, Peter ORCID: 0000-0001-6555-3501, Grosu, Codrut and Hladky, Jan (2020) Almost all trees are almost graceful. Random Structures and Algorithms, 56 (4). pp. 948-987. ISSN 1042-9832

Adler, Matthew D. and Treich, Nicolas (2017) Utilitarianism, prioritarianism, and intergenerational equity: a cake eating model. Mathematical Social Sciences, 87. pp. 94-102. ISSN 0165-4896

Adsul, Bharat, Garg, Jugal, Mehta, Ruta, Sohoni, Milind and Von Stengel, Bernhard ORCID: 0000-0002-3488-8322 (2020) Fast algorithms for rank-1 bimatrix games. Operations Research. 0-0. ISSN 0030-364X

Agnello, Luca, Castro, Vítor and Sousa, Ricardo M. (2019) On the duration of sovereign ratings cycle phases. Journal of Economic Behavior & Organization. ISSN 0167-2681

Ahipasaoglu, Selin Damla and Todd, Michael J. (2013) A modified Frank–Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: theory and algorithms. Computational Geometry, 46 (5). pp. 494-519. ISSN 0925-7721

Al Motairi, Hessah and Zervos, Mihail ORCID: 0000-0001-5194-6881 (2017) Irreversible capital accumulation with economic impact. Applied Mathematics and Optimization, 75 (3). pp. 525-551. ISSN 0095-4616

Alessi, Lucia, Barigozzi, Matteo and Capasso, Marco (2010) Improved penalization for determining the number of factors in approximate factor models. Statistics and Probability Letters, 80 (23-24). pp. 1806-1813. ISSN 0167-7152

Alexander, J. McKenzie ORCID: 0000-0002-2663-6993 (2015) Cheap talk, reinforcement learning, and the emergence of cooperation. Philosophy of Science, 82 (5). 969 - 982. ISSN 0031-8248

Alexander, Jason ORCID: 0000-0002-2663-6993 and Skyrms, Brian (1999) The (spatial) evolution of the equal split. Technical report MBS (99-07). University of California - Irvine, Irvine, USA.

Alfonzetti, Giuseppe, Bellio, Ruggero, Chen, Yunxiao ORCID: 0000-0002-7215-2324 and Moustaki, Irini ORCID: 0000-0001-8371-1251 (2024) Pairwise stochastic approximation for confirmatory factor analysis of categorical data. British Journal of Mathematical and Statistical Psychology. ISSN 0007-1102

Alharbi, Njud S., Jahanshahi, Hadi, Yao, Qijia, Bekiros, Stelios and Moroz, Irene (2023) Enhanced classification of heartbeat electrocardiogram signals using a long short-term memory–convolutional neural network ensemble: paving the way for preventive healthcare. Mathematics, 11 (18). ISSN 2227-7390

Alistarh, Dan, Grubic, Demjan, Li, Jerry Z., Tomioka, Ryota and Vojnovic, Milan ORCID: 0000-0003-1382-022X (2017) QSGD: communication-efficient SGD via gradient quantization and encoding. . arXiv.

Allen, Myles R., Read, Peter L. and Smith, Leonard A. (1992) Temperature oscillations. Nature, 359 (6397). p. 679. ISSN 0028-0836

Allen, Myles R., Read, Peter L. and Smith, Leonard A. (1992) Temperature time-series? Nature, 355 (6362). p. 686. ISSN 0028-0836

Allen, Myles R. and Smith, Leonard A. (1994) Investigating the origins and significance of low-frequency modes of climate variability. Geophysical Research Letters, 21 (10). pp. 883-886. ISSN 0094-8276

Allen, Myles R. and Smith, Leonard A. (1996) Monte Carlo SSA: detecting irregular oscillations in the presence of colored noise. Journal of Climate, 9 (12). pp. 3373-3404. ISSN 0894-8755

Allen, Myles R. and Smith, Leonard A. (1997) Optimal filtering in singular spectrum analysis. Physics Letters A, 234 (6). pp. 419-428. ISSN 0375-9601

Allen, Peter ORCID: 0000-0001-6555-3501 (2007) Almost every 2-SAT function is unate. Israel Journal of Mathematics, 161 (1). pp. 311-346. ISSN 0021-2172

Allen, Peter ORCID: 0000-0001-6555-3501 (2008) Covering two-edge-coloured complete graphs with two disjoint monochromatic cycles. Combinatorics, Probability and Computing, 17 (4). pp. 471-486. ISSN 0963-5483

Allen, Peter ORCID: 0000-0001-6555-3501 (2010) Dense H-free graphs are almost (χ(H)−1)-partite. Electronic Journal of Combinatorics, 27 (R21). ISSN 1077-8926

Allen, Peter ORCID: 0000-0001-6555-3501 (2009) Forbidden induced bipartite graphs. Journal of Graph Theory, 60 (3). pp. 219-241. ISSN 0364-9024

Allen, Peter ORCID: 0000-0001-6555-3501, Brightwell, Graham and Skokan, Jozef ORCID: 0000-0003-3996-7676 (2010) Ramsey-goodness - and otherwise. . arXiv.org.

Allen, Peter ORCID: 0000-0001-6555-3501, Brightwell, Graham and Skokan, Jozef ORCID: 0000-0003-3996-7676 (2013) Ramsey-goodness - and otherwise. Combinatorica, 33 (2). pp. 125-160. ISSN 0209-9683

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Clemens, Dennis and Taraz, Anusch (2022) Perfectly packing graphs with bounded degeneracy and many leaves. Israel Journal of Mathematics. ISSN 0021-2172

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Cooley, Oliver and Mycroft, Richard (2015) Regular slices for hypergraphs. Electronic Notes in Discrete Mathematics, 49. pp. 691-698. ISSN 1571-0653

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Cooley, Oliver and Mycroft, Richard (2017) Tight cycles and regular slices in dense hypergraphs. Journal of Combinatorial Theory, Series A, 149. pp. 30-100. ISSN 0097-3165

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Cooley, Oliver and Mycroft, Richard (2015) Tight cycles in hypergraphs. In: European Conference on Combinatorics, Graph Theory and Applications, 2015-08-31 - 2015-09-04, Bergen, Norway, NOR. (Submitted)

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Corsten, Jan, Davies, Ewan, Jenssen, Matthew, Morris, Patrick, Roberts, Barnaby and Skokan, Jozef ORCID: 0000-0003-3996-7676 (2024) A robust Corrádi–Hajnal theorem. Random Structures and Algorithms, 65 (1). pp. 61-130. ISSN 1042-9832

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Ehrenmüller, Julia, Schnitzer, Jakob and Taraz, Anusch (2022) A spanning bandwidth theorem in random graphs. Combinatorics Probability and Computing, 31 (4). 598 - 628. ISSN 0963-5483

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Ehrenmüller, Julia and Taraz, Anusch (2015) Local resilience of spanning subgraphs in sparse random graphs. In: European Conference on Combinatorics, Graph Theory and Applications, 2015-08-31 - 2015-09-04, Bergen, Norway, NOR. (Submitted)

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Ehrenmüller, Julia and Taraz, Anusch (2020) The bandwidth theorem in sparse graphs. Advances in Combinatorics, 2020 (1). 1 - 60. ISSN 2517-5599

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Griffiths, Simon and Kohayakawa, Yoshiharu (2013) The chromatic threshold of graphs. Advances in Mathematics, 235. pp. 261-295. ISSN 0001-8708

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Griffiths, Simon, Kohayakawa, Yoshiharu and Morris, Robert (2017) Chromatic thresholds in dense random graphs. Random Structures and Algorithms, 51 (2). 185 - 214. ISSN 1042-9832

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Griffiths, Simon, Kohayakawa, Yoshiharu and Morris, Robert (2017) Chromatic thresholds in sparse random graphs. Random Structures and Algorithms, 51 (2). pp. 215-236. ISSN 1042-9832

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635 and Hladky, Jan (2011) Filling the gap between Turan's theorem and Posa's conjecture. Journal of the London Mathematical Society, 84 (2). pp. 269-302. ISSN 0024-6107

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Hladký, Jan and Cooley, Oliver (2009) Minimum degree conditions for large subgraphs. Electronic Notes in Discrete Mathematics, 34. pp. 75-79. ISSN 1571-0653

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Hladký, Jan and Piguet, Diana (2019) Packing degenerate graphs. Advances in Mathematics, 354. ISSN 0001-8708

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Hladký, Jan and Piguet, Diana (2017) Packing degenerate graphs greedily. Electronic Notes in Discrete Mathematics, 61. pp. 45-51. ISSN 1571-0653

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Hladký, Jan and Piguet, Diana (2015) A density Corrádi-Hajnal theorem. Canadian Journal of Mathematics, 67 (4). pp. 721-758. ISSN 0008-414X

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Hladký, Jan and Piguet, Diana (2014) An extension of Turán's theorem, uniqueness and stability. Electronic Journal of Combinatorics, 21 (4). P4.5. ISSN 1077-8926

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Hàn, Hiệp, Kohayakawa, Yoshiharu and Person, Yury (2024) Blow-up lemmas for sparse graphs. Discrete Analysis. ISSN 2397-3129 (In Press)

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Hàn, Hiệp, Kohayakawa, Yoshiharu and Person, Yury (2017) Powers of Hamilton cycles in pseudorandom graphs. Combinatorica, 37 (4). pp. 573-616. ISSN 0209-9683

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Hàn, Hiệp, Kohayakawa, Yoshiharu and Person, Yury (2013) An approximate blow-up lemma for sparse pseudorandom graphs. Electronic Notes in Discrete Mathematics, 44. pp. 393-398. ISSN 1571-0653

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Kohayakawa, Yoshiharu and Person, Yury (2015) Tight Hamilton cycles in random hypergraphs. Random Structures and Algorithms, 46 (3). pp. 446-465. ISSN 1042-9832

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Kohayakawa, Yoshiharu and Roberts, Barnaby (2017) Triangle-free subgraphs of random graphs. Combinatorics, Probability and Computing, 27 (2). pp. 141-161. ISSN 0963-5483

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Lang, Richard, Skokan, Jozef ORCID: 0000-0003-3996-7676 and Stein, Maya (2024) Partitioning a 2-edge-coloured graph of minimum degree 2n/3 + o(n) into three monochromatic cycles. European Journal of Combinatorics, 121. ISSN 0195-6698

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635 and Person, Yury (2014) An improved error term for minimum H-decompositions of graphs. Journal of Combinatorial Theory, Series B, 108. pp. 92-101. ISSN 0095-8956

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Roberts, Barnaby and Kohayakawa, Yoshiharu (2015) Triangle-free subgraphs of random graphs. In: European Conference on Combinatorics, Graph Theory and Applications, 2015-08-31 - 2015-09-04, Bergen, Norway, NOR. (Submitted)

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635 and Skokan, Jozef ORCID: 0000-0003-3996-7676 (2017) Report of the large-scale Structures in random graphs workshop. Maths@LSE Blog (08 Feb 2017). Website.

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Skokan, Jozef ORCID: 0000-0003-3996-7676 and Stein, Maya (2020) Regularity inheritance in pseudorandom graphs. Random Structures and Algorithms, 56 (2). 306 - 338. ISSN 1042-9832

Allen, Peter ORCID: 0000-0001-6555-3501, Keevash, Peter, Sudakov, Benny and Verstraëte, Jacques (2014) Turán numbers of bipartite graphs plus an odd cycle. Journal of Combinatorial Theory, Series B, 106. pp. 134-162. ISSN 0095-8956

Allen, Peter ORCID: 0000-0001-6555-3501, Koch, Christoph, Parczyk, Olaf and Person, Yury (2018) Finding tight hamilton cycles in random hypergraphs faster. In: Bender, M., Farach-Colton, M. and Mosteiro, M., (eds.) LATIN 2018: theoretical informatics. Lecture Notes in Computer Science (10807). Springer Berlin / Heidelberg, Cham, Switzerland, pp. 28-36. ISBN 9783319774039

Allen, Peter ORCID: 0000-0001-6555-3501, Lozin, Vadim and Rao, Michaël (2009) Clique-width and the speed of hereditary properties. Electronic Journal of Combinatorics, 16 (1). R35. ISSN 1077-8926

Allen, Peter ORCID: 0000-0001-6555-3501, Luczak, Tomasz, Polcyn, Joanna and Zhang, Yanbo (2023) The Ramsey number of a long even cycle versus a star. Journal of Combinatorial Theory, Series B, 162. 144 - 153. ISSN 0095-8956

Allen, Peter ORCID: 0000-0001-6555-3501, Mergoni Cecchelli, Domenico, Skokan, Jozef ORCID: 0000-0003-3996-7676 and Roberts, Barnaby (2024) The Ramsey numbers of squares of paths and cycles. Electronic Journal of Combinatorics, 31 (2). ISSN 1077-8926

Allen, Peter ORCID: 0000-0001-6555-3501, Parczyk, Olaf and Pfenninger, Vincent (2024) Resilience for tight Hamiltonicity. Combinatorial Theory, 4 (1). ISSN 2766-1334

Allen, Peter ORCID: 0000-0001-6555-3501, Roberts, Barnaby and Skokan, Jozef ORCID: 0000-0003-3996-7676 (2015) Ramsey numbers of squares of paths. In: European Conference on Combinatorics, Graph Theory and Applications, 2015-08-31 - 2015-09-04, Bergen, Norway, NOR.

Allen, Peter ORCID: 0000-0001-6555-3501, Skokan, Jozef ORCID: 0000-0003-3996-7676 and Würfl, Andreas (2013) Maximum planar subgraphs in dense graphs. Electronic Journal of Combinatorics, 20 (3). ISSN 1077-8926

Alm, Erik. S and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2002) Exact expectations and distributions for the random assignment problem. Combinatorics, Probability and Computing, 11 (3). pp. 217-248. ISSN 0963-5483

Alon, Noga, Brightwell, Graham, Kierstead, H. A., Kostochka, A. V. and Winkler, Peter (2004) Dominating sets in k-majority tournaments. CDAM research report series (LSE-CDAM-2004-11). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Alonso, Ricardo ORCID: 0000-0001-9559-0864 and Rantakari, Heikki (2014) The art of brevity. USC Marshall School of Business Research Paper Series. University of Southern California, Marshall School of Business, Los Angeles, CA, USA.

Alotaibi, Naif D., Jahanshahi, Hadi, Yao, Qijia, Mou, Jun and Bekiros, Stelios (2023) An ensemble of long short-term memory networks with an attention mechanism for upper limb electromyography signal classification. Mathematics, 11 (18). ISSN 2227-7390

Alpern, Steve, Baston, Vic and Gal, Shmuel (2009) Searching symmetric networks with Utilitarian-Postman paths. Networks, 53 (4). pp. 392-402. ISSN 1097-0037

Alpern, Steve, Bui, Thuy, Lidbetter, Thomas and Papadaki, Katerina ORCID: 0000-0002-0755-1281 (2022) Continuous patrolling games. Operations Research, 70 (6). 3076 - 3089. ISSN 0030-364X

Alpern, Steve, Chen, Bo and Ostaszewski, Adam ORCID: 0000-0003-2630-8663 (2021) A functional equation of tail-balance for continuous signals in the Condorcet jury theorem. Aequationes Mathematicae, 95 (1). 67 - 74. ISSN 0001-9054

Alpern, Steve, Fokkink, Robbert, Lindelauf, Roy and Olsder, Geert Jan (2009) A numerical approach to the ‘Princess and Monster’ game on an interval. In: Bernhard, Pierre, Gaitsgory, Vladimir and Pourtallier, Odile, (eds.) Advances in Dynamic Games and Their Applications. Annals of the International Society of Dynamic Games. Birkhaeuser Verlag AG, pp. 149-157. ISBN 9780817648336

Alpern, Steve and Gal, Shmuel (2009) Analysis and design of selection committees: a game theoretic secretary problem. International Journal of Game Theory, 38 (3). pp. 377-394. ISSN 0020-7276

Alpern, Steve, Gal, Shmuel and Solan, Eilon (2010) A sequential selection game with vetoes. Games and Economic Behavior, 68 (1). pp. 1-14. ISSN 0899-8256

Alpern, Steve and Howard, J. V. (2019) A short solution to the many-player silent duel with arbitrary consolation prize. European Journal of Operational Research, 273 (2). pp. 646-649. ISSN 0377-2217

Alpern, Steve and Lidbetter, Thomas (2013) Mining coal or finding terrorists: the expanding search paradigm. Operations Research, 61 (2). pp. 265-279. ISSN 0030-364X

Alpern, Steve and Lidbetter, Thomas (2014) Searching a variable speed network. Mathematics of Operations Research, 39 (3). pp. 697-711. ISSN 0364-765X

Alpern, Steve, Lidbetter, Thomas and Papadaki, Katerina ORCID: 0000-0002-0755-1281 (2018) Optimizing periodic patrols against short attacks on the line and other networks. European Journal of Operational Research. ISSN 0377-2217

Alpern, Steven (2000) Asymmetric rendezvous search on the circle. Dynamics and Control, 10 (1). pp. 33-45. ISSN 0925-4668

Alpern, Steven (2004) Bilateral street searching in Manhattan (line-of-sight rendezvous on a planar lattice). CDAM Research Report Series (LSE-CDAM-2004-09). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Alpern, Steven (1999) Combinatorial approximation by Devaney-chaotic or periodic volume preserving homeomorphisms. International Journal of Bifurcation and Chaos, 9 (5). pp. 843-848. ISSN 0218-1274

Alpern, Steven (2011) Find-and-fetch search on a tree. Operations Research, 59 (5). pp. 1258-1268. ISSN 0030-364X

Alpern, Steven (2008) Hide-and-seek games on a tree to which Eulerian networks are attached. Networks, 52 (3). pp. 162-166. ISSN 0028-3045

Alpern, Steven (2005) How to search a tree to which Eulerian networks are attached. CDAM research report (CDAM-LSE- 2005-14). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Alpern, Steven (2008) Line-of-sight rendezvous. European Journal of Operational Research, 188 (3). pp. 865-883. ISSN 0377-2217

Alpern, Steven (2002) Rendezvous search: a personal perspective. Operations Research, 50 (5). pp. 772-795. ISSN 0030-364X

Alpern, Steven (2010) Search games on trees with asymmetric travel times. SIAM Journal on Control and Optimization, 48 (8). pp. 5547-5563. ISSN 0363-0129

Alpern, Steven (2011) A new approach to Gal’s theory of search games on weakly eulerian networks. Dynamic Games and Applications, 1 (2). pp. 209-219. ISSN 2153-0785

Alpern, Steven, Baston, V. and Essegaier, S. (1999) Rendezvous search on a graph. Journal of Applied Probability, 36 (1). pp. 223-231. ISSN 0021-9002

Alpern, Steven and Baston, Vic (2004) Rendezvous in higher dimensions. CDAM Research Report Series (LSE-CDAM-2004-06). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Alpern, Steven and Baston, Vic (2006) Rendezvous in higher dimensions. SIAM Journal on Control and Optimization, 44 (6). 2233 - 2252. ISSN 0363-0129

Alpern, Steven and Baston, Vic (2004) Rendezvous on a planar lattice. CDAM research report series (LSE-CDAM-2004-08). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Alpern, Steven and Baston, Vic (2005) Rendezvous on a planar lattice. Operations Research, 53 (6). 996 - 1006. ISSN 0030-364X

Alpern, Steven and Baston, Vic (2004) A common notion of clockwise can help in planar rendezvous. CDAM research report series (LSE-CDAM-2004-07). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Alpern, Steven and Baston, Vic (2006) A common notion of clockwise can help in planar rendezvous. European Journal of Operational Research, 175 (2). pp. 688-706. ISSN 0377-2217

Alpern, Steven, Baston, Vic and Gal, Schmuel (2006) Network search games with immobile hider, without a designated searcher starting point. CDAM research report series (LSE-CDAM-2006-03). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Alpern, Steven, Baston, Vic and Gal, Shmuel (2008) Network search games with immobile hider, without a designated searcher starting point. International Journal of Game Theory, 37 (2). pp. 281-302. ISSN 0020-7276

Alpern, Steven, Baston, Vic and Gal, Shmuel (2006) Searching symmetric networks with Utilitarian Postman paths. CDAM research report series (LSE-CDAM-2006-05). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Alpern, Steven and Beck, A. (1999) Asymmetric rendezvous on the line is a double linear search problem. Mathematics of Operations Research, 24 (3). pp. 604-618. ISSN 0364-765X

Alpern, Steven and Beck, A. (1999) Rendezvous search on the line with limited resources: maximizing the probability of meeting. Operations Research, 47 (6). pp. 849-861. ISSN 0030-364X

Alpern, Steven and Beck, Anatole (2000) Pure strategy asymmetric rendezvous on the line with an unknown initial distance. Operations Research, 48 (3). pp. 498-501. ISSN 0030-364X

Alpern, Steven and Binmore, Ken (2016) A tribute to Anatole Beck (1930-2014). Maths@LSE Blog (28 Jan 2016). Website.

Alpern, Steven, Fokkink, Robbert and Kikuta, Ken (2010) On ruckle's conjecture on accumulation games. SIAM Journal on Control and Optimization, 48 (8). pp. 5073-5083. ISSN 0363-0129

Alpern, Steven, Fokkink, Robbert, Lidbetter, Thomas and Clayton, Nicola S. (2012) A search game model of the scatter hoarder's problem. Journal of the Royal Society Interface, 9 (70). pp. 869-879. ISSN 1742-5689

Alpern, Steven, Fokkink, Robbert, Lindelauf, Roy and Olsder, Geert Jan (2006) Numerical approaches to the 'princess and monster' game on the interval. CDAM research report series (LSE-CDAM-2006-18). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Alpern, Steven, Fokkink, Robbert, Lindelauf, Roy and Olsder, Geert Jan (2006) The 'princess and monster' game on an interval. CDAM research report series (LSE-CDAM-2006-17). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Alpern, Steven, Fokkink, Robbert, Lindelauf, Roy and Olsder, Geert-Jan (2008) The “Princess and Monster” game on an interval. SIAM Journal on Control and Optimization, 47 (3). pp. 1178-1190. ISSN 0363-0129

Alpern, Steven, Fokkink, Robbert, Op Den Kelder, Joram and Lidbetter, Thomas (2010) Disperse or unite? A mathematical model of coordinated attack. Lecture Notes in Computer Science, 6442. pp. 220-233. ISSN 0302-9743

Alpern, Steven, Fokkink, Robbert and Pelekis, Christos (2012) A proof of the Kikuta–Ruckle Conjecture on cyclic caching of resources. Journal of Optimization Theory and Applications, 153 (3). pp. 650-661. ISSN 0022-3239

Alpern, Steven, Fokkink, Robbert, Timmer, Marco and Casas, Jerome (2011) Ambush frequency should increase over time during optimal predator search for prey. Journal of the Royal Society Interface, 8 (64). pp. 1665-1672. ISSN 1742-5689

Alpern, Steven and Gal, Shmuel (2002) Searching for an agent who may or may not want to be found. Operations Research, 50 (2). pp. 311-323. ISSN 0030-364X

Alpern, Steven and Gal, Shmuel (2003) The Theory of Search Games and Rendezvous. , Intern Springer Berlin / Heidelberg. ISBN 0792374681

Alpern, Steven and Gal, Shmuel (2006) Two conjectures on rendezvous in K3. CDAM research report series (LSE-CDAM-2006-21). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Alpern, Steven and Howard, J. V. (2000) Alternating search at two locations. Dynamics and Control, 10 (4). pp. 319-339. ISSN 0925-4668

Alpern, Steven and Howard, John V. (1999) Alternating search at two locations. Operational Research working papers (LSEOR 99.30). Department of Operational Research, London School of Economics and Political Science, London, UK.

Alpern, Steven and Katrantzi, Ioanna (2008) Equilibria of two-sided matching games with common preferences. European Journal of Operational Research, 196 (3). pp. 1214-1222. ISSN 0377-2217

Alpern, Steven, Katrantzi, Ioanna and Reyniers, Diane J. ORCID: 0000-0003-0677-2020 (2005) Mathematical models of mutual mate choice. CDAM research report (CDAM-LSE-2005-20). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Alpern, Steven, Morton, Alec and Papadaki, Katerina ORCID: 0000-0002-0755-1281 (2009) Optimizing randomized patrols. Operational Research working papers (LSEOR 09.116). Operational Research Group, London School of Economics and Political Science, London, UK. (Submitted)

Alpern, Steven, Morton, Alec and Papadaki, Katerina ORCID: 0000-0002-0755-1281 (2011) Patrolling games. Operations Research, 59 (5). pp. 1246-1257. ISSN 0030-364X

Alpern, Steven and Pikounis, Michael (2000) The telephone coordination game. In: Petrosjan, L. A. and Mazalov, V. V., (eds.) Game Theory and Applications. Nova Science Publishers, Huntington, New York, USA. ISBN 9781560728221

Alpern, Steven and Prasad, V. (2005) Towers, conjugacy and coding. CDAM research report series (CDAM-LSE-2005-21). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Alpern, Steven and Prasad, V. S. (1999) Chaotic homeomorphisms of RN, lifted from torus homeomorphisms. Bulletin of the London Mathematical Society, 31 (5). pp. 577-580. ISSN 0024-6093

Alpern, Steven and Prasad, V. S. (2000) Maximally chaotic homeomorphisms of sigma-compact manifolds. Topology and its Applications, 105 (1). pp. 103-112. ISSN 0166-8641

Alpern, Steven and Prasad, V. S. (2008) MultiTowers, conjugacies and codes: three theorems in ergodic theory, one variation on Rokhlin's Lemma. Proceedings of the American Mathematical Society, 136 (12). pp. 4373-4383. ISSN 0002-9939

Alpern, Steven and Prasad, V. S. (2002) Properties generic for Lebesgue space automorphisms are generic for measure-preserving manifold homeomorphisms. Ergodic Theory and Dynamical Systems, 22 (6). pp. 1587-1620. ISSN 0143-3857

Alpern, Steven and Prasad, V. S. (2005) Rotational (and other) representations of stochastic matrices. CDAM research report series (CDAM-LSE-2005-13). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Alpern, Steven and Prasad, V. S. (2008) Rotational (and other) representations of stochastic matrices. Stochastic Analysis and Applications, 26 (1). pp. 1-15. ISSN 0736-2994

Alpern, Steven and Prasad, Vidhu (2001) Typical dynamics of volume-preserving homeomorphisms. Cambridge tracts in mathematics. (139). Cambridge University Press, Cambridge. ISBN 9780521582872

Alpern, Steven and Reyniers, D. (1999) Strategic mating with homotypic preferences. Journal of Theoretical Biology, 198 (1). pp. 71-88. ISSN 0022-5193

Alpern, Steven and Reyniers, Diane J. ORCID: 0000-0003-0677-2020 (2001) Games of crowding. International Game Theory Review, 3 (1). pp. 27-56. ISSN 0219-1989

Alpern, Steven and Reyniers, Diane J. ORCID: 0000-0003-0677-2020 (2002) Spatial dispersion as a dynamic coordination problem. Theory and Decision, 53 (1). pp. 29-59. ISSN 0040-5833 (Submitted)

Alpern, Steven and Reyniers, Diane J. ORCID: 0000-0003-0677-2020 (2004) Strategic mating with common preferences. CDAM research report series (LSE-CDAM-2004-05). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Alpern, Steven and Shi Lim, Wei (2002) Rendezvous of three agents on the line. Naval Research Logistics, 49 (3). pp. 244-255. ISSN 0894-069X

Ambuehl, Christoph, Gaertner, Bernd and von Stengel, Bernhard ORCID: 0000-0002-3488-8322 (2013) Optimal lower bounds for projective list update algorithms. ACM Transactions on Algorithms, 9 (4). No.31. ISSN 1549-6325

Ambuehl, Christoph, Gaertner, Bernd and von Stengel, Bernhard ORCID: 0000-0002-3488-8322 (2010) Optimal projective algorithms for the list update problem. . arXiv.org.

Amini, Omid, Devroye, Luc, Griffiths, Simon and Olver, Neil ORCID: 0000-0001-8897-5459 (2015) Explosion and linear transit times in infinite trees. Probability Theory and Related Fields, 167. 325 - 347. ISSN 0178-8051

Amini, Omid, Devroye, Luc, Griffiths, Simon and Olver, Neil ORCID: 0000-0001-8897-5459 (2013) On explosions in heavy-tailed branching random walks. Annals of Probability, 41 (3B). 1864 - 1899. ISSN 0091-1798

Amini, Omid, Esperet, Louis and van den Heuvel, Jan ORCID: 0000-0003-0897-9148 (2013) A unified approach to distance-two colouring of graphs on surfaces. Combinatorica, 33 (3). pp. 253-296. ISSN 0209-9683

Amir, Gideon, Arieli, Itai, Ashkenazi-Golan, Galit ORCID: 0000-0003-3896-4131 and Peretz, Ron (2022) Granular DeGroot dynamics -- a model for robust naive learning in social networks. In: Proceedings of the 23rd ACM Conference on Economics and Computation. ACM Press, pp. 323-324. ISBN 9781450391504

Amir, Gideon, Arieli, Itai, Ashkenazi-Golan, Galit ORCID: 0000-0003-3896-4131 and Peretz, Ron (2024) Granular DeGroot dynamics – a model for robust naive learning in social networks. Journal of Economic Theory. ISSN 0022-0531 (In Press)

An, Hongzhi, Huang, Da, Yao, Qiwei ORCID: 0000-0003-2065-8486 and Zhang, Cun-Hui (2008) Stepwise searching for feature variables in high-dimensional linear regression. . London School of Economics and Political Science, London, UK.

Anderson, Gordon, Linton, Oliver and Leo, Teng Wah (2012) A polarization-cohesion perspective on cross-country convergence. Journal of Economic Growth, 17 (1). pp. 49-69. ISSN 1381-4338

Angelopoulos, Spyros, Dürr, Christoph and Lidbetter, Thomas (2016) The expanding search ratio of a graph. In: Ollinger, Nicolas and Vollmer, Heribert, (eds.) 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs). (47). Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Wadern, Germany, 9:1-9:14. ISBN 9783959770019

Anthony, Martin ORCID: 0000-0002-7796-6044 (2006) Abstract mathematics. University of London Press, London.

Anthony, Martin ORCID: 0000-0002-7796-6044 (2003) Accuracy of classification by iterative linear thresholding. In: SIAM International Conference on Data Mining, 2003-05-01 - 2003-05-03, CA., United States, USA. (Submitted)

Anthony, Martin ORCID: 0000-0002-7796-6044 (1999) Accuracy of techniques for the logical analysis of data. Discrete Applied Mathematics, 96-97 (1-3). pp. 247-257. ISSN 0166-218X

Anthony, Martin ORCID: 0000-0002-7796-6044 (2002) Analysis of data with threshold decision lists. CDAM research report series (LSE-CDAM-2002-12). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Anthony, Martin ORCID: 0000-0002-7796-6044 (2008) Aspects of discrete mathematics and probability in the theory of machine learning. Discrete Applied Mathematics, 156 (6). pp. 883-902. ISSN 0166-218X

Anthony, Martin ORCID: 0000-0002-7796-6044 (2003) Boolean functions and artificial neural networks. CDAM research report series (LSE-CDAM-2003-01). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Anthony, Martin ORCID: 0000-0002-7796-6044 (2005) Connections between neural networks and boolean functions. CDAM research report series (CDAM-LSE-2005-25). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Anthony, Martin ORCID: 0000-0002-7796-6044 (2003) Data classification by multithreshold functions. In: SIAM International Conference on Data Mining, 2003-05-01 - 2003-05-03, CA., United States, USA. (Submitted)

Anthony, Martin ORCID: 0000-0002-7796-6044 (2005) Decision lists. CDAM research report series (CDAM-LSE-2005-23). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Anthony, Martin ORCID: 0000-0002-7796-6044 (2010) Decision lists and related classes of boolean functions. In: Crama, Yves and Hammer, Peter L., (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering. Encyclopedia of mathematics and its applications (134). Cambridge University Press, New York, USA, pp. 577-598. ISBN 9780521847520

Anthony, Martin ORCID: 0000-0002-7796-6044 (2002) Decision lists and threshold decision lists. CDAM research report series (LSE-CDAM-2002-11). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Anthony, Martin ORCID: 0000-0002-7796-6044 (2001) Discrete mathematics of neural networks: selected topics. SIAM monographs on discrete mathematics and applications. Society for Industrial and Applied Mathematics, New York. ISBN 9780898714807

Anthony, Martin ORCID: 0000-0002-7796-6044 (2011) Generalization error bounds for the logical analysis of data. Rutcor Research Report (1-2011). Rutgers University, New Jersey, USA.

Anthony, Martin ORCID: 0000-0002-7796-6044 (2012) Generalization error bounds for the logical analysis of data. Discrete Applied Mathematics, 160 (10-11). pp. 1407-1415. ISSN 0166-218X

Anthony, Martin ORCID: 0000-0002-7796-6044 (2005) Learning boolean functions. CDAM research report series (CDAM-LSE-2005-24). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Anthony, Martin ORCID: 0000-0002-7796-6044 (2003) Learning multivalued multithreshold functions. CDAM Research Report Series (LSE-CDAM-2003-03). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Anthony, Martin ORCID: 0000-0002-7796-6044 (2003) Links between learning and optimization: a brief tutorial. CDAM research report series (LSE-CDAM-2003-02). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Anthony, Martin ORCID: 0000-0002-7796-6044 (2003) Margin-based generalization error bounds for threshold decision lists. CDAM research report series (LSE-CDAM-2003-09). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Anthony, Martin ORCID: 0000-0002-7796-6044 (2002) Mathematical modelling of generalization. In: Marinaro, M, and Tagliaferri, R., (eds.) Neural Nets: 13th Italian Workshop on Neural Nets, Wirn Vietri 2002 Vietri Sul Mare, Italy, May 30-June 1, 2002. Lecture notes in computer science (2486). Springer Berlin / Heidelberg, Berlin; New York, pp. 181-189. ISBN 9783540442653

Anthony, Martin ORCID: 0000-0002-7796-6044 (2010) Neural networks and boolean functions. In: Crama, Yves and Hammer, Peter L., (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering. Encyclopedia of mathematics and its applications (134). Cambridge University Press, New York, USA, pp. 554-576. ISBN 9780521847520

Anthony, Martin ORCID: 0000-0002-7796-6044 (2003) On Boolean combinations of definitive classifiers. CDAM Research Report Series (LSE-CDAM-2003-22). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Anthony, Martin ORCID: 0000-0002-7796-6044 (2004) On Learning a Function of Perceptrons. In: Proceedings of the IEEE 2004 International Joint Conference on Neural Networks. IEEE Press, pp. 967-972. ISBN 0780383591

Anthony, Martin ORCID: 0000-0002-7796-6044 (2009) On constructing threshold networks for pattern classification. In: Franco, Leonardo, Elizondo, David A. and Jerez, José M., (eds.) Constructive Neural Networks. Studies in computational intelligence (258). Springer Berlin / Heidelberg, Berlin, Germany, pp. 71-82. ISBN 9783642045110

Anthony, Martin ORCID: 0000-0002-7796-6044 (2004) On data classification by iterative linear partitioning. Discrete Applied Mathematics, 144 (1-2). pp. 2-16. ISSN 0166-218X

Anthony, Martin ORCID: 0000-0002-7796-6044 (2002) Partitioning points by parallel planes. CDAM research report series (LSE-CDAM-2002-10). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Anthony, Martin ORCID: 0000-0002-7796-6044 (2004) Partitioning points by parallel planes. Discrete Mathematics, 282 (1-3). pp. 17-21. ISSN 0012-365X

Anthony, Martin ORCID: 0000-0002-7796-6044 (2010) Probabilistic learning of boolean functions. In: Grama, Yves and Hammer, Peter L., (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering. Encyclopedia of mathematics and its applications (134). Cambridge University Press, New York, USA, pp. 197-220. ISBN 9780521847520

Anthony, Martin ORCID: 0000-0002-7796-6044 (2012) Probability in machine learning. In: Seel, Norbert M., (ed.) Encyclopedia of the Sciences of Learning. Springer Berlin / Heidelberg. ISBN 9781441914279

Anthony, Martin ORCID: 0000-0002-7796-6044 (2004) Some connections between learning and optimization. Discrete Applied Mathematics, 144 (1-2). pp. 17-26. ISSN 0166-218X

Anthony, Martin ORCID: 0000-0002-7796-6044 (2002) Uniform Glivenko-Cantelli theorems and concentration of measure in the mathematical modelling of learning. CDAM research report series (LSE-CDAM-2002-07). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Anthony, Martin ORCID: 0000-0002-7796-6044 (2011) The beauty of maths. LSE Connect (2011). Website.

Anthony, Martin ORCID: 0000-0002-7796-6044 (2002) The sample complexity and computational complexity of Boolean function learning. CDAM research report series (LSE-CDAM-2002-13). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Anthony, Martin ORCID: 0000-0002-7796-6044 and Bartlett, Peter L. (2000) Function learning from interpolation. Combinatorics, Probability and Computing, 9 (3). pp. 213-225. ISSN 0963-5483

Anthony, Martin ORCID: 0000-0002-7796-6044 and Biggs, Norman (1995) Pac learning and artificial neural networks. In: Arbib, Michael A., (ed.) Handbook of Brain Theory and Neural Networks. MIT Press, Cambridge, MA, USA, pp. 694-697. ISBN 9780262011488

Anthony, Martin ORCID: 0000-0002-7796-6044, Boros, Endre, Crama, Yves and Gruber, Aritanan (2017) Quadratic reformulations of nonlinear binary optimization problems. Mathematical Programming, 162 (1). pp. 115-144. ISSN 0025-5610

Anthony, Martin ORCID: 0000-0002-7796-6044, Boros, Endre, Crama, Yves and Gruber, Aritanan (2013) Quadratization of symmetric pseudo-Boolean functions. RUTCOR Research Reports (RRR 12-2013). Rutgers University, Rutgers Center for Operations Research, New Jersey, USA.

Anthony, Martin ORCID: 0000-0002-7796-6044, Boros, Endre, Crama, Yves and Gruber, Aritanan (2016) Quadratization of symmetric pseudo-Boolean functions. Discrete Applied Mathematics, 203. pp. 1-12. ISSN 0166-218X

Anthony, Martin ORCID: 0000-0002-7796-6044, Hammer, P. L., Subasi, E. and Subasi, M. (2005) Using a similarity measure for credible classification. CDAM research report series (CDAM-LSE-2005-22). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Anthony, Martin ORCID: 0000-0002-7796-6044 and Hammer, Peter L. (2004) A Boolean measure of similarity. RUTCOR research reports (27-2004). Rutgers Center for Operations Research, Rutgers University, New Jersey, USA.

Anthony, Martin ORCID: 0000-0002-7796-6044 and Hammer, Peter Ladislaw (2006) A Boolean measure of similarity. Discrete Applied Mathematics, 154 (16). pp. 2242-2246. ISSN 0166-218X

Anthony, Martin ORCID: 0000-0002-7796-6044 and Harvey, M (2006) Advanced linear algebra. University of London Press, London, UK. ISBN 0387978372

Anthony, Martin ORCID: 0000-0002-7796-6044 and Harvey, Michele (2011) Algebra. International Programmes. University of London.

Anthony, Martin ORCID: 0000-0002-7796-6044 and Harvey, Michele (2012) Further linear algebra. International Programmes. University of London.

Anthony, Martin ORCID: 0000-0002-7796-6044 and Harvey, Michele (2012) Linear algebra: concepts and methods. Cambridge University Press, Cambridge, UK. ISBN 9780521279482

Anthony, Martin ORCID: 0000-0002-7796-6044 and Ratasaby, Joel (2012) Analysis of a multi-category classifier. Discrete Applied Mathematics, 160 (16-17). pp. 2329-2338. ISSN 0166-218X

Anthony, Martin ORCID: 0000-0002-7796-6044 and Ratsaby, Joel (2013) Large margin case-based reasoning. RUTCOR Research Reports (RRR 2-2013). Rutgers, The State University of New Jersey, Piscataway, New Jersey, USA.

Anthony, Martin ORCID: 0000-0002-7796-6044 and Ratsaby, Joel (2018) Large width nearest prototype classification on general distance spaces. Theoretical Computer Science, 738 (22). pp. 65-79. ISSN 0304-3975

Anthony, Martin ORCID: 0000-0002-7796-6044 and Ratsaby, Joel (2018) Large-width bounds for learning half-spaces on distance spaces. Discrete Applied Mathematics. ISSN 0166-218X

Anthony, Martin ORCID: 0000-0002-7796-6044 and Ratsaby, Joel (2014) Learning bounds via sample width for classifiers on finite metric spaces. Theoretical Computer Science, 529. pp. 2-10. ISSN 0304-3975

Anthony, Martin ORCID: 0000-0002-7796-6044 and Ratsaby, Joel (2012) Learning on finite metric spaces. RUTCOR research reports (RRR 19-2012). Center for Operations Research, Rutgers University, Piscataway, New Jersey.

Anthony, Martin ORCID: 0000-0002-7796-6044 and Ratsaby, Joel (2006) Maximal width learning of binary functions. CDAM research report series (CDAM-LSE-2006-11). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Anthony, Martin ORCID: 0000-0002-7796-6044 and Ratsaby, Joel (2010) Maximal width learning of binary functions. Theoretical Computer Science, 411 (1). pp. 138-147. ISSN 0304-3975

Anthony, Martin ORCID: 0000-0002-7796-6044 and Ratsaby, Joel (2013) Quantifying accuracy of learning via sample width. In: 2013 IEEE Symposium on Foundations of Computational Intelligence (FOCI). IEEE, Singapore, Singapore, pp. 84-90. ISBN 9781467359016

Anthony, Martin ORCID: 0000-0002-7796-6044 and Ratsaby, Joel (2012) Robust cutpoints in the logical analysis of numerical data. Discrete Applied Mathematics, 160 (4 - 5). pp. 355-364. ISSN 0166-218X

Anthony, Martin ORCID: 0000-0002-7796-6044 and Ratsaby, Joel (2012) Sample width for multi-category classifiers. RUTCOR Research Reports (RRR 29-2012). RUTCOR, Rutgers University, Piscataway, New Jersey, USA.

Anthony, Martin ORCID: 0000-0002-7796-6044 and Ratsaby, Joel (2012) Using boxes and proximity to classify data into several categories. RUTCOR research reports (RRR 7-2012). Center for Operations Research, Rutgers University, Piscataway, New Jersey.

Anthony, Martin ORCID: 0000-0002-7796-6044 and Ratsaby, Joel (2014) A hybrid classifier based on boxes and nearest neighbors. Discrete Applied Mathematics, 172. pp. 1-11. ISSN 0166-218X

Anthony, Martin ORCID: 0000-0002-7796-6044 and Ratsaby, Joel (2011) The performance of a new hybrid classifier based on boxes and nearest neighbors. RUTCOR research reports (RRR 17-2011). Center for Operations Research, Rutgers University, Piscataway, New Jersey.

Anthony, Martin ORCID: 0000-0002-7796-6044 and Ratsaby, Joel (2012) The performance of a new hybrid classifier based on boxes and nearest neighbors. In: International Symposium on Artificial Intelligence and Mathematics, 2012-01-09 - 2012-01-11, Fort Lauderdale FL, United States, USA. (Submitted)

Anthony, Martin ORCID: 0000-0002-7796-6044 and Ratsaby, Joel (2015) A probabilistic approach to case-based inference. Theoretical Computer Science, 589. pp. 61-75. ISSN 0304-3975

Anthropelos, Michail, Kardaras, Constantinos ORCID: 0000-0001-6903-4506 and Vichos, Georgios (2020) Effective risk aversion in thin risk-sharing markets. Mathematical Finance, 30 (4). 1565 - 1590. ISSN 0960-1627

Appa, Gautam (2000) Is my solution unique? On the uniqueness of solutions to linear programs. Operational Research working papers (LSEOR 00.33). Department of Operational Research, London School of Economics and Political Science, London, UK.

Appa, Gautam (2002) On the uniqueness of solutions to linear programs. Journal of the Operational Research Society, 53 (10). pp. 1127-1132. ISSN 0160-5682

Appa, Gautam (1994) Using primal-dual relationship in mixed integer programming. Operational Research working papers (LSEOR 94.13). Department of Operational Research, London School of Economics and Political Science, London, UK.

Appa, Gautam, Argyris, N. and Williams, H. Paul (2006) A methodology for cross-evaluation in DEA. Operational Research working papers (LSEOR 06.81). Operational Research Group, Department of Management, London School of Economics and Political Science, London, UK. ISBN 0753017032

Appa, Gautam, Euler, R., Kouvela, Anastasia, Magos, D. and Mourtos, I. (2016) On the completability of incomplete orthogonal Latin rectangles. Discrete Mathematics. ISSN 0012-365X

Appa, Gautam and Giannikos, Ioannis (1992) Using duality information from a mixed integer program to derive new and old results for the rectilinear obnoxious facility location problem. Operational Research working papers (LSEOR 92.2). Department of Operational Research, London School of Economics and Political Science, London, UK.

Appa, Gautam and Kotnyek, Balázs (2003) Optimization with binet matrices. Operational Research working papers (LSEOR 03.59). Department of Operational Research, London School of Economics and Political Science, London, UK.

Appa, Gautam and Kotnyek, Balázs (2004) Rational and integral k-regular matrices. Discrete Mathematics, 275 (1-3). pp. 1-15. ISSN 0012-365X

Appa, Gautam, Kotnyek, Balázs, Papalamprou, Konstantinos and Pitsoulis, Leonidas (2007) Optimization with binet matrices. Operations Research Letters, 35 (3). pp. 345-352. ISSN 0167-6377

Appa, Gautam, Magos, D. and Mourtos, Ioannis (2004) LP relaxations of multiple all_different predicates. Lecture Notes in Computer Science, 3011. pp. 364-369. ISSN 0302-9743

Appa, Gautam, Magos, D. and Mourtos, Ioannis (2004) An LP-based proof for the non-existence of a pair of orthogonal Latin squares for n = 6. Operations Research Letters, 32 (4). pp. 336-344. ISSN 0167-6377

Appa, Gautam, Magos, D. and Mourtos, Ioannis (2006) On multi-index assignment polytopes. Linear Algebra and Its Applications, 416 (2-3). pp. 224-241. ISSN 0024-3795

Appa, Gautam, Magos, D. and Mourtos, Ioannis (2005) On the system of two all_different predicates. Operational Research working papers (LSEOR 05.74). Department of Operational Research, London School of Economics and Political Science, London, UK. ISBN 0753016966

Appa, Gautam, Magos, D. and Mourtos, Ioannis (2004) A branch and cut algorithm for a four-index assignment problem. Journal of the Operational Research Society, 55 (3). pp. 298-307. ISSN 0160-5682

Appa, Gautam, Magos, D. and Mourtos, Ioannis (2006) A new class of facets for the Latin square polytope. Discrete Applied Mathematics, 154 (6). pp. 900-911. ISSN 0166-218X

Appa, Gautam, Magos, D., Mourtos, Ioannis and Janssen, Jeannette (2006) On the Orthogonal Latin Square polytope. Discrete Mathematics, 306 (2). pp. 171-187. ISSN 0012-365X

Appa, Gautam, Magos, D., Mourtos, Ioannis and Pitsulis, L. (2006) Modelling for feasibility - the case of mutually orthogonal Latin squares problem. In: Appa, Gautam, Pitsoulis, Leonidas and Williams, H. Paul, (eds.) Handbook on Modelling for Discrete Optimization. International series in operations research & management science (88). Springer Berlin / Heidelberg, New York, US, pp. 103-128. ISBN 0387329412

Appa, Gautam, Mourtos, Ioannis and Magos, D. (2002) Integrating constraint and integer programming for the orthogonal Latin squares problem. Operational Research working papers (LSEOR 01.47). Department of Operational Research, London School of Economics and Political Science, London, UK.

Appa, Gautam, Mourtos, Ioannis and Magos, D. (2002) An LP-based proof of the non-existence of a pair of Orthogonal Latin Squares for n = 6. Operational Research working papers (LSEOR 02.51). Department of Operational Research, London School of Economics and Political Science, London, UK.

Appa, Gautam and Williams, H. Paul (2002) A formula for the solution of DEA models. Operational Research working papers (LSEOR 02.49). Department of Operational Research, London School of Economics and Political Science, London, UK.

Appa, Gautam and Williams, H. Paul (2006) A new framework for the solution of DEA models. European Journal of Operational Research, 172 (2). pp. 604-615. ISSN 0377-2217

Appa, Gautam and Yue, M. (2000) A reply to Zhu: how useful or accurate is this alternative? Journal of the Operational Research Society, 51 (3). p. 379. ISSN 0160-5682

Appa, Gautam and Yue, Ming (1996) On measuring scale efficiency and setting scale efficient targets in DEA. Operational Research working papers (LSEOR 96.22/2). Department of Operational Research, London School of Economics and Political Science, London, UK.

Aranda, Andrés, Bradley-Williams, David, Hng, Eng Keat, Hubička, Jan, Karamanlis, Miltiadis, Kompatscher, Michael, Konečný, Matěj and Pawliuk, Micheal (2021) Completing graphs to metric spaces. Contributions to Discrete Mathematics, 16 (2). 71 - 89. ISSN 1715-0868

Arieli, Itai and Young, H. Peyton (2016) Stochastic learning dynamics and speed of convergence in population games. Econometrica, 84 (2). pp. 627-676. ISSN 0012-9682

Arratia, Richard, Bollobás, Béla, Coppersmith, Don and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2000) Euler circuits and DNA sequencing by hybridization. Discrete Applied Mathematics, 104 (1-3). pp. 63-96. ISSN 0166-218X

Arratia, Richard, Bollobás, Béla and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2004) The interlace polynomial of a graph. Journal of Combinatorial Theory, Series B, 92 (2). pp. 199-233. ISSN 0095-8956

Arratia, Richard, Bollobás, Béla and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2004) A two-variable interlace polynomial. Combinatorica, 24 (2). pp. 567-584. ISSN 0209-9683

Ashkenazi-Golan, Galit ORCID: 0000-0003-3896-4131, Flesch, János, Predtetchinski, Arkadi and Solan, Eilon (2022) Existence of equilibria in repeated games with long-run payoffs. Proceedings of the National Academy of Sciences of the United States of America, 119 (11). ISSN 1091-6490

Ashkenazi-Golan, Galit ORCID: 0000-0003-3896-4131, Flesch, János, Predtetchinski, Arkadi and Solan, Eilon (2024) Regularity of the minmax value and equilibria in multiplayer Blackwell games. Israel Journal of Mathematics. ISSN 0021-2172

Ashkenazi-Golan, Galit ORCID: 0000-0003-3896-4131, Hernández, Penélope, Neeman, Zvika and Solan, Eilon (2023) Markovian persuasion with two states. Games and Economic Behavior, 142. 292 - 314. ISSN 0899-8256

Ashkenazi-Golan, Galit ORCID: 0000-0003-3896-4131, Krasikov, Ilia, Rainer, Catherine and Solan, Eilon (2022) Absorption paths and equilibria in quitting games. Mathematical Programming. ISSN 0025-5610

Ashkenazi-Golan, Galit ORCID: 0000-0003-3896-4131, Tsodikovich, Yevgeny and Viossat, Yannick (2023) I want to tell you? Maximizing revenue in first-price two-stage auctions. Economic Theory, 76 (4). 1329 - 1362. ISSN 0938-2259

Aste, Tomaso and Di Matteo, T. (2017) Sparse causality network retrieval from short time series. Complexity, 2017 (4518429). ISSN 1076-2787

Atherton, Mark A., Bates, Ronald A. and Wynn, Henry P. ORCID: 0000-0002-6448-1080 (2014) Dimensional analysis using toric ideals: primitive invariants. PLOS ONE, 9 (12). e112827. ISSN 1932-6203

Atkinson, Anthony (1999) Bayesian and other biased-coin designs for sequential clinical trials. Tatra Mountains Mathematical Publications, 17. pp. 403-421. ISSN 1210-3195

Atkinson, Anthony (1999) Optimum biased-coin designs for sequential treatment allocation with covariate information. Statistics in Medicine, 18 (14). pp. 1741-1752. ISSN 0277-6715

Atkinson, Anthony and Pedrosa, David (2017) Optimum design and sequential treatment allocation in an experiment in deep brain stimulation with sets of treatment combinations. Statistics in Medicine, 36 (30). pp. 4804-4815. ISSN 0277-6715

Atkinson, Anthony C. (2012) Bias and loss: the two sides of a biased coin. Statistics in Medicine, Online. ISSN 0277-6715

Atkinson, Anthony C. (2009) Commentary on 'Designs for dose-escalation trials with quantitative responses'. Statistics in Medicine, 28 (30). pp. 3739-3741. ISSN 0277-6715

Atkinson, Anthony C. and Bogacka, Barbara (2014) Optimum designs for the equality of parameters in enzyme inhibition kinetic models. Journal of Statistical Planning and Inference, 144 (1). pp. 47-54. ISSN 0378-3758

Atkinson, Anthony C. and Bogacka, Barbara (2015) A conversation with Professor Tadeusz Caliński. Statistical Science, 30 (3). pp. 423-442. ISSN 0883-4237

Atkinson, Anthony C. and Cheng, T.-C. (1999) Computing least trimmed squares regression with the forward search. Statistics and Computing, 9 (4). pp. 251-263. ISSN 0960-3174

Atkinson, Anthony C., Riani, Marco and Cerioli, Andrea (2010) Reply to discussion of “the forward search: theory and data analysis”. Journal of the Korean Statistical Society, 39 (2). pp. 161-163. ISSN 1226-3192

Atkinson, Anthony C., Riani, Marco and Cerioli, Andrea (2010) The forward search: theory and data analysis. Journal of the Korean Statistical Society, 39 (2). pp. 117-134. ISSN 1226-3192

Atkinson, Anthony C. and Zocchi, S. S. (1999) Optimum experimental designs for multinomial logistic models. Biometrics, 55 (2). pp. 437-444. ISSN 0006-341X

Avis, David, Rosenberg, Gabriel D., Savani, Rahul and von Stengel, Bernhard ORCID: 0000-0002-3488-8322 (2010) Enumeration of Nash equilibria for two-player games. Economic Theory, 42 (1). pp. 9-37. ISSN 0938-2259

Azadkia, Mona ORCID: 0000-0001-5480-8791 and Balabdaoui, Fadoua (2024) Linear regression with unmatched data: a deconvolution perspective. Journal of Machine Learning Research, 25. ISSN 1532-4435

Azevedo, Eduardo M. and Gottlieb, Daniel ORCID: 0000-0002-0555-6185 (2017) Perfect competition in markets with adverse selection. Econometrica, 85 (1). 67 - 105. ISSN 0012-9682

Azevedo, Eduardo M. and Gottlieb, Daniel ORCID: 0000-0002-0555-6185 (2019) An example of non-existence of Riley equilibrium in markets with adverse selection. Games and Economic Behavior, 116. 152 - 157. ISSN 0899-8256

B

Babichenko, Yakov, Peres, Yuval, Peretz, Ron, Sousi, Perla and Winkler, Peter (2012) Hunter, Cauchy Rabbit, and optimal Kakeya sets. . arXiv.

Backhouse, James (2006) Interoperability of identity and identity management systems. Datenschutz und Datensicherheit. ISSN 1614-0702

Balcan, Maria-Florina, Bansal, Nikhil, Beygelzimer, Alina, Coppersmith, Don, Langford, John and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2008) Robust reductions from ranking to classification. Machine Learning, 72 (1-2). pp. 139-153. ISSN 0885-6125

Baldwin, Elizabeth (2008) A GIT construction of moduli spaces of stable maps in positive characteristic. Journal of the London Mathematical Society, 78 (1). pp. 107-124. ISSN 0024-6107

Baldwin, Elizabeth and Klemperer, Paul (2016) Understanding preferences: "demand types", and the existence of equilibrium with indivisibilities. . London School of Economics and Political Science, London, UK.

Baldwin, Elizabeth and Swinarski, David (2008) A geometric invariant theory construction of moduli spaces of stable maps. International Mathematics Research Papers, 2008. ISSN 1687-3017

Balko, Martin, Por, Attila, Scheucher, Manfred, Swanepoel, Konrad ORCID: 0000-0002-1668-887X and Valtr, Pavel (2020) Almost-equidistant sets. Graphs and Combinatorics, 36 (3). 729 - 754. ISSN 0911-0119

Ball, J. A., Mikkola, K. M. and Sasane, Amol ORCID: 0000-0001-5566-9877 (2003) State-space formulas for the Nehari-Takagi problem for nonexponentially stable infinite-dimensional systems. Report (32). Institut Mittag-Leffler, The Royal Swedish Academy of Sciences, Djursholm, Sweden.

Ball, J. A. and Sasane, Amol J. ORCID: 0000-0001-5566-9877 (2012) Extension of the ν-metric. Complex Analysis and Operator Theory, 6 (1). pp. 65-89. ISSN 1661-8254

Ball, J. A. and Sasane, Amol J. ORCID: 0000-0001-5566-9877 (2006) Hautus tests for the controllability and observability of multidimensional systems. In: 17th International Symposium on Mathematical Theory of Networks and Systems, 2006-07-24 - 2006-07-28, Kyoto, Japan, JPN. (Submitted)

Ball, Joseph and Sasane, Amol J. ORCID: 0000-0001-5566-9877 (2004) Equivalence of a behavioral distance and the gap metric. CDAM research report series (LSE-CDAM-2004-17). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Ball, Joseph A., Mikkola, Kalle M. and Sasane, Amol ORCID: 0000-0001-5566-9877 (2005) State-space formulas for the Nehari-Takagi problem for nonexponentially stable infinite-dimensional systems. SIAM Journal on Control and Optimization, 44 (2). pp. 531-563. ISSN 0363-0129

Balogh, József, Clemen, Felix Cristian, Skokan, Jozef ORCID: 0000-0003-3996-7676 and Wgner, Adam Zsolt (2020) The Ramsey number of Fano plane versus tight path. Electronic Journal of Combinatorics, 27 (1). ISSN 1077-8926

Balogh, József, Mousset, Frank and Skokan, Jozef ORCID: 0000-0003-3996-7676 (2017) Stability for vertex cycle covers. Electronic Journal of Combinatorics, 24 (3). ISSN 1077-8926

Balogh, József, Narayanan, Bhargav and Skokan, Jozef ORCID: 0000-0003-3996-7676 (2019) The number of hypergraphs without linear cycles. Journal of Combinatorial Theory, Series B, 134. pp. 309-321. ISSN 0095-8956

Baltagi, Badi, Hidalgo, Javier and Li, Qi (1996) A nonparametric test for poolability using panel data. Journal of Econometrics, 75 (2). pp. 345-367. ISSN 0304-4076

Baltagi, Badi H., Fingleton, Bernard and Pirotte, Alain (2011) Estimating and forecasting with a dynamic spatial panel data model. SERC Discussion Papers (SERCDP095). Spatial Economics Research Centre, London School of Economics and Political Science, London, UK.

Bana e Costa, Carlos A. and Vansnick, Jean-Claude (2001) A critical analysis of the eigenvalue method used to derive priorities in AHP. Operational Research working papers (LSEOR 01.42). Department of Operational Research, London School of Economics and Political Science, London, UK.

Bana e Costa, Carlos A., de Corte, Jean-Marie and Vansnick, Jean-Claude (2003) MACBETH. Operational Research working papers (LSEOR 03.56). Department of Operational Research, London School of Economics and Political Science, London, UK. ISBN 075301520X

Bana e Costa, Carlos A., de Corte, Jean-Marie and Vansnick, Jean-Claude (2004) On the mathematical foundations of MACBETH. Operational Research working papers (LSEOR 04.61). Department of Operational Research, London School of Economics and Political Science, London, UK. ISBN 0753015250

Bansal, Ishan, Cheriyan, Joe, Grout, Logan and Ibrahimpur, Sharat (2023) Algorithms for 2-connected network design and flexible Steiner trees with a constant number of terminals. In: Megow, Nicole and Smith, Adam, (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023. Leibniz International Proceedings in Informatics, LIPIcs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. ISBN 9783959772969

Bansal, Ishan, Cheriyan, Joseph, Grout, Logan and Ibrahimpur, Sharat (2023) Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions. In: Etessami, Kousha, Feige, Uriel and Puppis, Gabriele, (eds.) 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023. Leibniz International Proceedings in Informatics, LIPIcs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. ISBN 9783959772785

Bansal, Ishan, Cheriyan, Joseph, Grout, Logan and Ibrahimpur, Sharat (2024) Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions. Algorithmica, 86 (8). 2575 - 2604. ISSN 0178-4617

Baranowski, Rafal, Chen, Yining ORCID: 0000-0003-1697-1920 and Fryzlewicz, Piotr ORCID: 0000-0002-9676-902X (2019) Narrowest-over-threshold detection of multiple change points and change-point-like features. Journal of the Royal Statistical Society. Series B: Statistical Methodology, 81 (3). 649 - 672. ISSN 1369-7412

Barbour, A. D. and Luczak, Malwina J. (2006) Laws of large numbers for epidemic models with countably many types. CDAM research report (LSE-CDAM-2006-14). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Barbour, A. D. and Luczak, Malwina J. (2008) Laws of large numbers for epidemic models with countably many types. Annals of Applied Probability, 18 (6). pp. 2208-2238. ISSN 1050-5164

Barbour, A.D., Brightwell, Graham and Luczak, Malwina J. (2022) Long-term concentration of measure and cut-off. Stochastic Processes and Their Applications, 152. 378 - 423. ISSN 0304-4149

Bardoscia, Marco, Battiston, Stefano, Caccioli, Fabio and Caldarelli, Guido (2017) Pathways towards instability in financial networks. Nature Communications, 8 (14416). ISSN 2041-1723

Barigozzi, Matteo, Brownlees, Christian and Lugosi, Gabor (2018) On the consequences of power-law behavior in partial correlation network models. Electronic Journal of Statistics, 12 (2). pp. 2905-2929. ISSN 1935-7524

Barigozzi, Matteo and Hallin, Marc (2017) Generalized dynamic factor models and volatilities estimation and forecasting. Journal of Econometrics, 201 (2). pp. 307-321. ISSN 0304-4076

Barker, Matt, Degond, Pierre, Martin, Ralf and Muûls, Mirabelle (2023) A mean field game model of firm-level innovation. Mathematical Models and Methods in Applied Sciences, 33 (5). 929 - 970. ISSN 0218-2025

Barmapalias, George, Fang, Nan and Lewis-Pye, Andrew (2020) Monotonous betting strategies in warped casinos. Information and Computation, 271. ISSN 0890-5401

Barmapalias, George, Lewis-Pye, Andrew and Meng Ng, Keng (2010) The importance of π⁰₁ classes in effective randomness. Journal of Symbolic Logic, 75 (1). pp. 387-400. ISSN 0022-4812

Barmpalias, G., Hölzl, R., Lewis-Pye, Andrew and Merkle, W. (2013) Analogues of Chaitinʼs Omega in the computably enumerable sets. Information Processing Letters, 113 (5-6). pp. 171-178. ISSN 0020-0190

Barmpalias, George, Day, Adam R. and Lewis-Pye, Andrew (2014) The typical Turing degree. Proceedings of the London Mathematical Society, 109 (1). pp. 1-39. ISSN 0024-6115

Barmpalias, George, Elwes, Richard and Lewis-Pye, Andrew (2018) Digital morphogenesis via Schelling segregation. Nonlinearity, 31 (4). 1593 - 1638. ISSN 0951-7715

Barmpalias, George, Elwes, Richard and Lewis-Pye, Andrew (2015) Tipping points in 1-dimensional Schelling models with switching agents. Journal of Statistical Physics, 158 (4). pp. 806-852. ISSN 0022-4715

Barmpalias, George, Elwes, Richard and Lewis-Pye, Andrew (2016) Unperturbed Schelling segregation in two or three dimensions. Journal of Statistical Physics, 164 (6). pp. 1460-1487. ISSN 0022-4715

Barmpalias, George, Fang, Nan and Lewis-Pye, Andrew (2016) Optimal asymptotic bounds on the oracle use in computations from Chaitin’s Omega. Journal of Computer and System Sciences, 82 (8). pp. 1283-1299. ISSN 0022-0000

Barmpalias, George, Huang, Neng, Lewis-Pye, Andrew, Li, Angsheng, Li, Xuechen, Pan, Yicheng and Roughgarden, Tim (2019) The idemetric property: when most distances are (almost) the same. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 475 (2222). ISSN 1364-5021

Barmpalias, George and Lewis-Pye, Andrew (2011) Chaitin's halting probability and the compression of strings using oracles. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 467 (2134). pp. 2912-2926. ISSN 1364-5021

Barmpalias, George and Lewis-Pye, Andrew (2019) Compression of data streams down to their information content. IEEE Transactions on Information Theory, 65 (7). pp. 4471-4485. ISSN 0018-9448

Barmpalias, George and Lewis-Pye, Andrew (2017) Differences of halting probabilities. Journal of Computer and System Sciences, 89. pp. 349-360. ISSN 0022-0000

Barmpalias, George and Lewis-Pye, Andrew (2017) Limits of the Kucera-Gacs coding method. In: Post-proceedings volume of SEALS 2016 (South Eastern Logic Symposium). World Scientific (Firm).

Barmpalias, George and Lewis-Pye, Andrew (2012) Measure and cupping in the Turing degrees. Proceedings of the American Mathematical Society, 140 (10). pp. 3607-3622. ISSN 0002-9939

Barmpalias, George and Lewis-Pye, Andrew (2017) Optimal redundancy in computations from random oracles. Journal of Computer and System Sciences. ISSN 0022-0000

Barmpalias, George and Lewis-Pye, Andrew (2006) A c.e. real that cannot be sw-computed by any Ω number. Notre Dame Journal of Formal Logic, 47 (2). pp. 197-209. ISSN 0029-4527

Barmpalias, George and Lewis-Pye, Andrew (2006) The hypersimple-free c.e. wtt degrees are dense in the c.e. wtt degrees. Notre Dame Journal of Formal Logic, 47 (3). pp. 361-370. ISSN 0029-4527

Barmpalias, George and Lewis-Pye, Andrew (2006) The ibT degrees of computably enumerable sets are not dense. Annals of Pure and Applied Logic, 141 (1-2). pp. 51-60. ISSN 0168-0072

Barmpalias, George and Lewis-Pye, Andrew (2015) The information content of typical reals. In: Sommaruga, Giovanni and Strahm, Thomas, (eds.) Turing’s revolution: the impact of his ideas about computability. Springer Berlin / Heidelberg, pp. 207-224. ISBN 9783319221557

Barmpalias, George, Lewis-Pye, Andrew and Li, Angsheng (2018) Pointed computations and Martin-Löf randomnesss. Computability, 7 (2-3). pp. 171-177. ISSN 2211-3568

Barmpalias, George, Lewis-Pye, Andrew and Soskova, Mariya (2008) Randomness, lowness and degrees. Journal of Symbolic Logic, 73 (2). pp. 559-577. ISSN 0022-4812

Barmpalias, George, Lewis-Pye, Andrew and Soskova, Mariya (2007) Working with the LR degrees. In: Cai, Jin-Yi, Cooper, S. Barry and Zhu, Hong, (eds.) Theory and Applications of Models of Computation: 4th International Conference, Tamc 2007, Shanghai, China, May 22-25, 2007. Lecture notes in computer science (4484). Springer Berlin / Heidelberg, Berlin, pp. 89-99. ISBN 9783540725039

Barmpalias, George, Lewis-Pye, Andrew and Stephan, Frank (2008) Π10 classes, LR degrees and Turing degrees. Annals of Pure and Applied Logic, 156 (1). pp. 21-38. ISSN 0168-0072

Barmpalias, George, Lewis-Pye, Andrew and Teutsch, Jason (2016) Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers. Information and Computation, 251. pp. 287-300. ISSN 0890-5401

Barnett, Tony ORCID: 0000-0001-9399-9607 (2012) Wise use of mathematical models in policy. LSE Health and Social Care (29 May 2012). Website.

Barrieu, Pauline ORCID: 0000-0001-9473-263X, Bellamy, Nadine and Sahut, Jean-Michel (2012) Assessing the costs of protection in a context of switching stochastic regimes. Applied Mathematical Finance, 19 (6). pp. 495-511. ISSN 1350-486X

Barrieu, Pauline ORCID: 0000-0001-9473-263X, Bellamy, Nadine and Sinclair-Desgagné, Bernard (2017) Assessing contaminated land cleanup costs and strategies. Applied Mathematical Modelling, 42. pp. 478-492. ISSN 0307-904X

Barrieu, Pauline ORCID: 0000-0001-9473-263X and El Karoui, Nicole (2013) Monotone stability of quadratic semimartingales with applications to general quadratic BSDEs. Annals of Probability, 41 (3B). pp. 1831-1863. ISSN 0091-1798

Barrieu, Pauline ORCID: 0000-0001-9473-263X and El Karoui, Nicole (2004) Optimal derivatives design under dynamic risk measures. In: Yin, George and Zhang, Qing, (eds.) Mathematics of Finance. Contemporary mathematics (351). American Mathematical Society, Providence, USA, pp. 13-26. ISBN 9780821834121

Barrieu, Pauline ORCID: 0000-0001-9473-263X and El Karoui, Nicole (2002) Optimal design of derivatives in illiquid markets. Quantitative Finance, 2 (3). pp. 181-188. ISSN 1469-7688

Barrieu, Pauline ORCID: 0000-0001-9473-263X and El Karoui, Nicole (2002) Optimal design of weather derivatives. Algo research quarterly, 5. pp. 79-92. ISSN 1488-0539

Barrieu, Pauline ORCID: 0000-0001-9473-263X and El Karoui, Nicole (2004) Optimal risk transfer. Finance, 25. pp. 31-47. ISSN 0752-6180

Barrieu, Pauline ORCID: 0000-0001-9473-263X and Scaillet, Olivier (2010) A primer on weather derivatives. In: Filar, Jerzy A. and Haurie, Alain, (eds.) Uncertainty and Environmental Decision Making: a Handbook of Research and Best Practice. International series in operations research & management science (138). Springer Berlin / Heidelberg, pp. 155-176. ISBN 9781441911285

Barrieu, Pauline ORCID: 0000-0001-9473-263X and Schoutens, Wim (2006) Iterates of the infinitesimal generator and space-time harmonic polynomials of a Markov process. Journal of Computational and Applied Mathematics, 186 (1). pp. 300-323. ISSN 0377-0427

Barrow-Green, June (2023) Augustus Love. In: Hollings, Christopher and McCartney, Mark, (eds.) Oxford's Sedleian Professors of Natural Philosophy: The First 400 Years. Oxford University Press, Oxford, UK, 141 - 156. ISBN 9780192843210

Baston, V. J. D., Rahmouni, M. K. and Williams, H. Paul (1991) The practical conversion of linear programmes to network flow models. European Journal of Operational Research, 50 (3). pp. 325-334. ISSN 0377-2217

Basu, Amitabh, Conforti, Michele, Cornuéjols, Gérard and Zambelli, Giacomo (2010) Maximal lattice-free convex sets in linear subspaces. Mathematics of Operations Research, 35 (3). pp. 704-720. ISSN 0364-765X

Basu, Amitabh, Conforti, Michele, Cornuéjols, Gérard and Zambelli, Giacomo (2010) Minimal inequalities for an infinite relaxation of integer programs. SIAM Journal on Discrete Mathematics, 24 (1). pp. 158-168. ISSN 0895-4801

Basu, Amitabh, Conforti, Michele, Cornuéjols, Gérard and Zambelli, Giacomo (2010) A counterexample to a conjecture of Gomory and Johnson. Mathematical Programming. ISSN 0025-5610

Basu, Amitabh, Conforti, Michele, Di Summa, Marco and Zambelli, Giacomo (2019) Optimal cutting planes from the group relaxations. Mathematics of Operations Research, 44 (4). pp. 1208-1220. ISSN 0364-765X

Basu, Amitabh, Cornuéjols, Gérard and Zambelli, Giacomo (2011) Convex Sets and Minimal Sublinear Functions. Journal of Convex Analysis, 18 (2). pp. 427-432. ISSN 0944-6532

Bates, R. A., Wynn, H. P. ORCID: 0000-0002-6448-1080 and Fraga, E. S. (2007) Feasible region approximation: a comparison of search cone and convex hull methods. Engineering Optimization, 39 (5). pp. 513-527. ISSN 0305-215X

Bates, R. A. and Wynn, Henry P. ORCID: 0000-0002-6448-1080 (2004) Modelling feasible design regions using lattice-based kernel methods. Quality and Reliability Engineering International, 20 (2). pp. 135-142. ISSN 0748-8017

Bates, Ron A., Giglio, Beatrice and Wynn, Henry P. ORCID: 0000-0002-6448-1080 (2003) A global selection procedure for polynomial interpolators. Technometrics, 45 (3). pp. 246-255. ISSN 0040-1706

Bathia, Neil, Yao, Qiwei ORCID: 0000-0003-2065-8486 and Ziegelmann, Flavio (2010) Identifying the finite dimensionality of curve time series. Annals of Statistics, 38 (6). pp. 3352-3386. ISSN 0090-5364

Battistin, Erich and Chesher, Andrew (2014) Treatment effect estimation with covariate measurement error. Journal of Econometrics, 178 (2). pp. 707-715. ISSN 0304-4076

Batu, Tugkan ORCID: 0000-0003-3914-4645, Berenbrink, Petra and Cooper, Colin (2010) Chains-into-bins processes. . arXiv.org.

Batu, Tugkan ORCID: 0000-0003-3914-4645, Berenbrink, Petra and Cooper, Colin (2012) Chains-into-bins processes. Journal of Discrete Algorithms, 14. pp. 21-28. ISSN 1570-8667

Batu, Tugkan ORCID: 0000-0003-3914-4645, Berenbrink, Petra and Cooper, Colin (2011) Chains-into-bins processes. In: Iliopoulos, Costas S. and Smyth, William F., (eds.) Combinatorial Algorithms. Lecture notes in computer science (6460). Springer Berlin / Heidelberg, pp. 314-325. ISBN 9783642192210

Batu, Tugkan ORCID: 0000-0003-3914-4645, Berenbrink, Petra and Sohler, Christian (2007) A sublinear-time approximation scheme for bin packing. CDAM Research Reports (LSE-CDAM-2007-33). London School of Economics and Political Science, London, UK.

Batu, Tugkan ORCID: 0000-0003-3914-4645 and Cenk Sahinalp, Suhleyman (2005) Locally consistent parsing and applications to approximate string comparisons. In: De Felice, Clelia and Restivo, Antonio, (eds.) Developments in Language Theory, 9th International Conference, Dlt 2005. Lecture notes in computer science 3572. Springer Berlin / Heidelberg, Berlin, pp. 22-35. ISBN 3540265465

Batu, Tugkan ORCID: 0000-0003-3914-4645, Dasgupta, Sanjoy, Kumar, Ravi and Rubinfeld, Ronitt (2002) The complexity of approximating entropy. In: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing - Stoc '02. ACM Press, New York, USA, pp. 678-687. ISBN 1581134959

Batu, Tugkan ORCID: 0000-0003-3914-4645, Ergun, Funda and Cenk, Sahinalp (2006) Oblivious string embeddings and edit distance approximations. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm. ACM Press, New York, US, pp. 792-801. ISBN 9780898716054

Batu, Tugkan ORCID: 0000-0003-3914-4645, Ergun, Funda, Kilian, Joe, Magen, Avner, Raskhodnikova, Sofya, Rubinfeld, Robin and Sami, Rahul (2003) A sublinear algorithm for weakly approximating edit distance. In: 35th ACM Symposium on Theory of Computing (STOC), 2003-06-09 - 2003-06-11, California, United States, USA. (Submitted)

Batu, Tugkan ORCID: 0000-0003-3914-4645, Fischer, E., Fortnow, L., Kumar, R., Rubinfeld, R. and White, P. (2001) Testing random variables for independence and identity. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (Focs). Foundations of Computer Science. IEEE, New York, USA, pp. 442-451.

Batu, Tugkan ORCID: 0000-0003-3914-4645, Fortnow, L., Rubinfeld, R., Smith, W. D. and White, P. (2000) Testing that distributions are close. In: Proceedings 41st Annual Symposium on Foundations of Computer Science. IEEE, New York, USA, pp. 259-269.

Batu, Tugkan ORCID: 0000-0003-3914-4645, Fortnow, Lance, Rubinfeld, Ronitt, Smith, Warren D. and White, Patrick (2010) Testing closeness of discrete distributions. . arXiv.org.

Batu, Tugkan ORCID: 0000-0003-3914-4645, Fortnow, Lance, Rubinfeld, Ronitt, Smith, Warren D. and White, Patrick (2013) Testing closeness of discrete distributions. Journal of the ACM, 60 (1). ISSN 0004-5411

Batu, Tugkan ORCID: 0000-0003-3914-4645, Guha, Sudipto and Kannan, Sampath (2004) Inferring mixtures of Markov chains. Lecture Notes in Computer Science. , 3120/2 Springer Berlin / Heidelberg. ISBN 9783540222828

Batu, Tugkan ORCID: 0000-0003-3914-4645, Kannan, Sampath, Khanna, Sanjeev and McGregor, Andrew (2004) Reconstructing strings from random traces. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004-01-11 - 2004-01-13, New Orleans, United States, USA.

Batu, Tugkan ORCID: 0000-0003-3914-4645, Kumar, Ravi and Rubinfeld, Ronitt (2004) Sublinear algorithms for testing monotone and unimodal distributions. In: 36th ACM Symposium on Theory of Computing (STOC), 2004-06-13 - 2004-06-15, IL., United States, USA.

Batu, Tugkan ORCID: 0000-0003-3914-4645, Rubinfeld, Ronitt and White, Patrick (1999) Fast approximate PCPs for multidimensional bin-packing problem. Lecture Notes in Computer Science, 1671. pp. 245-256. ISSN 0302-9743

Batu, Tugkan ORCID: 0000-0003-3914-4645 and Taptagaporn, Pongphat (2016) Competitive portfolio selection using stochastic predictions. In: Lecture Notes in Artificial Intelligence. Lecture Notes in Computer Science. Springer Berlin / Heidelberg, Cham, Switzerland, pp. 288-302. ISBN 9783319463797

Batu, Tugkan ORCID: 0000-0003-3914-4645, Trehan, Amitabh and Trehan, Chhaya ORCID: 0000-0002-3249-3212 (2024) All you need are random walks: fast and simple distributed conductance testing. In: Emek, Yuval, (ed.) Structural Information and Communication Complexity: 31st International Colloquium, SIROCCO 2024, Vietri sul Mare, Italy, May 27–29, 2024, Proceedings. Lecture Notes in Computer Science. Springer, Cham, CH, 64 - 82. ISBN 9783031606021

Bauer, D., Broersma, H. J., van den Heuvel, J. ORCID: 0000-0003-0897-9148, Kahl, N. and Schmeichel, E. (2009) Degree sequences and the existence of k-factors. . arXiv.

Bauer, D., Broersma, H. J., van den Heuvel, J. ORCID: 0000-0003-0897-9148, Kahl, N. and Schmeichel, E. (2013) Toughness and vertex degrees. Journal of Graph Theory, 72 (2). pp. 209-219. ISSN 0364-9024

Bauer, D., Broersma, H. J., van den Heuvel, Jan ORCID: 0000-0003-0897-9148, Kahl, N., Nevo, A., Schmeichel, E., Woodall, D. R. and Yatauro, M. (2014) Best monotone degree conditions for graph properties: a survey. Graphs and Combinatorics, 31 (1). ISSN 0911-0119

Bauer, D., Broersma, H. J., van den Heuvel, Jan ORCID: 0000-0003-0897-9148, Kahl, N. and Schmeichel, E. (2012) Degree sequences and the existence of k-Factors. Graphs and Combinatorics, 28 (2). pp. 149-166. ISSN 0911-0119

Bauerle, N. and Veraart, Luitgard A. M. ORCID: 0000-0003-1183-2227 (2011) Einblicke in die Finanzmathematik: Optionsbewertung und Portfolio-Optimierung. In: Wendland, Katrin and Werner, Annette, (eds.) Facettenreiche Mathematik: Einblicke in Die Moderne Mathematische Forschung Für Alle, Die Mehr Von Mathematik Verstehen Wollen. Vieweg & Teubner. ISBN 9783834814142

Baurdoux, Erik J. ORCID: 0000-0002-5407-0683 (2007) Examples of optimal stopping via measure transformation for processes with one-sided jumps. Stochastics: an International Journal of Probability and Stochastic Processes, 79 (3). pp. 303-307. ISSN 1744-2508

Baurdoux, Erik J. ORCID: 0000-0002-5407-0683 (2007) Fluctuation theory and stochastic games for spectrally negative Lévy processes. Doctoral thesis, Utrecht University.

Baurdoux, Erik J. ORCID: 0000-0002-5407-0683 (2009) Last exit before an exponential time for spectrally negative Lévy processes. Journal of Applied Probability, 46 (2). pp. 542-588. ISSN 0021-9002

Baurdoux, Erik J. ORCID: 0000-0002-5407-0683 (2009) Some excursion calculations for reflected Lévy processes. Alea: Latin American Journal of Probability and Mathematical Statistics, 6. pp. 149-162. ISSN 1980-0436

Baurdoux, Erik J. ORCID: 0000-0002-5407-0683 and Kyprianou, Andreas E. (2004) Further calculations for Israeli options. Stochastics and Stochastic Reports, 76 (6). pp. 546-569. ISSN 1045-1129

Baurdoux, Erik J. ORCID: 0000-0002-5407-0683 and Kyprianou, Andreas E. (2008) The McKean stochastic game driven by a spectrally negative Lévy process. Electronic Journal of Probability, 13. pp. 173-197. ISSN 1083-6489

Baurdoux, Erik J. ORCID: 0000-0002-5407-0683 and Kyprianou, Andreas E. (2009) The Shepp-Shiryaev stochastic game driven by a spectrally negative Lévy process. Theory of Probability and Its Applications, 53 (3). pp. 481-499. ISSN 0040-585X

Baurdoux, Erik J. ORCID: 0000-0002-5407-0683 and Kyprianou, Andreas E. (2008) The Shepp-Shiryaev stochastic game driven by a spectrally negative Lévy process. Teorii͡a Veroi͡atnosteĭ i Ee Primenenii͡a, 53 (3). pp. 588-609. ISSN 0040-361X

Baurdoux, Erik J. ORCID: 0000-0002-5407-0683, Kyprianou, Andreas E. and Ott, Curdin (2016) Optimal prediction for positive self-similar Markov processes. Electronic Journal of Probability, 21. ISSN 1083-6489

Baurdoux, Erik J. ORCID: 0000-0002-5407-0683, Kyprianou, Andreas E. and Pardo, J.C. (2011) The Gapeev-Kuhn stochastic game driven by a spectrally positive Levy process. Stochastic Processes and Their Applications, 121 (6). pp. 1266-1289. ISSN 0304-4149

Baurdoux, Erik J. ORCID: 0000-0002-5407-0683, Pardo, Juan Carlos, Perez, Jose Luis and Renaud, Jean-Francois (2016) Gerber–Shiu distribution at Parisian ruin for Lévy insurance risk processes. Journal of Applied Probability, 53 (2). pp. 572-584. ISSN 0021-9002

Baurdoux, Erik J. ORCID: 0000-0002-5407-0683 and Pedraza, José M. (2023) Predicting the last zero before an exponential time of a spectrally negative Lévy process. Advances in Applied Probability, 55 (2). 611 - 642. ISSN 0001-8678

Baurdoux, Erik J. ORCID: 0000-0002-5407-0683 and Schaik, Kees (2014) Predicting the time at which a Lévy process attains its ultimate supremum. Acta Applicandae Mathematicae, 134 (1). pp. 21-44. ISSN 0167-8019

Baurdoux, Erik J. ORCID: 0000-0002-5407-0683 and Van Schaik, K. (2011) Further calculations for the McKean stochastic game for a spectrally negative levy process: from a point to an interval. Journal of Applied Probability, 48 (1). pp. 200-216. ISSN 0021-9002

Bavly, Gilad and Peretz, Ron (2013) How to gamble against all odds. . London School of Economics and Political Science, London, UK.

Bayraktar, Erhan, Czichowsky, Christoph ORCID: 0000-0002-3513-6843, Dolinskyi, Leonid and Dolinsky, Yan (2021) Short communication: a note on utility maximization with proportional transaction costs and stability of optimal portfolios. SIAM Journal on Financial Mathematics, 12 (4). SC115 - SC125. ISSN 1945-497X

Bayraktar, Erhan, Kardaras, Constantinos ORCID: 0000-0001-6903-4506 and Xing, Hao (2011) Strict local martingale deflators and valuing American call-type options. Finance and Stochastics, 16 (2). pp. 275-291. ISSN 0949-2984

Bedford, David, Johnson, Matthew and Ollis, M. A. (2003) Defining sets for Latin squares given that they are based on groups. European Journal of Combinatorics, 24 (1). pp. 129-135. ISSN 0195-6698

Beeson, Coulter and Olver, Neil ORCID: 0000-0001-8897-5459 (2021) A short proof of convexity of step-out–step-in sequencing games. Operations Research Letters, 49 (2). 257 - 259. ISSN 0167-6377

Bekiros, Stelios, Soradi-Zeid, Samaneh, Mou, Jun, Yousefpour, Amin, Zambrano-Serrano, Ernesto and Jahanshahi, Hadi (2022) Laguerre wavelet approach for a two-dimensional time–space fractional Schrödinger equation. Entropy, 24 (8). ISSN 1099-4300

Bekmetjev, Airat, Brightwell, Graham, Czygrinow, Andrzej and Hurlbert, Glenn (2003) Thresholds for families of multisets, with an application to graph pebbling. Discrete Mathematics, 269 (1-3). pp. 21-34. ISSN 0012-365X

Belomestny, Denis and Gapeev, Pavel V. ORCID: 0000-0002-1346-2074 (2010) An iterative procedure for solving integral equations related to optimal stopping problems. Stochastics: an International Journal of Probability and Stochastic Processes, 82 (4). pp. 365-380. ISSN 1744-2508

Belotti, Federico, Deb, Partha, Manning, Willard G. and Norton, Edward C. (2015) twopm: two-part models. Stata Journal, 15 (1). pp. 3-20. ISSN 1536-867X

Benedetti, Giuseppe and Campi, Luciano (2012) Multivariate utility maximization with proportional transaction costs and random endowment. SIAM Journal on Control and Optimization, 50 (3). pp. 1283-1308. ISSN 0363-0129

Benevides, F. S., Łuczak, T., Scott, A., Skokan, Jozef ORCID: 0000-0003-3996-7676 and White, M. (2012) Monochromatic cycles in 2-coloured graphs. Combinatorics, Probability and Computing, 21 (1-2). pp. 57-87. ISSN 0963-5483

Benevides, Fabricio Siqueira and Skokan, Jozef ORCID: 0000-0003-3996-7676 (2009) The 3-colored Ramsey number of even cycles. Journal of Combinatorial Theory, Series B, 99 (4). pp. 690-708. ISSN 0095-8956

Bennazoli, Chiara, Campi, Luciano and Di Persio, Luca (2019) ε-Nash equilibrium in stochastic differential games with mean-field interaction and controlled jumps. Statistics and Probability Letters, 154. ISSN 0167-7152

Berg, Emily, Kim, J. K. and Skinner, Chris (2016) Imputation under informative sampling. Journal of Survey Statistics and Methodology, 4 (4). pp. 436-462. ISSN 2325-0984

Berger, James O. and Smith, Leonard A. (2019) On the statistical formalism of uncertainty quantification. Annual Review of Statistics and Its Application, 6. pp. 433-460. ISSN 2326-8298

Berger, Sören, Kohayakawa, Yoshiharu, Maesaka, Giulia Satiko, Martins, Taísa, Mendonça, Walner, Mota, Guilherme Oliveira and Parczyk, Olaf (2021) The size-Ramsey number of powers of bounded degree trees. Journal of the London Mathematical Society, 103 (4). 1314 - 1332. ISSN 0024-6107

Bergsma, Wicher ORCID: 0000-0002-2422-2359 (2020) Regression with I-priors. Econometrics and Statistics, 14. 89 - 111. ISSN 2452-3062

Bergsma, Wicher ORCID: 0000-0002-2422-2359, Croon, Marcel and van der Ark, L. Andries (2012) The empty set and zero likelihood problems in maximum empirical likelihood estimation. Electronic Journal of Statistics, 6. pp. 2356-2361. ISSN 1935-7524

Bergsma, Wicher ORCID: 0000-0002-2422-2359 and Dassios, Angelos ORCID: 0000-0002-3968-2366 (2014) A consistent test of independence based on a sign covariance related to Kendall's tau. Bernoulli, 20 (2). pp. 1006-1028. ISSN 1350-7265

Bergsma, Wicher P. ORCID: 0000-0002-2422-2359 and Rudas, Tamas (2002) Marginal models for categorical data. Annals of Statistics, 30 (1). pp. 140-159. ISSN 0090-5364

Berrington, Ann, Hu, Yongjian, Smith, Peter W. F. and Sturgis, Patrick ORCID: 0000-0003-1180-3493 (2008) A graphical chain model for reciprocal relationships between women's gender role attitudes and labour force participation. Journal of the Royal Statistical Society. Series A: Statistics in Society, 171. 89 - 108. ISSN 0964-1998

Berstein, Yael, Lee, Jon, Maruri-Aguilar, Hugo, Onn, Shmuel, Riccomagno, Eva, Weismantel, Robert and Wynn, Henry P. ORCID: 0000-0002-6448-1080 (2008) Nonlinear matroid optimization and experimental design. SIAM Journal on Discrete Mathematics, 22 (3). pp. 901-919. ISSN 0895-4801

Berstein, Yael, Maruri-Aguilar, Hugo, Onn, Shmuel, Riccomagno, Eva and Wynn, Henry ORCID: 0000-0002-6448-1080 (2010) Minimal average degree aberration and the state polytope for experimental designs. Annals of the Institute of Statistical Mathematics, 62 (4). pp. 673-698. ISSN 0020-3157

Bertschinger, Daniel, Hertrich, Christoph ORCID: 0000-0001-5646-8567, Jungeblut, Paul, Miltzow, Tillmann and Weber, Simon (2024) Training fully connected neural networks is ∃R-complete. In: Oh, A., Naumann, T., Globerson, A., Saenko, K., Hardt, M. and Levine, S., (eds.) NIPS '23: Proceedings of the 37th International Conference on Neural Information Processing Systems. Curran Associates, Inc., 36222 - 36237.

Beskos, A., Dureau, J. and Kalogeropoulos, K. ORCID: 0000-0002-0330-9105 (2015) Bayesian inference for partially observed stochastic differential equations driven by fractional Brownian motion. Biometrika, 102 (4). pp. 809-827. ISSN 0006-3444

Bhattacharyya, T. and Sasane, Amol J. ORCID: 0000-0001-5566-9877 (2011) Coherence of the real symmetric Hardy algebra. Operators and Matrices, 5 (2). pp. 303-308. ISSN 1846-3886

Biewen, Martin and Jenkins, Stephen P. ORCID: 0000-0002-8305-9774 (2006) Variance estimation for generalized entropy and Atkinson inequality indices: the complex survey data case. Oxford Bulletin of Economics and Statistics, 68 (3). pp. 371-383. ISSN 0305-9049

Biggs, Norman (1999) Chip-firing and the critical group of a graph. Journal of Algebraic Combinatorics, 9 (1). pp. 25-45. ISSN 0925-9899

Biggs, Norman (2002) Chromatic polynomials and representations of the symmetric group. Linear Algebra and Its Applications, 356 (1-3). pp. 3-26. ISSN 0024-3795

Biggs, Norman (2017) Chromatic polynomials and toroidal graphs. Australasian Journal of Combinatorics, 67 (2). pp. 235-242. ISSN 1034-4942

Biggs, Norman (2002) Chromatic polynomials for twisted bracelets. Bulletin of the London Mathematical Society, 34 (2). pp. 129-139. ISSN 0024-6093

Biggs, Norman (2005) Chromatic polynomials of some families of graphs I: theorems and conjectures. CDAM research report series (CDAM-LSE-2005-09). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Biggs, Norman (2020) Decoding chancery records from the 1240s. BSHM Bulletin: Journal of the British Society for the History of Mathematics, 36 (1). 1 - 12. ISSN 2637-5451

Biggs, Norman (2002) Discrete mathematics - second edition. Oxford University Press, Oxford, UK. ISBN 9780198507178

Biggs, Norman (2002) Equimodular curves. Discrete Mathematics, 259 (1-3). pp. 37-57. ISSN 0012-365X

Biggs, Norman (2009) Families of parameters for SRNT graphs. . arXiv.

Biggs, Norman (2018) Game, set, and graph. British Journal for the History of Mathematics. ISSN 2637-5451

Biggs, Norman (2018) John Reynolds of the Mint: a mathematician in the service of King and Commonwealth. Historia Mathematica. ISSN 0315-0860

Biggs, Norman (2020) Linear programming from Fibonacci to Farkas. Annals of Science. ISSN 0003-3790

Biggs, Norman (2009) Mathematics of currency and exchange: arithmetic at the end of the thirteenth century. BSHM: British Society for the History of Mathematics Bulletin, 24 (2). pp. 67-77. ISSN 1749-8430

Biggs, Norman (2016) Norman Biggs – Calculus on Clay? Maths@LSE Blog (15 Apr 2016). Website.

Biggs, Norman (2023) Practical algebra and hydrostatics: the legacy of Thomas Harriot. Seventeenth Century, 38 (2). 233 - 243. ISSN 0268-117X

Biggs, Norman (2003) Specht modules and chromatic polynomials. CDAM research report (LSE-CDAM-2003-06). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Biggs, Norman (2009) Strongly regular graphs with no triangles. . arXiv.

Biggs, Norman (2013) Thomas Harriot on continuous compounding. BSHM: British Society for the History of Mathematics Bulletin, 28 (2). pp. 66-74. ISSN 1749-8430

Biggs, Norman (2019) Thomas Harriot on the coinage of England. Archive for History of Exact Sciences, 73 (4). pp. 361-383. ISSN 0003-9519

Biggs, Norman (1999) The Tutte polynomial as a growth function. Journal of Algebraic Combinatorics, 10 (2). pp. 115-133. ISSN 0925-9899

Biggs, Norman (2010) Tutte polynomials of bracelets. Journal of Algebraic Combinatorics, 32 (3). pp. 389-398. ISSN 0925-9899

Biggs, Norman (2002) W. T. Tutte (obituary). The Independent. ISSN 0951-9467

Biggs, Norman (2006) The critical group from a cryptographic perspective. CDAM Research Report (LSE-CDAM 2006-07). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Biggs, Norman (2001) A matrix method for chromatic polynomials. Journal of Combinatorial Theory, Series B, 82 (1). pp. 19-29. ISSN 0095-8956

Biggs, Norman and Hutchinson, Jenny (2009) Knowles' patent yarn balance. Textile History, 40 (1). pp. 97-102. ISSN 0040-4969

Biggs, Norman, Klin, MH and Reinfeld, Philipp Augustin (2004) Algebraic methods for chromatic polynomials. European Journal of Combinatorics, 25 (2). pp. 147-160. ISSN 0195-6698

Biggs, Norman and Shrock, R. (1999) T=0 partition functions for Potts antiferromagnets on square lattice strips with (twisted) periodic boundary conditions. Journal of Physics A: Mathematical and General, 32. pp. 489-493. ISSN 0305-4470

Bingham, N. H., Jabłońska, Eliza, Jabłoński, Wojciech and Ostaszewski, Adam ORCID: 0000-0003-2630-8663 (2020) On subadditive functions bounded above on a large set. Results in Mathematics, 75 (2). ISSN 1422-6383

Bingham, N. H. and Ostaszewski, A. J. ORCID: 0000-0003-2630-8663 (2017) Additivity, subadditivity and linearity: automatic continuity and quantifier weakening. Indagationes Mathematicae, 29 (2). pp. 687-713. ISSN 0019-3577

Bingham, N. H. and Ostaszewski, A. J. ORCID: 0000-0003-2630-8663 (2010) Automatic continuity via analytic thinning. Proceedings of the American Mathematical Society, 138 (03). p. 907. ISSN 0002-9939

Bingham, N. H. and Ostaszewski, A. J. ORCID: 0000-0003-2630-8663 (2009) Automatic continuity: subadditivity, convexity, uniformity. Aequationes Mathematicae, 78 (3). pp. 257-270. ISSN 0001-9054

Bingham, N. H. and Ostaszewski, A. J. ORCID: 0000-0003-2630-8663 (2014) Beurling slow and regular variation. Transactions of the London Mathematical Society, 1 (1). 29 - 56. ISSN 2052-4986

Bingham, N. H. and Ostaszewski, A. J. ORCID: 0000-0003-2630-8663 (2010) Beyond Lebesgue and Baire II: bitopology and measure-category duality. Colloquium Mathematicum, 121 (2). pp. 225-238. ISSN 0010-1354

Bingham, N. H. and Ostaszewski, A. J. ORCID: 0000-0003-2630-8663 (2015) Cauchy’s functional equation and extensions: Goldie’s equation and inequality, the Gołąb–Schinzel equation and Beurling’s equation. Aequationes Mathematicae, 89 (5). pp. 1293-1310. ISSN 0001-9054

Bingham, N. H. and Ostaszewski, A. J. ORCID: 0000-0003-2630-8663 (2010) Dichotomy and infinite combinatorics: the theorems of Steinhaus and Ostrowski. Mathematical Proceedings of the Cambridge Philosophical Society, 150. pp. 1-22. ISSN 0305-0041

Bingham, N. H. and Ostaszewski, A. J. ORCID: 0000-0003-2630-8663 (2008) Generic subadditive functions. Proceedings of the American Mathematical Society, 136 (12). pp. 4257-4266. ISSN 0002-9939

Bingham, N. H. and Ostaszewski, A. J. ORCID: 0000-0003-2630-8663 (2011) Homotopy and the Kestelman-Borwein-Ditor theorem. Canadian Mathematical Bulletin, 54 (1). pp. 12-20. ISSN 0008-4395

Bingham, N. H. and Ostaszewski, A. J. ORCID: 0000-0003-2630-8663 (2009) Infinite combinatorics in function spaces: category methods. Publications de L’institut Mathématique, 86 (100). pp. 55-73. ISSN 0350-1302

Bingham, N. H. and Ostaszewski, A. J. ORCID: 0000-0003-2630-8663 (2010) Normed versus topological groups: dichotomy and duality. Dissertationes Mathematicae, 472. pp. 1-138. ISSN 0012-3862

Bingham, N. H. and Ostaszewski, A. J. ORCID: 0000-0003-2630-8663 (2013) The Steinhaus theorem and regular variation: de Bruijn and after. Indagationes Mathematicae, 24 (4). pp. 679-692. ISSN 0019-3577

Bingham, N. H. and Ostaszewski, Adam ORCID: 0000-0003-2630-8663 (2016) Beurling moving averages and approximate homomorphisms. Indagationes Mathematicae, 27 (3). pp. 601-633. ISSN 0019-3577

Bingham, N. H. and Ostaszewski, Adam ORCID: 0000-0003-2630-8663 (2018) Beyond Lebesgue and Baire IV: density topologies and a converse Steinhaus-Weil theorem. Topology and its Applications, 239. pp. 274-292. ISSN 0166-8641

Bingham, N. H. and Ostaszewski, Adam ORCID: 0000-0003-2630-8663 (2009) Beyond Lebesgue and Baire: generic regular variation. Colloquium Mathematicum, 116 (1). pp. 119-138. ISSN 0010-1354

Bingham, N. H. and Ostaszewski, Adam ORCID: 0000-0003-2630-8663 (2017) Category-measure duality: convexity, mid-point convexity and Berz sublinearity. Aequationes Mathematicae, 91 (5). pp. 801-836. ISSN 0001-9054

Bingham, N. H. and Ostaszewski, Adam ORCID: 0000-0003-2630-8663 (2006) Foundations of regular variation. CDAM research report (LSE-CDAM-2006-22). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Bingham, N. H. and Ostaszewski, Adam ORCID: 0000-0003-2630-8663 (2024) Homomorphisms from functional equations: The Goldie equation, II. Aequationes Mathematicae. ISSN 0001-9054

Bingham, N. H. and Ostaszewski, Adam ORCID: 0000-0003-2630-8663 (2009) Infinite combinatorics and the foundations of regular variation. Journal of Mathematical Analysis and Applications, 360 (2). pp. 518-529. ISSN 0022-247X

Bingham, N. H. and Ostaszewski, Adam ORCID: 0000-0003-2630-8663 (2010) Kingman, category and combinatorics. In: Bingham, N. H. and Goldie, C. M., (eds.) Probability and Mathematical Genetics: Papers in Honour of Sir John Kingman. London Mathematical Society lecture note series (378). Cambridge University Press, Cambridge, UK, pp. 135-169. ISBN 9780521145770

Bingham, N. H. and Ostaszewski, Adam ORCID: 0000-0003-2630-8663 (2024) Parthasarathy, shift-compactness and infinite combinatorics. Indian Journal of Pure and Applied Mathematics, 55 (3). 931 – 948. ISSN 0019-5588

Bingham, N. H. and Ostaszewski, Adam ORCID: 0000-0003-2630-8663 (2010) Regular variation without limits. Journal of Mathematical Analysis and Applications, 370 (2). pp. 322-338. ISSN 0022-247X

Bingham, N. H. and Ostaszewski, Adam ORCID: 0000-0003-2630-8663 (2020) Sequential regular variation: extensions of Kendall's Theorem. Quarterly Journal of Mathematics, 71 (4). 1171 - 1200. ISSN 0033-5606

Bingham, N. H. and Ostaszewski, Adam ORCID: 0000-0003-2630-8663 (2018) Set theory and the analyst. European Journal of Mathematics. ISSN 2199-675X

Bingham, N. H. and Ostaszewski, Adam ORCID: 0000-0003-2630-8663 (2022) The Steinhaus-Weil property: II. The Simmons-Mospan Converse. Sarajevo Journal of Mathematics, 17 (2). 179 - 186. ISSN 1840-0655

Bingham, N. H. and Ostaszewski, Adam ORCID: 0000-0003-2630-8663 (2010) Topological regular variation: I. Slow variation. Topology and its Applications, 157 (13). pp. 1999-2013. ISSN 0166-8641

Bingham, N. H. and Ostaszewski, Adam ORCID: 0000-0003-2630-8663 (2010) Topological regular variation: II. The fundamental theorems. Topology and its Applications, 157 (13). pp. 2014-2023. ISSN 0166-8641

Bingham, N. H. and Ostaszewski, Adam ORCID: 0000-0003-2630-8663 (2010) Topological regular variation: III. Regular variation. Topology and its Applications, 157 (13). pp. 2024-2037. ISSN 0166-8641

Bingham, N. H. and Ostaszewski, Adam ORCID: 0000-0003-2630-8663 (2007) Very slowly varying functions - II. CDAM Research Report Series (2007-03). London School of Economics and Political Science, London, UK.

Bingham, N. H. and Ostaszewski, Adam ORCID: 0000-0003-2630-8663 (2009) Very slowly varying functions. II. Colloquium Mathematicum, 116 (1). 105 - 117. ISSN 0010-1354

Bingham, Nick H. and Ostaszewski, Adam ORCID: 0000-0003-2630-8663 (2020) The Steinhaus-Weil property: I. Subcontinuity and amenability. Sarajevo Journal of Mathematics, 16 (1). 13 - 32. ISSN 1840-0655

Bjorkman, Beth, Cochran, Garner, Gao, Wei, Keough, Lauren, Kirsch, Rachel, Phillipson, Mitch, Rorabaugh, Danny, Smith, Heather and Wise, Jennifer (2019) k-foldability of words. Discrete Applied Mathematics, 259. pp. 19-30. ISSN 0166-218X

Blanchet, Jose and Ruf, Johannes ORCID: 0000-0003-3616-2194 (2015) A weak convergence criterion for constructing changes of measure. Stochastic Models, 32 (2). pp. 233-252. ISSN 1532-6349

Blauth, Jannis, Neuwohner, Meike ORCID: 0000-0002-3664-3687, Puhlmann, Luise and Vygen, Jens (2024) Improved guarantees for the A Priori TSP. Mathematics of Operations Research. ISSN 0364-765X

Board, John, Sutcliffe, Charles and Wells, Stephen (2002) Transparency and fragmentation: financial market regulation in a dynamic environment. LSE Financial Markets Group special paper series. (144). Palgrave Macmillan, London. ISBN 9780333986349

Bock, R. Darrell and Moustaki, Irini ORCID: 0000-0001-8371-1251 (2007) Item response theory in a general framework. In: Rao, C. R. and Sinharay, Sandip, (eds.) Handbook of Statistics, Volume 26: Psychometrics. North-Holland, Amsterdam, The Netherlands, pp. 469-514. ISBN 9780444521033

Bollobas, Bela, Brightwell, Graham and Morris, Robert (2009) Shadows of ordered graphs. . arXiv.

Bollobás, Bela and Brightwell, Graham (2000) Convex bodies, graphs and partial orders. Proceedings of the London Mathematical Society, 80 (2). pp. 415-450. ISSN 0024-6115

Bollobás, Bela, Brightwell, Graham and Morris, Robert (2011) Shadows of ordered graphs. Journal of Combinatorial Theory, Series A, 118 (3). pp. 729-747. ISSN 0097-3165

Bollobás, Bela and Brightwell, Graham R. (2003) The number of k-SAT functions. Random Structures and Algorithms, 22 (3). pp. 227-247. ISSN 1042-9832

Bollobás, Bela, Brightwell, Graham R. and Leader, I. (2003) The number of 2-SAT functions. Israel Journal of Mathematics, 133. pp. 45-60. ISSN 0021-2172

Bonami, Pierre, Conforti, Michele, Cornuéjols, Gérard, Molinaro, Marco and Zambelli, Giacomo (2013) Cutting planes from two-term disjunctions. Operations Research Letters, 41 (5). pp. 442-444. ISSN 0167-6377

Bonamy, Marthe, Botler, Fábio, Dross, François, Naia, Tássio and Skokan, Jozef ORCID: 0000-0003-3996-7676 (2023) Separating the edges of a graph by a linear number of paths. Advances in Combinatorics. ISSN 2517-5599

Bondi, Alessandro, Livieri, Giulia ORCID: 0000-0002-3777-7329 and Pulido, Sergio (2024) Affine Volterra processes with jumps. Stochastic Processes and Their Applications, 168. ISSN 0304-4149

Bondy, J. Adrian, Broersma, Hajo J., van den Heuvel, Jan ORCID: 0000-0003-0897-9148 and Veldman, Henk Jan (2002) Heavy cycles in weighted graphs. Discussiones Mathematicae Graph Theory, 22 (1). pp. 7-16. ISSN 1234-3099

Borodin, O. V., Broersma, H. J., Glebov, A. and van den Heuvel, Jan ORCID: 0000-0003-0897-9148 (2004) A new upper bound on the cyclic chromatic number. CDAM research report series (LSE-CDAM-2004-04). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Borst, Sander, Dadush, Daniel, Olver, Neil ORCID: 0000-0001-8897-5459 and Sinha, Makrand (2021) Majorizing measures for the optimizer. In: Lee, James R., (ed.) 12th Innovations in Theoretical Computer Science Conference, ITCS 2021. Leibniz International Proceedings in Informatics, LIPIcs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. ISBN 9783959771771

Bosman, Thomas, Frascaria, Dario, Olver, Neil ORCID: 0000-0001-8897-5459, Sitters, Rene and Stougie, Leen (2019) Fixed-order scheduling on parallel machines. In: Lodi, Andrea and Nagarajan, Viswanath, (eds.) Integer Programming and Combinatorial Optimization: 20th International Conference, IPCO 2019, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),11480. Springer Berlin / Heidelberg, Cham, CHE, 88 - 100. ISBN 9783030179526

Bosman, Thomas and Olver, Neil ORCID: 0000-0001-8897-5459 (2017) Exploring the tractability of the capped hose model. In: Proceedings of the 25th Annual European Symposium on Algorithms (ESA): ALGO 2017, 2018-09-04 - 2018-09-08, Vienna, Vienns, Austria, AUT.

Bosquet, Clément and Boulhol, Hervé (2014) Applying the GLM Variance Assumption to overcome the scale-dependence of the Negative Binomial QGPML estimator. Econometric Reviews, 33 (7). pp. 772-784. ISSN 0747-4938

Bosworth, William (2022) Social power and non-cooperative game theory. Journal of Theoretical Politics, 34 (2). 262 - 279. ISSN 1460-3667

Botler, F., Corsten, J., Dankovics, A., Frankl, N., Hàn, H., Jiménez, A. and Skokan, J. ORCID: 0000-0003-3996-7676 (2019) Maximum number of triangle-free edge colourings with five and six colours. Acta Mathematica Universitatis Comenianae, 88 (3). pp. 495-499. ISSN 0862-9544

Bottero, M., Ferretti, V. ORCID: 0000-0002-6656-0049, Figueira, J. R., Greco, S. and Roy, B. (2018) On the Choquet multiple criteria preference aggregation model: theoretical and practical insights from a real-world application. European Journal of Operational Research, 271 (1). pp. 120-140. ISSN 0377-2217

Bovens, Luc (2001) Book review: Equilibrium and rationality: game theory revised by decision rules. Mind, 110 (437). pp. 288-292. ISSN 0026-4423

Bovens, Luc and Leeds, Stephen (2002) The epistemology of social facts: the evidential value of personal experience versus testimony. In: Meggle, Georg, (ed.) Social Facts and Collective Intentionality. Philosophische Forschung / Philosophical research (1). Dr. Haensel-Hohenhausen, Frankfurt A.M, pp. 43-51. ISBN 9783826700286

Bown, Nicola J., Read, Daniel and Summers, Barbara (2002) The lure of choice. Operational Research working papers (LSEOR 02.54). Department of Operational Research, London School of Economics and Political Science, London, UK. ISBN 0753015188

Boyd, Sylvia, Cheriyan, Joseph, Haddadan, Arash and Ibrahimpur, Sharat (2023) Approximation algorithms for flexible graph connectivity. Mathematical Programming. ISSN 0025-5610

Boyle, Sean, Kunkle, Daniel and Guerin, Stephen (2006) An application of multi-agent simulation to policy appraisal in the criminal justice system. In: Chen, Shu-Heng, Jain, Lakhmi and Tai, Chung-Ching, (eds.) Computational Economics: a Perspective From Computational Intelligence. Idea Group Publishing, Hershey, PA, pp. 228-234. ISBN 9781591406495

Bradley, Richard ORCID: 0000-0003-2184-7844 (2001) Ramsey and the measurement of belief. In: Corfield, David and Williamson, Jon, (eds.) Foundations of Bayesianism. Applied logic series. Kluwer Academic Publishers, London, UK, pp. 263-290. ISBN 9781402002236

Braggion, Eleonora, Gatti, Nicola, Lucchetti, Roberto, Sandholm, Thomas and Von Stengel, Bernhard ORCID: 0000-0002-3488-8322 (2020) Strong Nash equilibria and mixed strategies. International Journal of Game Theory, 49 (3). 699 - 710. ISSN 0020-7276

Brailsford, S. C., Hubbard, P. M., Smith, B. M. and Williams, H. Paul (1996) Organizing a social event: a difficult problem of combinatorial optimization. Computers and Operations Research, 23 (9). pp. 845-856. ISSN 0305-0548

Brass, Peter, Rote, Gunter and Swanepoel, Konrad ORCID: 0000-0002-1668-887X (2001) Triangles of extremal area or perimeter in a finite planar point set. Discrete and Computational Geometry, 26 (1). pp. 51-58. ISSN 0179-5376

Brazil, M., Ras, C.J., Swanepoel, Konrad J. ORCID: 0000-0002-1668-887X 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

Brazil, Marcus, Ras, Charl J., Swanepoel, Konrad ORCID: 0000-0002-1668-887X and Thomas, Doreen A. (2015) Generalised k-Steiner tree problems in normed planes. Algorithmica, 71 (1). pp. 66-86. ISSN 1432-0541

Brañas-Garza, Pablo, Galizzi, Matteo M. ORCID: 0000-0002-7757-5625 and Nieboer, Jeroen (2018) Experimental and self-reported measures of risk taking and digit ratio (2D:4D): evidence from a large, systematic study. International Economic Review, 59 (3). 1131 - 1157. ISSN 0020-6598

Brearley, A. L., Mitra, G. and Williams, H. Paul (1975) Analysis of mathematical programming problems prior to applying the simplex algorithm. Mathematical Programming, 8 (1). pp. 54-83. ISSN 0025-5610

Brightwell, Graham (1999) Balanced pairs in partial orders. Discrete Mathematics, 201 (1-3). pp. 25-52. ISSN 0012-365X

Brightwell, Graham (2009) A result in 2d causal set theory: the emergence of spacetime. Journal of Physics: Conference Series, 174 (012049). pp. 1-6. ISSN 1742-6596

Brightwell, Graham, Alon, Nogo, Kierstead, H. A, Kostochka, A. V and Winkler, P (2006) Dominating sets in k-majority tournaments. Journal of Combinatorial Theory, Series B, 96 (3). pp. 374-387. ISSN 0095-8956

Brightwell, Graham and Bollobás, Bela (2006) How many graphs are unions of k-cliques? Journal of Graph Theory, 52 (2). pp. 87-107. ISSN 0364-9024

Brightwell, Graham, Bollobás, Béla and Sidorenko, Alexander (1999) Geometrical techniques for estimating numbers of linear extensions. European Journal of Combinatorics, 20 (5). pp. 329-335. ISSN 0195-6698

Brightwell, Graham, Cohen, Gerard, Toth, Agnes, Fairthorne, Marianne, Fachini, Emanuela, Koerner, Janos and Simonyi, Gabor (2010) Permutation capacities of families of oriented infinite paths. SIAM Journal on Discrete Mathematics, 24 (2). pp. 441-456. ISSN 0895-4801

Brightwell, Graham, Cohen, Gérard, Fachini, Emanuela, Fairthorne, Marianne, Körner, János, Simonyi, Gábor and Tóth, Ágnes (2011) Permutation capacities and oriented infinite paths. Electronic Notes in Discrete Mathematics, 38. pp. 195-199. ISSN 1571-0653

Brightwell, Graham, Fairthorne, Marianne and Luczak, Malwina J. (2018) The supermarket model with bounded queue lengths in equilibrium. Journal of Statistical Physics, 173 (3-4). pp. 1149-1194. ISSN 0022-4715

Brightwell, Graham and Georgiou, Nicholas (2010) Continuum limits for classical sequential growth models. Random Structures and Algorithms, 36 (2). pp. 218-250. ISSN 1042-9832

Brightwell, Graham, Grable, D. A. and Prömel, H. J. (1999) Forbidden induced partial orders. Discrete Mathematics, 201 (1-3). pp. 53-80. ISSN 0012-365X

Brightwell, Graham, Haggström, O. and Winkler, P. (1999) Nonmonotonic behavior in hard-core and Widom-Rowlinson models. Journal of Statistical Physics, 94 (3-4). pp. 415-435. ISSN 0022-4715

Brightwell, Graham, Henson, Joe and Surya, Sumati (2008) A 2D model of causal set quantum gravity: the emergence of the continuum. Classical and Quantum Gravity, 25 (10). p. 105025. ISSN 0264-9381

Brightwell, Graham, House, Thomas and Luczak, Malwina J. (2018) Extinction times in the subcritical stochastic SIS logistic epidemic. Journal of Mathematical Biology, 77 (2). pp. 455-493. ISSN 0303-6812

Brightwell, Graham, Janson, Svante and Luczak, Malwina (2017) The greedy independent set in a random graph with given degrees. Random Structures and Algorithms, 51 (4). 565 - 586. ISSN 1042-9832

Brightwell, Graham and Katona, Gyula (2001) A new type of coding problem. Studia Scientiarum Mathematicarum Hungarica, 38 (1-4). pp. 139-147. ISSN 0081-6906

Brightwell, Graham and Keller, Mitchel T. (2015) The reversal ratio of a poset. Order - a Journal on the Theory of Ordered Sets and Its Applications, 32 (1). pp. 43-52. ISSN 0167-8094

Brightwell, Graham and Luczak, Malwina (2009) Order-invariant measures on fixed causal sets. . arXiv.

Brightwell, Graham and Luczak, Malwina J. (2011) Order-invariant measures on causal sets. Annals of Applied Probability, 21 (4). pp. 1493-1536. ISSN 1050-5164

Brightwell, Graham and Luczak, Malwina J. (2012) Order-invariant measures on fixed causal sets. Combinatorics, Probability and Computing, 21 (03). pp. 330-357. ISSN 0963-5483

Brightwell, Graham and Massow, Mareike (2013) Diametral pairs of linear extensions. SIAM Journal on Discrete Mathematics, 27 (2). pp. 634-649. ISSN 0895-4801

Brightwell, Graham, Oriolo, G. and Shepherd, F. B. (2001) Reserving Resilient Capacity in a Network. SIAM Journal on Discrete Mathematics, 14 (4). pp. 524-539. ISSN 0895-4801

Brightwell, Graham, Panagiotou, Konstantinos and Steger, Angelika (2012) Extremal subgraphs of random graphs. Random Structures and Algorithms, 41 (2). pp. 147-178. ISSN 1042-9832

Brightwell, Graham, Panagiotou, Konstantinos and Steger, Angelika (2009) Extremal subgraphs of random graphs: an extended version. . arXiv.

Brightwell, Graham, Panagiotou, Konstantinos and Steger, Angelika (2007) On extremal subgraphs of random graphs. In: 18th ACM-SIAM Symposium on Discrete Algorithms, 2007-01-07 - 2007-01-09, New Orleans LA, United States, USA.

Brightwell, Graham and Patel, Viresh (2010) Average relational distance in linear extensions of posets. Discrete Mathematics, 310 (5). pp. 1016-1021. ISSN 0012-365X

Brightwell, Graham and Trotter, William T. (2002) A combinatorial approach to correlation inequalities. Discrete Mathematics, 257 (2-3). pp. 311-327. ISSN 0012-365X

Brightwell, Graham and West, Douglas (2000) Partially ordered sets. In: Rosen, Kenneth H, (ed.) Handbook of Discrete and Combinatorial Mathematics. CRC Press, Boca Raton, Florida, U.S., pp. 717-752. ISBN 9780849301490

Brightwell, Graham and Winkler, P. (1999) Graph homomorphisms and phase transitions. Journal of Combinatorial Theory, Series B, 77 (2). pp. 221-262. ISSN 0095-8956

Brightwell, Graham and Winkler, P. (2004) A second threshold for the hard-core model on a Bethe lattice. Random Structures & Algorithms, 24 (3). pp. 303-314. ISSN 1098-2418

Brightwell, Graham and Winkler, Peter (2004) Graph homomorphisms and long range action. In: Nešetril, Jaroslav and Winkler, Peter, (eds.) Graphs, Morphisms and Statistical Physics. DIMACS Series in Discrete Mathematics and Computer Science. American Mathematical Society, Providence, Rhode Island, USA, pp. 29-48. ISBN 0821835513

Brightwell, Graham and Winkler, Peter (2002) Hard constraints and the Bethe Lattice: adventures at the interface of combinatorics and statistical physics. In: Proceedings of the International Congress of Mathematicians: Beijing 2002, August 20-28 (International Congress of Mathematician. Higher Education Press, pp. 605-624. ISBN 9787040086904

Brightwell, Graham and Winkler, Peter (2004) Note on counting Eulerian circuits. CDAM research report series (LSE-CDAM-2004-12). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Brightwell, Graham and Winkler, Peter (2002) Random colorings of a cayley tree. In: Bollobás, Bela, (ed.) Contemporary Combinatorics. Bolyai Society Mathematical Studies. Springer Berlin / Heidelberg, U.K., pp. 247-276. ISBN 9783540427254

Brightwell, Graham and Winkler, Peter (2009) Submodular percolation. SIAM Journal on Discrete Mathematics, 23 (3). pp. 1149-1178. ISSN 0895-4801

Brightwell, Graham and Winkler, Peter (2003) A second threshold for the hard-core model on a Bethe lattice. CDAM research report series (LSE-CDAM-2003-05). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Brightwell, Graham R., Oriolo, G. and Shepherd, F. B. (2003) Reserving resilient capacity for a single commodity with upper-bound constraints. Networks, 41 (2). pp. 87-96. ISSN 0028-3045

Brightwell, Graham R. and Tetali, Prasad (2003) The number of linear extensions of the Boolean lattice. Order - a Journal on the Theory of Ordered Sets and Its Applications, 20 (4). pp. 333-345. ISSN 0167-8094

Brightwell, Graham R. and Winkler, Peter (2000) Gibbs measures and dismantlable graphs. Journal of Combinatorial Theory, Series B, 78 (1). pp. 141-166. ISSN 0095-8956

Brokmann, Xavier, Itkin, David ORCID: 0000-0001-8643-574X, Muhle-Karbe, Johannes and Schmidt, Peter (2024) Tackling nonlinear price impact with linear strategies. Mathematical Finance. ISSN 0960-1627

Brudnyi, Alexander and Sasane, Amol ORCID: 0000-0001-5566-9877 (2023) Projective freeness and hermiteness of complex function algebras. Advances in Mathematics, 434. ISSN 0001-8708

Brudnyi, Alexander and Sasane, Amol ORCID: 0000-0001-5566-9877 (2009) Sufficient conditions for the projective freeness of Banach algebras. Journal of Functional Analysis, 257 (12). pp. 4003-4014. ISSN 0022-1236

Bruggeman, Cameron and Ruf, Johannes ORCID: 0000-0003-3616-2194 (2016) A one-dimensional diffusion hits points fast. Electronic Communications in Probability, 21 (22). pp. 1-7. ISSN 1083-589X

Brunton-Smith, Ian, Sturgis, Patrick ORCID: 0000-0003-1180-3493 and Leckie, George (2017) Detecting and understanding interviewer effects on survey data by using a cross-classified mixed effects location-scale model. Journal of the Royal Statistical Society. Series A: Statistics in Society, 180 (2). 551 - 568. ISSN 0964-1998

Brustle, Johannes, Correa, José, Duetting, Paul and Verdugo, Victor (2024) The competition complexity of dynamic pricing. Mathematics of Operations Research, 49 (3). 1986 - 2008. ISSN 0364-765X

Bruynooghe, Daniel (2010) A copula based differential measure of local correlation. In: Relating research to reality: interdisciplinary ideas for a changing world. LSE PhD student poster exhibition, 2010-05-26, London School of Economics and Political Science, London, United Kingdom, GBR. (Submitted)

Bröcker, Jochen and Parlitz, Ulrich (2003) Analyzing communication schemes using methods from nonlinear filtering. Chaos, 13 (1). pp. 195-208. ISSN 1054-1500

Bröcker, Jochen and Smith, Leonard A. (2008) From ensemble forecasts to predictive distribution functions. Tellus Series A: Dynamic Meteorology and Oceanography, 60 (4). pp. 663-678. ISSN 0280-6495

Buch-Kromann, Tine, Guillén, Montserrat, Linton, Oliver and Nielsen, Jens Perch (2011) Multivariate density estimation using dimension reducing information and tail flattening transformations. Insurance: Mathematics and Economics, 48 (1). pp. 99-110. ISSN 0167-6687

Burdzy, Krzysztof and Ostaszewski, Adam ORCID: 0000-0003-2630-8663 (2023) Freezing in space-time: a functional equation linked with a PDE system. Journal of Mathematical Analysis and Applications, 524 (2). ISSN 0022-247X

Buscha, Franz and Sturgis, Patrick ORCID: 0000-0003-1180-3493 (2018) Declining social mobility? Evidence from five linked censuses in England and Wales 1971-2011. British Journal of Sociology, 69 (1). 154 - 182. ISSN 0007-1315

Bustamante, Sebastián, Corsten, Jan, Frankl, Nora, Pokrovskiy, Alexey and Skokan, Jozef ORCID: 0000-0003-3996-7676 (2020) Partitioning edge-colored hypergraphs into few monochromatic tight cycles. SIAM Journal on Discrete Mathematics, 34 (2). 1460 – 1471. ISSN 0895-4801

Bustamante, Sebastián, Corsten, Jan and Frankl, Nóra (2020) Partitioning infinite hypergraphs into few monochromatic Berge-paths. Graphs and Combinatorics, 36 (3). 437 - 444. ISSN 0911-0119

Butler, Martin, Williams, H. Paul and Yarrow, Leslie-Ann (1997) The two-period travelling salesman problem applied to milk collection in Ireland. Computational Optimization and Applications, 7 (3). pp. 291-306. ISSN 0926-6003

Butz, M. and Oomen, R. (2019) Internalisation by electronic FX spot dealers. Quantitative Finance, 19 (1). pp. 35-56. ISSN 1469-7688

Bäuerle, Nicole, Urban, Sebastian and Veraart, Luitgard A. M. ORCID: 0000-0003-1183-2227 (2012) The relaxed investor with partial information. SIAM Journal on Financial Mathematics, 3 (1). pp. 304-327. ISSN 1945-497X

Bérczi, Kristóf, Csikvári, Péter, Kovács, Erika Renáta and Végh, László A. ORCID: 0000-0003-1152-200X (2013) Splitting property via shadow systems. In: 8th Japanese Hungarian Symposium on Discrete Mathematics and its Applications, 2013-06-04 - 2013-06-07, Veszprem, Hungary, HUN.

Böttcher, Julia ORCID: 0000-0002-4104-3635 (2005) Coloring sparse random k-colorable graphs in polynomial expected time. In: Je¸drzejowicz, Joanna and Szepietowski, Andrzej, (eds.) Mathematical Foundations of Computer Science 2005: 30th International Symposium, Mfcs 2005, Gdansk, Poland, August 29–september. Lecture notes in computer science (3618). Springer Berlin / Heidelberg, Berlin, pp. 156-167. ISBN 9783540287025

Böttcher, Julia ORCID: 0000-0002-4104-3635 (2017) Large-scale structures in random graphs. In: Claesson, Anders, Dukes, Mark, Kitaev, Sergei, Manlove, David and Meeks, Kitty, (eds.) Surveys in Combinatorics 2017. London Mathematical Society Lecture Note Series (440). Cambridge University Press, Cambridge, UK, pp. 87-140. ISBN 9781108332699

Böttcher, Julia ORCID: 0000-0002-4104-3635 (2017) vvv. Maths@LSE Blog (03 Feb 2017). Website.

Böttcher, Julia ORCID: 0000-0002-4104-3635 and Foniok, Jan (2013) Ramsey properties of permutations. Electronic Journal of Combinatorics, 20 (1). ISSN 1077-8926

Böttcher, Julia ORCID: 0000-0002-4104-3635, Han, Jie, Kohayakawa, Yoshiharu, Montgomery, Richard, Parczyk, Olaf and Person, Yury (2019) Universality for bounded degree spanning trees in randomly perturbed graphs. Random Structures and Algorithms, 55 (4). pp. 854-864. ISSN 1042-9832

Böttcher, Julia ORCID: 0000-0002-4104-3635, Heinig, Peter and Taraz, Anusch (2010) Embedding into bipartite graphs. SIAM Journal on Discrete Mathematics, 24 (4). pp. 1215-1233. ISSN 0895-4801

Böttcher, Julia ORCID: 0000-0002-4104-3635, Hladký, Jan and Piguet, Diana (2009) The tripartite Ramsey number for trees. Electronic Notes in Discrete Mathematics, 34. pp. 597-601. ISSN 1571-0653

Böttcher, Julia ORCID: 0000-0002-4104-3635, Hladký, Jan, Piguet, Diana and Taraz, Anusch (2016) An approximate version of the tree packing conjecture. Israel Journal of Mathematics, 211 (1). pp. 391-446. ISSN 0021-2172

Böttcher, Julia ORCID: 0000-0002-4104-3635, Kohayakawa, Yoshiharu and Procacci, Aldo (2011) Properly coloured copies and rainbow copies of large graphs with small maximum degree. Random Structures and Algorithms, 40 (4). pp. 425-436. ISSN 1042-9832

Böttcher, Julia ORCID: 0000-0002-4104-3635, Kohayakawa, Yoshiharu and Taraz, Anusch (2009) Almost spanning subgraphs of random graphs after adversarial edge removal. Electronic Notes in Discrete Mathematics, 35. pp. 335-340. ISSN 1571-0653

Böttcher, Julia ORCID: 0000-0002-4104-3635, Kohayakawa, Yoshiharu and Taraz, Anusch (2013) Almost spanning subgraphs of random graphs after adversarial edge removal. Combinatorics, Probability and Computing, 22 (5). pp. 639-683. ISSN 0963-5483

Böttcher, Julia ORCID: 0000-0002-4104-3635, Kohayakawa, Yoshiharu, Taraz, Anusch and Würfl, Andreas (2015) An extension of the blow-up lemma to arrangeable graphs. SIAM Journal on Discrete Mathematics, 29 (2). pp. 962-1001. ISSN 0895-4801

Böttcher, Julia ORCID: 0000-0002-4104-3635, Montgomery, Richard, Parczyk, Olaf and Person, Yury (2020) Embedding spanning bounded degree graphs in randomly perturbed graphs. Mathematika, 66 (2). 422 - 447. ISSN 0025-5793

Böttcher, Julia ORCID: 0000-0002-4104-3635, Montgomery, Richard, Parczyk, Olaf and Person, Yury (2017) Embedding spanning bounded degree subgraphs in randomly perturbed graphs. Electronic Notes in Discrete Mathematics, 61. pp. 155-161. ISSN 1571-0653

Böttcher, Julia ORCID: 0000-0002-4104-3635 and Müller, Sybille (2009) Forcing spanning subgraphs via Ore type conditions. Electronic Notes in Discrete Mathematics, 34. pp. 255-259. ISSN 1571-0653

Böttcher, Julia ORCID: 0000-0002-4104-3635, Parczyk, Olaf, Sgueglia, Amedeo and Skokan, Jozef ORCID: 0000-0003-3996-7676 (2022) Cycle factors in randomly perturbed graphs. Procedia Computer Science, 195. 404 - 411. ISSN 1877-0509

Böttcher, Julia ORCID: 0000-0002-4104-3635, Parczyk, Olaf, Sgueglia, Amedeo and Skokan, Jozef ORCID: 0000-0003-3996-7676 (2023) Triangles in randomly perturbed graphs. Combinatorics, Probability and Computing, 32 (1). 91 - 121. ISSN 0963-5483

Böttcher, Julia ORCID: 0000-0002-4104-3635, Parczyk, Olaf, Sgueglia, Amedeo and Skokan, Jozef ORCID: 0000-0003-3996-7676 (2024) The square of a Hamilton cycle in randomly perturbed graphs. Random Structures and Algorithms, 65 (2). 342 - 386. ISSN 1042-9832

Böttcher, Julia ORCID: 0000-0002-4104-3635, Parczyk, Olaf, Sgueglia, Amedeo and Skokan, Jozef ORCID: 0000-0003-3996-7676 (2021) The square of a Hamilton cycle in randomly perturbed graphs. In: Nešetřil, Jaroslav, Perarnau, Guillem, Rué, Juanjo and Serra, Oriol, (eds.) Extended Abstracts EuroComb 2021: European Conference on Combinatorics, Graph Theory and Applications. Research Perspectives CRM Barcelona. Birkhäuser (Firm), Cham, CH, 644 - 650. ISBN 9783030838225

Böttcher, Julia ORCID: 0000-0002-4104-3635, Pruessmann, Klaas P., Taraz, Anusch and Würfl, Andreas (2010) Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs. European Journal of Combinatorics, 31 (5). pp. 1217-1227. ISSN 0195-6698

Böttcher, Julia ORCID: 0000-0002-4104-3635, Pruessmann, Klaas P., Taraz, Anusch and Würfl, Andreas (2008) Bandwidth, treewidth, separators, expansion, and universality. Electronic Notes in Discrete Mathematics, 31. pp. 91-96. ISSN 1571-0653

Böttcher, Julia ORCID: 0000-0002-4104-3635, Schacht, Mathais and Taraz, Anusch (2007) On the bandwidth conjecture for 3-colourable graphs. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, pp. 618-626. ISBN 9780898716245

Böttcher, Julia ORCID: 0000-0002-4104-3635, Schacht, Mathais and Taraz, Anusch (2009) Proof of the bandwidth conjecture of Bollobás and Komlós. Mathematische Annalen, 343 (1). pp. 175-205. ISSN 1432-1807

Böttcher, Julia ORCID: 0000-0002-4104-3635, Schacht, Mathias and Taraz, Anusch (2008) Spanning 3-colourable subgraphs of small bandwidth in dense graphs. Journal of Combinatorial Theory, Series B, 98 (4). pp. 752-777. ISSN 0095-8956

Böttcher, Julia ORCID: 0000-0002-4104-3635, Taraz, Anusch and Würfl, Andreas (2012) Perfect graphs of fixed density: counting and homogeneous sets. Combinatorics, Probability and Computing, 21 (5). pp. 661-682. ISSN 0963-5483

Böttcher, Julia ORCID: 0000-0002-4104-3635, Taraz, Anusch and Würfl, Andreas (2015) Spanning embeddings of arrangeable graphs with sublinear bandwidth. Random Structures and Algorithms, 48 (2). pp. 270-289. ISSN 1042-9832

Böttcher, Julia ORCID: 0000-0002-4104-3635 and Vilenchik, Dan (2008) On the tractability of coloring semirandom graphs. Information Processing Letters, 108 (3). pp. 143-149. ISSN 0020-0190

C

Caceres, Manuel, Mumey, Brendan, Husic, Edin ORCID: 0000-0002-6708-5112, Rizzi, Romeo, Cairo, Massimo, Sahlin, Kristoffer and Tomescu, Alexandru I.Ioan (2022) Safety in multi-assembly via paths appearing in all path covers of a DAG. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 19 (6). 3673 - 3684. ISSN 1545-5963

Cagnone, Silvia, Moustaki, Irini ORCID: 0000-0001-8371-1251 and Vasdekis, Vassilis (2009) Latent variable models for multivariate longitudinal ordinal responses. British Journal of Mathematical and Statistical Psychology, 62 (2). pp. 401-415. ISSN 0007-1102

Cai, Xiaoming, Den Haan, Wouter J. ORCID: 0000-0001-6214-8156 and Pinder, Jonathan (2016) Predictable recoveries. Economica, 83 (330). 307 - 337. ISSN 0013-0427

Caines, Peter E., Deardon, R. and Wynn, Henry P. ORCID: 0000-0002-6448-1080 (2002) Conditional orthogonality and conditional stochastic realization. In: Directions in mathematical systems theory and optimization. Lecture Notes in Control and Information Sciences (286). Springer Berlin / Heidelberg, Berlin, Germany, pp. 71-84. ISBN 9783540000655

Campi, Luciano, Cetin, Umut ORCID: 0000-0001-8905-853X and Danilova, Albina ORCID: 0009-0001-4264-3798 (2013) Equilibrium model with default and dynamic insider information. Finance and Stochastics, 17 (347). pp. 565-585. ISSN 0949-2984

Campi, Luciano, Cetin, Umut ORCID: 0000-0001-8905-853X and Danilova, Albina ORCID: 0009-0001-4264-3798 (2013) Explicit construction of a dynamic Bessel bridge of dimension 3. Electronic Journal of Probability, 18 (20). pp. 1-25. ISSN 1083-6489

Campi, Luciano and De Santis, Davide (2020) Nonzero-sum stochastic differential games between an impulse controller and a stopper. Journal of Optimization Theory and Applications, 186 (2). 688 - 724. ISSN 0022-3239

Campi, Luciano and Fischer, Markus (2018) N-player games and mean-field games with absorption. Annals of Applied Probability, 28 (4). pp. 2188-2242. ISSN 1050-5164

Campi, Luciano and Martini, Claude (2019) On the support of extremal martingale measures with given marginals: the countable case. Advances in Applied Probability, 51 (2). pp. 570-605. ISSN 0001-8678

Campi, Luciano and Zabaljauregui, Diego (2020) Optimal market making under partial information with general intensities. Applied Mathematical Finance, 27 (1-2). 1 - 45. ISSN 1350-486X

Campi, Luciano, de Angelis, Tiziano, Ghio, Maddalena and Livieri, Giulia ORCID: 0000-0002-3777-7329 (2022) Mean-field games of finite-fuel capacity expansion with singular controls. Annals of Applied Probability, 32 (5). pp. 3674-3717. ISSN 1050-5164

Campi, Luciano and Çetin, Umut ORCID: 0000-0001-8905-853X (2007) Insider trading in an equilibrium model with default: a passage from reduced-form to structural modelling. Finance and Stochastics, 11 (4). pp. 591-602. ISSN 0949-2984

Camponovo, Lorenzo and Otsu, Taisuke ORCID: 0000-0002-2307-143X (2014) On Bartlett correctability of empirical likelihood in generalized power divergence family. Statistics and Probability Letters, 86 (1). pp. 38-43. ISSN 0167-7152

Camponovo, Lorenzo and Otsu, Taisuke ORCID: 0000-0002-2307-143X (2015) Robustness of bootstrap in instrumental variable regression. Econometric Reviews, 34 (3). pp. 352-393. ISSN 0747-4938

Cao, J., Han, H, Wang, Y.J. and Han, T.C. (2023) Optimal logistics scheduling with dynamic information in emergency response: case studies for humanitarian objectives. Advances in Production Engineering & Management, 18 (3). 381 - 395. ISSN 1854-6250

Capodaglio, Giacomo, Gunzburger, Max and Wynn, Henry P. ORCID: 0000-0002-6448-1080 (2021) Approximation of Probability Density Functions for PDEs with Random Parameters Using Truncated Series Expansions. Vietnam Journal of Mathematics, 49 (3). pp. 685-711. ISSN 2305-221X

Cappellari, Lorenzo and Jenkins, Stephen P ORCID: 0000-0002-8305-9774 (2008) The dynamics of social assistance receipt: measurement and modelling issues, with an application to Britain. OECD social, employment and migration working papers (DELSA/ELSA/WD/SEM(2008)4). OECD, Paris, France.

Cappellari, Lorenzo and Jenkins, Stephen P ORCID: 0000-0002-8305-9774 (2008) The dynamics of social assistance receipt: measurement and modelling issues, with an application to Britain. ISER working paper series (No. 2008-34). Institute for Social and Economic Research, Essex, UK.

Cappellari, Lorenzo and Jenkins, Stephen P. ORCID: 0000-0002-8305-9774 (2006) Calculation of multivariate normal probabilities by simulation, with applications to maximum simulated likelihood estimation. Stata Journal, 6 (2). pp. 156-189. ISSN 1536-867X

Caron, François, Panero, Francesca ORCID: 0000-0002-8287-163X and Rousseau, Judith (2023) On sparsity, power-law, and clustering properties of graphex processes. Advances in Applied Probability, 55 (4). 1211 - 1253. ISSN 0001-8678

Carrol, Peter, Fisher, Travis and Ruf, Johannes ORCID: 0000-0003-3616-2194 (2013) On the hedging of options on exploding exchange rates. Finance and Stochastics, 18 (1). pp. 115-144. ISSN 0949-2984

Casetti, Marta M., Merschen, Julian and von Stengel, Bernhard ORCID: 0000-0002-3488-8322 (2010) Finding Gale Strings. Electronic Notes in Discrete Mathematics, 36. pp. 1065-1072. ISSN 1571-0653

Ceccon, Riccardo, Livieri, Giulia ORCID: 0000-0002-3777-7329 and Marmi, Stefano (2023) The Yoccoz–Birkeland livestock population model coupled with random price dynamics. Communications in Nonlinear Science and Numerical Simulation, 118. ISSN 1007-5704

Cereceda, Luis, van den Heuvel, Jan ORCID: 0000-0003-0897-9148 and Johnson, Matthew (2008) Connectedness of the graph of vertex-colourings. Discrete Mathematics, 308 (5-6). pp. 913-919. ISSN 0012-365X

Cereceda, Luis, van den Heuvel, Jan ORCID: 0000-0003-0897-9148 and Johnson, Matthew (2005) Connectedness of the graph of vortex-colourings. CDAM research report series (CDAM-LSE-2005-11). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Cereceda, Luis, van den Heuvel, Jan ORCID: 0000-0003-0897-9148 and Johnson, Matthew (2011) Finding paths between 3-colorings. Journal of Graph Theory, 67 (1). pp. 69-82. ISSN 0364-9024

Cereceda, Luis, van den Heuvel, Jan ORCID: 0000-0003-0897-9148 and Johnson, Matthew (2009) Mixing 3-colourings in bipartite graphs. European Journal of Combinatorics, 30 (7). pp. 1593-1606. ISSN 0195-6698

Cerioli, Andrea, Riani, Marco, Atkinson, Anthony C. and Corbellini, Aldo (2017) The power of monitoring: how to make the most of a contaminated multivariate sample. Statistical Methods and Applications. ISSN 1618-2510

Cetin, Umut ORCID: 0000-0001-8905-853X (2018) Path transformations for local times of one-dimensional diffusions. Stochastic Processes and Their Applications, 128 (10). pp. 3439-3465. ISSN 0304-4149

Cetin, Umut ORCID: 0000-0001-8905-853X (2010) Stochastic integration. In: Cont, Rama, (ed.) Encyclopedia of Quantitative Finance. John Wiley & Sons, Chichester, UK. ISBN 9780470057568

Cetin, Umut ORCID: 0000-0001-8905-853X, Jarrow, P., Protter, M. and Warachka, M. (2006) Pricing options in an extended black-scholes economy with illiquidity: theory and empirical evidence. Review of Financial Studies, 19 (2). pp. 493-529. ISSN 0893-9454

Cetin, Umut ORCID: 0000-0001-8905-853X, Jarrow, R. and Protter, P. (2010) Liquidity risk and arbitrage pricing theory. In: Lee, Cheng-Few, Lee, Alice C. and Lee, John, (eds.) Handbook of Quantitative Finance and Risk Management. Springer Berlin / Heidelberg, New York, USA. ISBN 9780387771168

Cetin, Umut ORCID: 0000-0001-8905-853X, Jarrow, Robert A. and Protter, Philip (2004) Liquidity risk and arbitrage pricing theory. Finance and Stochastics, 8 (3). pp. 311-341. ISSN 1432-1122

Cetin, Umut ORCID: 0000-0001-8905-853X and Rogers, L.C.G. (2007) Modeling liquidity effects in discrete time. Mathematical Finance, 17 (1). pp. 15-29. ISSN 0960-1627

Cetin, Umut ORCID: 0000-0001-8905-853X and Verschuere, Michel (2007) Hedging under incomplete information: applications to emmissions markets. In: Vanmaele, Michèle, Deelstra, Griselda, De Schepper, Ann, Dhaene, Jan, Reynaerts, Huguette, Schoutens, Wim and Van Goethem, Paul, (eds.) Proceedings of the 5th Actuarial and Financial Mathematics Day: Contactforum [Proceedings of the 5th Actuarial and Financial Mat. Koninklijke Vlaamse Academie van Belgie voor Wetenschappen en Kunsten, Brussels, Belgium, pp. 33-42.

Cetin, Umut ORCID: 0000-0001-8905-853X and Verschuere, Michel (2009) Pricing and hedging in carbon emissions markets. International Journal of Theoretical and Applied Finance, 12 (7). pp. 949-967. ISSN 0219-0249

Chan, Kung-Sik and Tong, Howell (2010) A note on the invertibility of nonlinear ARMA models. Journal of Statistical Planning and Inference, 140 (12). pp. 3709-3714. ISSN 0378-3758

Chan, W., Ng, M. W. and Tong, Howell (2006) On a simple graphical approach to modelling economic fluctuations with an application to United Kingdom price inflation, 1265-2005. Annals of Actuarial Science, 1 (1). pp. 103-128. ISSN 1748-4995

Chandrasekaran, Karthekeyan, Végh, László A. ORCID: 0000-0003-1152-200X and Vempala, Santosh S. (2016) The cutting plane method is polynomial for perfect matchings. Mathematics of Operations Research, 41 (1). pp. 23-48. ISSN 0364-765X

Chang, Jinyuan, Cheng, Guanghui and Yao, Qiwei ORCID: 0000-0003-2065-8486 (2022) Testing for unit roots based on sample autocovariances. Biometrika, 109 (2). 543 - 550. ISSN 0006-3444

Chen, Xi, Chen, Yunxiao ORCID: 0000-0002-7215-2324 and Li, Xiaoou (2022) Asymptotically optimal sequential design for rank aggregation. Mathematics of Operations Research, 47 (3). 2310 - 2332. ISSN 0364-765X

Chen, Xiao, Huang, Hanwei, Ju, Jiandong, Sun, Ruoyan and Zhang, Jialiang (2022) Endogenous cross-region human mobility and pandemics. CEP Discussion Papers (1860). London School of Economics and Political Science. Centre for Economic Performance, London, UK.

Chen, Yining ORCID: 0000-0003-1697-1920 (2015) Semiparametric time series models with log-concave innovations: maximum likelihood estimation and its consistency. Scandinavian Journal of Statistics, 42 (1). pp. 1-31. ISSN 0303-6898

Chen, Yining ORCID: 0000-0003-1697-1920 and Samworth, Richard J. (2016) Generalized additive and index models with shape constraints. Journal of the Royal Statistical Society. Series B: Statistical Methodology, 78 (4). 729 - 754. ISSN 1369-7412

Chen, Yining ORCID: 0000-0003-1697-1920 and Wellner, Jon A. (2016) On convex least squares estimation when the truth is linear. Electronic Journal of Statistics, 10 (1). pp. 171-209. ISSN 1935-7524

Chen, Yunxiao ORCID: 0000-0002-7215-2324 (2020) A continuous-time dynamic choice measurement model for problem-solving process data. Psychometrika. ISSN 0033-3123

Chen, Yunxiao ORCID: 0000-0002-7215-2324, Li, Xiaoou and Zhang, Siliang (2019) Joint maximum likelihood estimation for high-dimensional exploratory item factor analysis. Psychometrika, 84 (1). pp. 124-146. ISSN 0033-3123

Chen, Yunxiao ORCID: 0000-0002-7215-2324, Li, Xiaoou and Zhang, Siliang ORCID: 0000-0002-2641-4944 (2019) Structured latent factor analysis for large-scale data: identifiability, estimability, and their implications. Journal of the American Statistical Association, 115 (532). pp. 1756-1770. ISSN 0162-1459

Chen, Yunxiao ORCID: 0000-0002-7215-2324, Ying, Zhiliang and Zhang, Haoran (2021) Unfolding-model-based visualization: theory, method and applications. Journal of Machine Learning Research, 22. pp. 1-51. ISSN 1532-4435

Cheriyan, Joseph and Végh, László A. ORCID: 0000-0003-1152-200X (2014) Approximating minimum-cost -node connected subgraphs via independence-free graphs. SIAM Journal on Computing, 43 (4). pp. 1342-1362. ISSN 0097-5397

Cheshire, M., McKinnon, K. I. M. and Williams, H. Paul (1984) The efficient allocation of private contractors to public works. Journal of the Operational Research Society, 35 (8). pp. 705-709. ISSN 0160-5682

Cho, Haeran and Fryzlewicz, Piotr ORCID: 0000-0002-9676-902X (2012) High dimensional variable selection via tilting. Journal of the Royal Statistical Society. Series B: Statistical Methodology, 74 (3). pp. 593-622. ISSN 1369-7412

Cho, Haeran, Goude, Yannig, Brossat, Xavier and Yao, Qiwei ORCID: 0000-0003-2065-8486 (2013) Modeling and forecasting daily electricity load curves: a hybrid approach. Journal of the American Statistical Association, 108 (501). pp. 7-21. ISSN 0162-1459

Christen, Paula and Conteh, Lesong ORCID: 0000-0002-0719-3672 (2021) How are mathematical models and results from mathematical models of vaccine-preventable diseases used, or not, by global health organisations? BMJ Global Health, 6 (9). ISSN 2059-7908

Chun, Kwok Pan, Dieppois, Bastien, He, Qing, Sidibe, Moussa, Eden, Jonathan, Paturel, Jean Emmanuel, Mahé, Gil, Rouché, Nathalie, Klaus, Julian and Conway, Declan ORCID: 0000-0002-4590-6733 (2021) Identifying drivers of streamflow extremes in West Africa to inform a nonstationary prediction model. Weather and Climate Extremes, 33. ISSN 2212-0947

Clemens, Dennis, Hamann, Fabian, Mogge, Yannick and Parczyk, Olaf (2021) Waiter-Client games on randomly perturbed graphs. In: Nešetřil, Jaroslav, Perarnau, Guillem, Rué, Juanjo and Serra, Oriol, (eds.) Extended Abstracts EuroComb 2021: European Conference on Combinatorics, Graph Theory and Applications. Trends in Mathematics. Springer Science and Business Media Deutschland GmbH, Cham, CH, 397 - 403. ISBN 9783030838225

Clift, Hamish (2013) Book review: Spatial statistics and geostatistics. LSE Review of Books (26 Aug 2013). Website.

Coja-Oghlan, Amin, Loick, Philipp, Mezei, Balazs F. and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2022) The ising antiferromagnet and max cut on random regular graphs. SIAM Journal on Discrete Mathematics, 36 (2). 1306 - 1342. ISSN 0895-4801

Cole, Richard, Correa, Jose, Gkatzelis, Vasillis, Mirrokni, Vahab and Olver, Neil ORCID: 0000-0001-8897-5459 (2015) Decentralized utilitarian mechanisms for scheduling games. Games and Economic Behavior, 92. 306 - 326. ISSN 0899-8256

Cole, Richard, Correa, Jose, Gkatzelis, Vasillis, Mirrokni, Vahab and Olver, Neil ORCID: 0000-0001-8897-5459 (2011) Decentralized utilitarian mechanisms for scheduling games. In: 43rd ACM Symposium on Theory of Computing, 2011-06-06 - 2011-06-08, San Jose, California, San Jose, United States, USA.

Cole, Richard, Hertrich, Christoph ORCID: 0000-0001-5646-8567, Tao, Yixin and Végh, László A. ORCID: 0000-0003-1152-200X (2024) A first order method for linear programming parameterized by circuit imbalance. In: Vygen, Jens and Byrka, Jarosław, (eds.) Integer Programming and Combinatorial Optimization - 25th International Conference, IPCO 2024, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Science and Business Media Deutschland GmbH, 57 - 70. ISBN 9783031598340

Colussi, Livio, Conforti, Michele and Zambelli, Giacomo (2005) Disjoint paths in arborescences. Discrete Mathematics, 292 (1-3). pp. 187-191. ISSN 0012-365X

Cominetti, Roberto, Correa, Jose and Olver, Neil ORCID: 0000-0001-8897-5459 (2017) Long term behavior of dynamic equilibria in fluid queuing networks. In: IPCO: International Conference on Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science. Springer Berlin / Heidelberg, CAN, pp. 161-172.

Conforti, Michele, Cornuéjols, Gérard, Liu, Xinming, Vuskovic, Kristina and Zambelli, Giacomo (2006) Odd hole recognition in graphs of bounded clique size. SIAM Journal on Discrete Mathematics, 20 (1). pp. 42-48. ISSN 0895-4801

Conforti, Michele, Cornuéjols, Gérard and Zambelli, Giacomo (2004) Bicolorings and equitable bicolorings of matrices. In: Grötschel, Martin, (ed.) The Sharpest Cut : the Impact of Manfred Padberg and His Work. MPS-SIAM series on optimization. Society for Industrial and Applied Mathematics, Philadelphia, USA, pp. 33-37. ISBN 9780898715521

Conforti, Michele, Cornuéjols, Gérard and Zambelli, Giacomo (2011) Corner polyhedron and intersection cuts. Surveys in Operations Research and Management Science, 16 (2). pp. 105-120. ISSN 1876-7354

Conforti, Michele, Cornuéjols, Gérard and Zambelli, Giacomo (2006) Decomposing berge graphs containing no proper wheels, long prisms or their complements. Combinatorica, 26 (5). pp. 533-558. ISSN 0209-9683

Conforti, Michele, Cornuéjols, Gérard and Zambelli, Giacomo (2010) Extended formulations in combinatorial optimization. 4or: a Quarterly Journal of Operations Research, 8 (1). pp. 1-48. ISSN 1619-4500

Conforti, Michele, Cornuéjols, Gérard and Zambelli, Giacomo (2010) Polyhedral approaches to mixed integer linear programming. In: Jünger, Michael, Liebling, Thomas M., Naddef, Denis, Nemhauser, George L., Pulleyblank, William R., Reinelt, Gerhard, Rinaldi, Giovanni and Wolsey, Laurence A., (eds.) 50 Years of Integer Programming 1958-2008: From the Early Years to the State-Of-The-Art. Springer Berlin / Heidelberg, Berlin, Germany, pp. 334-384. ISBN 9783540682745

Conforti, Michele, Cornuéjols, Gérard and Zambelli, Giacomo (2011) A geometric perspective on lifting. Operations Research, 59 (3). pp. 567-577. ISSN 0030-364X

Conforti, Michele, Gerards, Bert and Zambelli, Giacomo (2007) Mixed-integer vertex covers on bipartite graphs. In: Fischetti, Matteo and Williamson, David .P., (eds.) Integer Programming and Combinatorial Optimization. Lecture notes in computer science (4513). Springer Berlin / Heidelberg, Berlin, Germany, pp. 324-336. ISBN 9783540727927

Conforti, Michele, Summa, Marco Di and Zambelli, Giacomo (2007) Minimally infeasible set-partitioning problems with balanced constraints. Mathematics of Operations Research, 32 (3). pp. 497-507. ISSN 0364-765X

Conforti, Michele, Wolsey, Laurence A. and Zambelli, Giacomo (2010) Projecting an extended formulation for mixed-integer covers on bipartite graphs. Mathematics of Operations Research, 35 (3). pp. 603-623. ISSN 0364-765X

Conforti, Michele and Zambelli, Giacomo (2006) Recognizing balanceable matrices. Mathematical Programming, 105 (2-3). pp. 161-179. ISSN 0025-5610

Conforti, Michele and Zambelli, Giacomo (2009) The mixing set with divisible capacities: a simple approach. Operations Research Letters, 37 (6). pp. 379-383. ISSN 0167-6377

Contisciani, Martina, Power, Eleanor A. ORCID: 0000-0002-3064-2050 and De Bacco, Caterina (2020) Community detection with node attributes in multilayer networks. Scientific Reports, 10 (1). ISSN 2045-2322

Cooley, Oliver, Garbe, Frederik, Hng, Eng Keat, Kang, Mihyun, Sanhueza-Matama, Nicolás and Zalla, Julian (2021) Longest paths in random hypergraphs. SIAM Journal on Discrete Mathematics, 35 (4). 2430 – 2458. ISSN 0895-4801

Cooper, Barry, Lewis-Pye, Andrew, Li, Angsheng, Pan, Yicheng and Yong, Xi (2018) Establishing social cooperation: the role of hubs and community structure. Network Science, 6 (2). pp. 251-264. ISSN 2050-1242

Cooper, Colin, Frieze, Alan and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2007) Random 2-SAT with prescribed literal degrees. Algorithmica, 48 (3). pp. 249-265. ISSN 0178-4617

Cooper, S. Barry, Lewis-Pye, Andrew and Yang, Yue (2005) Properly Σ2 minimal degrees and 0″ complementation. Mathematical Logic Quarterly, 51 (3). pp. 274-276. ISSN 0942-5616

Coppersmith, Don, Gamarnik, David, Hajiaghayi, Mohammad and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2003) Random Max Sat, random Max Cut, and their phase transitions. In: Farach-Colton, Martin, (ed.) Proceedings of the Fourteenth Aanual ACM-SIAM: Symposium on Discrete Algorithms. SIAM, pp. 364-373. ISBN 9780898715385

Coppersmith, Don, Gamarnik, David, Taghi Hajiaghayi, Mohammad and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2004) Random MAX SAT, random MAX CUT, and their phase transitions. Random Structures and Algorithms, 24 (4). pp. 502-545. ISSN 1042-9832

Coppersmith, Don and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2002) On the expected incremental cost of a minimum assignment. In: Bollobás, Béla, (ed.) Contemporary Combinatorics. Bolyai Society Mathematical Studies (10). Springer Berlin / Heidelberg, pp. 277-288. ISBN 9783540427254

Correa, Jose, Dütting, Paul, Fischer, Felix, Schewior, Kevin and Ziliotto, Bruno (2020) Unknown I.I.D. prophets: better bounds, streaming algorithms, and a new impossibility. In: Proceedings of the 12th Innovations in Theoretical Computer Science Conference, ITCS'21, forthcoming. ACM Press. (In Press)

Correa, Jose, Kiwi, Marcos, Olver, Neil ORCID: 0000-0001-8897-5459 and Vera, Alberto (2015) Adaptive Rumor Spreading. In: WINE 2015: the 11th conference on web and internet economics, 2015-12-09 - 2015-12-12, Amsterdam, Amsterdam, Netherlands, NLD.

Correa, José, Dütting, Paul, Fischer, Felix and Schewior, Kevin (2022) Prophet inequalities for independent and identically distributed random variables from an unknown distribution. Mathematics of Operations Research, 47 (2). 847 - 1705. ISSN 0364-765X

Corsten, Jan, DeBiasio, Louis, Lamaison, Ander and Lang, Richard (2020) Upper density of monochromatic infinite paths. Advances in Combinatorics, 2019 (4). ISSN 2517-5599

Corsten, Jan and Frankl, Nóra (2018) A note on diameter-Ramsey sets. European Journal of Combinatorics, 71. pp. 51-54. ISSN 0195-6698

Corsten, Jan, Mond, Adva, Pokrovskiy, Alexey, Spiegel, Christoph and Szabó, Tibor (2020) On the odd cycle game and connected rules. European Journal of Combinatorics, 89. ISSN 0195-6698

Cosso, Andrea, Pham, Huyên and Xing, Hao (2017) BSDEs with diffusion constraint and viscous Hamilton-Jacobi equations with unbounded data. Annales de l'Institut Henri Poincaré, Probabilités et Statistiques, 53 (4). pp. 1528-1547. ISSN 0246-0203

Croon, Marcel, Bergsma, Wicher ORCID: 0000-0002-2422-2359 and Hagenaars, Jacques (2000) Analyzing change in categorical variables by generalized log-linear models. Sociological Methods and Research, 29 (2). pp. 195-229. ISSN 0049-1241

Csikós, Balázs, Kiss, György, Swanepoel, Konrad ORCID: 0000-0002-1668-887X and Oloff de Wet, P. (2009) Large antipodal families. Periodica Mathematica Hungarica, 58 (2). pp. 129-138. ISSN 0031-5303

Csóka, Endre and Lidbetter, Thomas (2016) The solution to an open problem for a caching game. Naval Research Logistics, 63 (1). pp. 23-31. ISSN 0894-069X

Curtain, R. F. and Sasane, A. J. ORCID: 0000-0001-5566-9877 (2001) Compactness and nuclearity of the Hankel operator and internal stability of infinite-dimensional state linear systems. International Journal of Control, 74 (12). pp. 1260-1270. ISSN 0020-7179

Curtain, R. F. and Sasane, Amol ORCID: 0000-0001-5566-9877 (2002) Explicit formulae for J-spectral factors for regular linear systems. In: Proceedings of the 15th International Symposium on Mathematical Theory of Networks and Systems, 2002-08-12 - 2002-08-16, Notre Dame, United States, USA. (Submitted)

Curtain, Ruth, Mikkola, Kalle and Sasane, Amol ORCID: 0000-0001-5566-9877 (2005) The Hilbert-Schmidt property of feedback operators. CDAM research report series (CDAM-LSE-2005-15). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Curtain, Ruth F. and Sasane, Amol J. ORCID: 0000-0001-5566-9877 (2011) On Riccati equations in Banach algebras. SIAM Journal on Control and Optimization, 49 (2). pp. 464-475. ISSN 0363-0129

Czichowsky, Christoph ORCID: 0000-0002-3513-6843, Muhle-Karbe, Johannes and Schachermayer, Walter (2013) Transaction costs and shadow prices in discrete time. . The London School of Economics and Political Science, Department of Mathematics, London, UK.

Czichowsky, Christoph ORCID: 0000-0002-3513-6843, Muhle-Karbe, Johannes and Schachermayer, Walter (2014) Transaction costs, shadow prices, and duality in discrete time. SIAM Journal on Financial Mathematics, 5 (1). pp. 258-277. ISSN 1945-497X

Czichowsky, Christoph ORCID: 0000-0002-3513-6843 and Schachermayer, Walter (2016) Duality theory for portfolio optimisation under transaction costs. Annals of Applied Probability, 26 (3). pp. 1888-1941. ISSN 1050-5164

Czichowsky, Christoph ORCID: 0000-0002-3513-6843 and Schachermayer, Walter (2017) Portfolio optimisation beyond semimartingales: shadowprices and fractional Brownian motion. Annals of Applied Probability, 27 (3). pp. 1414-1451. ISSN 1050-5164

Czichowsky, Christoph ORCID: 0000-0002-3513-6843 and Schachermayer, Walter (2016) Strong supermartingales and limits of non-negative martingales. Annals of Probability, 44 (1). pp. 171-205. ISSN 0091-1798

Czichowsky, Christoph ORCID: 0000-0002-3513-6843, Schachermayer, Walter and Yang, Junjian (2017) Shadow prices for continuous processes. Mathematical Finance, 27 (3). pp. 623-658. ISSN 0960-1627

Czichowsky, Christoph ORCID: 0000-0002-3513-6843 and Schweizer, Martin (2011) Closedness in the semimartingale topology for spaces of stochastic integrals with constrained integrands. In: Donati-Martin, Catherine, Lejay, Antoine and Rouault, Alain, (eds.) Séminaire De Probabilités Xliii. Lecture Notes in Mathematics (2006). Springer Berlin / Heidelberg, Berlin, Germany, pp. 413-436. ISBN 9783642152160

Czichowsky, Christoph ORCID: 0000-0002-3513-6843 and Schweizer, Martin (2013) Cone-constrained continuous-time Markowitz problems. Annals of Applied Probability, 23 (2). pp. 764-810. ISSN 1050-5164

Czichowsky, Christoph ORCID: 0000-0002-3513-6843 and Schweizer, Martin (2012) Convex duality in mean-variance hedging under convex trading constraints. Advances in Applied Probability, 44 (4). pp. 1084-1112. ISSN 0001-8678

Czichowsky, Christoph ORCID: 0000-0002-3513-6843, Westray, Nicholas and Zheng, Harry (2011) Convergence in the semimartingale topology and constrained portfolios. In: Donati-Martin, Catherine, Lejay, Antoine and Rouault, Alain, (eds.) Séminaire De Probabilités Xliii. Lecture Notes in Mathematics (2006). Springer Berlin / Heidelberg, Berlin, Germany, pp. 395-412. ISBN 9783642152160

Czichowsky, Christoph Johannes ORCID: 0000-0002-3513-6843 (2011) Mean-variance portfolio optimisation: trading constraints and time consistency. Doctoral thesis, ETH Zurich.

Czichowsky, Christoph Johannes ORCID: 0000-0002-3513-6843, Peyre, Rémi, Schachermayer, Walter and Yang, Junjian (2018) Shadow prices, fractional Brownian motion, and portfolio optimisation under transaction costs. Finance and Stochastics, 22 (1). pp. 161-180. ISSN 0949-2984

D

Dadush, Daniel, Guzmán, Cristóbal and Olver, Neil ORCID: 0000-0001-8897-5459 (2018) Fast, deterministic and sparse dimensionality reduction. In: ACM SIAM Symposium on Discrete Algorithms, 2018-01-07 - 2018-01-10, Astor Crowne Plaza, New Orleans, United States, USA.

Dadush, Daniel, Huiberts, Sophie, Natura, Bento and Végh, László A. ORCID: 0000-0003-1152-200X (2023) A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. Mathematical Programming. ISSN 0025-5610

Dadush, Daniel, Koh, Zhuan Khye, Natura, Bento, Olver, Neil ORCID: 0000-0001-8897-5459 and Végh, László A. ORCID: 0000-0003-1152-200X (2024) A strongly polynomial algorithm for linear programs with at most two nonzero entries per row or column. In: Mohar, Bojan, Shinkar, Igor and O�Donnell, Ryan, (eds.) STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC ’24), June 24–28. Proceedings of the Annual ACM Symposium on Theory of Computing. ACM Press, New York, NY, 1561 – 1572. ISBN 9798400703836

Dadush, Daniel, Koh, Zhuan Khye, Natura, Bento and Végh, László A. ORCID: 0000-0003-1152-200X (2021) An accelerated Newton-dinkelbach method and its application to two variables per inequality systems. In: Mutzel, Petra, Pagh, Rasmus and Herman, Grzegorz, (eds.) 29th Annual European Symposium on Algorithms, ESA 2021. Leibniz International Proceedings in Informatics, LIPIcs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. ISBN 9783959772044

Dadush, Daniel, Koh, Zhuan Khye, Natura, Bento and Végh, László A. ORCID: 0000-0003-1152-200X (2023) An accelerated Newton–Dinkelbach method and its application to two variables per inequality systems. Mathematics of Operations Research, 48 (4). 1934 - 1958. ISSN 0364-765X

Dadush, Daniel, Végh, László A. ORCID: 0000-0003-1152-200X 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

Dadush, Daniel, Végh, László A. ORCID: 0000-0003-1152-200X and Zambelli, Giacomo (2021) Geometric rescaling algorithms for submodular function minimization. Mathematics of Operations Research, 46 (3). 1081 - 1108. ISSN 0364-765X

Dadush, Daniel, Végh, László A. ORCID: 0000-0003-1152-200X and Zambelli, Giacomo (2022) On finding exact solutions of linear programs in the oracle model. In: Naor, Joseph (Seffi) and Buchbinder, Niv, (eds.) Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2700 - 2722. ISBN 9781611977073

Dadush, Daniel, Végh, László A. ORCID: 0000-0003-1152-200X and Zambelli, Giacomo (2016) Rescaled coordinate descent methods for linear programming. In: Louveaux, Quentin and Skutella, Martin, (eds.) Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science. Springer Berlin / Heidelberg, Cham, Switzerland, pp. 26-37. ISBN 9783319334608