Eleni C. Akrida

33 papers A* 2B 4C 3Journal 16Unranked 7

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	A Deep Learning Approach for Paragraph-Level Paraphrase Generation for Plagiarism Detection. Neural Process. Lett. Arwa Al Saqaabi, Craig D. Stewart, Eleni C. Akrida, Alexandra I. Cristea
2025	—	`conf`	Multi-domain Evaluation of Auto-paraphrase Generation at Paragraph-Level: Insights for Education and Plagiarism Detection. ITS (2) Arwa Al Saqaabi, Craig D. Stewart, Eleni C. Akrida, Alexandra I. Cristea
2025	—	`conf`	Neurodivergence in Computing Education: Prevalence and Future Research Directions. Koli Calling Jessica Rose Hirst, Eleni C. Akrida, Steven Bradley
2024	—	`conf`	A Pedagogical Framework for Developing Abstraction Skills. ITiCSE-WGR Marjahan Begum, Julia Crossley, Filip Strömbäck, Eleni C. Akrida, Isaac Alpizar Chacon, Abigail Evans, Joshua B. Gross, Pontus Haglund, Violetta Lonati, Chandrika Satyavolu, Sverrir Thorgeirsson
2024	—	`conf`	Designing a Pedagogical Framework for Developing Abstraction Skills. ITiCSE (2) Marjahan Begum, Julia Crossley, Filip Strömbäck, Eleni C. Akrida, Isaac Alpizar Chacon, Abigail Evans, Joshua B. Gross, Pontus Haglund, Violetta Lonati, Chandrika Satyavolu, Sverrir Thorgeirsson
2024	—	`conf`	Paraphrase Generation and Identification at Paragraph-Level. ITS (2) Arwa Al Saqaabi, Craig D. Stewart, Eleni C. Akrida, Alexandra I. Cristea
2023	—	`ed.`	Computing Education Practice, CEP 2023, Durham, United Kingdom, 6 January 2023 CEP Eleni C. Akrida, Mark Zarb
2022	—	`conf`	A Paraphrase Identification Approach in Paragraph Length Texts. ICDM (Workshops) Arwa Al Saqaabi, Eleni C. Akrida, Alexandra I. Cristea, Craig D. Stewart
2022	B	`conf`	A Paraphrase Identification Approach in Paragraph length texts. EDM Arwa Al Saqaabi, Craig D. Stewart, Eleni C. Akrida, Alexandra I. Cristea
2022	—	`conf`	Narrowing and Stretching: Addressing the Challenge of Multi-track Programming. CEP Steven Bradley, Eleni C. Akrida
2021	J	`jnl`	Connected Subgraph Defense Games. Algorithmica Eleni C. Akrida, Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis
2021	J	`jnl`	The temporal explorer who returns to the base. J. Comput. Syst. Sci. Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Christoforos L. Raptopoulos
2020	J	`jnl`	How fast can we reach a target vertex in stochastic temporal graphs? J. Comput. Syst. Sci. Eleni C. Akrida, George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis, Viktor Zamaraev
2020	J	`jnl`	Matching in Stochastically Evolving Graphs. CoRR Eleni C. Akrida, Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
2020	J	`jnl`	Temporal vertex cover with a sliding time window. J. Comput. Syst. Sci. Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
2019	B	`conf`	Connected Subgraph Defense Games. SAGT Eleni C. Akrida, Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis
2019	J	`jnl`	Connected Subgraph Defense Games. CoRR Eleni C. Akrida, Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis
2019	A*	`conf`	How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs? ICALP Eleni C. Akrida, George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis, Viktor Zamaraev
2019	J	`jnl`	How fast can we reach a target vertex in stochastic temporal graphs? CoRR Eleni C. Akrida, George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis, Viktor Zamaraev
2019	J	`jnl`	On Verifying and Maintaining Connectivity of Interval Temporal Networks. Parallel Process. Lett. Eleni C. Akrida, Paul G. Spirakis
2019	J	`jnl`	Temporal flows in temporal networks. J. Comput. Syst. Sci. Eleni C. Akrida, Jurek Czyzowicz, Leszek Gasieniec, Lukasz Kuszner, Paul G. Spirakis
2019	C	`conf`	The Temporal Explorer Who Returns to the Base. CIAC Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis
2018	A*	`conf`	Temporal Vertex Cover with a Sliding Time Window. ICALP Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
2018	J	`jnl`	Temporal Vertex Cover with a Sliding Time Window. CoRR Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
2018	J	`jnl`	The temporal explorer who returns to the base. CoRR Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis
2017	C	`conf`	Temporal Flows in Temporal Networks. CIAC Eleni C. Akrida, Jurek Czyzowicz, Leszek Gasieniec, Lukasz Kuszner, Paul G. Spirakis
2017	J	`jnl`	The Complexity of Optimal Design of Temporally Connected Graphs. Theory Comput. Syst. Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis
2016	J	`jnl`	Ephemeral networks with random availability of links: The case of fast networks. J. Parallel Distributed Comput. Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis
2016	J	`jnl`	Flows in Temporal networks. CoRR Eleni C. Akrida, Jurek Czyzowicz, Leszek Gasieniec, Lukasz Kuszner, Paul G. Spirakis
2015	J	`jnl`	Designing and Testing Temporally Connected Graphs. CoRR Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis
2015	B	`conf`	On Temporally Connected Graphs of Small Cost. WAOA Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis
2015	C	`conf`	On Verifying and Maintaining Connectivity of Interval Temporal Networks. ALGOSENSORS Eleni C. Akrida, Paul G. Spirakis
2014	B	`conf`	Ephemeral networks with random availability of links: diameter and connectivity. SPAA Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis

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.