Igor Razgon

Dr. Igor Razgon serves as an Associate Professor in the Department of Computer Science at Durham University, where he conducts foundational research at the intersection of discrete mathematics and theoretical computer science. His work bridges abstract graph theory with practical applications in artificial intelligence systems and database optimization.

His research program centers on structural graph theory, algorithms and complexity, with particular emphasis on tree-width parameters, hypertree decompositions, and constraint satisfaction frameworks. This work establishes critical connections between graph structural properties and computational tractability boundaries, directly impacting query optimization in database management systems and knowledge representation in AI.

Analysis of his 2021-2025 publications reveals consistent focus on dichotomy theorems, fractional decomposition methods, and width parameters for hypergraphs. His research demonstrates how structural graph properties determine computational complexity thresholds, with direct applications to database query optimization and constraint-based reasoning systems.

Professional recognition includes:

• Nerode Prize (2020) for contributions to computational complexity theory

While his publications indicate significant collaborative work with leading researchers in discrete mathematics, the available information does not specify doctoral advisees, grant funding sources, or laboratory affiliations. His research trajectory suggests ongoing investigation into structural parameters for combinatorial problem solving.