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
∙
05/18/2021
GSF-locality is not sufficient for proximity-oblivious testing
In Property Testing, proximity-oblivious testers (POTs) form a class of ...
research
∙
01/15/2021
Towards Approximate Query Enumeration with Sublinear Preprocessing Time
This paper aims at providing extremely efficient algorithms for approxim...
research
∙
09/16/2020
Faster Property Testers in a Variation of the Bounded Degree Model
Property testing algorithms are highly efficient algorithms, that come w...
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
On Testability of First-Order Properties in Bounded-Degree Graphs
We study property testing of properties that are definable in first-orde...
research
∙
08/12/2020
On the tree-width of even-hole-free graphs
The class of all even-hole-free graphs has unbounded tree-width, as it c...
research
∙
01/14/2019