Search
-
On the Tree-Width of Planar Graphs
Communication dans un congrès -
Local Computation of Nearly Additive Spanners
Communication dans un congrès -
What Can be Observed Locally? Round-based Models for Quantum Distributed Computing
Communication dans un congrès -
On the Path Separability of Planar Graphs
Communication dans un congrès -
Distributed computing with advice: information sensitivity of graph coloring
(Distributed Computing. vol. 21, n° 6, pp. 395-403, 2009-03)Article de revue -
What Can be Observed Locally? Round-based Models for Quantum Distributed Computing
(2009)Autre document -
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies
Communication dans un congrès -
Strong-Diameter Decompositions of Minor Free Graphs
Communication dans un congrès -
Spanners for Bounded Tree-Length Graphs
(Theoretical Computer Science. vol. 383, n° 1, pp. 34-44, 2007-09)Article de revue -
Average Stretch Analysis of Compact Routing Schemes
(Discrete Applied Mathematics. vol. 155, pp. 598-610, 2007)Article de revue