research
∙
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...
share
research
∙
03/06/2023
Odd Chromatic Number of Graph Classes
A graph is called odd (respectively, even) if every vertex has odd (resp...
research
∙
04/01/2022
Twin-width VIII: delineation and win-wins
We introduce the notion of delineation. A graph class 𝒞 is said delineat...
research
∙
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...
research
∙
05/18/2021
GSF-locality is not sufficient for proximity-oblivious testing
In Property Testing, proximity-oblivious testers (POTs) form a class of ...
research
∙
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...
research
∙
08/13/2020