Felicia Lucke - RankMe

29 papers B 5C 1Journal 23

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs. Algorithmica Felicia Lucke, Ali Momeni, Daniël Paulusma, Siani Smith
2026	J	`jnl`	Optimal b-Colourings and Fall Colourings in H-Free Graphs. CoRR Jungho Ahn, Tala Eagling-Vose, Felicia Lucke, David F. Manlove, Fabricio Mendoza, Daniël Paulusma
2026	J	`jnl`	Steiner Forest for CoRR Tala Eagling-Vose, David C. Kutner, Felicia Lucke, Dániel Marx, Barnaby Martin, Daniël Paulusma, Erik Jan van Leeuwen
2025	J	`jnl`	Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification. CoRR Tala Eagling-Vose, Jorik Jooken, Felicia Lucke, Barnaby Martin, Daniël Paulusma
2025	J	`jnl`	Finding Minimum Matching Cuts in CoRR Felicia Lucke, Joseph Marchand, Jannik Olbrich
2025	B	`conf`	Finding d-Cuts in Claw-Free Graphs. ISAAC Jungho Ahn, Tala Eagling-Vose, Felicia Lucke, Daniël Paulusma, Siani Smith
2025	J	`jnl`	Finding d-Cuts in Claw-free Graphs. CoRR Jungho Ahn, Tala Eagling-Vose, Felicia Lucke, Daniël Paulusma, Siani Smith
2025	J	`jnl`	Matching Cut and Variants on Bipartite Graphs of Bounded Radius and Diameter. CoRR Felicia Lucke
2025	J	`jnl`	Matching Cuts in Graphs of High Girth and H-Free Graphs. Algorithmica Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries
2025	J	`jnl`	Matching cut and variants on bipartite graphs of bounded radius and diameter. Theor. Comput. Sci. Felicia Lucke
2024	J	`jnl`	Dichotomies for Maximum Matching Cut: H-freeness, bounded diameter, bounded radius. Theor. Comput. Sci. Felicia Lucke, Daniël Paulusma, Bernard Ries
2024	J	`jnl`	Finding CoRR Felicia Lucke, Ali Momeni, Daniël Paulusma, Siani Smith
2024	B	`conf`	Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs. WG Felicia Lucke, Ali Momeni, Daniël Paulusma, Siani Smith
2024	J	`jnl`	On blockers and transversals of maximum independent sets in co-comparability graphs. Discret. Appl. Math. Felicia Lucke, Bernard Ries
2024	J	`jnl`	Reducing Graph Parameters by Contractions and Deletions. Algorithmica Felicia Lucke, Felix Mann
2023	B	`conf`	Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius. MFCS Felicia Lucke, Daniël Paulusma, Bernard Ries
2023	J	`jnl`	Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius. CoRR Felicia Lucke, Daniël Paulusma, Bernard Ries
2023	J	`jnl`	Finding Matching Cuts in H-Free Graphs. Algorithmica Felicia Lucke, Daniël Paulusma, Bernard Ries
2023	B	`conf`	Matching Cuts in Graphs of High Girth and H-Free Graphs. ISAAC Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries
2023	J	`jnl`	Maximizing Matching Cuts. CoRR Van Bang Le, Felicia Lucke, Daniël Paulusma, Bernard Ries
2023	J	`jnl`	On Blockers and Transversals of Maximum Independent Sets in Co-Comparability Graphs. CoRR Felicia Lucke, Bernard Ries
2022	B	`conf`	Finding Matching Cuts in H-Free Graphs. ISAAC Felicia Lucke, Daniël Paulusma, Bernard Ries
2022	J	`jnl`	Finding Matching Cuts in H-Free Graphs. CoRR Felicia Lucke, Daniël Paulusma, Bernard Ries
2022	J	`jnl`	New Hardness Results for (Perfect) Matching Cut and Disconnected Perfect Matching. CoRR Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries
2022	J	`jnl`	On The Complexity of Matching Cut for Graphs of Bounded Radius and H-Free Graphs. CoRR Felicia Lucke, Daniël Paulusma, Bernard Ries
2022	J	`jnl`	On the complexity of matching cut for graphs of bounded radius and Theor. Comput. Sci. Felicia Lucke, Daniël Paulusma, Bernard Ries
2022	J	`jnl`	Reducing Graph Parameters by Contractions and Deletions. CoRR Felicia Lucke, Felix Mann
2022	C	`conf`	Using Edge Contractions and Vertex Deletions to Reduce the Independence Number and the Clique Number. IWOCA Felicia Lucke, Felix Mann
2022	J	`jnl`	Using Edge Contractions and Vertex Deletions to Reduce the Independence Number and the Clique Number. CoRR Felicia Lucke, Felix Mann

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.