2 papers
cs.DS2026
On the Complexity of Fundamental Problems for DAG-Compressed Graphs
Florian Chudigiewitsch, Till Tantau, Felix Winkler
A DAG compression of a (typically dense) graph is a simple data structure that stores how vertex clusters are connected, where the clusters are described indirectly as sets of reac…
cs.LO2026
The Descriptive Complexity of Relation Modification Problems
Florian Chudigiewitsch, Marlene Gründel, Christian Komusiewicz +2
A relation modification problem gets a logical structure and a natural number k as input and asks whether k modifications of the structure suffice to make it satisfy a predefined p…