ACM Transactions on Algorithms

Marx, D. and O'Sullivan, B. and Razgon, Igor (2013) Finding small separators in linear time via treewidth reduction. ACM Transactions on Algorithms 9 (4), p. 30. ISSN 1549-6325.

Algorithmica

Razgon, Igor (2015) On the read-once property of branching programs and CNFs of bounded treewidth. Algorithmica 75 (2), pp. 277-294. ISSN 0178-4617.

Fomin, F.V. and Gaspers, S. and Pyatkin, A.V. and Razgon, Igor (2008) On the minimum feedback vertex set problem: exact and enumeration algorithms. Algorithmica 52 (2), pp. 293-307. ISSN 0178-4617.

Constraints: An International Journal

Razgon, Igor and Meisels, A. (2007) A CSP search algorithm with responsibility sets and kernels. Constraints: An International Journal 12 , pp. 151-177. ISSN 1383-7133.

Discrete Applied Mathematics

Lozin, V. and Razgon, Igor and Zamaraev, V. and Zamaraeva, E. and Zolotykh, N. (2018) Linear read-once and related Boolean functions. Discrete Applied Mathematics 250 (11), pp. 16-27. ISSN 0166-218X.

Information Processing Letters

Marx, D. and Razgon, Igor (2009) Constant ratio fixed-parameter approximation of the edge multicut problem. Information Processing Letters 109 (20), pp. 1161-1166. ISSN 0020-0190.

Razgon, Igor (2007) A 2O(k)poly(n) algorithm for the parameterized convex recoloring problem. Information Processing Letters 104 (2), pp. 53-58. ISSN 0020-0190.

Journal of Artificial Intelligence Research

Hebrard, E. and Marx, D. and O'Sullivan, B. and Razgon, Igor (2011) Soft constraints of difference and equality. Journal of Artificial Intelligence Research 41 , pp. 97-130. ISSN 1076-9757.

Journal of Combinatorial Theory Series B

Lozin, V. and Razgon, Igor and Zamaraev, V. (2018) Well-quasi-ordering versus clique-width. Journal of Combinatorial Theory Series B 130 , pp. 1-18. ISSN 0095-8956.

Journal of Computer and System Sciences

Razgon, Igor and O'Sullivan, B. (2009) Almost 2-SAT is fixed-parameter tractable. Journal of Computer and System Sciences 75 (8), pp. 435-450. ISSN 0022-0000.

Journal of Discrete Algorithms

Razgon, Igor (2009) Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3. Journal of Discrete Algorithms 7 (2), pp. 191-212. ISSN 1570-8667.

Journal of the ACM

Chen, J. and Liu, Y. and Lu, S. and O'Sullivan, B. and Razgon, Igor (2008) A fixed-parameter algorithm for the directed feedback vertex set problem. Journal of the ACM 55 (5), pp. 1-19. ISSN 0004-5411.

Principles and Practice of Constraint Programming

Razgon, Igor (2015) Quasipolynomial simulation of DNNF by a non-determinstic read-once branching program. In: Pesant, G. (ed.) Principles and Practice of Constraint Programming. Lecture Notes in Computer Science 9255. New York, U.S.: Springer, pp. 367-375. ISBN 9783319232188.

SIAM Journal on Computing

Marx, D. and Razgon, Igor (2014) Fixed-parameter tractability of multicut parameterized by the size of the cutset. SIAM Journal on Computing 43 (2), pp. 355-388. ISSN 0097-5397.

Theoretical Computer Science

Gutin, G. and Razgon, Igor and Kim, E.J. (2009) Minimum leaf out-branching and related problems. Theoretical Computer Science 410 (45), pp. 4571-4579. ISSN 0304-3975.

Theory of Computing Systems

Razgon, Igor (2017) On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth. Theory of Computing Systems 61 , pp. 755-776. ISSN 1432-4350.