Laura Merker - RankMe

22 papers A* 2A 5B 1Journal 14

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Product Structure and Treewidth of Hyperbolic Uniform Disk Graphs. CoRR Thomas Bläsius, Emil Dohse, Deborah Haun, Laura Merker
2025	J	`jnl`	Directed Acyclic Outerplanar Graphs Have Constant Stack Number. TheoretiCS Paul Jungeblut, Laura Merker, Torsten Ueckerdt
2025	A	`conf`	Forbidden Patterns in Mixed Linear Layouts. STACS Deborah Haun, Laura Merker, Sergey Pupyrev
2024	J	`jnl`	Forbidden Patterns in Mixed Linear Layouts. CoRR Deborah Haun, Laura Merker, Sergey Pupyrev
2024	A	`conf`	Intersection Graphs with and Without Product Structure. GD Laura Merker, Lena Scherzer, Samuel Schneider, Torsten Ueckerdt
2024	J	`jnl`	Intersection Graphs with and without Product Structure. CoRR Laura Merker, Lena Scherzer, Samuel Schneider, Torsten Ueckerdt
2024	J	`jnl`	The product structure of squaregraphs. J. Graph Theory Robert Hickingbotham, Paul Jungeblut, Laura Merker, David R. Wood
2024	J	`jnl`	Three-Dimensional Graph Products with Unbounded Stack-Number. Discret. Comput. Geom. David Eppstein, Robert Hickingbotham, Laura Merker, Sergey Norin, Michal T. Seweryn, David R. Wood
2023	J	`jnl`	A Sublinear Bound on the Page Number of Upward Planar Graphs. SIAM J. Discret. Math. Paul Jungeblut, Laura Merker, Torsten Ueckerdt
2023	A*	`conf`	Directed Acyclic Outerplanar Graphs Have Constant Stack Number. FOCS Paul Jungeblut, Laura Merker, Torsten Ueckerdt
2023	B	`conf`	Linear Layouts of Bipartite Planar Graphs. WADS Henry Förster, Michael Kaufmann, Laura Merker, Sergey Pupyrev, Chrysanthi N. Raftopoulou
2023	J	`jnl`	Linear Layouts of Bipartite Planar Graphs. CoRR Henry Förster, Michael Kaufmann, Laura Merker, Sergey Pupyrev, Chrysanthi N. Raftopoulou
2022	A*	`conf`	A Sublinear Bound on the Page Number of Upward Planar Graphs. SODA Paul Jungeblut, Laura Merker, Torsten Ueckerdt
2022	J	`jnl`	Directed Acyclic Outerplanar Graphs Have Constant Stack Number. CoRR Paul Jungeblut, Laura Merker, Torsten Ueckerdt
2022	J	`jnl`	Three-dimensional graph products with unbounded stack-number. CoRR David Eppstein, Robert Hickingbotham, Laura Merker, Sergey Norin, Michal T. Seweryn, David R. Wood
2021	J	`jnl`	A Sublinear Bound on the Page Number of Upward Planar Graphs. CoRR Paul Jungeblut, Laura Merker, Torsten Ueckerdt
2021	A	`conf`	Linear Layouts of Complete Graphs. GD Stefan Felsner, Laura Merker, Torsten Ueckerdt, Pavel Valtr
2021	J	`jnl`	Linear Layouts of Complete Graphs. CoRR Stefan Felsner, Laura Merker, Torsten Ueckerdt, Pavel Valtr
2020	A	`conf`	The Local Queue Number of Graphs with Bounded Treewidth. GD Laura Merker, Torsten Ueckerdt
2020	J	`jnl`	The Local Queue Number of Graphs with Bounded Treewidth. CoRR Laura Merker, Torsten Ueckerdt
2019	A	`conf`	Local and Union Page Numbers. GD Laura Merker, Torsten Ueckerdt
2019	J	`jnl`	Local and Union Page Numbers. CoRR Laura Merker, Torsten Ueckerdt

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.