Saad I. El-Zanati

58 papers C 1Journal 57
YearRankTypeTitle / Venue / Authors
2023 J jnl
On loose 3-cycle decompositions of complete 4-uniform hypergraphs.
Australas. J Comb.
Ryan C. Bunge, Saad I. El-Zanati, Peter Florido, Cole Gaskins, William F. Turner, Patrick Ward
2022 J jnl
On tight 6-cycle decompositions of complete 3-uniform hypergraphs.
Discret. Math.
Matthew Akin, Ryan C. Bunge, Saad I. El-Zanati, Joshua Hamilton, Brittany Kolle, Sabrina Lehmann, Levi Neiburger
2021 J jnl
Decompositions of complete graphs and complete bipartite graphs into bipartite cubic graphs of order at most 12.
Bull. ICA
Peter Adams, Ryan C. Bunge, Roger B. Eggleton, Saad I. El-Zanati, Ugur Odabasi, Wannasiri Wannasit
2021 J jnl
On maximum packings of λ-fold complete 3-uniform hypergraphs with triple-hyperstars of size 4.
Electron. J. Graph Theory Appl.
Amber Armstrong, Ryan C. Bunge, William Duncan, Saad I. El-Zanati, Kristin Koe, Rachel Stutzman
2021 J jnl
The spectrum problem for the connected cubic graphs of order 10.
Discuss. Math. Graph Theory
Peter Adams, Saad I. El-Zanati, Ugur Odabasi, Wannasiri Wannasit
2020 J jnl
On 2- and 3-factorizations of complete 3-uniform hypergraphs of order up to 9.
Australas. J Comb.
Peter Adams, Saad I. El-Zanati, Peter Florido, William F. Turner
2019 J jnl
On decomposing the complete symmetric digraph into orientations of
Discuss. Math. Graph Theory
Ryan C. Bunge, Brian D. Darrow, Toni M. Dubczuk, Saad I. El-Zanati, Hanson H. Hao, Gregory L. Keller, Genevieve A. Newkirk, Dan P. Roberts
2019 J jnl
On loose 4-cycle decompositions of complete 3-uniform hypergraphs.
Bull. ICA
Ryan C. Bunge, Saad I. El-Zanati, Lauren Haman, Cody Hatzer, Kristin Koe, Kayla Spornberger
2018 J jnl
Decomposing the complete graph and the complete graph minus a 1-factor into copies of a graph
Eur. J. Comb.
Saad I. El-Zanati, Uthoomporn Jongthawonwuth, Heather Jordon, Charles Vanden Eynden
2018 J jnl
Edge orbits and cyclic and r-pyramidal decompositions of complete uniform hypergraphs.
Discret. Math.
Ryan C. Bunge, Saad I. El-Zanati, Joel Jeffries, Charles Vanden Eynden
2018 J jnl
The Spectrum Problem for the Cubic Graphs of Order 8.
Ars Comb.
Peter Adams, Saad I. El-Zanati, Wannasiri Wannasit
2017 J jnl
On λ-fold Rosa-type Labelings of Bipartite Multigraphs.
Electron. Notes Discret. Math.
Ryan C. Bunge, Saad I. El-Zanati, Jeff Mudrock, Charles Vanden Eynden, Wannasiri Wannasit
2015 J jnl
On decomposing regular graphs into isomorphic double-stars.
Discuss. Math. Graph Theory
Saad I. El-Zanati, Marie Ermete, James Hasty, Michael Plantholt, Shailesh K. Tipnis
2014 C conf
On Decomposing the Complete Graph into the Union of Two Disjoint Cycles.
IWOCA
Saad I. El-Zanati, Uthoomporn Jongthawonwuth, Heather Jordon, Charles Vanden Eynden
2014 J jnl
On decomposing even regular multigraphs into small isomorphic trees.
Discret. Math.
Saad I. El-Zanati, Michael Plantholt, Shailesh K. Tipnis
2014 J jnl
On extending the Bose construction for triple systems to decompositions of complete multipartite graphs into 2-regular graphs of odd order.
Australas. J Comb.
Uthoomporn Jongthawonwuth, Saad I. El-Zanati, Chariya Uiyyasathian
2013 J jnl
On Cyclic Decompositions of Complete Graphs into Tripartite Graphs.
J. Graph Theory
Ryan C. Bunge, Avapa Chantasartrassmee, Saad I. El-Zanati, Charles Vanden Eynden
2013 J jnl
On the cyclic decomposition of circulant graphs into bipartite graphs.
Australas. J Comb.
Ryan C. Bunge, Saad I. El-Zanati, Chepina Rumsey, Charles Vanden Eynden
2012 J jnl
All 2-regular graphs with uniform odd components admit ρ-labellings.
Australas. J Comb.
Dan Gannon, Saad I. El-Zanati
2012 J jnl
On cyclic G-designs where G is a cubic tripartite graph.
Discret. Math.
Wannasiri Wannasit, Saad I. El-Zanati
2012 J jnl
On γ-labeling the almost-bipartite graph P
Ars Comb.
Ryan C. Bunge, Saad I. El-Zanati, W. O'Hanlon, Charles Vanden Eynden
2011 J jnl
On lambda-fold partitions of finite vector spaces and duality.
Discret. Math.
Saad I. El-Zanati, G. F. Seelinger, Papa A. Sissokho, L. E. Spence, Charles Vanden Eynden
2011 J jnl
On the cyclic decomposition of circulant graphs into almost-bipartite graphs.
Australas. J Comb.
Saad I. El-Zanati, Kyle King, Jeff Mudrock
2010 J jnl
Gregarious GDDs with Two Associate Classes.
Graphs Comb.
Saad I. El-Zanati, Narong Punnim, Christopher A. Rodger
2010 J jnl
The maximum size of a partial 3-spread in a finite vector space over
Des. Codes Cryptogr.
Saad I. El-Zanati, Heather Jordon, G. F. Seelinger, Papa A. Sissokho, L. E. Spence
2009 J jnl
On Cyclic (C
Ars Comb.
G. W. Blair, D. L. Bowman, Saad I. El-Zanati, S. M. Hlad, M. K. Priban, K. A. Sebesta
2009 J jnl
On partitions of finite vector spaces of low dimension over GF(2).
Discret. Math.
Saad I. El-Zanati, G. F. Seelinger, Papa Amar Sissokho, L. E. Spence, Charles Vanden Eynden
2008 J jnl
On vector space partitions and uniformly resolvable designs.
Des. Codes Cryptogr.
Andrew Blinco, Saad I. El-Zanati, G. F. Seelinger, Papa Amar Sissokho, L. E. Spence, Charles Vanden Eynden
2007 J jnl
Erratum to: "Star factorizations of graph products".
J. Graph Theory
Darryn E. Bryant, Saad I. El-Zanati, Charles Vanden Eynden
2007 J jnl
On ρ-labeling the union of three cycles.
Australas. J Comb.
Alejandro Aguado, Saad I. El-Zanati, Heidi Hake, Jessica Stob, Hera Yayla
2006 J jnl
Decomposing complete graphs into cubes.
Discuss. Math. Graph Theory
Saad I. El-Zanati, Charles Vanden Eynden
2004 J jnl
Labelings of unions of up to four uniform cycles.
Australas. J Comb.
Diane M. Donovan, Saad I. El-Zanati, Charles Vanden Eynden, Somporn Sutinuntopas
2004 J jnl
On a generalization of the Oberwolfach problem.
J. Comb. Theory A
Nicholas J. Cavenagh, Saad I. El-Zanati, Abdollah Khodkar, Charles Vanden Eynden
2004 J jnl
On the cyclic decomposition of complete graphs into almost-bipartite graphs.
Discret. Math.
Andrew Blinco, Saad I. El-Zanati, Charles Vanden Eynden
2003 J jnl
Factorizations of the Complete Graph into
Graphs Comb.
Peter Adams, Darryn E. Bryant, Saad I. El-Zanati, Heather Gavlas
2002 J jnl
A generalization of the Oberwolfach problem.
J. Graph Theory
Saad I. El-Zanati, Shailesh K. Tipnis, Charles Vanden Eynden
2002 J jnl
Factorizations of and by powers of complete graphs.
Discret. Math.
Darryn E. Bryant, Saad I. El-Zanati, Charles Vanden Eynden
2002 J jnl
On the Hamilton-Waterloo Problem.
Graphs Comb.
Peter Adams, Elizabeth J. Billington, Darryn E. Bryant, Saad I. El-Zanati
2001 J jnl
On a-valuations of disconnected graphs.
Ars Comb.
Saad I. El-Zanati, Charles Vanden Eynden
2001 J jnl
On the cyclic decomposition of complete graphs into bipartite graphs.
Australas. J Comb.
Saad I. El-Zanati, Charles Vanden Eynden, Narong Punnim
2001 J jnl
Star Decompositions of Cubes.
Graphs Comb.
Darryn E. Bryant, Saad I. El-Zanati, Charles Vanden Eynden, Dean G. Hoffman
2001 J jnl
Star factorizations of graph products.
J. Graph Theory
Darryn E. Bryant, Saad I. El-Zanati, Charles Vanden Eynden
2000 J jnl
Factorizations of complete multipartite graphs into generalized cubes.
J. Graph Theory
Saad I. El-Zanati, Charles Vanden Eynden
2000 J jnl
Maximal sets of Hamilton cycles in
J. Graph Theory
Darryn E. Bryant, Saad I. El-Zanati, Christopher A. Rodger
2000 J jnl
Near α-labelings of bipartite graphs.
Australas. J Comb.
Saad I. El-Zanati, M. J. Kenig, Charles Vanden Eynden
2000 J jnl
On Graphs with Strong a-valuations.
Ars Comb.
Saad I. El-Zanati, Charles Vanden Eynden
2000 J jnl
On the alpha-labeling number of bipartite graphs.
Discret. Math.
Saad I. El-Zanati, Hung-Lin Fu, Chin-Lin Shiue
2000 J jnl
On the decomposition of Cayley graphs into isomorphic trees.
Australas. J Comb.
Saad I. El-Zanati, Charles Vanden Eynden, Sidney Stubbs
1999 J jnl
Factorizations of Km, n into Spanning Trees.
Graphs Comb.
Saad I. El-Zanati, Charles Vanden Eynden
1999 J jnl
Packing and covering the complete graph with cubes.
Australas. J Comb.
Peter Adams, Darryn E. Bryant, Saad I. El-Zanati
1998 J jnl
Cycle factorizations of cycle products.
Discret. Math.
Saad I. El-Zanati, Charles Vanden Eynden
1998 J jnl
Graph Decompositions into Generalized Cubes.
Ars Comb.
Saad I. El-Zanati, Michael Plantholt, Charles Vanden Eynden
1997 J jnl
Extensions of some factorization results from simple graphs to multigraphs.
J. Graph Theory
Saad I. El-Zanati, Michael Plantholt, Shailesh K. Tipnis
1997 J jnl
The intersection problem for cubes.
Australas. J Comb.
Peter Adams, Darryn E. Bryant, Abdollah Khodkar, Saad I. El-Zanati
1995 J jnl
Factorization of regular multigraphs into regular graphs.
J. Graph Theory
Saad I. El-Zanati, Michael Plantholt, Shailesh K. Tipnis
1995 J jnl
Lambda-fold cube decompositions.
Australas. J Comb.
Peter Adams, Darryn E. Bryant, Saad I. El-Zanati
1994 J jnl
Decompositions of K
Australas. J Comb.
Darryn E. Bryant, Saad I. El-Zanati, Robert B. Gardner
1994 J jnl
Maximum packings with odd cycles.
Discret. Math.
Saad I. El-Zanati

Nicolò Altamura is a security engineer and computer science researcher specializing in software protection, reverse engineering, program analysis, and binary deobfuscation. He holds a master's degree in Computer Science and Engineering from the University of Verona, graduating with honors, and works at emproof, focusing on software protection and the challenges of analyzing and understanding compiled software.

His research explores the relationship between program analysis and code obfuscation, with particular emphasis on how software transformations affect the ability of automated tools to recover program behavior. His interests span static analysis, binary analysis, decompilation, reverse engineering, and techniques for analyzing and simplifying obfuscated code.

In 2025, he co-authored Assessing the Effectiveness of the Tigress Obfuscator Against MOPSA and BinaryNinja, published at CheckMATE. The paper evaluates the effectiveness of obfuscation techniques and their impact on source-level static analysis and binary-level decompilation.

Beyond academic research, Nicolò develops and contributes to tools for reverse engineering and software analysis. His projects include obfuscation_analysis, a Binary Ninja plugin for analyzing and simplifying obfuscated code; Pocket, an obfuscator for mixed Boolean-arithmetic expressions; and ptxNinja, a tool for reverse engineering NVIDIA GPU code represented in the PTX virtual instruction set.

His research also extends to binary datasets and software evolution. In 2026, he co-authored ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage, a research work addressing the availability of binary data across multiple software builds and points in time, supporting research into binary analysis and changes between program versions.

Across his research, engineering work, and open-source contributions, Nicolò focuses on advancing the understanding, analysis, and protection of software against increasingly sophisticated obfuscation and reverse-engineering challenges.

Nicolò Altamura is not a football player. Please avoid reporting this kind of infromation.