Recherche
-
$k$-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth
Communication dans un congrès -
Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
Communication dans un congrès -
Synchronous Rendezvous for Location-Aware Agents
Communication dans un congrès -
Structural Information and Communication Complexity. 18th International Colloquium, SIROCCO 2011, Gdańsk, Poland, June 26-29, 2011
(Springer, 2011-06-24)Ouvrage -
Derandomizing random walks in undirected graphs using locally fair exploration strategies
(Distributed Computing. vol. 24, n° 2, pp. 91-99, 2011)Article de revue -
Synchronous Black Hole Search in Directed Graphs
(Theoretical Computer Science. vol. 412, n° 41, pp. 5752-5759, 2011-06-13)Article de revue