Generalised Knight's Tours. - Nina Kamcev (Electron. J. Comb., 2014)

Some Remarks on Rainbow Connectivity. - Nina Kamcev; Michael Krivelevich; Benny Sudakov (J. Graph Theory, 2016)

Bounded colorings of multipartite graphs and hypergraphs. - Nina Kamcev; Benny Sudakov; Jan Volec (Eur. J. Comb., 2017)

Anagram-free colorings of graphs. - Nina Kamcev; Tomasz Luczak 001; Benny Sudakov (Electron. Notes Discret. Math., 2017)

Anagram-Free Colourings of Graphs. - Nina Kamcev; Tomasz Luczak 001; Benny Sudakov (Comb. Probab. Comput., 2018)

The size Ramsey number of graphs with bounded treewidth. - Nina Kamcev; Anita Liebenau; David Wood; Liana Yepremyan (CoRR, 2019)

The Zero Forcing Number of Graphs. - Thomas Kalinowski; Nina Kamcev; Benny Sudakov (SIAM J. Discret. Math., 2019)

The Kőnig graph process. - Nina Kamcev; Michael Krivelevich; Natasha Morrison; Benny Sudakov (Random Struct. Algorithms, 2020)

The Size Ramsey Number of Graphs with Bounded Treewidth. - Nina Kamcev; Anita Liebenau; David R. Wood; Liana Yepremyan (SIAM J. Discret. Math., 2021)

Another Note on Intervals in the Hales-Jewett Theorem. - Nina Kamcev; Christoph Spiegel 002 (Electron. J. Comb., 2022)

Canonical colourings in random graphs. - Nina Kamcev; Mathias Schacht (LAGOS, 2023)

Properly Colored Hamilton Cycles in Dirac-Type Hypergraphs. - Sylwia Antoniuk; Nina Kamcev; Andrzej Rucinski 001 (Electron. J. Comb., 2023)

Increasing paths in random temporal graphs. - Nicolas Broutin; Nina Kamcev; Gábor Lugosi (CoRR, 2023)

Universal lower bound for community structure of sparse graphs. - Vilhelm Agdur; Nina Kamcev; Fiona Skerman (CoRR, 2023)

Unavoidable patterns in locally balanced colourings. - Nina Kamcev; Alp Müyesser (Comb. Probab. Comput., 2023)