HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation


...
hal-00846953v1  Conference papers
Patrizio AngeliniDavid EppsteinFabrizio FratiMichael KaufmannSylvain Lazard et al.  Universal Point Sets for Planar Graph Drawings with Circular Arcs
Canadian Conference on Computational Geometry, Aug 2013, Waterloo, Canada. pp.117-122
...
hal-00997207v1  Journal articles
Patrizio AngeliniDavid EppsteinFabrizio FratiMichael KaufmannSylvain Lazard et al.  Universal Point Sets for Planar Graph Drawing with Circular Arcs
Journal of Graph Algorithms and Applications, Brown University, 2014, 18 (3), pp.313-324. ⟨10.7155/jgaa.00324⟩
...
inria-00070630v1  Reports
Claude CastellucciaJeong Yi. DoS-Resistant Self-Keying Mobile Ad-Hoc Networks
[Research Report] RR-5373, INRIA. 2004, pp.28
hal-01326779v1  Conference papers
David EppsteinPhilipp KindermannStephen KobourovGiuseppe LiottaAnna Lubiw et al.  On the Planar Split Thickness of Graphs
LATIN 2016: Theoretical Informatics: 12th Latin American Symposium, Apr 2016, Ensenada, Mexico. pp.403-415, ⟨10.1007/978-3-662-49529-2_30⟩
hal-02424621v1  Journal articles
Mark AlberChristophe GodinPhilip K. MainiRoeland M.H. MerksEric Mjolsness. Introduction
Bulletin of Mathematical Biology, Springer Verlag, 2019, pp.3214-3218. ⟨10.1007/s11538-019-00649-2⟩