A fixed-parameter algorithm for the directed feedback vertex set problem J Chen, Y Liu, S Lu, B O'sullivan, I Razgon Proceedings of the fortieth annual ACM symposium on Theory of computing, 177-186, 2008 | 310 | 2008 |

Comparing performance of distributed constraints processing algorithms A Meisels, E Kaplansky, I Razgon, R Zivan Proc. AAMAS-2002 workshop on distributed constraint reasoning DCR, 86-93, 2002 | 177 | 2002 |

Fixed-parameter tractability of multicut parameterized by the size of the cutset D Marx, I Razgon SIAM Journal on Computing 43 (2), 355-388, 2014 | 139 | 2014 |

Almost 2-SAT is fixed-parameter tractable I Razgon, B O'Sullivan Journal of computer and system sciences 75 (8), 435-450, 2009 | 132 | 2009 |

On the minimum feedback vertex set problem: Exact and enumeration algorithms FV Fomin, S Gaspers, AV Pyatkin, I Razgon Algorithmica 52 (2), 293-307, 2008 | 114 | 2008 |

Finding small separators in linear time via treewidth reduction D Marx, B O'sullivan, I Razgon ACM Transactions on Algorithms (TALG) 9 (4), 1-35, 2013 | 87 | 2013 |

Exact computation of maximum induced forest I Razgon Scandinavian Workshop on Algorithm Theory, 160-171, 2006 | 81 | 2006 |

COMPUTING MINIMUM DIRECTED FEEDBACK VERTEX SET IN O*(1.9977^{n})I Razgon Theoretical Computer Science, 70-81, 2007 | 46 | 2007 |

Minimum leaf out-branching and related problems G Gutin, I Razgon, EJ Kim Theoretical Computer Science 410 (45), 4571-4579, 2009 | 45 | 2009 |

Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3 I Razgon Journal of Discrete Algorithms 7 (2), 191-212, 2009 | 39 | 2009 |

Constant ratio fixed-parameter approximation of the edge multicut problem D Marx, I Razgon Information Processing Letters 109 (20), 1161-1166, 2009 | 36 | 2009 |

Linear time algorithm for computing a small biclique in graphs without long induced paths A Atminas, VV Lozin, I Razgon Scandinavian Workshop on Algorithm Theory, 142-152, 2012 | 35 | 2012 |

Connected coloring completion for general graphs: algorithms and complexity B Chor, M Fellows, MA Ragan, I Razgon, F Rosamond, S Snir International Computing and Combinatorics Conference, 75-85, 2007 | 33 | 2007 |

Minimum leaf out-branching problems G Gutin, I Razgon, EJ Kim International Conference on Algorithmic Applications in Management, 235-246, 2008 | 30 | 2008 |

Treewidth reduction for constrained separation and bipartization problems D Marx, B O'Sullivan, I Razgon arXiv preprint arXiv:0902.3780, 2009 | 27 | 2009 |

On OBDDs for CNFs of bounded treewidth I Razgon arXiv preprint arXiv:1308.3829, 2013 | 26 | 2013 |

A Faster Solving of the Maximum In-dependent Set Problem for Graphs with Maximal Degree 3 I Razgon | 20 | 2006 |

On the read-once property of branching programs and CNFs of bounded treewidth I Razgon Algorithmica 75 (2), 277-294, 2016 | 15 | 2016 |

Boundary properties of well-quasi-ordered sets of graphs N Korpelainen, VV Lozin, I Razgon Order 30 (3), 723-735, 2013 | 14 | 2013 |

Well-quasi-ordering does not imply bounded clique-width VV Lozin, I Razgon, V Zamaraev International Workshop on Graph-Theoretic Concepts in Computer Science, 351-359, 2015 | 13 | 2015 |