On graphs of bounded degree that are far from being Hamiltonian. - Isolde Adler; Noleen Köhler (CoRR, 2020)

GSF-Locality Is Not Sufficient For Proximity-Oblivious Testing. - Isolde Adler; Noleen Köhler; Pan Peng 001 (CCC, 2021)

On Testability of First-Order Properties in Bounded-Degree Graphs. - Isolde Adler; Noleen Köhler; Pan Peng 001 (SODA, 2021)

Logical methods for property testing in the bounded degree model - Noleen Köhler (2021)

Twin-Width VIII: Delineation and Win-Wins. - Édouard Bonnet; Dibyayan Chakraborty; Eun Jung Kim 002; Noleen Köhler; Raul Lopes 001; Stéphan Thomassé (IPEC, 2022)

An explicit construction of graphs of bounded degree that are far from being Hamiltonian. - Isolde Adler; Noleen Köhler (Discret. Math. Theor. Comput. Sci., 2022)

Core Stability in Additively Separable Hedonic Games of Low Treewidth. - Tesshu Hanaka; Noleen Köhler; Michael Lampis (ISAAC, 2024)

On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing. - Isolde Adler; Noleen Köhler; Pan Peng 001 (SIAM J. Comput., 2024)

An Algorithmic Framework for Locally Constrained Homomorphisms. - Laurent Bulteau; Konrad K. Dabrowski; Noleen Köhler; Sebastian Ordyniak; Daniël Paulusma (SIAM J. Discret. Math., 2024)

Twin-Width One. - Jungho Ahn; Hugo Jacob 001; Noleen Köhler; Christophe Paul; Amadeus Reinald; Sebastian Wiederrecht (STACS, 2025)

CMSO-Transducing Tree-Like Graph Decompositions. - Rutger Campbell; Bruno Guillon; Mamadou Moustapha Kanté; Eun Jung Kim 002; Noleen Köhler (STACS, 2025)

Odd chromatic number of graph classes. - Rémy Belmonte; Ararat Harutyunyan; Noleen Köhler; Nikolaos Melissinos (J. Graph Theory, 2025)

Bounding Width on Graph Classes of Constant Diameter. - Konrad K. Dabrowski; Tala Eagling-Vose; Noleen Köhler; Sebastian Ordyniak; Daniël Paulusma (CoRR, 2025)

Bandwidth Parameterized by Cluster Vertex Deletion Number. - Tatsuya Gima; Eun Jung Kim 002; Noleen Köhler; Nikolaos Melissinos; Manolis Vasilakis (Algorithmica, 2025)