Mirza Redzic

Orcid: 0009-0001-7509-1686

According to our database1, Mirza Redzic authored at least 10 papers between 2022 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
When Does Sparsity Help for k-Independent Set in Hypergraphs and Other Boolean CSPs?
CoRR, May, 2026

Conditionally Tight Algorithms for Maximum k-Coverage and Partial k-Dominating Set via Arity-Reducing Hypercuts.
CoRR, January, 2026

Classifying Identities: Subcubic Distributivity Checking and Hardness from Arithmetic Progression Detection.
Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

Engineering Dominating Patterns: A Fine-grained Case Study.
Proceedings of the 28th Symposium on Algorithm Engineering and Experiments, 2026

2025
The Role of Regularity in (Hyper-)Clique Detection and Implications for Optimizing Boolean CSPs.
Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

Fine-Grained Classification of Detecting Dominating Patterns.
Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

2024
The Effect of Sparsity on <i>k</i>-Dominating Set and Related First-Order Graph Properties.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Fine-Grained Complexity of Multiple Domination and Dominating Patterns in Sparse Graphs.
Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

2023
The Effect of Sparsity on k-Dominating Set and Related First-Order Graph Properties.
CoRR, 2023

2022
Minimizing the Sombor Index among Trees with Fixed Degree Sequence.
CoRR, 2022


  Loading...