Communication dans les réseaux optiques par multiplexage en longueur d'onde, 2000. ,
On Spectrum Assignment in Elastic Optical TreeNetworks, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01116321
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.632-646, 2004. ,
Lightpath communications: an approach to high bandwidth optical wan's. Communications, IEEE Transactions on, vol.40, pp.1171-1182, 1992. ,
On some packing problem related to dynamic storage allocation, vol.22, pp.487-499, 1988. ,
An approximation result for the interval coloring problem on claw-free chordal graphs, Discrete Appl. Math, vol.120, pp.73-90, 2002. ,
Chordal graphs and their clique graphs, Graph-Theoretic Concepts in Computer Science, M. Nagl, vol.1017, pp.358-371, 1995. ,
The intersection graphs of subtrees in trees are exactly the chordal graphs, Journal of Combinatorial Theory, Series B, vol.16, pp.47-56, 1974. ,
Approximation algorithms for dynamic storage allocation, Algorithms-ESA '96, vol.1136, pp.52-61, 1996. ,
Algorithms for compile-time memory optimization, Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.907-908, 1999. ,
Elastic optical networking: a new dawn for the optical layer? Communications Magazine, IEEE, vol.50, pp.12-20, 2012. ,
An approximation algorithm for scheduling on three dedicated machines, Discrete Applied Mathematics, vol.61, pp.49-59, 1995. ,
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, pp.8-22, 1985. ,
The edge intersection graphs of paths in a tree, Discrete mathematics, vol.55, pp.151-159, 1985. ,
Representing edge intersection graphs of paths on degree 4 trees, Discrete Mathematics, vol.308, pp.1381-1387, 2008. ,
Complexity of scheduling multiprocessor tasks with prespecified processor allocations, Discrete Applied Mathematics, vol.55, pp.259-272, 1994. ,
A simple linear-time approximation algorithm for multi-processor job scheduling on four processors, Lecture Notes in Computer Science, vol.1969, pp.60-71, 2000. ,
The linearity of first-fit coloring of interval graphs, SIAM Journal on Discrete Mathematics, vol.1, pp.526-530, 1988. ,
A polynomial time approximation algorithm for dynamic storage allocation, Discrete Mathematics, vol.88, pp.231-237, 1991. ,
New approximation algorithms for some dynamic storage allocation problems, Lecture Notes in Computer Science, vol.3106, pp.339-348, 2004. ,
Intersection graphs of paths in a tree, Journal of Combinatorial Theory, Series B, vol.41, pp.141-181, 1986. ,
Approximation algorithms and heuristics for the dynamic storage allocation problem, Univ. Maryland Inst. Adv. Comput. Studies, 1999. ,
Approximating interval coloring and max-coloring in chordal graphs, ACM J. Experimental Algorithmics, vol.10, 2005. ,
On the interval chromatic number of proper interval graphs, Discrete Mathematics, vol.338, pp.1907-1916, 2015. ,
On routing and spectrum allocation in spectrum-sliced optical networks, INFOCOM, 2013 Proceedings IEEE, pp.385-389, 2013. ,
Spectrum management techniques for elastic optical networks: A survey, Optical Switching and Networking, vol.13, pp.34-48, 2014. ,
Spectrum assignment in optical networks: A multiprocessor scheduling perspective, J. Opt. Commun. Netw, vol.6, pp.754-763, 2014. ,
Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM J. Comput, vol.13, issue.3, pp.566-579, 1984. ,
Spectrum management in heterogeneous bandwidth optical networks, Optical Switching and Networking, vol.11, pp.83-91, 2014. ,