|
 
|
Liste des publications
2018
- [KMM18] S. Kedad-Sidhoum, F. Monna, G. Mounié, D. Trystram. "A Family of Scheduling Algorithms for Hybrid Parallel Platforms", International Journal of Foundations of Computer Science, vol. 29(1), pp. 63-90, 2018, (doi:/10.1142/S012905411850003X)
Revue Internationale avec comité de lecture
2016
-
[WP16]
D. Watel, P. Poirion.
"The Maximum Matrix Contraction problem",
4th International Symposium on Combinatorial Optimization,
May 2016,
pp.1-12,
France,
-
[WP16a]
D. Watel, P. Poirion.
"The Maximum Matrix Contraction problem : Appendix",
Date de dépot: 2016/06/02,
Nb pages 12,
(Tech. Rep.: CEDRIC-16-3645)
Conférence Internationale avec comité de lecture
Rapport Scientifique
2014
-
[WW14]
D. Watel, M. Weisser.
"A practical greedy approximation for the Directed Steiner Tree problem",
Combinatorial optimization and applications (COCOA),
November 2014,
pp.200-215,
Series Lecture Notes in Computer Science,
Wailea, Hawai,
USA,
(DOI: 10.1007/978-3-319-12691-3_16)
Conférence Internationale avec comité de lecture
2011
- [ANP11] L. Alfandari, A. Nagih, A. Plateau, J. Sadki. "Hybridization of column generation and approximation heuristics for large-size Covering Integer Programs", MIC 2011 : The IX Metaheuristics International Conference, July 2011, pp.531-533, Udine, Italy,
Conférence Internationale avec comité de lecture
2008
-
[BR08]
A. Billionnet, F. Roupin.
"A Deterministic Approximation Algorithm for the Densest k-Subgraph Problem",
International Journal of Operational Research,
vol. 3(3), pp. 301-314,
2008, (doi:10.1504/IJOR.2008.017534)
