research
∙
06/20/2022
Learning from Positive and Negative Examples: New Proof for Binary Alphabets
One of the most fundamental problems in computational learning theory is...
share
research
∙
05/23/2022
From Width-Based Model Checking to Width-Based Automated Theorem Proving
In the field of parameterized complexity theory, the study of graph widt...
research
∙
08/29/2021
Second-Order Finite Automata
Traditionally, finite automata theory has been used as a framework for t...
research
∙
05/19/2021
Diversity in Kemeny Rank Aggregation: A Parameterized Approach
In its most traditional setting, the main concern of optimization theory...
research
∙
04/21/2021
On the Width of Regular Classes of Finite Structures
In this work, we introduce the notion of decisional width of a finite re...
research
∙
01/15/2020
Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach
It can be shown that each permutation group G S_n can be embedded, in a...
research
∙
01/03/2020
On Supergraphs Satisfying CMSO Properties
Let CMSO denote the counting monadic second order logic of graphs. We gi...
research
∙
03/18/2019
