Frank Fuhlbrück

Frank Fuhlbrück is a Researcher at the Institute of Computer Science within the Faculty of Mathematics and Natural Sciences at Humboldt University of Berlin, actively contributing to the Algorithms and Complexity II research group. His position as a scientific collaborator places him at the forefront of theoretical computer science research in Berlin.

His research centers on fundamental problems in graph theory and computational complexity, with deep expertise in the Weisfeiler-Leman algorithm for graph isomorphism testing. Key interests include parameterized complexity, graph invariants, spectral properties, and combinatorial methods for distinguishing graph structures. His work bridges discrete mathematics, algebra, and theoretical computer science to address foundational questions in algorithm design.

Analysis of his 2020-2024 publications reveals a cohesive research trajectory focused on the expressive power of combinatorial invariants, particularly through subgraph counts and spectral hierarchies. His contributions to understanding fixing numbers, vertex individualization, and fractional packing dimensions demonstrate innovative applications of algebraic and logical frameworks to graph classification problems.

As an integral member of the Algorithms and Complexity II group, he collaborates on advancing core theoretical frameworks in algorithms while maintaining connections to empirical research methodologies as evidenced by his 2022 work on R-based statistical tools.