- 2
- 1
- 1
- 1
- 1
Ignasi Sau
6
Documents
Identifiants chercheurs
- ignasi-sau
- 0000-0002-8981-9287
- IdRef : 137767420
Présentation
See also : <http://www.lirmm.fr/~sau/Pubs.html>
Publications
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 6
- 3
- 3
- 3
- 3
- 2
- 1
- 1
- 1
- 1
- 4
- 2
- 1
- 1
- 1
- 2
- 2
- 2
On the approximability of some degree-constrained subgraph problemsDiscrete Applied Mathematics, 2012, 160 (2), pp.1661-1679. ⟨10.1016/j.dam.2012.03.025⟩
Article dans une revue
lirmm-00736702v1
|
|
|
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
|
|
Hardness of Approximating the Traffic Grooming Problem9ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2007, Ile d'Oléron, France. pp.45-48
Communication dans un congrès
inria-00176960v1
|
|
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
|
|
Hardness and Approximation of Traffic Grooming[Research Report] RR-6236, INRIA. 2007, pp.17
Rapport
inria-00158341v3
|