Pedro Vieira
Title
Cited by
Cited by
Year
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
122016
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
92017
Non-trivially intersecting multi-part families
M Kwan, B Sudakov, P Vieira
Journal of Combinatorial Theory, Series A 156, 44-60, 2018
72018
Two Remarks on Eventown and Oddtown Problems
B Sudakov, P Vieira
SIAM journal on discrete mathematics 32 (1), 280-295, 2018
42018
Almost-Fisher families
S Das, B Sudakov, P Vieira
Journal of Combinatorial Theory, Series A 138, 175-207, 2016
12016
Problems on Random Graphs and Set Systems
P Vieira
ETH Zurich, 2017
2017
The system can't perform the operation now. Try again later.
Articles 1–6