Recherche
-
On the size of identifying codes in triangle-free graphs
(Discrete Applied Mathematics. vol. 160, n° 10-11, pp. 1532-1546, 2012-07-01)Article de revue -
A $\tilde O(n^2)$ Time-Space Trade-off for Undirected s-t Connectivity
Communication dans un congrès -
Allowing Each Node to Communicate Only Once in a Distributed System: Shared Whiteboard Models
Communication dans un congrès -
k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth
Communication dans un congrès -
$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