| Improved bounds on the multicolor Ramsey numbers of paths and even cycles C Knierim, P Su arXiv preprint arXiv:1801.04128, 2018 | 24 | 2018 |
| Kr-factors in graphs with low independence number C Knierim, P Su Journal of Combinatorial Theory, Series B 148, 60-83, 2021 | 14 | 2021 |
| Long cycles, heavy cycles and cycle decompositions in digraphs C Knierim, M Larcher, A Martinsson, A Noever Journal of Combinatorial Theory, Series B 148, 125-148, 2021 | 8 | 2021 |
| Schur properties of randomly perturbed sets S Das, C Knierim, P Morris European Journal of Combinatorics, 103843, 2023 | 4 | 2023 |
| Hat guessing numbers of strongly degenerate graphs C Knierim, A Martinsson, R Steiner SIAM Journal on Discrete Mathematics 37 (2), 1331-1347, 2023 | 4 | 2023 |
| The Maximum Label Propagation Algorithm onSparse Random Graphs C Knierim, J Lengler, P Pfister, U Schaller, A Steger Leibniz International Proceedings in Informatics (LIPIcs) 145, 58, 2019 | 2 | 2019 |
| Note on long paths in eulerian digraphs C Knierim, M Larcher, A Martinsson arXiv preprint arXiv:2103.05330, 2021 | 1 | 2021 |
| Schur’s theorem for randomly perturbed sets S Das, C Knierim, P Morris Extended Abstracts EuroComb 2021: European Conference on Combinatorics …, 2021 | 1 | 2021 |
| Reconstructibility of the Kr-count from n− 1 cards C Knierim, A Martinsson Discrete Mathematics 347 (6), 113950, 2024 | | 2024 |
| c Copyright American Mathematical Society 2024 C Knierim, A Martinsson, R Steiner SIAM J. Discrete Math 37 (2), 1331-1347, 2023 | | 2023 |
| On Partition Problems in Combinatorics C Knierim ETH Zurich, 2022 | | 2022 |
Anders MartinssonETH ZurichDirección de correo verificada de inf.ethz.ch
