Noleen Köhler

According to our database, Noleen Köhler authored at least 11 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

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

On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing.

Isolde Adler, Noleen Köhler, Pan Peng

SIAM J. Comput., 2024

Core Stability in Additively Separable Hedonic Games of Low Treewidth.

Tesshu Hanaka, Noleen Köhler, Michael Lampis

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

2023

Odd Chromatic Number of Graph Classes.

Rémy Belmonte, Ararat Harutyunyan, Noleen Köhler, Nikolaos Melissinos

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Bandwidth Parameterized by Cluster Vertex Deletion Number.

Tatsuya Gima, Eun Jung Kim, Noleen Köhler, Nikolaos Melissinos, Manolis Vasilakis

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

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

Twin-Width VIII: Delineation and Win-Wins.

Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim, Noleen Köhler, Raul Lopes, Stéphan Thomassé

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

2021

Logical methods for property testing in the bounded degree model

Noleen Köhler

PhD thesis, 2021

On Testability of First-Order Properties in Bounded-Degree Graphs.

Isolde Adler, Noleen Köhler, Pan Peng

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

GSF-Locality Is Not Sufficient For Proximity-Oblivious Testing.

Isolde Adler, Noleen Köhler, Pan Peng

Proceedings of the 36th Computational Complexity Conference, 2021

2020

On graphs of bounded degree that are far from being Hamiltonian.

Isolde Adler, Noleen Köhler

CoRR, 2020