Dan McQuillan - RankMe

21 papers Journal 21

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Every even-regular Hamiltonian graph is vertex-magic. Discret. Math. Ian Gray, Dan McQuillan, James M. McQuillan
2025	J	`jnl`	Every even cycle of order at least 8 has a mirror labeling. Discret. Math. Jonathan Calzadillas, Dan McQuillan, James M. McQuillan
2023	J	`jnl`	Strong vertex-magic and super edge-magic total labelings of the disjoint union of a cycle with 3-cycles. Discret. Math. Dan McQuillan, James M. McQuillan
2023	J	`jnl`	Vertex-magic trees with Bull. ICA Jonathan Calzadillas, Dan McQuillan
2022	J	`jnl`	Convex drawings of the complete graph: topology meets geometry. Ars Math. Contemp. Alan Arroyo, Dan McQuillan, R. Bruce Richter, Gelasio Salazar
2021	J	`jnl`	Drawings of complete graphs in the projective plane. J. Graph Theory Alan Arroyo, Dan McQuillan, R. Bruce Richter, Gelasio Salazar, Matthew Sullivan
2020	J	`jnl`	Towards generalizing MacDougall's conjecture on vertex-magic total labelings. Discret. Math. Keith Gibson, Artmiz Golkaramnay, Dan McQuillan
2018	J	`jnl`	Bishellable drawings of K SIAM J. Discret. Math. Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Dan McQuillan, Bojan Mohar, Petra Mutzel, Pedro Ramos, R. Bruce Richter, Birgit Vogtenhuber
2018	J	`jnl`	Levi's Lemma, pseudolinear drawings of Kn, and empty triangles. J. Graph Theory Alan Arroyo, Dan McQuillan, R. Bruce Richter, Gelasio Salazar
2018	J	`jnl`	Strong vertex-magic and edge-magic labelings of 2-regular graphs of odd order using Kotzig completion. Discret. Math. Dan McQuillan, James M. McQuillan
2017	J	`jnl`	Drawings of K Australas. J Comb. Alan Arroyo, Dan McQuillan, R. Bruce Richter, Gelasio Salazar
2016	J	`jnl`	Algorithmic paranoia and the convivial alternative. Big Data Soc. Dan McQuillan
2016	J	`jnl`	On the Crossing Number of Kn without Computer Assistance. J. Graph Theory Dan McQuillan, R. Bruce Richter
2015	J	`jnl`	Bishellable drawings of K CoRR Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Dan McQuillan, Bojan Mohar, Petra Mutzel, Pedro Ramos, R. Bruce Richter, Birgit Vogtenhuber
2015	J	`jnl`	On the crossing number of K J. Comb. Theory B Dan McQuillan, Shengjun Pan, R. Bruce Richter
2011	J	`jnl`	Vertex-magic total labelings of even complete graphs. Discret. Math. Addie Armstrong, Dan McQuillan
2010	J	`jnl`	A Parity Theorem for Drawings of Complete and Complete Bipartite Graphs. Am. Math. Mon. Dan McQuillan, R. Bruce Richter
2009	J	`jnl`	A conjecture on strong magic labelings of 2-regular graphs. Discret. Math. Jeremy Holden, Dan McQuillan, James M. McQuillan
2009	J	`jnl`	Edge-magic and Vertex-magic Total Labelings of Certain Cycles. Ars Comb. Dan McQuillan
2009	J	`jnl`	Magic labelings of triangles. Discret. Math. Dan McQuillan, James M. McQuillan
1994	J	`jnl`	On 3-regular graphs having crossing number at least 2. J. Graph Theory Dan McQuillan, R. Bruce Richter

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.