activity
20172023
most citedTwin-width and Limits of Tractability of FO Model Checking on Geometric Graphs

1 citations · 1 across the 2 of their papers we have counts for

collaborators
Showing cs.LOShow all

2 papers · 1 filter

cs.LO2020

Clique-Width of Point Configurations

Onur Çağırıcı, Petr Hliněný, Filip Pokrývka +1

While structural width parameters (of the input) belong to the standard toolbox of graph algorithms, it is not the usual case in computational geometry. As a case study we propose…

cs.LO2017

FO model checking of geometric graphs

Petr Hliněný, Filip Pokrývka, Bodhayan Roy

Over the past two decades the main focus of research into first-order (FO) model checking algorithms has been on sparse relational structures - culminating in the FPT algorithm by…