| On the generalised colouring numbers of graphs that exclude a fixed minor J van den Heuvel, PO de Mendez, D Quiroz, R Rabinovich, S Siebertz European Journal of Combinatorics 66, 129-144, 2017 | 42 | 2017 |
| Entanglement and the complexity of directed graphs D Berwanger, E Grädel, Ł Kaiser, R Rabinovich Theoretical Computer Science 463, 2-25, 2012 | 39 | 2012 |
| Colouring and covering nowhere dense graphs M Grohe, S Kreutzer, R Rabinovich, S Siebertz, K Stavropoulos International Workshop on Graph-Theoretic Concepts in Computer Science, 325-338, 2015 | 38 | 2015 |
| Neighborhood complexity and kernelization for nowhere dense classes of graphs K Eickmeyer, AC Giannopoulou, S Kreutzer, O Kwon, M Pilipczuk, ... arXiv preprint arXiv:1612.08197, 2016 | 37 | 2016 |
| Polynomial kernels and wideness properties of nowhere dense graph classes S Kreutzer, R Rabinovich, S Siebertz ACM Transactions on Algorithms (TALG) 15 (2), 1-19, 2018 | 25 | 2018 |
| The generalised colouring numbers on classes of bounded expansion S Kreutzer, M Pilipczuk, R Rabinovich, S Siebertz arXiv preprint arXiv:1606.08972, 2016 | 21 | 2016 |
| Coloring and covering nowhere dense graphs M Grohe, S Kreutzer, R Rabinovich, S Siebertz, K Stavropoulos SIAM Journal on Discrete Mathematics 32 (4), 2467-2481, 2018 | 14 | 2018 |
| Distributed domination on graph classes of bounded expansion S Akhoondian Amiri, P Ossona de Mendez, R Rabinovich, S Siebertz Proceedings of the 30th on Symposium on Parallelism in Algorithms and …, 2018 | 12 | 2018 |
| DAG-width is PSPACE-complete SA Amiri, S Kreutzer, R Rabinovich Theoretical Computer Science 655, 78-89, 2016 | 12 | 2016 |
| Routing with congestion in acyclic digraphs SA Amiri, S Kreutzer, D Marx, R Rabinovich Information Processing Letters 151, 105836, 2019 | 11 | 2019 |
| Graph searching games and width measures for directed graphs S Akhoondian Amiri, L Kaiser, S Kreutzer, R Rabinovich, S Siebertz 32nd International Symposium on Theoretical Aspects of Computer Science …, 2015 | 11 | 2015 |
| Complexity measures of directed graphs R Rabinovich, L Forschungsgebiet Diploma thesis, RWTH-Aachen, 2008 | 11 | 2008 |
| Classes of graphs with low complexity: the case of classes with bounded linear rankwidth J Nešetřil, PO de Mendez, R Rabinovich, S Siebertz European Journal of Combinatorics 91, 103223, 2021 | 10 | 2021 |
| Linear rankwidth meets stability J Nešetřil, R Rabinovich, PO de Mendez, S Siebertz Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 10 | 2020 |
| Empirical evaluation of approximation algorithms for generalized graph coloring and uniform quasi-wideness W Nadara, M Pilipczuk, R Rabinovich, F Reidl, S Siebertz Journal of Experimental Algorithmics (JEA) 24, 1-34, 2019 | 8 | 2019 |
| Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion J van den Heuvel, S Kreutzer, M Pilipczuk, DA Quiroz, R Rabinovich, ... 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-11, 2017 | 8 | 2017 |
| Directed graphs of entanglement two E Grädel, Ł Kaiser, R Rabinovich International Symposium on Fundamentals of Computation Theory, 169-180, 2009 | 8 | 2009 |
| Down the Borel hierarchy: Solving Muller games via safety games D Neider, R Rabinovich, M Zimmermann Theoretical Computer Science 560, 219-234, 2014 | 7 | 2014 |
| Down the borel hierarchy: Solving Muller games via safety games D Neider, R Rabinovich, M Zimmermann arXiv preprint arXiv:1210.2457, 2012 | 6 | 2012 |
| Graph searching, parity games and imperfect information B Puchala, R Rabinovich arXiv preprint arXiv:1110.5575, 2011 | 5 | 2011 |
Łukasz KaiserGoogle Brain & CNRSVerified email at liafa.jussieu.fr
