8 papers
Pseudo-finiteness of arbitrary graphs of bounded shrub-depth
Abhisekh Sankaran
We consider classes of arbitrary (finite or infinite) graphs of bounded shrub-depth, specifically the classes of arbitrary graphs that have tree models of height…
Some classical model theoretic aspects of bounded shrub-depth classes
Abhisekh Sankaran
We consider classes of arbitrary (finite or infinite) graphs of bounded shrub-depth, specifically the class of -labeled arbitrary graphs whose underlying…
Extension Preservation in the Finite and Prefix Classes of First Order Logic
Anuj Dawar, Abhisekh Sankaran
It is well known that the classic Łoś-Tarski preservation theorem fails in the finite: there are first-order definable classes of finite structures closed under extensions which ar…
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…
Exact Crossing Number Parameterized by Vertex Cover
Petr Hliněný, Abhisekh Sankaran
We prove that the exact crossing number of a graph can be efficiently computed for simple graphs having bounded vertex cover. In more precise words, Crossing Number is in FPT when…
Revisiting the generalized Łoś-Tarski theorem
Abhisekh Sankaran
We present a new proof of the generalized Łoś-Tarski theorem () introduced in [1], over arbitrary structures. Instead of using -saturation as in [1], we constru…