Paul Jungeblut

30 papers A* 4A 1B 3Journal 20Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Recognition Complexity of Subgraphs of bf k-Connected Planar Cubic Graphs. Algorithmica Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt
2025	J	`jnl`	Cops and Robber - When Capturing is not Surrounding. Electron. J. Comb. Paul Jungeblut, Samuel Schneider, Torsten Ueckerdt
2025	J	`jnl`	Directed Acyclic Outerplanar Graphs Have Constant Stack Number. TheoretiCS Paul Jungeblut, Laura Merker, Torsten Ueckerdt
2024	—	`—`	Capturing the Computational Complexity of Geometric Problems by the First-Order Theory of the Reals Paul Jungeblut
2024	J	`jnl`	Primal-Dual Cops and Robber. Comput. Geom. Topol. Minh Tuan Ha, Paul Jungeblut, Torsten Ueckerdt, Pawel Zylinski
2024	J	`jnl`	Recognition Complexity of Subgraphs of 2- and 3-Connected Planar Cubic Graphs. CoRR Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt
2024	J	`jnl`	The Complexity of the Hausdorff Distance. Discret. Comput. Geom. Paul Jungeblut, Linda Kleist, Tillmann Miltzow
2024	J	`jnl`	The product structure of squaregraphs. J. Graph Theory Robert Hickingbotham, Paul Jungeblut, Laura Merker, 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	B	`conf`	Cops and Robber - When Capturing Is Not Surrounding. WG Paul Jungeblut, Samuel Schneider, Torsten Ueckerdt
2023	J	`jnl`	Cops and Robber - When Capturing is not Surrounding. CoRR Paul Jungeblut, Samuel Schneider, Torsten Ueckerdt
2023	A*	`conf`	Directed Acyclic Outerplanar Graphs Have Constant Stack Number. FOCS Paul Jungeblut, Laura Merker, Torsten Ueckerdt
2023	—	`conf`	On the Complexity of Lombardi Graph Drawing. GD (1) Paul Jungeblut
2023	J	`jnl`	On the Complexity of Lombardi Graph Drawing. CoRR Paul Jungeblut
2023	J	`jnl`	Primal-Dual Cops and Robber. CoRR Minh Tuan Ha, Paul Jungeblut, Torsten Ueckerdt, Pawel Zylinski
2023	J	`jnl`	Recognizing Unit Disk Graphs in Hyperbolic Geometry is ∃R-Complete. CoRR Nicholas Bieker, Thomas Bläsius, Emil Dohse, Paul Jungeblut
2023	A*	`conf`	Training Fully Connected Neural Networks is ∃R-Complete. NeurIPS Daniel Bertschinger, Christoph Hertrich, Paul Jungeblut, Tillmann Miltzow, Simon Weber
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	A	`conf`	Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs. ESA Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt
2022	J	`jnl`	Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs. CoRR Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt
2022	A*	`conf`	The Complexity of the Hausdorff Distance. SoCG Paul Jungeblut, Linda Kleist, Tillmann Miltzow
2022	J	`jnl`	Training Fully Connected Neural Networks is ∃R-Complete. CoRR Daniel Bertschinger, Christoph Hertrich, Paul Jungeblut, Tillmann Miltzow, Simon Weber
2021	J	`jnl`	A Sublinear Bound on the Page Number of Upward Planar Graphs. CoRR Paul Jungeblut, Laura Merker, Torsten Ueckerdt
2021	J	`jnl`	Multilevel Planarity. J. Graph Algorithms Appl. Lukas Barth, Guido Brückner, Paul Jungeblut, Marcel Radermacher
2021	J	`jnl`	The Complexity of the Hausdorff Distance. CoRR Paul Jungeblut, Linda Kleist, Tillmann Miltzow
2020	B	`conf`	Guarding Quadrangulations and Stacked Triangulations with Edges. WG Paul Jungeblut, Torsten Ueckerdt
2020	J	`jnl`	Guarding Quadrangulations and Stacked Triangulations with Edges. CoRR Paul Jungeblut, Torsten Ueckerdt
2019	B	`conf`	Multilevel Planarity. WALCOM Lukas Barth, Guido Brückner, Paul Jungeblut, Marcel Radermacher
2018	J	`jnl`	Multilevel Planarity. CoRR Lukas Barth, Guido Brückner, Paul Jungeblut, Marcel Radermacher

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.