default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMirza Redzic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[c6]Jonathan Dransfeld, Marvin Künnemann, Mirza Redzic, Marcus Wunderlich:
Engineering Dominating Patterns: A Fine-grained Case Study. ALENEX 2026: 99-113- [c5]Bartlomiej Dudek, Nick Fischer, Geri Gokaj, Ce Jin, Marvin Künnemann, Xiao Mao, Mirza Redzic:
Classifying Identities: Subcubic Distributivity Checking and Hardness from Arithmetic Progression Detection. STOC 2026: 1453-1464 - [i9]Nick Fischer, Marvin Künnemann, Mirza Redzic:
Conditionally Tight Algorithms for Maximum k-Coverage and Partial k-Dominating Set via Arity-Reducing Hypercuts. CoRR abs/2601.16923 (2026) - [i8]Bartlomiej Dudek, Nick Fischer, Geri Gokaj, Ce Jin, Marvin Künnemann, Xiao Mao, Mirza Redzic:
Classifying Identities: Subcubic Distributivity Checking and Hardness from Arithmetic Progression Detection. CoRR abs/2603.28843 (2026) - [i7]Timo Fritsch, Marvin Künnemann, Mirza Redzic, Julian Stieß:
When Does Sparsity Help for k-Independent Set in Hypergraphs and Other Boolean CSPs? CoRR abs/2605.10778 (2026) - 2025
- [c4]Jonathan Dransfeld, Marvin Künnemann, Mirza Redzic:
Fine-Grained Classification of Detecting Dominating Patterns. ESA 2025: 98:1-98:15 - [c3]Nick Fischer, Marvin Künnemann, Mirza Redzic, Julian Stieß:
The Role of Regularity in (Hyper-)Clique Detection and Implications for Optimizing Boolean CSPs. ICALP 2025: 78:1-78:18 - [i6]Nick Fischer, Marvin Künnemann, Mirza Redzic, Julian Stieß:
The Role of Regularity in (Hyper-)Clique Detection and Implications for Optimizing Boolean CSPs. CoRR abs/2505.17314 (2025) - [i5]Jonathan Dransfeld, Marvin Künnemann, Mirza Redzic:
Fine-Grained Classification Of Detecting Dominating Patterns. CoRR abs/2509.22332 (2025) - [i4]Jonathan Dransfeld, Marvin Künnemann, Mirza Redzic, Marcus Wunderlich:
Engineering Dominating Patterns: A Fine-grained Case Study. CoRR abs/2510.12232 (2025) - 2024
- [c2]Marvin Künnemann, Mirza Redzic:
Fine-Grained Complexity of Multiple Domination and Dominating Patterns in Sparse Graphs. IPEC 2024: 9:1-9:18 - [c1]Nick Fischer, Marvin Künnemann, Mirza Redzic:
The Effect of Sparsity on k-Dominating Set and Related First-Order Graph Properties. SODA 2024: 4704-4727 - [i3]Marvin Künnemann, Mirza Redzic:
Fine-Grained Complexity of Multiple Domination and Dominating Patterns in Sparse Graphs. CoRR abs/2409.08037 (2024) - 2023
- [i2]Nick Fischer, Marvin Künnemann, Mirza Redzic:
The Effect of Sparsity on k-Dominating Set and Related First-Order Graph Properties. CoRR abs/2312.14593 (2023) - 2022
- [i1]Mirza Redzic:
Minimizing the Sombor Index among Trees with Fixed Degree Sequence. CoRR abs/2212.03959 (2022)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-06-10 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
