default search action
Roman Rabinovich 0001
Person information
- affiliation: Technical University Berlin, Germany
- affiliation (PhD 2013): RWTH Aachen University, Germany
Other persons with the same name
- Roman Rabinovich 0002 — Technion, Geometric Image Processing Lab, Haifa, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]Bogdan Alecu
, Vadim V. Lozin, Daniel A. Quiroz
The Treewidth and Pathwidth of Graph Unions. SIAM J. Discret. Math. 38(1): 261-276 (2024) - 2022
- [i19]Bogdan Alecu, Vadim V. Lozin, Daniel A. Quiroz, Roman Rabinovich, Igor Razgon, Viktor Zamaraev
The treewidth and pathwidth of graph unions. CoRR abs/2202.07752 (2022) - 2021
- [j14]Jaroslav Nesetril
Classes of graphs with low complexity: The case of classes with bounded linear rankwidth. Eur. J. Comb. 91: 103223 (2021) - [j13]Spyros Angelopoulos, Nancy E. Clarke, Fedor V. Fomin
Preface to the special issue on Graph Searching: Theory and Applications. Theor. Comput. Sci. 858: 145-146 (2021) - [c19]Jona Dirks, Mario Grobler, Roman Rabinovich, Yannik Schnaubelt, Sebastian Siebertz, Maximilian Sonneborn:
PACE Solver Description: PACA-JAVA. IPEC 2021: 30:1-30:4 - [c18]Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz:
Rankwidth meets stability. SODA 2021: 2014-2033 - 2020
- [j12]Kord Eickmeyer
Model-Checking on Ordered Structures. ACM Trans. Comput. Log. 21(2): 11:1-11:28 (2020) - [c17]Jaroslav Nesetril, Roman Rabinovich, Patrice Ossona de Mendez
Linear rankwidth meets stability. SODA 2020: 1180-1199 - [i18]Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz:
Rankwidth meets stability. CoRR abs/2007.07857 (2020)
2010 – 2019
- 2019
- [j11]Saeed Akhoondian Amiri
Routing with congestion in acyclic digraphs. Inf. Process. Lett. 151 (2019) - [j10]Wojciech Nadara
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness. ACM J. Exp. Algorithmics 24(1): 2.6:1-2.6:34 (2019) - [j9]Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz
Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes. ACM Trans. Algorithms 15(2): 24:1-24:19 (2019) - [c16]Stephan Kreutzer, Irene Muzi, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz
Algorithmic Properties of Sparse Digraphs. STACS 2019: 46:1-46:20 - [c15]Meike Hatzel, Roman Rabinovich, Sebastian Wiederrecht
Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs. WG 2019: 53-65 - [i17]Meike Hatzel, Roman Rabinovich, Sebastian Wiederrecht:
Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs. CoRR abs/1902.01322 (2019) - [i16]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 abs/1909.01564 (2019) - [i15]Jaroslav Nesetril, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz:
Linear rankwidth meets stability. CoRR abs/1911.07748 (2019) - 2018
- [j8]Martin Grohe, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz
Coloring and Covering Nowhere Dense Graphs. SIAM J. Discret. Math. 32(4): 2467-2481 (2018) - [c14]Saeed Akhoondian Amiri, Patrice Ossona de Mendez
Distributed Domination on Graph Classes of Bounded Expansion. SPAA 2018: 143-151 - [c13]Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness. SEA 2018: 14:1-14:16 - [i14]Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, Sebastian Siebertz:
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness. CoRR abs/1802.09801 (2018) - [i13]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 abs/1812.08003 (2018) - 2017
- [j7]Jan van den Heuvel
On the generalised colouring numbers of graphs that exclude a fixed minor. Eur. J. Comb. 66: 129-144 (2017) - [c12]Kord Eickmeyer
Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs. ICALP 2017: 63:1-63:14 - [c11]Jan van den Heuvel, Stephan Kreutzer, Michal Pilipczuk
Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion. LICS 2017: 1-11 - [c10]Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz
Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes. SODA 2017: 1533-1545 - [c9]Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz
Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs. STACS 2017: 48:1-48:15 - [i12]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 abs/1701.08516 (2017) - [i11]Saeed Akhoondian Amiri, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz:
Distributed Domination on Graph Classes of Bounded Expansion. CoRR abs/1702.02848 (2017) - [i10]Bernd Puchala, Roman Rabinovich:
Parity Games, Imperfect Information and Structural Complexity. CoRR abs/1703.00683 (2017) - [i9]Stephan Kreutzer, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz:
Algorithmic Properties of Sparse Digraphs. CoRR abs/1707.01701 (2017) - 2016
- [j6]Bernd Puchala, Roman Rabinovich:
Jumping robbers in digraphs. Theor. Comput. Sci. 655: 58-77 (2016) - [j5]Saeed Akhoondian Amiri, Stephan Kreutzer, Roman Rabinovich:
DAG-width is PSPACE-complete. Theor. Comput. Sci. 655: 78-89 (2016) - [c8]Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, Roman Rabinovich:
Routing with Congestion in Acyclic Digraphs. MFCS 2016: 7:1-7:11 - [c7]Stephan Kreutzer, Michal Pilipczuk
The Generalised Colouring Numbers on Classes of Bounded Expansion. MFCS 2016: 85:1-85:13 - [i8]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 abs/1602.09052 (2016) - [i7]Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, Roman Rabinovich:
Routing with Congestion in Acyclic Digraphs. CoRR abs/1605.01866 (2016) - [i6]Stephan Kreutzer, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz:
The Generalised Colouring Numbers on Classes of Bounded Expansion. CoRR abs/1606.08972 (2016) - [i5]Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz:
Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes. CoRR abs/1608.05637 (2016) - [i4]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 abs/1612.08197 (2016) - 2015
- [j4]Jan van den Heuvel, Patrice Ossona de Mendez
On the generalised colouring numbers of graphs that exclude a fixed minor. Electron. Notes Discret. Math. 49: 523-530 (2015) - [c6]Saeed Akhoondian Amiri, Lukasz Kaiser, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz
Graph Searching Games and Width Measures for Directed Graphs. STACS 2015: 34-47 - [c5]Martin Grohe, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz
Colouring and Covering Nowhere Dense Graphs. WG 2015: 325-338 - 2014
- [j3]Daniel Neider
Down the Borel hierarchy: Solving Muller games via safety games. Theor. Comput. Sci. 560: 219-234 (2014) - [j2]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: 235-250 (2014) - [i3]Lukasz Kaiser, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz:
Directed Width Measures and Monotonicity of Directed Graph Searching. CoRR abs/1408.4745 (2014) - [i2]Saeed Akhoondian Amiri, Stephan Kreutzer, Roman Rabinovich:
DAG-width is PSPACE-complete. CoRR abs/1411.2438 (2014) - 2013
- [b1]Roman Rabinovich:
Graph complexity measures and monotonicity. RWTH Aachen University, 2013, pp. 1-163 - 2012
- [j1]Dietmar Berwanger
Entanglement and the complexity of directed graphs. Theor. Comput. Sci. 463: 2-25 (2012) - [c4]Daniel Neider, Roman Rabinovich, Martin Zimmermann
Down the Borel Hierarchy: Solving Muller Games via Safety Games. GandALF 2012: 169-182 - [c3]Felix Canavoi, Erich Grädel, Roman Rabinovich:
The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs. GandALF 2012: 197-209 - 2011
- [i1]Bernd Puchala, Roman Rabinovich:
Graph Searching, Parity Games and Imperfect Information. CoRR abs/1110.5575 (2011) - 2010
- [c2]Bernd Puchala, Roman Rabinovich:
Parity Games with Partial Information Played on Graphs of Bounded Complexity. MFCS 2010: 604-615
2000 – 2009
- 2009
- [c1]Erich Grädel, Lukasz Kaiser, Roman Rabinovich:
Directed Graphs of Entanglement Two. FCT 2009: 169-180
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: