Maintaining Dominance Consistency. - Igor Razgon; Amnon Meisels (CP, 2003)

Pruning by Equally Constrained Variables. - Igor Razgon; Amnon Meisels (CSCLP, 2004)

Complexity Analysis of Heuristic CSP Search Algorithms. - Igor Razgon (CSCLP, 2005)

A CSP Search Algorithm with Reduced Branching Factor. - Igor Razgon; Amnon Meisels (CSCLP, 2005)

CSP Search with Responsibility Sets and Kernels. - Igor Razgon; Amnon Meisels (IJCAI, 2005)

A Faster Solving of the Maximum Independent Set Problem for Graphs with Maximal Degree 3. - Igor Razgon (ACiD, 2006)

Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems. - Igor Razgon; Barry O'Sullivan (CSCLP, 2006)

Exact Computation of Maximum Induced Forest. - Igor Razgon (SWAT, 2006)

Connected Coloring Completion for General Graphs: Algorithms and Complexity. - Benny Chor; Michael R. Fellows; Mark A. Ragan; Igor Razgon; Frances A. Rosamond; Sagi Snir (COCOON, 2007)

Generalizing Global Constraints Based on Network Flows. - Igor Razgon; Barry O'Sullivan; Gregory M. Provan (CSCLP, 2007)

Directed Feedback Vertex Set is Fixed-Parameter Tractable. - Igor Razgon; Barry O'Sullivan (Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 2007)

Computing Minimum Directed Feedback Vertex Set in O(1.9977n). - Igor Razgon (ICTCS, 2007)

A CSP Search Algorithm with Responsibility Sets and Kernels. - Igor Razgon; Amnon Meisels (Constraints An Int. J., 2007)

A 2O(k)poly(n) algorithm for the parameterized Convex Recoloring problem. - Igor Razgon (Inf. Process. Lett., 2007)

Minimum Leaf Out-Branching Problems. - Gregory Z. Gutin; Igor Razgon; Eun Jung Kim 002 (AAIM, 2008)

A Soft Constraint of Equality: Complexity and Approximability. - Emmanuel Hebrard; Barry O'Sullivan; Igor Razgon (CP, 2008)

Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract). - Igor Razgon; Barry O'Sullivan (ICALP (1), 2008)

On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms. - Fedor V. Fomin; Serge Gaspers; Artem V. Pyatkin; Igor Razgon (Algorithmica, 2008)

A fixed-parameter algorithm for the directed feedback vertex set problem. - Jianer Chen; Yang Liu 002; Songjian Lu; Barry O'Sullivan; Igor Razgon (J. ACM, 2008)

Constraints of Difference and Equality: A Complete Taxonomic Characterisation. - Emmanuel Hebrard; Dániel Marx; Barry O'Sullivan; Igor Razgon (CP, 2009)

Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs. - Gregory Z. Gutin; Daniel Karapetyan; Igor Razgon (IWPEC, 2009)

Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences. - Daniel Johannsen; Igor Razgon; Magnus Wahlström (SAT, 2009)

FPT Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs - Gregory Z. Gutin; Daniel Karapetyan; Igor Razgon (CoRR, 2009)

Constant ratio fixed-parameter approximation of the edge multicut problem. - Dániel Marx; Igor Razgon (Inf. Process. Lett., 2009)

Almost 2-SAT is fixed-parameter tractable. - Igor Razgon; Barry O'Sullivan (J. Comput. Syst. Sci., 2009)

Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3. - Igor Razgon (J. Discrete Algorithms, 2009)

Minimum leaf out-branching and related problems. - Gregory Z. Gutin; Igor Razgon; Eun Jung Kim 002 (Theor. Comput. Sci., 2009)

Treewidth Reduction for Constrained Separation and Bipartization Problems. - Dániel Marx; Barry O'Sullivan; Igor Razgon (STACS, 2010)

Computing multiway cut within the given excess over the largest minimum isolating cut - Igor Razgon (CoRR, 2010)

Large Isolating Cuts Shrink the Multiway Cut - Igor Razgon (CoRR, 2011)

Soft Constraints of Difference and Equality. - Emmanuel Hebrard; Dániel Marx; Barry O'Sullivan; Igor Razgon (J. Artif. Intell. Res., 2011)

Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths. - Aistis Atminas; Vadim V. Lozin; Igor Razgon (SWAT, 2012)

Cliquewidth and Knowledge Compilation. - Igor Razgon; Justyna Petke (SAT, 2013)

Boundary Properties of Well-Quasi-Ordered Sets of Graphs. - Nicholas Korpelainen; Vadim V. Lozin; Igor Razgon (Order, 2013)

Finding small separators in linear time via treewidth reduction. - Dániel Marx; Barry O'Sullivan; Igor Razgon (ACM Trans. Algorithms, 2013)

No Small Nondeterministic Read-Once Branching Programs for CNFs of Bounded Treewidth. - Igor Razgon (IPEC, 2014)

On OBDDs for CNFs of Bounded Treewidth. - Igor Razgon (KR, 2014)

Complexity of Conjunctive Query Answering under Access Limitations (Preliminary Report). - Andrea Calì; Igor Razgon (SEBD, 2014)

Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset. - Dániel Marx; Igor Razgon (SIAM J. Comput., 2014)

Quasipolynomial Simulation of DNNF by a Non-determinstic Read-Once Branching Program. - Igor Razgon (CP, 2015)

Well-quasi-ordering Does Not Imply Bounded Clique-width. - Vadim V. Lozin; Igor Razgon; Victor Zamaraev (WG, 2015)

Two types of branching programs with bounded repetition that cannot efficiently compute monotone 3-CNFs. - Igor Razgon (CoRR, 2015)

On the Read-Once Property of Branching Programs and CNFs of Bounded Treewidth. - Igor Razgon (Algorithmica, 2016)

Non-deterministic branching programs with logarithmic repetition cannot efficiently compute small monotone CNFs. - Oded Lachish; Igor Razgon (CoRR, 2016)

Specifying a positive threshold function via extremal points. - Vadim V. Lozin; Igor Razgon; Viktor Zamaraev; Elena Zamaraeva; Nikolai Yu. Zolotykh (ALT, 2017)

Querying the Deep Web: Back to the Foundations. - Andrea Calì; Davide Martinenghi; Igor Razgon; Martín Ugarte (AMW, 2017)

Non-FPT lower bounds for structural restrictions of decision DNNF. - Andrea Calì; Florent Capelli; Igor Razgon (CoRR, 2017)

Partial matching width and its application to lower bounds for branching programs. - Igor Razgon (CoRR, 2017)

On Oblivious Branching Programs with Bounded Repetition that Cannot Efficiently Compute CNFs of Bounded Treewidth. - Igor Razgon (Theory Comput. Syst., 2017)

Linear read-once and related Boolean functions. - Vadim V. Lozin; Igor Razgon; Viktor Zamaraev; Elena Zamaraeva; Nikolai Yu. Zolotykh (Discret. Appl. Math., 2018)

Well-quasi-ordering versus clique-width. - Vadim V. Lozin; Igor Razgon; Viktor Zamaraev (J. Comb. Theory B, 2018)

Regular resolution for CNF of bounded incidence treewidth with few long clauses. - Andrea Calì; Igor Razgon (CoRR, 2019)

Complexity Analysis of General and Fractional Hypertree Decompositions. - Georg Gottlob; Matthias Lanzinger; Reinhard Pichler; Igor Razgon (CoRR, 2020)

Classification of OBDD size for monotone 2-CNFs. - Igor Razgon (Electron. Colloquium Comput. Complex., 2021)

Complexity Analysis of Generalized and Fractional Hypertree Decompositions. - Georg Gottlob; Matthias Lanzinger; Reinhard Pichler; Igor Razgon (J. ACM, 2021)

FPT algoritms providing constant ratio approximation of hypertree width parameters for hypergraphs of bounded rank. - Igor Razgon (CoRR, 2022)

Tree-width dichotomy. - Vadim V. Lozin; Igor Razgon (Eur. J. Comb., 2022)

New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth. - Benjamin Bergougnoux; Tuukka Korhonen; Igor Razgon (WG, 2023)

Fractional covers of hypergraphs with bounded multi-intersection. - Georg Gottlob; Matthias Lanzinger; Reinhard Pichler; Igor Razgon (Theor. Comput. Sci., 2023)

FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs. - Matthias Lanzinger; Igor Razgon (STACS, 2024)

The splitting power of branching programs of bounded repetition and CNFs of bounded width. - Igor Razgon (Electron. Colloquium Comput. Complex., 2024)

The Treewidth and Pathwidth of Graph Unions. - Bogdan Alecu; Vadim V. Lozin; Daniel A. Quiroz; Roman Rabinovich 001; Igor Razgon; Viktor Zamaraev (SIAM J. Discret. Math., 2024)

On complexity of restricted fragments of Decision DNNF. - Andrea Calì; Igor Razgon (CoRR, 2025)

Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width. - Igor Razgon (CoRR, 2025)

FPT Parameterisations of Fractional and Generalised Hypertree Width. - Matthias Lanzinger; Igor Razgon; Daniel Unterberger (CoRR, 2025)