Oleg Verbitsky

Dr. Oleg Verbitsky is a Researcher at the Institute of Computer Science within the Faculty of Mathematics and Natural Sciences at Humboldt University of Berlin. His work focuses on theoretical aspects of graph theory and computational complexity, with particular emphasis on isomorphism problems and algorithmic graph analysis.

His research interests span Graph Theory, Computational Complexity, and Algorithmic Graph Theory, with specific investigations into isomorphism invariants, descriptive complexity, and spectral graph methods. Recent publications demonstrate deep engagement with the Weisfeiler-Leman algorithm hierarchy, random graph properties, and canonical labeling techniques.

Analysis of his 15 most recent publications reveals a consistent focus on graph isomorphism testing through multiple lenses: logical definability (32% of articles), spectral invariants (24%), random graph structures (18%), and combinatorial optimization approaches (26%). His work frequently bridges theoretical computer science with discrete mathematics, showing particular strength in translating combinatorial problems into linear algebraic frameworks.

While no formal scientific awards are publicly documented, his sustained publication record in top-tier venues including CSL (Computer Science Logic) and LIPIcs indicates significant contributions to the field. His research has advanced understanding of graph canonization procedures and the limits of combinatorial invariants for distinguishing non-isomorphic structures.

Dr. Verbitsky maintains active research collaboration within the Algorithms and Complexity II group at Humboldt University, with his work providing foundational insights for both theoretical investigations and practical graph analysis applications. His email contact verbitsk@informatik.hu-berlin.de serves as the primary channel for academic correspondence.