Directed Graphs of Entanglement Two. - Erich Grädel; Lukasz Kaiser; Roman Rabinovich 001 (FCT, 2009)

Parity Games with Partial Information Played on Graphs of Bounded Complexity. - Bernd Puchala; Roman Rabinovich 001 (MFCS, 2010)

Graph Searching, Parity Games and Imperfect Information - Bernd Puchala; Roman Rabinovich 001 (CoRR, 2011)

Entanglement and the complexity of directed graphs. - Dietmar Berwanger; Erich Grädel; Lukasz Kaiser; Roman Rabinovich 001 (Theor. Comput. Sci., 2012)

Graph complexity measures and monotonicity. - Roman Rabinovich 001 (2013)

Directed Width Measures and Monotonicity of Directed Graph Searching. - Lukasz Kaiser; Stephan Kreutzer; Roman Rabinovich 001; Sebastian Siebertz (CoRR, 2014)

The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs. - Felix Canavoi; Erich Grädel; Roman Rabinovich 001 (Theor. Comput. Sci., 2014)

Down the Borel hierarchy: Solving Muller games via safety games. - Daniel Neider; Roman Rabinovich 001; Martin Zimmermann 002 (Theor. Comput. Sci., 2014)

Graph Searching Games and Width Measures for Directed Graphs. - Saeed Akhoondian Amiri; Lukasz Kaiser; Stephan Kreutzer; Roman Rabinovich 001; Sebastian Siebertz (STACS, 2015)

Colouring and Covering Nowhere Dense Graphs. - Martin Grohe; Stephan Kreutzer; Roman Rabinovich 001; Sebastian Siebertz; Konstantinos S. Stavropoulos (WG, 2015)

On the generalised colouring numbers of graphs that exclude a fixed minor. - Jan van den Heuvel; Patrice Ossona de Mendez; Roman Rabinovich 001; Sebastian Siebertz (Electron. Notes Discret. Math., 2015)

The Generalised Colouring Numbers on Classes of Bounded Expansion. - Stephan Kreutzer; Michal Pilipczuk; Roman Rabinovich 001; Sebastian Siebertz (MFCS, 2016)

DAG-width is PSPACE-complete. - Saeed Akhoondian Amiri; Stephan Kreutzer; Roman Rabinovich 001 (Theor. Comput. Sci., 2016)

Jumping robbers in digraphs. - Bernd Puchala; Roman Rabinovich 001 (Theor. Comput. Sci., 2016)

Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs. - Kord Eickmeyer; Archontia C. Giannopoulou; Stephan Kreutzer; O-joung Kwon; Michal Pilipczuk; Roman Rabinovich 001; Sebastian Siebertz (ICALP, 2017)

Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion. - Jan van den Heuvel; Stephan Kreutzer; Michal Pilipczuk; Daniel A. Quiroz; Roman Rabinovich 001; Sebastian Siebertz (LICS, 2017)

Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs. - Stephan Kreutzer; Roman Rabinovich 001; Sebastian Siebertz; Grischa Weberstädt (STACS, 2017)

Algorithmic Properties of Sparse Digraphs. - Stephan Kreutzer; Patrice Ossona de Mendez; Roman Rabinovich 001; Sebastian Siebertz (CoRR, 2017)

Parity Games, Imperfect Information and Structural Complexity. - Bernd Puchala; Roman Rabinovich 001 (CoRR, 2017)

On the generalised colouring numbers of graphs that exclude a fixed minor. - Jan van den Heuvel; Patrice Ossona de Mendez; Daniel Quiroz 001; Roman Rabinovich 001; Sebastian Siebertz (Eur. J. Comb., 2017)

Distributed Domination on Graph Classes of Bounded Expansion. - Saeed Akhoondian Amiri; Patrice Ossona de Mendez; Roman Rabinovich 001; Sebastian Siebertz (SPAA, 2018)

Coloring and Covering Nowhere Dense Graphs. - Martin Grohe; Stephan Kreutzer; Roman Rabinovich 001; Sebastian Siebertz; Konstantinos S. Stavropoulos (SIAM J. Discret. Math., 2018)

Algorithmic Properties of Sparse Digraphs. - Stephan Kreutzer; Irene Muzi; Patrice Ossona de Mendez; Roman Rabinovich 001; Sebastian Siebertz (STACS, 2019)

Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs. - Meike Hatzel; Roman Rabinovich 001; Sebastian Wiederrecht (WG, 2019)

Routing with congestion in acyclic digraphs. - Saeed Akhoondian Amiri; Stephan Kreutzer; Dániel Marx; Roman Rabinovich 001 (Inf. Process. Lett., 2019)

Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness. - Wojciech Nadara; Marcin Pilipczuk; Roman Rabinovich 001; Felix Reidl; Sebastian Siebertz (ACM J. Exp. Algorithmics, 2019)

Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes. - Stephan Kreutzer; Roman Rabinovich 001; Sebastian Siebertz (ACM Trans. Algorithms, 2019)

Linear rankwidth meets stability. - Jaroslav Nesetril; Roman Rabinovich 001; Patrice Ossona de Mendez; Sebastian Siebertz (SODA, 2020)

Model-Checking on Ordered Structures. - Kord Eickmeyer; Jan van den Heuvel; Ken-ichi Kawarabayashi; Stephan Kreutzer; Patrice Ossona de Mendez; Michal Pilipczuk; Daniel A. Quiroz; Roman Rabinovich 001; Sebastian Siebertz (ACM Trans. Comput. Log., 2020)

PACE Solver Description: PACA-JAVA. - Jona Dirks; Mario Grobler; Roman Rabinovich 001; Yannik Schnaubelt; Sebastian Siebertz; Maximilian Sonneborn (IPEC, 2021)

Rankwidth meets stability. - Jaroslav Nesetril; Patrice Ossona de Mendez; Michal Pilipczuk; Roman Rabinovich 001; Sebastian Siebertz (SODA, 2021)

Classes of graphs with low complexity: The case of classes with bounded linear rankwidth. - Jaroslav Nesetril; Patrice Ossona de Mendez; Roman Rabinovich 001; Sebastian Siebertz (Eur. J. Comb., 2021)

Preface to the special issue on Graph Searching: Theory and Applications. - Spyros Angelopoulos 001; Nancy E. Clarke; Fedor V. Fomin; Archontia C. Giannopoulou; Roman Rabinovich 001 (Theor. Comput. Sci., 2021)

The Treewidth and Pathwidth of Graph Unions. - Bogdan Alecu; Vadim V. Lozin; Daniel A. Quiroz; Roman Rabinovich 001; Igor Razgon; Viktor Zamaraev (SIAM J. Discret. Math., 2024)