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 | 372 | 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 | 187 | 2002 |

Fixed-parameter tractability of multicut parameterized by the size of the cutset D Marx, I Razgon Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 177 | 2011 |

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

On the minimum feedback vertex set problem: Exact and enumeration algorithms FV Fomin, S Gaspers, AV Pyatkin, I Razgon Algorithmica 52, 293-307, 2008 | 137 | 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 | 113 | 2013 |

Exact computation of maximum induced forest I Razgon Algorithm Theory–SWAT 2006: 10th Scandinavian Workshop on Algorithm Theory …, 2006 | 90 | 2006 |

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

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 | 47 | 2009 |

Constant ratio fixed-parameter approximation of the edge multicut problem D Marx, I Razgon Information Processing Letters 109 (20), 1161-1166, 2009 | 45 | 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 | 44 | 2012 |

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

Connected coloring completion for general graphs: algorithms and complexity B Chor, M Fellows, MA Ragan, I Razgon, F Rosamond, S Snir Computing and Combinatorics: 13th Annual International Conference, COCOON …, 2007 | 32 | 2007 |

Minimum leaf out-branching problems G Gutin, I Razgon, EJ Kim Algorithmic Aspects in Information and Management: 4th International …, 2008 | 31 | 2008 |

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

On OBDDs for CNFs of bounded treewidth I Razgon AAAI Press, 2014 | 28 | 2014 |

Tree-width dichotomy V Lozin, I Razgon European Journal of Combinatorics 103, 103517, 2022 | 27 | 2022 |

On the read-once property of branching programs and cnfs of bounded treewidth I Razgon Algorithmica 75, 277-294, 2016 | 25 | 2016 |

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

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