1. I. Razgon, A. Atminas, and V. Lozin "Graphs without large bicliques and well-quasi-orderability by the induced subgraph relation", Journal of Combinatorics, in press.
  2. V. Lozin, I. Razgon, V. Zamaraev, E. Zamaraeva and N. Zolotykh "Linear read-once and related functions", Discrete Applied Mathematics, in press.
  3. V. Lozin, I. Razgon, V. Zamaraev "Well-quasi-ordering versus clique-width", Journal of Combinatorial Theory, Series B, Volume 130, pp. 1-18, 2018. (link)
  4. I. Razgon "On Oblivious Branching Programs with Bounded Repetition that Cannot Efficiently Compute CNFs of Bounded Treewidth", Theory of Computing Systems, Volume 61, Issue 3, pp. 755-776, 2017. (link)
  5. I. Razgon "On the read-once property of branching programs and CNFs of bounded treewidth", Algorithmica, Volume 75, Issue 2, pp. 277-294, 2016. (PDF)
  6. D. Marx and I. Razgon "Fixed-parameter tractability of multicut parameterized by the size of the cutset", SIAM Journal on Computing, Volume 43, Issue 2, pp. 355-388, 2014. (PDF)
  7. D. Marx, B. O'Sullivan and I. Razgon "Finding small separators in linear time via treewidth reduction", ACM Transaction on Algorithms, Volume 9, Issue 4, 2013. (PDF)
  8. N. Korpelainen, V. Lozin, and I. Razgon "Boundary properties of well-quasi-ordered sets of graphs", Journal on the Theory of Ordered Sets and its Applications (ORDER), Volume 30, Issue 3, pp. 723-735, 2013. (PDF)
  9. E. Hebrard, D. Marx, B. O'Sullivan and I. Razgon "Soft Constraints of Difference and Equality", Journal of Artificial Intelligence Research (JAIR), Volume 41, pp. 97-130, 2011. (PDF)
  10. I. Razgon and B. O'Sullivan "Almost-2-SAT is Fixed-Parameter Tractable", Journal of Computer and System Sciences, Volume 75, Issue 8, pp. 435-450, 2009. (PDF)
  11. I. Razgon "Faster Computation of Maximum Independent Set and Parameterized Vertex Cover for Graphs with Maximum Degree 3", Journal on Discrete Algorithms, Volume 7, pp. 191-212, 2009. (PDF)
  12. D. Marx and I. Razgon "Constant ratio fixed-parameter approximation of the edge multicut problem", "Information Processing Letters" journal, Volume 109, Issue 20, pp. 1161-1166, 2009. (PDF)
  13. G. Gutin, I. Razgon and E.-J. Kim, "Minimum Leaf Out-branching and Related Problems", Theoretical Computer Science, Volume 410, pp. 4571-4579, 2009. (PDF)
  14. J. Chen, Y. Liu, S. Lu, B. O'Sullivan and I. Razgon "A Fixed-Parameter Algorithm for the Directed Feedback Vertex Set Problem", Journal of the ACM, Volume 55, Issue 5, 2008. (PDF)
  15. F. Fomin, S. Gaspers, A. Pyatkin and I. Razgon "On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms", Algorithmica, Volume 52, Issue 2, pp. 293-307, 2008. (PDF)
  16. I. Razgon "A 2O(k)poly(n) Algorithm for the Parameterized Convex Recoloring Problem", "Information Processing Letters" journal, Volume 104, pp. 53-58, 2007. (PDF)
  17. I. Razgon and A. Meisels "A CSP Search Algorithm with Responsibility Sets and Kernels", "Constraints" journal, Volume 12, Issue 2, pp. 151-177, 2007. (PDF)