Noleen Köhler | DeepAI

AI Chat

Featured Co-authors

Daniël Paulusma
59 publications
Édouard Bonnet
45 publications
Sebastian Ordyniak
31 publications
Stéphan Thomassé
31 publications
Eun Jung Kim
29 publications
Pan Peng
26 publications
Konrad K. Dabrowski
14 publications
Dibyayan Chakraborty
13 publications
Rémy Belmonte
10 publications
Nikolaos Melissinos
9 publications
Laurent Bulteau
9 publications

∙ 04/07/2023

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

We study property testing of properties that are definable in first-orde...

0 Isolde Adler, et al. ∙

∙ 03/06/2023

Odd Chromatic Number of Graph Classes

A graph is called odd (respectively, even) if every vertex has odd (resp...

0 Rémy Belmonte, et al. ∙

∙ 04/01/2022

Twin-width VIII: delineation and win-wins

We introduce the notion of delineation. A graph class 𝒞 is said delineat...

0 Édouard Bonnet, et al. ∙

∙ 01/27/2022

An Algorithmic Framework for Locally Constrained Homomorphisms

A homomorphism f from a guest graph G to a host graph H is locally bijec...

0 Laurent Bulteau, et al. ∙

∙ 05/18/2021

GSF-locality is not sufficient for proximity-oblivious testing

In Property Testing, proximity-oblivious testers (POTs) form a class of ...

0 Isolde Adler, et al. ∙

∙ 08/13/2020

On graphs of bounded degree that are far from being Hamiltonian

Hamiltonian cycles in graphs were first studied in the 1850s. Since then...

0 Isolde Adler, et al. ∙

∙ 08/13/2020

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

We study property testing of properties that are definable in first-orde...

0 Isolde Adler, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world