Efficient routing and scheduling algorithms for optical networks, Proc. of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.412-423, 1994. ,
Topologies for wavelength-routing all-optical networks, IEEE/ACM Transactions on Networking, vol.1, issue.5, pp.5-534, 1993. ,
DOI : 10.1109/90.251912
Echange total dans les réseaux optiques obtenus par composition de cliques, 1996. ,
Improved bounds for all optical routing, Proc. of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.567-576, 1995. ,
On-line competitive algorithms for call admission in optical networks, Lecture Notes in Computer Science, vol.1136, pp.431-444, 1996. ,
Efficient collective communication in optical networks, Lecture Notes in Computer Science, vol.1099, pp.574-585, 1996. ,
Dense wavelength division multiplexing networks: principles and applications, IEEE Journal on Selected Areas in Communications, vol.8, issue.6, pp.948-964, 1990. ,
DOI : 10.1109/49.57798
Special issue on dense WDM networks, Journal on Selected Areas in Communications, vol.8, 1990. ,
Scheduling of virtual connections in fast networks, Proc. of Parallel Systems and Algorithms (PASA), pp.13-32, 1996. ,
Call scheduling in trees, rings and meshes, Proc. of HICSS, 1997. ,
On the complexity of timetable and multicommodity flow problems, SIAM Journal of Computing, vol.5, issue.4, pp.691-703, 1976. ,
Algorithms for routing around a rectangle, Discrete Applied Mathematics, vol.40, pp.363-378, 1992. ,
The complexity of coloring circular arcs and chords, SIAM Journal on Algebraic and Discrete Methods, vol.1, issue.2, pp.216-227, 1980. ,
Colouring paths in directed symmetric trees with applications to WDM routing ,
The edge intersection graphs of paths in a tree, Journal of Combinatorial Theory, Series B, vol.38, pp.8-22, 1985. ,
Edge-disjoint routing in the undirected hypercube, 1996. ,
Routing a permutation in the hypercube by two sets of edgedisjoint paths, Proc. of 10th International Parallel Processing Symposium (IPPS), 1996. ,
Analogues of Shannon capacity, Annals of Discrete Mathematics, pp.155-168, 1982. ,
On forwarding indices of networks, Discrete Applied Mathematics, vol.23, pp.103-123, 1989. ,
Constrained bipartite edge coloring with applications to wavelength routing ,
An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms, Proc. of 29th Annual Symposium on Foundations of Computer Science (FOCS), pp.422-431, 1988. ,
Efficient access to optical bandwidth? wavelength routing on directed fiber trees, rings, and trees of rings, Proc. of 36th Annual Symposium on Foundations of Computer Science (FOCS), pp.548-557, 1995. ,
Intersection graphs of paths in a tree, Journal of Combinatorial Theory, Series B, pp.141-181, 1986. ,
100 channel optical FDM technology and its applications to optical FDM channel-based networks, IEEE/OSA Journal of Lightwave Theory, vol.11, pp.764-776, 1993. ,
Wavelength requirements of all?optical networks, IEEE/ACM Trans. on Networking, vol.3, pp.269-280, 1995. ,
Efficient routing in all-optical networks, Proc. of the 26th Annual ACM Symposium on Theory of Computing, pp.134-143, 1994. ,
All optical implementations of high capacity TDMA networks, Fiber and Integrated Optics, vol.12, pp.173-186, 1993. ,
Distributed computing with high-speed optical networks, Computer, vol.26, issue.2, pp.8-18, 1993. ,
DOI : 10.1109/2.191977