pith. machine review for the scientific record.
sign in

Roman Rabinovich

Identifiers

No identifiers captured yet.

Papers (13)

  1. Separating Feasibility and Movement in Solution Discovery: The Case of Path Discovery cs.DM · 2026 · author #7
  2. Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs math.CO · 2019 · author #2
  3. Algorithmic Properties of Sparse Digraphs cs.DM · 2017 · author #3
  4. Parity Games, Imperfect Information and Structural Complexity cs.GT · 2017 · author #2
  5. Distributed Domination on Graph Classes of Bounded Expansion cs.DC · 2017 · author #3
  6. Neighborhood complexity and kernelization for nowhere dense classes of graphs cs.DM · 2016 · author #6
  7. Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes cs.DM · 2016 · author #2
  8. The Generalised Colouring Numbers on Classes of Bounded Expansion cs.DM · 2016 · author #3
  9. Routing with Congestion in Acyclic Digraphs cs.DS · 2016 · author #4
  10. Colouring and Covering Nowhere Dense Graphs math.CO · 2016 · author #3
  11. Directed Width Measures and Monotonicity of Directed Graph Searching cs.DM · 2014 · author #3
  12. The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs cs.CC · 2012 · author #3
  13. Graph Searching, Parity Games and Imperfect Information cs.GT · 2011 · author #2

Mentions

No mention provenance yet.

Frequent Coauthors