- 4
- 2
- 1
- 1
Ignasi Sau
8
Documents
Identifiants chercheurs
ignasi-sau-
0000-0002-8981-9287
- IdRef : 137767420
Présentation
See also : <http://www.lirmm.fr/~sau/Pubs.html>
Publications
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 8
- 4
- 3
- 3
- 3
- 3
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 6
- 4
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 4
- 1
|
|
GMPLS Label Space Minimization through Hypergraph LayoutsTheoretical Computer Science, 2012, 444, pp.3-16. ⟨10.1016/j.tcs.2012.01.033⟩
Article dans une revue
hal-00706260v1
|
|
|
Circuits in graphs through a prescribed set of ordered verticesJournal of Interconnection Networks, 2011, 11 (3-4), pp.121-141. ⟨10.1142/S0219265910002763⟩
Article dans une revue
inria-00585561v1
|
|
|
Edge-Simple Circuits Through 10 Ordered Vertices in Square GridsInternational Workshop on Combinatorial Algorithms -- IWOCA, Jun 2009, Hradec nad Moravicì, Czech Republic
Communication dans un congrès
inria-00429146v1
|
|
|
Traffic Grooming in Bidirectional WDM Ring NetworksInternational Conference on Transparent Optical Networks (ICTON), Jun 2006, Nottingham, United Kingdom. pp.19 - 22, ⟨10.1109/ICTON.2006.248390⟩
Communication dans un congrès
inria-00429168v1
|
Traffic Grooming: Combinatorial Results and Practical Resolutions.Arie Koster and Xavier Muñoz. Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless, and Ad Hoc Networks., XXVII, Springer, pp.63-94, 2010, EATCS Texts in Theoretical Computer Science, 978-3-642-02249-4. ⟨10.1007/978-3-642-02250-0⟩
Chapitre d'ouvrage
inria-00530964v1
|
|
|
Circuit visiting 10 ordered vertices in infinite grids[Research Report] RR-6910, INRIA. 2009
Rapport
inria-00378586v1
|
|
|
MPLS label stacking on the line network[Research Report] RR-6803, INRIA. 2009
Rapport
inria-00354267v1
|
|
|
GMPLS Routing Strategies based on the Design of Hypergraph Layouts[Research Report] RR-6842, INRIA. 2009
Rapport
inria-00360576v1
|