3 citations · 3 across the 2 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2026
Pairwise Reflection Symmetry in Generalized Latin Rectangles
Enrico Iurlano, Günther R. Raidl
Many combinatorial designs ask for equal distribution of given symbols across the entries of a matrix. The paramount examples are Latin squares, where each symbol from $\{1,\dots,n…
cs.DM2024
SAT-Based Search for Minwise Independent Families
Enrico Iurlano, Günther R. Raidl
Proposed for rapid document similarity estimation in web search engines, the celebrated property of minwise independence imposes highly symmetric constraints on a family $\mathcal{…
cs.DM2023★ 3 cited
Signed double Roman domination on cubic graphs
Enrico Iurlano, Tatjana Zec, Marko Djukanovic +1
The signed double Roman domination problem is a combinatorial optimization problem on a graph asking to assign a label from to each vertex feasibly, such that the…