| 2024 | STACS | FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs. | Matthias Lanzinger, Igor Razgon |
| 2023 | WG | New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth. | Benjamin Bergougnoux, Tuukka Korhonen, Igor Razgon |
| 2020 | MFCS | Fractional Covers of Hypergraphs with Bounded Multi-Intersection. | Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon |
| 2017 | ALT | Specifying a positive threshold function via extremal points. | Vadim V. Lozin, Igor Razgon, Viktor Zamaraev, Elena Zamaraeva, Nikolai Yu. Zolotykh |
| 2015 | CP | Quasipolynomial Simulation of DNNF by a Non-determinstic Read-Once Branching Program. | Igor Razgon |
| 2015 | WG | Well-quasi-ordering Does Not Imply Bounded Clique-width. | Vadim V. Lozin, Igor Razgon, Victor Zamaraev |
| 2014 | KR | On OBDDs for CNFs of Bounded Treewidth. | Igor Razgon |
| 2013 | SAT | Cliquewidth and Knowledge Compilation. | Igor Razgon, Justyna Petke |
| 2011 | STOC | Fixed-parameter tractability of multicut parameterized by the size of the cutset. | Dniel Marx, Igor Razgon |
| 2010 | STACS | Treewidth Reduction for Constrained Separation and Bipartization Problems. | Dniel Marx, Barry O'Sullivan, Igor Razgon |
| 2009 | CP | Constraints of Difference and Equality: A Complete Taxonomic Characterisation. | Emmanuel Hebrard, Dniel Marx, Barry O'Sullivan, Igor Razgon |
| 2009 | ESA | Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem. | Dniel Marx, Igor Razgon |
| 2009 | SAT | Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences. | Daniel Johannsen, Igor Razgon, Magnus Wahlstrm |
| 2008 | AAIM | Minimum Leaf Out-Branching Problems. | Gregory Z. Gutin, Igor Razgon, Eun Jung Kim |
| 2008 | CP | A Soft Constraint of Equality: Complexity and Approximability. | Emmanuel Hebrard, Barry O'Sullivan, Igor Razgon |
| 2008 | ICALP | Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract). | Igor Razgon, Barry O'Sullivan |
| 2008 | STOC | A fixed-parameter algorithm for the directed feedback vertex set problem. | Jianer Chen, Yang Liu, Songjian Lu, Barry O'Sullivan, Igor Razgon |
| 2007 | COCOON | Connected Coloring Completion for General Graphs: Algorithms and Complexity. | Benny Chor, Michael R. Fellows, Mark A. Ragan, Igor Razgon, Frances A. Rosamond, Sagi Snir |
| 2005 | IJCAI | CSP Search with Responsibility Sets and Kernels. | Igor Razgon, Amnon Meisels |
| 2003 | CP | Maintaining Dominance Consistency. | Igor Razgon, Amnon Meisels |