Roman Rabinovich

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Classes of graphs with low complexity: The case of classes with bounded linear rankwidth.
Eur. J. Comb., 2021

2020
Model-Checking on Ordered Structures.
ACM Trans. Comput. Log., 2020

Rankwidth meets stability.
CoRR, 2020

Linear rankwidth meets stability.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

CoBe - Coded Beacons for Localization, Object Tracking, and SLAM Augmentation.
Proceedings of the 16th IEEE International Conference on Automation Science and Engineering, 2020

2019
Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes.
ACM Trans. Algorithms, 2019

Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness.
ACM J. Exp. Algorithmics, 2019

Routing with congestion in acyclic digraphs.
Inf. Process. Lett., 2019

Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

Algorithmic Properties of Sparse Digraphs.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

2018
Coloring and Covering Nowhere Dense Graphs.
SIAM J. Discret. Math., 2018

Distributed Domination on Graph Classes of Bounded Expansion.
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.
Eur. J. Comb., 2017

Parity Games, Imperfect Information and Structural Complexity.
CoRR, 2017

Algorithmic Properties of Sparse Digraphs.
CoRR, 2017

Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs.
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.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Jumping robbers in digraphs.
Theor. Comput. Sci., 2016

DAG-width is PSPACE-complete.
Theor. Comput. Sci., 2016

The Generalised Colouring Numbers on Classes of Bounded Expansion.
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.
Electron. Notes Discret. Math., 2015

Colouring and Covering Nowhere Dense Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

Graph Searching Games and Width Measures for Directed Graphs.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

2014
Down the Borel hierarchy: Solving Muller games via safety games.
Theor. Comput. Sci., 2014

The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs.
Theor. Comput. Sci., 2014

Directed Width Measures and Monotonicity of Directed Graph Searching.
CoRR, 2014

2013
Graph complexity measures and monotonicity.
PhD thesis, 2013

2012
Entanglement and the complexity of directed graphs.
Theor. Comput. Sci., 2012

2011
Graph Searching, Parity Games and Imperfect Information
CoRR, 2011

2010
Parity Games with Partial Information Played on Graphs of Bounded Complexity.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2009
Directed Graphs of Entanglement Two.
Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009


  Loading...