Roman Rabinovich

54 papers A* 5A 3B 9Journal 34Unranked 2

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