The Maximum Label Propagation Algorithm on Sparse Random Graphs. - Charlotte Knierim; Johannes Lengler; Pascal Pfister; Ulysse Schaller; Angelika Steger (APPROX-RANDOM, 2019)

Improved Bounds on the Multicolor Ramsey Numbers of Paths and Even Cycles. - Charlotte Knierim; Pascal Su (Electron. J. Comb., 2019)

Note on Long Paths in Eulerian Digraphs. - Charlotte Knierim; Maxime Larcher; Anders Martinsson (Electron. J. Comb., 2021)

Long cycles, heavy cycles and cycle decompositions in digraphs. - Charlotte Knierim; Maxime Larcher; Anders Martinsson; Andreas Noever (J. Comb. Theory B, 2021)

Kr-factors in graphs with low independence number. - Charlotte Knierim; Pascal Su (J. Comb. Theory B, 2021)

Hat Guessing Numbers of Strongly Degenerate Graphs. - Charlotte Knierim; Anders Martinsson; Raphael Steiner (SIAM J. Discret. Math., 2023)

Reconstructibility of the K-count from n - 1 cards. - Charlotte Knierim; Anders Martinsson (Discret. Math., 2024)

Schur properties of randomly perturbed sets. - Shagnik Das; Charlotte Knierim; Patrick Morris 001 (Eur. J. Comb., 2024)