| 2026 | ALENEX | Engineering Dominating Patterns: A Fine-grained Case Study. | Jonathan Dransfeld, Marvin Knnemann, Mirza Redzic, Marcus Wunderlich |
| 2026 | ICALP | When Does Sparsity Help for k-Independent Set in Hypergraphs and Other Boolean CSPs? | Timo Fritsch, Marvin Knnemann, Mirza Redzic, Julian Stie |
| 2026 | STOC | Classifying Identities: Subcubic Distributivity Checking and Hardness from Arithmetic Progression Detection. | Bartlomiej Dudek, Nick Fischer, Geri Gokaj, Ce Jin, Marvin Knnemann, Xiao Mao, Mirza Redzic |
| 2026 | WG | On the Relation Between Treewidth, Tree-Independence Number, and Tree-Chromatic Number of Graphs. | Alex Koutsoutis, Kilian Krause, Chun-Hung Liu, Mirza Redzic, Torsten Ueckerdt |
| 2025 | ESA | Fine-Grained Classification of Detecting Dominating Patterns. | Jonathan Dransfeld, Marvin Knnemann, Mirza Redzic |
| 2025 | ICALP | The Role of Regularity in (Hyper-)Clique Detection and Implications for Optimizing Boolean CSPs. | Nick Fischer, Marvin Knnemann, Mirza Redzic, Julian Stie |
| 2024 | SODA | The Effect of Sparsity on | Nick Fischer, Marvin Knnemann, Mirza Redzic |