- 11
- 7
- 3
Rodolphe Giroudeau
21
Documents
Identifiants chercheurs
- rodolphe-giroudeau
- IdRef : 095605355
Présentation
Publications
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 21
- 13
- 9
- 4
- 4
- 3
- 2
- 1
- 1
- 21
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 4
- 4
- 2
- 3
- 6
Approximability and Exact Resolution of the Multidimensional Binary Vector Assignment ProblemISCO: International Symposium on Combinatorial Optimization, May 2016, Vietri sul Mare, Italy. pp.148-159, ⟨10.1007/978-3-319-45587-7_13⟩
Communication dans un congrès
lirmm-01383110v1
|
|
On the Complexity of Wafer-to-Wafer IntegrationCIAC: International Conference on Algorithms and Complexity, May 2015, Paris, France. pp.208-220, ⟨10.1007/978-3-319-18173-8_15⟩
Communication dans un congrès
lirmm-01250989v1
|
|
|
Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee ParameterizationsFCT: Fundamentals of Computation Theory, Aug 2015, Gdańsk, Poland. pp.189-201, ⟨10.1007/978-3-319-22177-9_15⟩
Communication dans un congrès
lirmm-01250997v1
|
On the complexity of flexible interval schedulingMAPSP: Models and Algorithms for Planning and Scheduling Problems, Jun 2015, La Roche-en-Ardenne, Belgium
Communication dans un congrès
lirmm-01251104v1
|
|
Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal GraphsSOFSEM: Theory and Practice of Computer Science, Jan 2014, Nový Smokovec, Slovakia. pp.150-161, ⟨10.1007/978-3-319-04298-5_14⟩
Communication dans un congrès
lirmm-01251025v1
|
|
Approximating the Sparsest $k$-Subgraph in Chordal GraphsWAOA: Workshop on Approximation and Online Algorithms, Sep 2013, Sophia Antipolis, France. pp.73-84, ⟨10.1007/978-3-319-08001-7_7⟩
Communication dans un congrès
lirmm-01283611v1
|
|
|
Sum-Max Graph Partitioning ProblemISCO: International Symposium on Combinatorial Optimization, Apr 2012, Athens, Greece. pp.297-308, ⟨10.1007/978-3-642-32147-4_27⟩
Communication dans un congrès
lirmm-00738554v1
|
|
Approximation algorithms for the wafer to wafer integration problemWAOA 2012 - 10th Workshop on Approximation and Online Algorithms, Sep 2012, Ljubljana, Slovenia. pp.286-297, ⟨10.1007/978-3-642-38016-7_23⟩
Communication dans un congrès
lirmm-00805063v1
|
|
On the Approximability of the Sum-Max Graph Partitioning ProblemAPEX: Approximation, Parameterized and EXact algorithms, Feb 2012, Paris, France
Communication dans un congrès
lirmm-00675888v1
|
|
Approximability and exact resolution of the Multidimensional Binary Vector Assignment problem[Research Report] Lirmm; Montpellier II. 2016
Rapport
lirmm-01310648v1
|
|
On the complexity of Wafer-to-Wafer Integration[Research Report] LIRMM. 2015
Rapport
lirmm-01110027v1
|
|
Parameterized Complexity of the Sparsest k-Subgraph in Chordal Graphs[Research Report] RR-13033, LIRMM. 2013
Rapport
lirmm-00875132v1
|
|
Approximating the Sparsest k-Subgraph in Chordal Graphs2013
Rapport
hal-00868188v1
|
|
Sum-Max Graph Partitioning ProblemRR-12015, 2012
Rapport
lirmm-00694569v2
|
|
NP-hardness of the Sparsest k-Subgraph Problem in Chordal GraphsRR-12026, 2012
Rapport
lirmm-00744655v3
|
|
The k-Sparsest Subgraph ProblemRR-12019, 2012
Rapport
lirmm-00735713v2
|