Communication dans les réseaux optiques par multiplexage en longueur d'onde, 2000. ,
Restricted strip covering and the sensor cover problem, Proc. 18th Symp. on Discrete Algorithms, pp.1056-1065, 2007. ,
Opt versus load in dynamic storage allocation, SIAM J. Comput, vol.33, pp.3-632, 2004. ,
Lightpath communications: an approach to high bandwidth optical WAN's, IEEE Transactions on Communications, vol.40, issue.7, pp.1171-1182, 1992. ,
DOI : 10.1109/26.153361
On some packing problem related to dynamic storage allocation, Theoretical Informatics and Applications -Informatique Théorique et Applications, pp.487-499, 1988. ,
DOI : 10.1051/ita/1988220404871
An approximation result for the interval coloring problem on claw-free chordal graphs, Discrete Applied Mathematics, vol.120, issue.1-3, pp.1-3, 2002. ,
DOI : 10.1016/S0166-218X(01)00282-7
Chordal graphs and their clique graphs, Graph-Theoretic Concepts in Computer Science, M. Nagl, pp.358-371, 1995. ,
DOI : 10.1007/3-540-60618-1_88
Approximation algorithms for dynamic storage allocation, Algorithms ? ESA '96, pp.52-61, 1996. ,
DOI : 10.1007/3-540-61680-2_46
Algorithms for compile-time memory optimization, Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms SODA '99, pp.907-908, 1999. ,
Elastic Optical Networking, IEEE, vol.50, issue.2, pp.12-20, 2012. ,
DOI : 10.1016/B978-0-12-396960-6.00014-6
An approximation algorithm for scheduling on three dedicated machines, Discrete Applied Mathematics, vol.61, issue.1, pp.49-59, 1995. ,
DOI : 10.1016/0166-218X(94)00160-F
Algorithmic Graph Theory and Perfect Graphs, Annals of Discrete Mathematics, vol.57, 2004. ,
The edge intersection graphs of paths in a tree, Journal of Combinatorial Theory, Series B, vol.38, issue.1, pp.8-22, 1985. ,
DOI : 10.1016/0095-8956(85)90088-7
Representing edge intersection graphs of paths on degree 4 trees, Discrete Mathematics, vol.308, issue.8, pp.1381-1387, 2008. ,
DOI : 10.1016/j.disc.2007.07.064
Complexity of scheduling multiprocessor tasks with prespecified processor allocations, Discrete Applied Mathematics, vol.55, issue.3, pp.259-272, 1994. ,
DOI : 10.1016/0166-218X(94)90012-4
A simple linear-time approximation algorithm for multi-processor job scheduling on four processors, Lecture Notes in Computer Science, pp.60-71, 1969. ,
The Linearity of First-Fit Coloring of Interval Graphs, SIAM Journal on Discrete Mathematics, vol.1, issue.4, pp.526-530, 1988. ,
DOI : 10.1137/0401048
A polynomial time approximation algorithm for dynamic storage allocation, Discrete Mathematics, vol.88, issue.2-3, pp.2-3, 1991. ,
DOI : 10.1016/0012-365X(91)90011-P
New Approximation Algorithms for Some Dynamic Storage Allocation Problems, Lecture Notes in Computer Science, vol.3106, pp.339-348, 2004. ,
DOI : 10.1007/978-3-540-27798-9_37
Approximation algorithms and heuristics for the dynamic storage allocation problem, Tech. rep., Univ. Maryland Inst. Adv. Comput. Studies, 1999. ,
Approximating interval coloring and maxcoloring in chordal graphs, ACM J. Experimental Algorithmics, vol.10, 2005. ,
On the interval chromatic number of proper interval graphs, Discrete Mathematics, vol.338, issue.11, pp.1907-1916, 2015. ,
DOI : 10.1016/j.disc.2015.04.016
On routing and spectrum allocation in spectrum-sliced optical networks, 2013 Proceedings IEEE INFOCOM, pp.385-389, 2013. ,
DOI : 10.1109/INFCOM.2013.6566800
Spectrum Assignment in Optical Networks: A Multiprocessor Scheduling Perspective, Journal of Optical Communications and Networking, vol.6, issue.8, pp.754-763, 2014. ,
DOI : 10.1364/JOCN.6.000754
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs, SIAM Journal on Computing, vol.13, issue.3, pp.566-579, 1984. ,
DOI : 10.1137/0213035
Spectrum management in heterogeneous bandwidth optical networks, Optical Switching and Networking, vol.11, pp.83-91, 2014. ,
DOI : 10.1016/j.osn.2013.09.003