Research output per year
Research output per year
Search results
-
2018
The method of hypergraph containers
Balogh, J., Morris, R. & Samotij, W., 2018, Invited Lectures. Sirakov, B., de Souza, P. N. & Viana, M. (eds.). World Scientific Publishing Co. Pte Ltd, p. 3077-3110 34 p. (Proceedings of the International Congress of Mathematicians, ICM 2018; vol. 4).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
22 Scopus citations -
2014
Smoothed analysis on connected graphs
Krivelevich, M., Reichman, D. & Samotij, W., 1 Sep 2014, Leibniz International Proceedings in Informatics, LIPIcs. Jansen, K., Rolim, J. D. P., Devanur, N. R. & Moore, C. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 810-825 16 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 28).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
1 Scopus citations -
2012
Expanders are universal for the class of all spanning trees
Johannsen, D., Krivelevich, M. & Samotij, W., 2012, Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012. p. 1539-1551 13 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
5 Scopus citations