Adam Zsolt Wagner

22 papers A* 1Journal 21

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Perfect proper edge colorings of regular bipartite graphs with rainbow C4-s. Discret. Math. András Gyárfás, Gábor N. Sárközy, Adam Zsolt Wagner
2025	J	`jnl`	Advancing Geometry with AI: Multi-agent Generation of Polytopes. CoRR Grzegorz Swirszcz, Adam Zsolt Wagner, Geordie Williamson, Sam Blackwell, Bogdan Georgiev, Alex Davies, S. M. Ali Eslami, Sébastien Racanière, Theophane Weber, Pushmeet Kohli
2025	J	`jnl`	AlphaEvolve: A coding agent for scientific and algorithmic discovery. CoRR Alexander Novikov, Ngân Vu, Marvin Eisenberger, Emilien Dupont, Po-Sen Huang, Adam Zsolt Wagner, Sergey Shirobokov, Borislav Kozlovskii, Francisco J. R. Ruiz, Abbas Mehrabian, M. Pawan Kumar, Abigail See, Swarat Chaudhuri, George Holland, Alex Davies, Sebastian Nowozin, Pushmeet Kohli, Matej Balog
2025	J	`jnl`	Drums of high width. CoRR Alex Davies, Prateek Gupta, Sébastien Racanière, Grzegorz Swirszcz, Adam Zsolt Wagner, Theophane Weber, Geordie Williamson
2025	J	`jnl`	Mathematical exploration and discovery at scale. CoRR Bogdan Georgiev, Javier Gómez-Serrano, Terence Tao, Adam Zsolt Wagner
2024	J	`jnl`	A Note on Small Percolating Sets on Hypercubes via Generative AI. CoRR Gergely Bérczi, Adam Zsolt Wagner
2024	A*	`conf`	Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search. IJCAI Abbas Mehrabian, Ankit Anand, Hyunjik Kim, Nicolas Sonnerat, Matej Balog, Gheorghe Comanici, Tudor Berariu, Andrew Lee, Anian Ruoss, Anna Bulanova, Daniel Toyama, Sam Blackwell, Bernardino Romera-Paredes, Petar Velickovic, Laurent Orseau, Joonkyung Lee, Anurag Murty Naredla, Doina Precup, Adam Zsolt Wagner
2024	J	`jnl`	Intersecting families of sets are typically trivial. J. Comb. Theory B József Balogh, Ramon Garcia, Lina Li, Adam Zsolt Wagner
2024	J	`jnl`	PatternBoost: Constructions in Mathematics with a Little Help from AI. CoRR François Charton, Jordan S. Ellenberg, Adam Zsolt Wagner, Geordie Williamson
2023	J	`jnl`	Balanced Edge-Colorings Avoiding Rainbow Cliques of Size Four. Electron. J. Comb. Felix Christian Clemen, Adam Zsolt Wagner
2023	J	`jnl`	Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search. CoRR Abbas Mehrabian, Ankit Anand, Hyunjik Kim, Nicolas Sonnerat, Matej Balog, Gheorghe Comanici, Tudor Berariu, Andrew Lee, Anian Ruoss, Anna Bulanova, Daniel Toyama, Sam Blackwell, Bernardino Romera-Paredes, Petar Velickovic, Laurent Orseau, Joonkyung Lee, Anurag Murty Naredla, Doina Precup, Adam Zsolt Wagner
2022	J	`jnl`	Infinite Sperner's theorem. J. Comb. Theory A Benny Sudakov, István Tomon, Adam Zsolt Wagner
2022	J	`jnl`	Uniform chain decompositions and applications. Random Struct. Algorithms Benny Sudakov, István Tomon, Adam Zsolt Wagner
2021	J	`jnl`	Constructions in combinatorics via neural networks. CoRR Adam Zsolt Wagner
2020	J	`jnl`	Bounded Degree Spanners of the Hypercube. Electron. J. Comb. Rajko Nenadov, Mehtab Sawhney, Benny Sudakov, Adam Zsolt Wagner
2020	J	`jnl`	Completion and deficiency problems. J. Comb. Theory B Rajko Nenadov, Benny Sudakov, Adam Zsolt Wagner
2020	J	`jnl`	Families in posets minimizing the number of comparable pairs. J. Graph Theory József Balogh, Sárka Petrícková, Adam Zsolt Wagner
2020	J	`jnl`	Refuting conjectures in extremal combinatorics via linear programming. J. Comb. Theory A Adam Zsolt Wagner
2020	J	`jnl`	The Ramsey Number of Fano Plane Versus Tight Path. Electron. J. Comb. József Balogh, Felix Christian Clemen, Jozef Skokan, Adam Zsolt Wagner
2019	J	`jnl`	Monochromatic Hilbert Cubes and Arithmetic Progressions. Electron. J. Comb. József Balogh, Mikhail Lavrov, George Shakan, Adam Zsolt Wagner
2019	J	`jnl`	Partition problems in high dimensional boxes. J. Comb. Theory A Matija Bucic, Bernard Lidický, Jason Long, Adam Zsolt Wagner
2019	J	`jnl`	The largest projective cube-free subsets of Z2n. Eur. J. Comb. Jason Long, Adam Zsolt Wagner

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.

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.