 |
 |
 |
|
|
||
|---|---|---|
| inria-00338701v1
Journal articles
Computing Largest Circles Separating Two Sets of Segments International Journal of Computational Geometry and Applications, World Scientific Publishing, 2000, 10, pp.41--54. ⟨10.1142/S0218195900000036⟩ |
||
| |
||
| hal-00725924v1
Conference papers
Time vs. space trade-offs for rendezvous in trees SPAA - 24th Symposium on Parallelism in Algorithms and Architectures - 2012, ACM, 2012, Pittsburgh, United States. pp.1-10, ⟨10.1145/2312005.2312007⟩  |
||
| hal-00646907v1
Conference papers
Synchronous Rendezvous for Location-Aware Agents DISC 2011 - 25th International Symposium on Distributed Computing, Sep 2011, Rome, Italy. pp.447-459, ⟨10.1007/978-3-642-24100-0_42⟩  |
||
| hal-00534263v1
Conference papers
Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids DISC 2010, Sep 2010, United States. pp.297--311, ⟨10.1007/978-3-642-15763-9_28⟩ |
||
| hal-00643686v1
Journal articles
Asynchronous deterministic rendezvous in bounded terrains Theoretical Computer Science, Elsevier, 2011, 412 (50), pp.6926-6937. ⟨10.1016/j.tcs.2011.09.002⟩ |
||
| |
||
| hal-00686270v3
Conference papers
Optimal Patrolling of Fragmented Boundaries SPAA - 25th Symposium on Parallelism in Algorithms and Architectures, 2013, Montreal, Canada. pp.241-250, ⟨10.1145/2486159.2486176⟩ |
||
| hal-01194847v1
Conference papers
When Patrolmen Become Corrupted: Monitoring a Graph using Faulty Mobile Robots 26th International Symposium on Algorithms and Computation (ISAAC 2015), Proceedings, Dec 2015, Nagoya, Japan. pp.343-354, ⟨10.1007/978-3-662-48971-0_30⟩ |
||
| inria-00090667v1
Journal articles
Circular Separability of Polygons Algorithmica, Springer Verlag, 2001, 30 (1), pp.67--82. ⟨10.1007/s004530010078⟩ |
||
| inria-00413181v1
Journal articles
Convex Tours of Bounded Curvature. Computational Geometry, Elsevier, 1999, 13, pp.149-160. ⟨10.1016/S0925-7721(99)00022-X⟩ |
||
| hal-01179145v1
Conference papers
Computing Largest Circles Separating Two Sets of Segments 8th Canadian Conference on Computational Geometry, 1996, Ottawa, Canada |
||
| hal-00371489v1
Conference papers
More Efficient Periodic Traversal in Anonymous Undirected Graphs SIROCCO 2009, May 2009, Slovenia. pp.174--188, ⟨10.1007/978-3-642-11476-2_14⟩ |
||
| hal-00516048v1
Conference papers
Asynchronous Deterministic Rendezvous in Bounded Terrains SIROCCO 2010, Jun 2010, Şirince, Turkey. pp.72-85, ⟨10.1007/978-3-642-13284-1_7⟩ |
||
| hal-00516061v1
Conference papers
Optimal Exploration of Terrains with Obstacles SWAT 2010, Jun 2010, Bergen, Norway. pp.1-12, ⟨10.1007/978-3-642-13731-0_1⟩ |
||
| hal-01179468v1
Conference papers
Circular separability of polygon Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, 1995, ~, United States. pp.273-281 |
||
| hal-01416026v1
Journal articles
Collision-Free Network Exploration Journal of Computer and System Sciences, Elsevier, 2017, 86, pp.70-81. ⟨10.1016/j.jcss.2016.11.008⟩ |
||
| hal-01137486v1
Conference papers
On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015), Proceedings, Part I, Jul 2015, Kyoto, Japan. pp.393-405, ⟨10.1007/978-3-662-47672-7_32⟩ |
||
| inria-00073985v1
Reports
Computing Largest Circles Separating Two Sets of Segments RR-2705, INRIA. 1995 |
||
| hal-01179475v1
Conference papers
Convex Tours of Bounded Curvature Proceedings of the 2nd European Symposium on Algorithms, 1994, Utrecht, Netherlands. pp.254-265, ⟨10.1007/BFb0049413⟩ |
||
| hal-00863496v1
Journal articles
Worst-case optimal exploration of terrains with obstacles Information and Computation, Elsevier, 2013, 225, pp.16-28. ⟨10.1016/j.ic.2013.02.001⟩ |
||
| hal-00725875v1
Journal articles
How to meet when you forget: log-space rendezvous in arbitrary graphs Distributed Computing, Springer Verlag, 2012, 25 (2), pp.165-178. ⟨10.1007/s00446-011-0141-9⟩ |
||
| hal-00996773v1
Conference papers
Patrolling by Robots Equipped with Visibility SIROCCO - 21th International Colloquium on Structural Information and Communication Complexity, Jul 2014, Hida Takayama, Japan. pp.224-234, ⟨10.1007/978-3-319-09620-9_18⟩ |
||
| hal-00646910v1
Conference papers
Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds ESA 2011 - 19th Annual European Symposium on Algorithms, Sep 2011, Saarbruecken, Germany. pp.701-712, ⟨10.1007/978-3-642-23719-5_59⟩ |
||
| hal-00726767v1
Journal articles
More efficient periodic traversal in anonymous undirected graphs Theoretical Computer Science, Elsevier, 2012, 444, p. 60-76. ⟨10.1016/j.tcs.2012.01.035⟩ |
||
| hal-00646912v2
Journal articles
Time versus space trade-offs for rendezvous in trees Distributed Computing, Springer Verlag, 2014, 27 (2), pp.95-109. ⟨10.1007/s00446-013-0201-4⟩ |
||
| hal-00736276v1
Conference papers
Collision-Free Network Exploration LATIN - 11th Latin American Theoretical INformatics Symposium, Mar 2014, Montevideo, Uruguay. pp.342-354, ⟨10.1007/978-3-642-54423-1_30⟩ |
||
| hal-01251829v1
Journal articles
Position discovery for a system of bouncing robots Information and Computation, Elsevier, 2015, 244, pp.122-133. ⟨10.1016/j.ic.2015.07.005⟩ |
||
| hal-00735828v1
Conference papers
Position Discovery for a System of Bouncing Robots DISC - 26th International Symposium on Distributed Computing, 2012, Salvador, Brazil. pp.341-355, ⟨10.1007/978-3-642-33651-5_24⟩ |
||
| |
||
|
|
||
