Roman Rabinovich

Available identifiers

zbMath Open rabinovich.romanWikidataQ102406116 ScholiaQ102406116MaRDI QIDQ322314

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6192507	2024-02-12	Paper
The Treewidth and Pathwidth of Graph Unions	2024-01-23	Paper
https://portal.mardi4nfdi.de/entity/Q6147376	2024-01-15	Paper
Algorithmic properties of sparse digraphs	2022-07-18	Paper
https://portal.mardi4nfdi.de/entity/Q4986513	2021-04-27	Paper
The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs	2021-04-27	Paper
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness	2021-04-21	Paper
Classes of graphs with low complexity: the case of classes with bounded linear rankwidth	2021-02-08	Paper
Linear rankwidth meets stability	2021-02-02	Paper
https://portal.mardi4nfdi.de/entity/Q5144662	2021-01-19	Paper
Empirical evaluation of approximation algorithms for generalized graph coloring and uniform quasi-wideness	2020-12-16	Paper
Model-checking on ordered structures	2020-09-11	Paper
Neighborhood complexity and kernelization for nowhere dense classes of graphs	2020-05-27	Paper
Cyclewidth and the grid theorem for perfect matching width of bipartite graphs	2020-02-24	Paper
Routing with congestion in acyclic digraphs	2019-09-20	Paper
Polynomial kernels and wideness properties of nowhere dense graph classes	2019-03-28	Paper
Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs	2019-02-04	Paper
Coloring and covering nowhere dense graphs	2018-10-31	Paper
Polynomial kernels and wideness properties of nowhere dense graph classes	2018-07-16	Paper
Structural properties and constant factor-approximation of strong distance-\(r\) dominating sets in sparse directed graphs	2018-04-19	Paper
The generalised colouring numbers on classes of bounded expansion	2018-03-21	Paper
https://portal.mardi4nfdi.de/entity/Q4608564	2018-03-21	Paper
On the generalised colouring numbers of graphs that exclude a fixed minor	2017-09-11	Paper
Graph searching games and width measures for directed graphs	2017-01-24	Paper
Jumping robbers in digraphs	2016-11-29	Paper
DAG-width is PSPACE-complete	2016-11-29	Paper
Colouring and covering nowhere dense graphs	2016-10-21	Paper
On the generalised colouring numbers of graphs that exclude a fixed minor	2016-10-14	Paper
Down the Borel hierarchy: solving Muller games via safety games	2014-12-02	Paper
The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs	2014-12-02	Paper
Directed Width Measures and Monotonicity of Directed Graph Searching	2014-08-20	Paper
Entanglement and the complexity of directed graphs	2013-01-07	Paper
Parity games with partial information played on graphs of bounded complexity	2010-09-03	Paper
Directed Graphs of Entanglement Two	2009-10-20	Paper

Research outcomes over time

This page was built for person: Roman Rabinovich