When Trees Grow Low: Shrubs and Fast MSO_{1}R Ganian, P Hliněný, J Nešetřil, J Obdržálek, P Ossona de Mendez, ... Mathematical Foundations of Computer Science 2012: 37th International …, 2012 | 73 | 2012 |

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 | 68 | 2010 |

Are there any good digraph width measures? R Ganian, P Hlinený, J Kneis, D Meister, J Obdrzálek, P Rossmanith, ... IPEC 10, 135-146, 2010 | 60 | 2010 |

Twin-cover: Beyond vertex cover in parameterized algorithmics R Ganian Parameterized and Exact Computation: 6th International Symposium, IPEC 2011 …, 2012 | 57 | 2012 |

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 | 50 | 2014 |

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

On Digraph Width Measures in Parameterized Algorithmics. R Ganian, P Hlinený, J Kneis, A Langer, J Obdrzálek, P Rossmanith IWPEC 5917, 185-197, 2009 | 48 | 2009 |

Shrub-depth: Capturing height of dense graphs PO de Mendez, J Obdržálek, J Nešetřil, P Hliněný, R Ganian Logical Methods in Computer Science 15, 2019 | 45 | 2019 |

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

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

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 | 39 | 2014 |

On structural parameterizations of the bounded-degree vertex deletion problem R Ganian, F Klute, S Ordyniak Algorithmica 83, 297-336, 2021 | 37 | 2021 |

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 | 35 | 2016 |

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 | 35 | 2013 |

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

FO model checking of interval graphs R Ganian, P Hliněný, D Král’, J Obdržálek, J Schwartz, J Teska Automata, Languages, and Programming: 40th International Colloquium, ICALP …, 2013 | 31 | 2013 |

Algorithmic applications of tree-cut width R Ganian, EJ Kim, S Szeider Mathematical Foundations of Computer Science 2015: 40th International …, 2015 | 30 | 2015 |

Discovering archipelagos of tractability for constraint satisfaction and counting R Ganian, MS Ramanujan, S Szeider ACM Transactions on Algorithms (TALG) 13 (2), 1-32, 2017 | 28 | 2017 |

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 | 28 | 2015 |

Thread graphs, linear rank-width and their algorithmic applications R Ganian Combinatorial Algorithms: 21st International Workshop, IWOCA 2010, London …, 2011 | 28 | 2011 |