Roman Rabinovich

According to our database, Roman Rabinovich authored at least 32 papers between 2009 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Classes of graphs with low complexity: The case of classes with bounded linear rankwidth.

Jaroslav Nesetril, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz

Eur. J. Comb., 2021

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, Sebastian Siebertz

ACM Trans. Comput. Log., 2020

Rankwidth meets stability.

Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz

CoRR, 2020

Linear rankwidth meets stability.

Jaroslav Nesetril, Roman Rabinovich, Patrice Ossona de Mendez, Sebastian Siebertz

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

CoBe - Coded Beacons for Localization, Object Tracking, and SLAM Augmentation.

Roman Rabinovich, Ibrahim Jubran, Aaron Wetzler, Ron Kimmel

Proceedings of the 16th IEEE International Conference on Automation Science and Engineering, 2020

2019

Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes.

Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz

ACM Trans. Algorithms, 2019

Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness.

Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, Sebastian Siebertz

ACM J. Exp. Algorithmics, 2019

Routing with congestion in acyclic digraphs.

Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, Roman Rabinovich

Inf. Process. Lett., 2019

Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs.

Meike Hatzel, Roman Rabinovich, Sebastian Wiederrecht

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

Algorithmic Properties of Sparse Digraphs.

Stephan Kreutzer, Irene Muzi, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

2018

Coloring and Covering Nowhere Dense Graphs.

Martin Grohe, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, Konstantinos S. Stavropoulos

SIAM J. Discret. Math., 2018

Distributed Domination on Graph Classes of Bounded Expansion.

Saeed Akhoondian Amiri, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

2017

On the generalised colouring numbers of graphs that exclude a fixed minor.

Jan van den Heuvel, Patrice Ossona de Mendez, Daniel Quiroz, Roman Rabinovich, Sebastian Siebertz

Eur. J. Comb., 2017

Parity Games, Imperfect Information and Structural Complexity.

Bernd Puchala, Roman Rabinovich

CoRR, 2017

Algorithmic Properties of Sparse Digraphs.

Stephan Kreutzer, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz

CoRR, 2017

Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs.

Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, Grischa Weberstädt

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 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, Sebastian Siebertz

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs.

Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Jumping robbers in digraphs.

Bernd Puchala, Roman Rabinovich

Theor. Comput. Sci., 2016

DAG-width is PSPACE-complete.

Saeed Akhoondian Amiri, Stephan Kreutzer, Roman Rabinovich

Theor. Comput. Sci., 2016

The Generalised Colouring Numbers on Classes of Bounded Expansion.

Stephan Kreutzer, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015

On the generalised colouring numbers of graphs that exclude a fixed minor.

Jan van den Heuvel, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz

Electron. Notes Discret. Math., 2015

Colouring and Covering Nowhere Dense Graphs.

Martin Grohe, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, Konstantinos S. Stavropoulos

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

Graph Searching Games and Width Measures for Directed Graphs.

Saeed Akhoondian Amiri, Lukasz Kaiser, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

2014

Down the Borel hierarchy: Solving Muller games via safety games.

Daniel Neider, Roman Rabinovich, Martin Zimmermann

Theor. Comput. Sci., 2014

The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs.

Felix Canavoi, Erich Grädel, Roman Rabinovich

Theor. Comput. Sci., 2014

Directed Width Measures and Monotonicity of Directed Graph Searching.

Lukasz Kaiser, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz

CoRR, 2014

2013

Graph complexity measures and monotonicity.

Roman Rabinovich

PhD thesis, 2013

2012

Entanglement and the complexity of directed graphs.

Dietmar Berwanger, Erich Grädel, Lukasz Kaiser, Roman Rabinovich

Theor. Comput. Sci., 2012

2011

Graph Searching, Parity Games and Imperfect Information

Bernd Puchala, Roman Rabinovich

CoRR, 2011

2010

Parity Games with Partial Information Played on Graphs of Bounded Complexity.

Bernd Puchala, Roman Rabinovich

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2009

Directed Graphs of Entanglement Two.

Erich Grädel, Lukasz Kaiser, Roman Rabinovich

Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009