Author of the publication

Adding a Referee to an Interconnection Network: What Can(not) Be Computed in One Round.

, , , , , and . IPDPS, page 508-514. IEEE, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Constrained ear decompositions in graphs and digraphs., and . Discrete Mathematics & Theoretical Computer Science, (2019)Understanding the Power of Stigmergy of Anonymous Agents in Discrete Environments., , and . CANDAR, page 50-59. IEEE Computer Society, (2014)Exclusive Graph Searching., , and . ESA, volume 8125 of Lecture Notes in Computer Science, page 181-192. Springer, (2013)Brief Announcement: Distributed Exclusive and Perpetual Tree Searching., , and . DISC, volume 7611 of Lecture Notes in Computer Science, page 403-404. Springer, (2012)Maintaining Balanced Trees for Structured Distributed Streaming Systems., , , and . SIROCCO, volume 8179 of Lecture Notes in Computer Science, page 177-188. Springer, (2013)Distributed computing of efficient routing schemes in generalized chordal graphs., , and . Theor. Comput. Sci., (2012)Connected graph searching., , , , , , and . Inf. Comput., (2012)Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks., , , , and . Algorithmica, 72 (4): 1055-1096 (2015)Minimum Size Tree-decompositions., , , and . Electron. Notes Discret. Math., (2015)Jeux des gendarmes et du voleur dans les graphes. Mineurs de graphes, stratgies connexes, et approche distribue. (Graph searching and related problems. Graph Minors, connected search strategies, and distributed approach).. University of Paris-Sud, Orsay, France, (2007)