On parse trees and Myhill–Nerode-type tools for handling graphs of bounded rank-width R Ganian, P Hliněný Discrete Applied Mathematics 158 (7), 851-867, 2010 | 62 | 2010 |

When Trees Grow Low: Shrubs and Fast MSO_{1}R Ganian, P Hliněný, J Nešetřil, J Obdržálek, PO de Mendez, ... International Symposium on Mathematical Foundations of Computer Science, 419-430, 2012 | 59 | 2012 |

Are there any good digraph width measures? R Ganian, P Hliněný, J Kneis, D Meister, J Obdržálek, P Rossmanith, ... International Symposium on Parameterized and Exact Computation, 135-146, 2010 | 54 | 2010 |

On digraph width measures in parameterized algorithmics R Ganian, P Hliněný, J Kneis, A Langer, J Obdržálek, P Rossmanith International Workshop on Parameterized and Exact Computation, 185-197, 2009 | 45 | 2009 |

Twin-cover: Beyond vertex cover in parameterized algorithmics R Ganian International Symposium on Parameterized and Exact Computation, 259-271, 2011 | 42 | 2011 |

Digraph width measures in parameterized algorithmics R Ganian, P Hliněný, J Kneis, A Langer, J Obdržálek, P Rossmanith Discrete applied mathematics 168, 88-107, 2014 | 36 | 2014 |

Using neighborhood diversity to solve hard problems R Ganian arXiv preprint arXiv:1201.3091, 2012 | 34 | 2012 |

Better algorithms for satisfiability problems for formulas of bounded rank-width R Ganian, P Hliněný, J Obdržálek Fundamenta Informaticae 123 (1), 59-76, 2013 | 32 | 2013 |

The complexity landscape of decompositional parameters for ILP R Ganian, S Ordyniak Artificial Intelligence 257, 61-71, 2018 | 31 | 2018 |

Lower bounds on the complexity of MSO1 model-checking R Ganian, P Hliněný, A Langer, J Obdržálek, P Rossmanith, S Sikdar Journal of Computer and System Sciences 80 (1), 180-194, 2014 | 29 | 2014 |

Shrub-depth: Capturing height of dense graphs R Ganian, P Hliněný, J Nešetřil, J Obdržálek, PO De Mendez arXiv preprint arXiv:1707.00359, 2017 | 27 | 2017 |

Thread graphs, linear rank-width and their algorithmic applications R Ganian International Workshop on Combinatorial Algorithms, 38-42, 2010 | 26 | 2010 |

Are there any good digraph width measures? R Ganian, P Hliněný, J Kneis, D Meister, J Obdržálek, P Rossmanith, ... Journal of Combinatorial Theory, Series B 116, 250-286, 2016 | 24 | 2016 |

Going beyond primal treewidth for (M) ILP R Ganian, S Ordyniak, M Ramanujan Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017 | 22 | 2017 |

Improving vertex cover as a graph parameter R Ganian Discrete Mathematics & Theoretical Computer Science 17, 2015 | 22 | 2015 |

FO model checking of interval graphs R Ganian, P Hliněný, J Obdržálek, J Schwartz, J Teska International Colloquium on Automata, Languages, and Programming, 250-262, 2013 | 22 | 2013 |

Model checking existential logic on partially ordered sets S Bova, R Ganian, S Szeider ACM Transactions on Computational Logic (TOCL) 17 (2), 1-35, 2015 | 21 | 2015 |

Algorithmic applications of tree-cut width R Ganian, EJ Kim, S Szeider International Symposium on Mathematical Foundations of Computer Science, 348-360, 2015 | 20 | 2015 |

Clique-width: When hard does not mean impossible R Ganian, P Hlineny, J Obdrzálek 28th International Symposium on Theoretical Aspects of Computer Science …, 2011 | 18 | 2011 |

Solving integer linear programs with a small number of global variables and constraints P Dvořák, E Eiben, R Ganian, D Knop, S Ordyniak arXiv preprint arXiv:1706.06084, 2017 | 16 | 2017 |