Skip to Main content Skip to Navigation

lirmm-00325147v1  Conference papers
Louigi Addario-BerryOmid AminiJean-Sébastien SereniStéphan Thomassé. Guarding Art Galleries: The Extra Cost for Sculptures is Linear
SWAT: Scandinavian Workshop on Algorithm Theory, Jul 2008, Gothenburg, Sweden. pp.41-52, ⟨10.1007/978-3-540-69903-3_6⟩
hal-01109634v2  Journal articles
Omid AminiDavid Cohen-Steiner. A transfer principle and applications to eigenvalue estimates for graphs
Commentarii Mathematici Helvetici, European Mathematical Society, 2018
hal-00487884v1  Conference papers
Omid AminiJean-Daniel BoissonnatPooran Memari. Geometric Tomography With Topological Guarantees
Symposium on Computational Geometry, Jun 2010, Snowbird, United States. pp.200
hal-00921910v1  Journal articles
Omid AminiJean-Daniel BoissonnatPooran Memari. Geometric Tomography with Topological Guarantees
Discrete and Computational Geometry, Springer Verlag, 2013, 50 (4), pp.821-856. ⟨10.1007/s00454-013-9531-z⟩
hal-01132032v1  Journal articles
Omid AminiDavid CoudertNicolas Nisse. Non-deterministic graph searching in trees
Theoretical Computer Science, Elsevier, 2015, 580, pp.101-121. ⟨10.1016/j.tcs.2015.02.038⟩
inria-00176960v1  Conference papers
Omid AminiStéphane PérennesIgnasi Sau Valls. Hardness of Approximating the Traffic Grooming Problem
9ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2007, Ile d'Oléron, France. pp.45-48
inria-00265297v2  Reports
Omid AminiFlorian HucJanez Zerovnik. $(\ell,k)$-Routing on Plane Grids
[Research Report] RR-6480, INRIA. 2008
lirmm-00512776v1  Journal articles
Omid AminiFrédéric HavetFlorian HucStéphan Thomassé. WDM and Directed Star Arboricity
Combinatorics, Probability and Computing, Cambridge University Press (CUP), 2010, 19, pp.161-182
inria-00144318v2  Reports
Omid AminiLouis EsperetJan van den Heuvel. Frugal Colouring of Graphs
[Research Report] RR-6178, INRIA. 2007, pp.12