8 citations · 66 across the 52 of their papers we have counts for
8 papers · 1 filter
Data reduction for directed feedback vertex set on graphs without long induced cycles
Jona Dirks, Enna Gerhard, Mario Grobler +2
We study reduction rules for Directed Feedback Vertex Set (DFVS) on directed graphs without long cycles. A DFVS instance without cycles longer than naturally corresponds to an…
Parikh Automata on Finite and Infinite Words
Mario Grobler, Leif Sabellek, Sebastian Siebertz
We study Parikh automata on finite and infinite words. First we establish some results for Parikh automata on finite words. Following, we present several definitions of Parikh auto…
On Solution Discovery via Reconfiguration
Michael R. Fellows, Mario Grobler, Nicole Megow +5
The dynamics of real-world applications and systems require efficient methods for improving infeasible solutions or restoring corrupted ones by making modifications to the current…
Büchi-like characterizations for Parikh-recognizable omega-languages
Mario Grobler, Sebastian Siebertz
Büchi's theorem states that -regular languages are characterized as languages of the form , where and are regular languages. Parikh automata are…
First-Order Model Checking on Structurally Sparse Graph Classes
Jan Dreier, Nikolas Mählmann, Sebastian Siebertz
A class of graphs is structurally nowhere dense if it can be constructed from a nowhere dense class by a first-order transduction. Structurally nowhere dense classes vastly general…
Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes
Nicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis +2
Disjoint-paths logic, denoted +, extends first-order logic () with atomic predicates , expressing…