Roman Rabinovich

Publication Activity (10 Years)

Years Active: 2009-2022
Publications (10 Years): 40

Top Venues

CoRR

Theor. Comput. Sci.

SODA

STACS

RWTH Aachen University (PHD)

Education History

RWTH Aachen University

PHD

Publications

Bogdan Alecu, Vadim V. Lozin, Daniel A. Quiroz, Roman Rabinovich, Igor Razgon, Viktor Zamaraev
The treewidth and pathwidth of graph unions. CoRR (2022)
Spyros Angelopoulos, Nancy E. Clarke, Fedor V. Fomin, Archontia C. Giannopoulou, Roman Rabinovich
Preface to the special issue on Graph Searching: Theory and Applications. Theor. Comput. Sci. 858 (2021)
Jaroslav Nesetril, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz
Classes of graphs with low complexity: The case of classes with bounded linear rankwidth. Eur. J. Comb. 91 (2021)
Jona Dirks, Mario Grobler, Roman Rabinovich, Yannik Schnaubelt, Sebastian Siebertz, Maximilian Sonneborn
PACE Solver Description: PACA-JAVA. IPEC (2021)
Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz
Rankwidth meets stability. SODA (2021)
Kord Eickmeyer, Jan van den Heuvel, Ken-ichi Kawarabayashi, Stephan Kreutzer, Patrice Ossona de Mendez, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz
Model-Checking on Ordered Structures. ACM Trans. Comput. Log. 21 (2) (2020)
Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz
Rankwidth meets stability. CoRR (2020)
Roman Rabinovich, Ibrahim Jubran, Aaron Wetzler, Ron Kimmel
CoBe - Coded Beacons for Localization, Object Tracking, and SLAM Augmentation. CASE (2020)
Jaroslav Nesetril, Roman Rabinovich, Patrice Ossona de Mendez, Sebastian Siebertz
Linear rankwidth meets stability. SODA (2020)
Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, Sebastian Siebertz
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness. ACM J. Exp. Algorithmics 24 (1) (2019)
Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, Roman Rabinovich
Routing with congestion in acyclic digraphs. Inf. Process. Lett. 151 (2019)
Meike Hatzel, Roman Rabinovich, Sebastian Wiederrecht
Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs. WG (2019)
Jaroslav Nesetril, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz
Linear rankwidth meets stability. CoRR (2019)
Stephan Kreutzer, Irene Muzi, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz
Algorithmic Properties of Sparse Digraphs. STACS (2019)
Meike Hatzel, Roman Rabinovich, Sebastian Wiederrecht
Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs. CoRR (2019)
Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz
Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes. ACM Trans. Algorithms 15 (2) (2019)
Jaroslav Nesetril, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz
Classes of graphs with low complexity: the case of classes with bounded linear rankwidth. CoRR (2019)
Saeed Akhoondian Amiri, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz
Distributed Domination on Graph Classes of Bounded Expansion. SPAA (2018)
Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, Sebastian Siebertz
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness. CoRR (2018)
Kord Eickmeyer, Jan van den Heuvel, Ken-ichi Kawarabayashi, Stephan Kreutzer, Patrice Ossona de Mendez, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz
Model-Checking on Ordered Structures. CoRR (2018)
Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, Sebastian Siebertz
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness. SEA (2018)
Martin Grohe, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, Konstantinos S. Stavropoulos
Coloring and Covering Nowhere Dense Graphs. SIAM J. Discret. Math. 32 (4) (2018)
Jan van den Heuvel, Stephan Kreutzer, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz
Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion. LICS (2017)
Stephan Kreutzer, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz
Algorithmic Properties of Sparse Digraphs. CoRR (2017)
Saeed Akhoondian Amiri, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz
Distributed Domination on Graph Classes of Bounded Expansion. CoRR (2017)
Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz
Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes. SODA (2017)
Jan van den Heuvel, Patrice Ossona de Mendez, Daniel Quiroz, Roman Rabinovich, Sebastian Siebertz
On the generalised colouring numbers of graphs that exclude a fixed minor. Eur. J. Comb. 66 (2017)
Jan van den Heuvel, Stephan Kreutzer, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz
Model-Checking for Successor-Invariant First-Order Formulas on Graph Classes of Bounded Expansion. CoRR (2017)
Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz
Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs. ICALP (2017)
Bernd Puchala, Roman Rabinovich
Parity Games, Imperfect Information and Structural Complexity. CoRR (2017)
Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, Grischa Weberstädt
Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs. STACS (2017)
Bernd Puchala, Roman Rabinovich
Jumping robbers in digraphs. Theor. Comput. Sci. 655 (2016)
Stephan Kreutzer, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz
The Generalised Colouring Numbers on Classes of Bounded Expansion. MFCS (2016)
Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, Roman Rabinovich
Routing with Congestion in Acyclic Digraphs. MFCS (2016)
Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz
Neighborhood complexity and kernelization for nowhere dense classes of graphs. CoRR (2016)
Jan van den Heuvel, Patrice Ossona de Mendez, Daniel Quiroz, Roman Rabinovich, Sebastian Siebertz
On the Generalised Colouring Numbers of Graphs that Exclude a Fixed Minor. CoRR (2016)
Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz
Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes. CoRR (2016)
Stephan Kreutzer, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz
The Generalised Colouring Numbers on Classes of Bounded Expansion. CoRR (2016)
Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, Roman Rabinovich
Routing with Congestion in Acyclic Digraphs. CoRR (2016)
Saeed Akhoondian Amiri, Stephan Kreutzer, Roman Rabinovich
DAG-width is PSPACE-complete. Theor. Comput. Sci. 655 (2016)
Jan van den Heuvel, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz
On the generalised colouring numbers of graphs that exclude a fixed minor. Electron. Notes Discret. Math. 49 (2015)
Saeed Akhoondian Amiri, Lukasz Kaiser, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz
Graph Searching Games and Width Measures for Directed Graphs. STACS (2015)
Martin Grohe, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, Konstantinos S. Stavropoulos
Colouring and Covering Nowhere Dense Graphs. WG (2015)
Saeed Akhoondian Amiri, Stephan Kreutzer, Roman Rabinovich
DAG-width is PSPACE-complete. CoRR (2014)
Felix Canavoi, Erich Grädel, Roman Rabinovich
The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs. Theor. Comput. Sci. 560 (2014)
Daniel Neider, Roman Rabinovich, Martin Zimmermann
Down the Borel hierarchy: Solving Muller games via safety games. Theor. Comput. Sci. 560 (2014)
Lukasz Kaiser, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz
Directed Width Measures and Monotonicity of Directed Graph Searching. CoRR (2014)
Daniel Neider, Roman Rabinovich, Martin Zimmermann
Down the Borel Hierarchy: Solving Muller Games via Safety Games GandALF (2012)
Dietmar Berwanger, Erich Grädel, Lukasz Kaiser, Roman Rabinovich
Entanglement and the complexity of directed graphs. Theor. Comput. Sci. 463 (2012)
Felix Canavoi, Erich Grädel, Roman Rabinovich
The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs GandALF (2012)
Bernd Puchala, Roman Rabinovich
Graph Searching, Parity Games and Imperfect Information CoRR (2011)
Bernd Puchala, Roman Rabinovich
Parity Games with Partial Information Played on Graphs of Bounded Complexity. MFCS (2010)
Erich Grädel, Lukasz Kaiser, Roman Rabinovich
Directed Graphs of Entanglement Two. FCT (2009)

Roman Rabinovich.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Roman Rabinovich