research
∙
02/13/2022
Pseudo-finiteness of arbitrary graphs of bounded shrub-depth
We consider classes of arbitrary (finite or infinite) graphs of bounded ...
share
research
∙
12/30/2021
Feferman-Vaught Decompositions for Prefix Classes of First Order Logic
The Feferman-Vaught theorem provides a way of evaluating a first order s...
research
∙
11/05/2020
MSO Undecidability for some Hereditary Classes of Unbounded Clique-Width
Seese's conjecture for finite graphs states that monadic second-order lo...
research
∙
10/12/2020
Some classical model theoretic aspects of bounded shrub-depth classes
We consider classes of arbitrary (finite or infinite) graphs of bounded ...
research
∙
07/10/2020
Extension Preservation in the Finite and Prefix Classes of First Order Logic
It is well known that the classic Łoś-Tarski preservation theorem fails ...
research
∙
04/05/2020
Clique-Width of Point Configurations
While structural width parameters (of the input) belong to the standard ...
research
∙
06/14/2019
Exact Crossing Number Parameterized by Vertex Cover
We prove that the exact crossing number of a graph can be efficiently co...
research
∙
11/15/2018
Revisiting the generalized Łoś-Tarski theorem
We present a new proof of the generalized Łoś-Tarski theorem (GLT(k)) in...
research
∙
11/02/2018