Pedro Vieira

2016201720182019202020212022202320241 6 2 5 10 10 7 8 8

Public access

5 articles

0 articles

available

not available

Based on funding mandates

Benjamin SudakovETH, ZurichVerified email at math.ethz.ch
asaf ferberAssistant Professor, UCIVerified email at uci.edu
Michael KrivelevichProfessor of Mathematics, Tel Aviv UniversityVerified email at post.tau.ac.il
Matthew KwanIST AustriaVerified email at ist.ac.at
Shagnik DasAssistant Professor, National Taiwan UniversityVerified email at ntu.edu.tw

Pedro Vieira

ETH Zürich

Verified email at google.com


Title Sort by citations Sort by year Sort by 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	23	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	11	2018
Non-trivially intersecting multi-part families M Kwan, B Sudakov, P Vieira Journal of Combinatorial Theory, Series A 156, 44-60, 2018	8	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

The system can't perform the operation now. Try again later.

Articles 1–7

Citations per year