Scholar
Mario Grobler
Google Scholar ID: 2yEO5toAAAAJ
University of Bremen
Automata
Logic
Algorithms
Computational Complexity
Follow
Google Scholar
↗
Citations & Impact
All-time
Citations
53
H-index
4
i10-index
0
Publications
17
Co-authors
2
list available
Publications
5 items
Every Regular Language Has a Bipartite Cactus Automaton
2026
Cited
0
Towards Settling the Complexity of the Lettericity Problem
2026
Cited
0
Data reduction for directed feedback vertex set on graphs without long induced cycles
Conference on Current Trends in Theory and Practice of Informatics · 2023
Cited
0
Parikh Automata on Finite and Infinite Words
2023
Cited
6
History-deterministic Parikh Automata
International Conference on Concurrency Theory · 2022
Cited
6
Co-authors
1 total
Sebastian Siebertz
Universität Bremen, AG Theoretische Informatik
