Roman Rabinovich

From MaRDI portal
Person:322314

Available identifiers

zbMath Open rabinovich.romanWikidataQ102406116 ScholiaQ102406116MaRDI QIDQ322314

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61925072024-02-12Paper
The Treewidth and Pathwidth of Graph Unions2024-01-23Paper
https://portal.mardi4nfdi.de/entity/Q61473762024-01-15Paper
https://portal.mardi4nfdi.de/entity/Q50904972022-07-18Paper
https://portal.mardi4nfdi.de/entity/Q49865132021-04-27Paper
https://portal.mardi4nfdi.de/entity/Q49865152021-04-27Paper
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness2021-04-21Paper
Classes of graphs with low complexity: the case of classes with bounded linear rankwidth2021-02-08Paper
Linear rankwidth meets stability2021-02-02Paper
https://portal.mardi4nfdi.de/entity/Q51446622021-01-19Paper
https://portal.mardi4nfdi.de/entity/Q51407242020-12-16Paper
Model-Checking on Ordered Structures2020-09-11Paper
Neighborhood complexity and kernelization for nowhere dense classes of graphs2020-05-27Paper
Cyclewidth and the grid theorem for perfect matching width of bipartite graphs2020-02-24Paper
Routing with congestion in acyclic digraphs2019-09-20Paper
Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes2019-03-28Paper
Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs2019-02-04Paper
Coloring and Covering Nowhere Dense Graphs2018-10-31Paper
Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes2018-07-16Paper
https://portal.mardi4nfdi.de/entity/Q46366492018-04-19Paper
https://portal.mardi4nfdi.de/entity/Q46085642018-03-21Paper
The Generalised Colouring Numbers on Classes of Bounded Expansion2018-03-21Paper
On the generalised colouring numbers of graphs that exclude a fixed minor2017-09-11Paper
https://portal.mardi4nfdi.de/entity/Q29549822017-01-24Paper
Jumping robbers in digraphs2016-11-29Paper
DAG-width is PSPACE-complete2016-11-29Paper
Colouring and Covering Nowhere Dense Graphs2016-10-21Paper
On the generalised colouring numbers of graphs that exclude a fixed minor2016-10-14Paper
Down the Borel hierarchy: solving Muller games via safety games2014-12-02Paper
The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs2014-12-02Paper
Directed Width Measures and Monotonicity of Directed Graph Searching2014-08-20Paper
Entanglement and the complexity of directed graphs2013-01-07Paper
Parity Games with Partial Information Played on Graphs of Bounded Complexity2010-09-03Paper
Directed Graphs of Entanglement Two2009-10-20Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Roman Rabinovich