|
Livres
Cliquer ici pour une liste complète.
Chapitres de livres
|
|
de Werra, D., and Kobler, D.
Problèmes de coloration dans les graphes.
In Optimisation Combinatoire, vol. 5. Hermès Science, Paris,
2007, pp. 95-141.
[ Details ]
|
|
|
de Werra, D.
Hypergraph coloring by bichromatic exchanges.
In Graph Theory and Combinatorial Optimization, D. Avis,
A. Hertz, and O. Marcotte, Eds. Springer Verlag, 2005, pp. 255-264.
[ Details ]
|
|
|
Burke, E., de Werra, D., and Kingston, J.
Applications to timetabling.
In Handbook of Graph Theory, J. L. Gross and J. Yellen,
Eds. CRC Press London, 2004, pp. 445-474.
[ Details ]
|
|
|
de Werra, D., Demange, M., Monnot, J., and Paschos, V. T.
The hypocoloring problem: complexity and approximability results when
the chromatic number is small.
In WG2004, Lecture Notes in Computer Science 3353,
J. Hromovich, M. Nagl, and B. Westfechtel, Eds. Springer Verlag, 2004,
pp. 377-388.
[ Details ]
|
|
|
de Werra, D., Demange, M., Escoffier, B., Monnot, J., and Paschos, V. T.
Weighted coloring: on planar bipartite and split graphs: complexity
and improved approximation.
In Algorithms and Computations, 15th International
symposium, Lecture Notes in computer Science 2573. Springer Verlag,
2004, pp. 377-388.
[ Details ]
|
|
|
de Werra, D.
Constraints of availability in timetabling and scheduling.
In Practice and Theory of Automated Timetabling IV,
E. Burke and P. de Causmaeker, Eds., vol. IV. Springer Verlag, 2003,
pp. 3-23.
[ Details ]
|
|
|
de Werra, D., Hansen, P., and Bouyssou, D.
Connectivity, transitivity and chromaticity: the pioneering work of
Bernard Roy in Graph Theory.
In Aiding Decisions with Multiple Criteria. Kluwer
Academic Publishers, 2002, pp. 23-42.
[ Details ]
|
|
|
Demange, M., de Werra, D., Monnot, J., and Paschos, V. T.
Weighted node coloring: when stable sets are expensive.
In Proceedings of WG'02, 28th International workshop on
graph theoretic concepts in compute science, Lecture Notes in Computer
Science 2573. Springer Verlag, 2002, pp. 113-125.
[ Details ]
|
|
|
de Werra, D.
Restricted graph coloring: some mathematical programming models.
In CRM Processings & Lecture Notes, vol. 23. 1999,
pp. 135-148.
[ Details ]
|
|
|
Hertz, A., Taillard, E., and de Werra, D.
Tabu Search.
In Local search in combinatorial optimization, E. Aarts and
J. K. Lenstra, Eds. John Wiley & Sons Ltd, N.Y., 1997, pp. 121-136.
[ Details ]
|
|
|
de Werra, D.
Some combinatorial models for course scheduling.
In Lecture Notes in: Computer Science 1153, E. Burke and
P. Ross, Eds., vol. 1153. Springer Verlag, 1996, pp. 296-308.
[ Details ]
|
|
|
de Werra, D., Glover, F., and Silver, E. A.
A chromatic scheduling model with costs.
In IIE Transactions, vol. 27. 1995, pp. 181-189.
[ Details ]
|
|
|
Solot, P., and de Werra, D.
Some graph coloring models for cyclic scheduling.
In Scheduling Theory and its Applications, P. Chrétienne,
E. G. J. Coffman, J. K. Lenstra, and Z. Liu, Eds. John Wiley & Sons Ltd,
N.Y., 1995, pp. 227-239.
[ Details ]
|
|
|
Airoldi, J. P., and de Werra, D.
The burrow system of the fossorial form of the water vole (arvicola
Terrestris L.).
In (Mammalia, Rodentia): an approach using graph theoretical
methods and simulation models, vol. 57. 1993, pp. 423-433.
[ Details ]
|
|
|
de Werra, D., and Solot, P.
Graph coloring models for scheduling in automated production systems.
In Proceedings of the second conference of the Association of
Asian-Pacific Operational Research Societies APORS, C. P. Wu,
Ed. Peking University Press, 1991, pp. 26-34.
[ Details ]
|
|
|
de Werra, D.
Packing independent sets and transversals.
In Combinatorics and graph theory, vol. 25. Banach Center
Publications, Warsaw, 1989, pp. 233-240.
[ Details ]
|
|
|
Amaldi, E., Mayoraz, E., Hertz, A., and de Werra, D.
Apprentissage dans les réseaux de Hopfield.
In Comptes rendus des journées d'électronique. Presses
Polytechniques Romandes, 1989, pp. 77-85.
[ Details ]
|
|
|
de Werra, D.
Graph-theoretical models for preemptive scheduling.
In Advances in Project Scheduling, R. Slowinski and
J. Weglarz, Eds. Elsevier, Amsterdam, 1989, pp. 171-185.
[ Details ]
|
|
|
de Werra, D.
Heuristics for graph coloring.
In Computational graph theory, G. Tinhofer, E. Mayoraz,
H. Noltemeir, and M. Syslo, Eds. Springer Verlag NY, 1989, pp. 171-185.
[ Details ]
|
|
|
Barras, J., Alec, S., Pasche, C., Chamorel, P. A., Germond, A. J., and
de Werra, D.
Network simplex method applied to AC load-flow calculation.
In IEEE Transactions on Power Systems, vol. 2. 1987,
pp. 197-203.
[ Details ]
|
|
|
de Werra, D.
Graphs, networks and applications.
In Further developments in operational research, G. K. Rand and
R. W. Eglese, Eds. Pergamon Press Oxford, 1985, pp. 76-95.
[ Details ]
|
|
|
de Werra, D.
Graphs, hypergraphs and timetabling.
In Methods Operational Research, vol. 49. Verlag A. Hain,
Königstein, 1985, pp. 201-215.
[ Details ]
|
|
|
de Werra, D.
Some min-max formulations for partitioning problems in graphs and
hypergraphs, Proceedings (Springer Verlag).
In Graphs and hypergraphs, DGOR Operations Research
Proceedings. Springer Verlag, 1984, pp. 269-273.
[ Details ]
|
|
|
de Werra, D.
On the fuzzy faces of the COP domain.
In Methods operational research, R. Henn, Ed., vol. 45.
Althenäum, Hain, Hastein, 1983, pp. 213-216.
[ Details ]
|
|
|
de Werra, D.
Scheduling in Sports.
In Studies on graphs and integer programming, P. Hansen, Ed.,
vol. 11. Annals of Discrete Mathematics, North Holland, 1981, pp. 381-395.
[ Details ]
|
|
|
de Werra, D.
Some partitioning problems for graphs and hypergraphs.
In Proceedings V Symposium on Operations Research.
1980, pp. 291-293.
[ Details ]
|
|
|
de Werra, D.
Fantaisies chromatiques sur diverses partitions.
In Regards sur la théorie des graphes, P. Hansen and
D. de Werra, Eds. Presses Polytechniques Romandes, 1980, pp. 217-226.
[ Details ]
|
|
|
de Werra, D.
Network flows and chromatic scheduling.
In Proceedings of DAPS, J. Krarup and S. Walukiewicz, Eds.
Uni of Copenhagen, 1980, pp. 429-438.
[ Details ]
|
|
|
de Werra, D.
Optimisation in edge-chromatic scheduling.
In Survey of Mathematical Programming, A. Prekopa, Ed.
Akademiai Kiado, Budapest, 1980, pp. 379-382.
[ Details ]
|
|
|
de Werra, D.
On a class of hypergraphs occurring in chromatic scheduling,.
In Cahiers du C.E.R.O., vol. 21. 1979, pp. 239-245.
[ Details ]
|
|
|
de Werra, D.
Color-feasible sequences in almost bipartite graphs.
In Problèmes combinatoires et théorie des graphes, F. Bermond
and S. Las Vergnas, Eds. Orsay - Editions CNRS, Paris, 1978, pp. 427-429.
[ Details ]
|
|
|
de Werra, D.
Progressive balancing in chromatic scheduling.
In Proceedings of Combinatorial Programming, T. A. Boffey,
Ed. Uni. of Liverpool, 1977, pp. 105-113.
[ Details ]
|
|
|
Rochat, J. C., and de Werra, D.
Modélisation mathématique du recyclage des boues d'épuration comme
engrais pour l'agriculture.
In Modélisation et maîtrise des systèmes techniques,
économiques, sociaux, Actes du Congrès AFCET. Hommes et Techniques,
Paris, 1977, pp. 519-526.
[ Details ]
|
|
|
de Werra, D.
On a multi-period assignment problem.
In Advances in operations research, M. Roubens, Ed.
Physica-Verlag, Würzburg, North Holland, Amsterdam, 1977, pp. 129-134.
[ Details ]
|
|
|
Beck, P., Rochat, J. C., and de Werra, D.
Un modèle pour l'utilisation dans l'agriculture des boues produites
par les stations d'épuration.
In Proceedings in Operation Research. Physica-Verlag,
Würzburg, 1976, p. 412.
[ Details ]
|
|
|
de Werra, D.
Everything you always wanted to know about S. ex.
In Proceedings in Operation Research. Physica-Verlag,
Würzburg, 1976, pp. 104-107.
[ Details ]
|
|
|
de Werra, D.
On good and equitable colorings.
In Cahiers du C.E.R.O., vol. 17. 1975, pp. 417-426.
[ Details ]
|
|
|
de Werra, D.
A few remarks on chromatic scheduling.
In Combinatorial programming : methods and applications,
B. Roy, Ed. D. Reidel Publ. Co., Dordrecht, Netherlands, 1975, pp. 337-342.
[ Details ]
|
|
|
de Werra, D.
How to color a graph.
In Combinatorial programming : methods and applications,
B. Roy, Ed. D. Reidel Publ. Co., Dordrecht, Netherlands, 1975, pp. 305-325.
[ Details ]
|
|
|
de Werra, D.
Partitions of graphs into coverings and hypergraphs into
transversals.
In Comment Math. Helvet., vol. 49. 1974, pp. 175-178.
[ Details ]
|
|
|
de Werra, D.
Résolution de problèmes d'horaires par la théorie des graphes.
In EPFL. 1969.
[ Details ]
|
|
|
