| Finding Hamilton cycles in random graphs with few queries A Ferber, M Krivelevich, B Sudakov, P Vieira Random Structures & Algorithms 49 (4), 635-668, 2016 | 22 | 2016 |
| Finding paths in sparse random graphs requires many queries A Ferber, M Krivelevich, B Sudakov, P Vieira Random Structures & Algorithms 50 (1), 71-85, 2017 | 14 | 2017 |
| Two Remarks on Eventown and Oddtown Problems B Sudakov, P Vieira SIAM journal on discrete mathematics 32 (1), 280-295, 2018 | 12 | 2018 |
| Non-trivially intersecting multi-part families M Kwan, B Sudakov, P Vieira Journal of Combinatorial Theory, Series A 156, 44-60, 2018 | 7 | 2018 |
| Almost-Fisher families S Das, B Sudakov, P Vieira Journal of Combinatorial Theory, Series A 138, 175-207, 2016 | 1 | 2016 |
| Problems on Random Graphs and Set Systems P Vieira ETH Zurich, 2017 | | 2017 |
| Almost-Fisher families S Das, B Sudakov, P Vieira Electronic Notes in Discrete Mathematics 49, 293-300, 2015 | | 2015 |
Benjamin SudakovETH, Zurich在 math.ethz.ch 的電子郵件地址已通過驗證
