8 citations · 39 across the 15 of their papers we have counts for
5 papers · 1 filter
CoBe -- Coded Beacons for Localization, Object Tracking, and SLAM Augmentation
Roman Rabinovich, Ibrahim Jubran, Aaron Wetzler +1
This paper presents a novel beacon light coding protocol, which enables fast and accurate identification of the beacons in an image. The protocol is provably robust to a predefined…
Algorithmic Properties of Sparse Digraphs
Stephan Kreutzer, Patrice Ossona de Mendez, Roman Rabinovich +1
The notions of bounded expansion and nowhere denseness have been applied very successfully in algorithmic graph theory. We study the corresponding notions of directed bounded expan…
Parity Games, Imperfect Information and Structural Complexity
Bernd Puchala, Roman Rabinovich
We address the problem of solving parity games with imperfect information on finite graphs of bounded structural complexity. It is a major open problem whether parity games with pe…
Distributed Domination on Graph Classes of Bounded Expansion
Saeed Akhoondian Amiri, Patrice Ossona de Mendez, Roman Rabinovich +1
We provide a new constant factor approximation algorithm for the (connected) distance- dominating set problem on graph classes of bounded expansion. Classes of bounded expansion…
Model-Checking for Successor-Invariant First-Order Formulas on Graph Classes of Bounded Expansion
Jan van den Heuvel, Stephan Kreutzer, Michał Pilipczuk +3
A successor-invariant first-order formula is a formula that has access to an auxiliary successor relation on a structure's universe, but the model relation is independent of the pa…