Staff profile
Overview
https://apps.dur.ac.uk/biography/image/4804
Dr Igor Razgon
Associate Professor
| Affiliation |
|---|
| Associate Professor in the Department of Computer Science |
Research interests
- Algorithms and Complexity
- Discrete Mathematics.
- Structural graph theory.
- Foundations of AI and Databases.
Esteem Indicators
- 2020: Nerode Prize :
Publications
Journal Article
- Razgon, I. (2025). The splitting power of branching programs of bounded repetition and CNFs of bounded width. Discrete Applied Mathematics, 360, 366-381. https://doi.org/10.1016/j.dam.2024.09.028
- Alecu, B., Lozin, V. V., Quiroz, D. A., Rabinovich, R., Razgon, I., & Zamaraev, V. (2024). The Treewidth and Pathwidth of Graph Unions. SIAM Journal on Discrete Mathematics, 38(1), 261-276. https://doi.org/10.1137/22m1524047
- Gottlob, G., Lanzinger, M., Pichler, R., & Razgon, I. (2023). Fractional covers of hypergraphs with bounded multi-intersection. Theoretical Computer Science, 979, Article 114204. https://doi.org/10.1016/j.tcs.2023.114204
- Lozin, V., & Razgon, I. (2022). Tree-width dichotomy. European Journal of Combinatorics, 103, 103517. https://doi.org/10.1016/j.ejc.2022.103517
- Gottlob, G., Lanzinger, M., Pichler, R., & Razgon, I. (2021). Complexity Analysis of Generalized and Fractional Hypertree Decompositions. Journal of the ACM, 68(5), 1-50. https://doi.org/10.1145/3457374