Filter your results
- 7
- 2
- 1
- 10
- 5
- 5
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 9
- 2
- 10
- 10
- 2
- 2
- 1
- 1
- 10
- 10
- 10
- 10
- 10
- 10
- 10
- 10
- 10
- 10
- 7
- 5
- 5
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 10
- 10
- 1
- 1
- 5
- 3
|
|
sorted by
|
|
On the Pathwidth of Planar Graphs[Research Report] 2006, pp.6
Reports
inria-00082035v1
|
||
|
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
Conference papers
inria-00176960v1
|
||
|
Design of Minimal Fault Tolerant Networks: Asymptotic BoundsAlgotel06, May 2006, Tregastel, France. pp.169-174
Conference papers
hal-00512287v1
|
||
|
Frugal Colouring of Graphs[Research Report] RR-6178, INRIA. 2007, pp.12
Reports
inria-00144318v2
|
||
|
$(\ell,k)$-Routing on Plane Grids[Research Report] RR-6480, INRIA. 2008
Reports
inria-00265297v2
|
||
|
Hardness and Approximation of Traffic Grooming[Research Report] RR-6236, INRIA. 2007, pp.17
Reports
inria-00158341v3
|
||
|
WDM and Directed Star Arboricity[Research Report] RR-6179, INRIA. 2007, pp.20
Reports
inria-00132396v3
|
||
|
WDM and Directed Star ArboricityCombinatorics, Probability and Computing, 2010, 19, pp.161-182. ⟨10.1017/S0963548309990551⟩
Journal articles
lirmm-00512776v1
|
||
|
Parameterized Complexity of the Smallest Degree Constraint Subgraph Problem[Research Report] RR-6237, INRIA. 2007, pp.20
Reports
inria-00157970v4
|
||
|
Minimal Selectors and Fault Tolerant Networks[Research Report] 2006, pp.24
Reports
inria-00082015v1
|