1 citations · 3 across the 8 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.DS2024
Kernelization Complexity of Solution Discovery Problems
Mario Grobler, Stephanie Maaz, Amer E. Mouawad +3
In the solution discovery variant of a vertex (edge) subset problem on graphs, we are given an initial configuration of tokens on the vertices (edges) of an input graph tog…
cs.FL2024
Deterministic Parikh automata on infinite words
Mario Grobler, Sebastian Siebertz
Various variants of Parikh automata on infinite words have recently been introduced in the literature. However, with some exceptions only their non-deterministic versions have been…