| Uniform parsing for hyperedge replacement grammars H Björklund, F Drewes, P Ericson, F Starke Journal of Computer and System Sciences 118, 1-27, 2021 | 13 | 2021 |
| ASNP: A tame fragment of existential second-order logic M Bodirsky, S Knäuer, F Starke Beyond the Horizon of Computability: 16th Conference on Computability in …, 2020 | 12 | 2020 |
| Smooth digraphs modulo primitive positive constructability and cyclic loop conditions M Bodirsky, F Starke, A Vucaj International Journal of Algebra and Computation 31 (05), 929-967, 2021 | 9 | 2021 |
| Maximal digraphs with respect to primitive positive constructability M Bodirsky, F Starke Combinatorica 42 (Suppl 1), 997-1010, 2022 | 8 | 2022 |
| The smallest hard trees M Bodirsky, J Bulín, F Starke, M Wernthaler Constraints 28 (2), 105-137, 2023 | 4 | 2023 |
| On associative operations on commutative integral domains E Lehtonen, F Starke Semigroup Forum 100, 910-915, 2020 | 4 | 2020 |
| Smooth digraphs modulo primitive positive constructability M Bodirsky, F Starke, A Vucaj arXiv preprint arXiv:1906.05699, 2019 | 1 | 2019 |
| Symmetric Linear Arc Monadic Datalog and Gadget Reductions M Bodirsky, F Starke arXiv preprint arXiv:2407.04924, 2024 | | 2024 |
| Digraphs modulo primitive positive constructability F Starke arXiv preprint arXiv:2402.16729, 2024 | | 2024 |
| Maximal Digraphs With Respect to Primitive Positive Constructibility F Starke, M Bodirsky arXiv preprint arXiv:2103.08625, 2021 | | 2021 |
| Exploring the topological entropy of formal languages F Starke Theoretical Computer Science 849, 210-226, 2021 | | 2021 |
| Topological Entropy of Formal Languages. F Starke arXiv preprint arXiv:1801.07321, 2018 | | 2018 |
