ISTA Research Explorer

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

2017 | Journal Article | IST-REx-ID: 9574 |

Resilience for the Littlewood-Offord problem
A.S. Bandeira, A. Ferber, M.A. Kwan, Electronic Notes in Discrete Mathematics 61 (2017) 93–99.

[Preprint] View | DOI | Download Preprint (ext.) | arXiv

2017 | Journal Article | IST-REx-ID: 9590 |

Bounded-degree spanning trees in randomly perturbed graphs
M. Krivelevich, M.A. Kwan, B. Sudakov, SIAM Journal on Discrete Mathematics 31 (2017) 155–171.

[Preprint] View | DOI | Download Preprint (ext.) | arXiv

2017 | Journal Article | IST-REx-ID: 9588 |

Resilience for the Littlewood–Offord problem
A.S. Bandeira, A. Ferber, M.A. Kwan, Advances in Mathematics 319 (2017) 292–312.

[Preprint] View | DOI | Download Preprint (ext.) | arXiv

2017 | Journal Article | IST-REx-ID: 9589 |

The average number of spanning trees in sparse graphs with given degrees
C. Greenhill, M. Isaev, M.A. Kwan, B.D. McKay, European Journal of Combinatorics 63 (2017) 6–25.

[Published Version] View | DOI | Download Published Version (ext.) | arXiv

2017 | Conference Paper | IST-REx-ID: 963 |

Timed network games with clocks
G. Avni, S. Guha, O. Kupferman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.

[Published Version] View | Files available | DOI