|
Articles de Journaux
|
|
Hertz, A., Plumettaz, M., and Zufferey, N.
Variable space search for graph coloring (vol 156, pg 2551, 2008).
Discrete Applied Mathematics 157 (2009), 1335-1336.
[ Details ]
|
|
|
Leveque, B., Maffray, F., and Preissmann, M.
Characterizing Path Graphs by Forbidden Induced Subgraphs.
Journal Of Graph Theory 62 (2009), 369-384.
[ Details ]
|
|
|
Hertz, A., and de Werra, D.
A Magnetic Procedure for the Stability Number.
Graphs And Combinatorics 25 (2009), 707-716.
[ Details ]
|
|
|
de Werra, D., Kis, T., and Kubiak, W.
Preemptive open shop scheduling with multiprocessors: polynomial
cases and applications.
Journal Of Scheduling 11 (2008), 75-83.
[ Details ]
|
|
|
Geinoz, A., Ekim, T., and de Werra, D.
Construction of balanced sports schedules using partitions into
subleagues.
Operations Research Letters 36 (2008), 279-282.
[ Details ]
|
|
|
Ekim, T., Mahadev, N. V. R., and de Werra, D.
Polar cographs.
Discrete Applied Mathematics 156 (2008), 1652-1660.
[ Details ]
|
|
|
Costa, M.-C., de Werra, D., Picouleau, C., and Ries, B.
Addendum to bicolored matchings in some classes of graphs.
Graphs and Combinatorics 24, 2 (2008), 127-128.
[ Details ]
|
|
|
Ries, B.
Complexity of mixed graph coloring.
Theoretical Computer Science (2008).
[ Details |
Link ]
|
|
|
Furmancyk, H., Kosowski, A., Ries, B., and Zylinski, P.
Mixed Graph Edge Coloring.
Discrete Mathematics (2008).
[ Details ]
|
|
|
Costa, M.-C., de Werra, D., Picouleau, C., and Ries, B.
A tutorial on the use of graphs in discrete tomography.
4OR 6 (2008), 101-123.
Invited Paper.
[ Details |
Link ]
|
|
|
Ries, B., and de Werra, D.
On two coloring problems in mixed graphs.
European Journal of Combinatorics 29 (2008), 712-725.
[ Details |
Link ]
|
|
|
Costa, M.-C., de Werra, D., Picouleau, C., and Ries, B.
Graph coloring with cardinality constraints on the neighborhoods.
[ Details |
Link ]
|
|
|
Bentz, C., Costa, M.-C., de Werra, D., Picouleau, C., and Ries, B.
On a graph coloring problem arising from discrete tomography.
Networks 51, 4 (2008), 256-267.
[ Details |
Link ]
|
|
|
de Werra, D., and Hammer, P. L.
Weighted stability number of graphs and weighted satisfiability: the
two facets of pseudo-Boolean optimization.
Annals of Operations Research 149, 1 (2007), 67-73.
[ Details ]
|
|
|
Demange, M., de Werra, D., Monnot, J., and Paschos, V.
Time slot scheduling of compatible jobs.
Journal of Scheduling 10, 2 (2007), 11-127.
[ Details ]
|
|
|
Bentz, C., Costa, M.-C., Picouleau, C., de Werra, D., and Ries, B.
Degree-constrained edge partitioning in graphs arising from discrete
tomography.
[ Details ]
|
|
|
Costa, M.-C., de Werra, D., Picouleau, C., and Ries, B.
Bicolored matchings in some classes of graphs.
Graphs and Combinatorics 23, 1 (2007), 47-60.
[ Details ]
|
|
|
Ries, B.
Coloring some classes of mixed graphs.
Discrete Applied Mathematics 155 (2007), 1-6.
[ Details ]
|
|
|
de Werra, D.
Good and nice colorings of balanced hypergraphs.
Discrete Mathematics 306 (2006), 2630-2636.
[ Details ]
|
|
|
Demange, M., Ekim, T., and de Werra, D.
On the approximation of Min Split-coloring and Min
Cocoloring.
Journal of Graph Algorithms and Applications 10, 2
(2006), 297-315.
[ Details ]
|
|
|
de Werra, D., Ekim, T., and Raess, C.
Construction of sports schedules with multiple venues.
Discrete Applied Mathematics 154 (2006), 47-58.
[ Details ]
|
|
|
Costa, M. C., de Werra, D., and Picouleau, C.
Using graphs for some discrete tomography problems.
Discrete Applied Mathematics 154, 1 (2006), 35-46.
[ Details ]
|
|
|
Bornand-Jaccard, T., Schindl, D., and de Werra, D.
Some simple optimization techniques for self-organized public key
management in mobile ad hoc networks.
Discrete Applied Mathematics 154 (2006), 1223-1235.
[ Details ]
|
|
|
Gribovskaia, I. V., Lee, C. L., Strusevich, V., and de Werra, D.
Three is easy, two is hard: open shop sum-batch scheduling problem
refined.
Operations Research Letters 34 (2006), 459-464.
[ Details ]
|
|
|
Blöchliger, I., and de Werra, D.
Locally Restricted Colorings.
Discrete Applied Mathematics 154 (2006), 158-165.
[ Details ]
|
|
|
de Werra, D., Demange, M., Monnot, J., and Paschos, V. T.
A hypocoloring model for batch scheduling.
Discrete Applied Mathematics 146 (2005), 3-26.
[ Details ]
|
|
|
de Werra, D.
Path colorings in bipartite multigraphs.
European Journal of Oper. Research 164 (2005), 575-584.
[ Details ]
|
|
|
Costa, M. C., de Werra, D., Picouleau, C., and Schindl, D.
A solvable case of image reconstruction in discrete tomography.
Discrete Applied Mathematics 148, 3 (2005), 240-245.
[ Details ]
|
|
|
de Werra, D., and Hansen, P.
Variations on the Roy-Gallai Theorem.
4OR 3 (2005), 245-251.
[ Details ]
|
|
|
Ekim, T., and de Werra, D.
On split-coloring problems.
Journal of Combinatorial Optimization 10, 3 (2005),
211-225.
[ Details ]
|
|
|
Demange, M., Ekim, T., and de Werra, D.
(p,k)-coloring problems in line graphs.
Theoretical Computer Science 349, 3 (2005), 462-474.
[ Details ]
|
|
|
Demange, M., Ekim, T., and de Werra, D.
Partitioning cographs into cliques and stable sets.
Discrete Optimization 2, 2 (2005), 145-153.
[ Details ]
|
|
|
Ekim, T., and Paschos, T. V.
Approximation preserving reductions among set covering and vertex
covering hierarchies via differential approximation ratio.
International Journal of Computer Mathematics 81, 5
(2004), 569-582.
[ Details ]
|
|
|
Blöchliger, I.
Modeling Staff Scheduling Problems. a Tutorial.
European Journal of Operational Research 158 (2004),
533-542.
[ Details ]
|
|
|
Blöchliger, I.
Color-blind Graphs and Suboptimal Colorings.
Electronic Notes in Discrete Mathematics 18 (2004),
37-40.
Extended abstract for the em Latin-American Conference on
Combinatorics, Graphs and Applications (LACGA'04), Santiago, Chile.
[ Details ]
|
|
|
Blöchliger, I., and de Werra, D.
On Some Properties of Suboptimal Colorings of Graphs.
Networks 43(2) (2004), 103-108.
[ Details |
Full Text ]
|
|
|
de Werra, D., and Hansen, P.
Using stable sets to bound the chromatic number.
Information Processing Letters 87 (2003), 127-131.
[ Details ]
|
|
|
de Werra, D.
Variations on the theorem of Birkhoff-von Neumann and extensions.
Graphs and Combinatorics 19 (2003), 263-278.
[ Details ]
|
|
|
de Werra, D.
Partitioning the edge set of a bipartite graph into chain packings:
complexity of some variations.
Linear Algebra and its Applications 268 (2003), 315-327.
[ Details ]
|
|
|
Alexe, G., Hammer, P. L., Lozin, V., and de Werra, D.
Struction revisited.
Discrete Applied Mathematics 132, 1-3 (2003), 27-46.
[ Details ]
|
|
|
de Werra, D., and Kobler, D.
Colorations de graphes: fondements et applications.
RAIRO Operations Research 37 (2003), 29-66.
[ Details ]
|
|
|
de Werra, D., Eisenbeis, C., Lelait, S., and Stöhr, E.
Circular-arc graph coloring: on chords and circuits in the meeting
graph.
European Journal of Oper. Research 136 (2002), 483-500.
[ Details ]
|
|
|
Asratian, A. S., and de Werra, D.
A generalized class-teacher model for timetabling problems.
European Journal of Oper. Research 143 (2002), 531-542.
[ Details ]
|
|
|
Asratian, A. S., and de Werra, D.
Complexity of some special types of timetabling problems.
Journal of Scheduling 5 (2002), 171-183.
[ Details ]
|
|
|
de Werra, D., Hertz, A., Kobler, D., and Mahadev, N. V. R.
Feasible edge colorings of trees with cardinality constraints.
Discrete Mathematics 222, 1-3 (2000), 61-72.
[ Details ]
|
|
|
de Werra, D.
On a multiconstrained model for chromatic scheduling.
Discrete Applied Mathematics 94 (1999), 171-180.
[ Details ]
|
|
|
de Werra, D., and Hertz, A.
On perfectness of sums of graphs.
Discrete Mathematics 195 (1999), 93-101.
[ Details ]
|
|
|
de Werra, D., Eisenbeis, C., Lelait, S., and Marmol, B.
On a graph-theoretical model for cyclic register allocation.
Discrete Applied Mathematics 93, 2-3 (1999), 191-203.
[ Details ]
|
|
|
de Werra, D.
Restricted graph coloring: some mathematical programming models.
CRM Processings & Lectures Notes 23 (1999),
135-148.
[ Details ]
|
|
|
Blazewicz, J., Hertz, A., Kobler, D., and de Werra, D.
On some properties of DNA graphs.
Discrete Applied Mathematics 98, 1-2 (1999), 1-19.
[ Details ]
|
|
|
de Werra, D.
The combinatorics of timetabling.
European Journal of Oper. Research 96 (1997), 504-513.
[ Details ]
|
|
|
Hansen, P., Kuplinsky, J., and de Werra, D.
Mixed graphs colorings.
Mathematical Methods of Oper. Res. 45 (1997), 145-160.
[ Details ]
|
|
|
de Werra, D.
Restricted colorings models for timetabling.
Discrete Mathematics 165/166 (1997), 161-170.
[ Details ]
|
|
|
de Werra, D., and Mahadev, N. V. R.
Preassignment requirements in chromatic scheduling.
Discrete Applied Mathematics 76 (1997), 93-101.
[ Details ]
|
|
|
Hansen, P., and de Werra, D.
Nesticity, DIMACS series.
Discrete Mathematics & Theoretical Computer Science
37 (1997), 225-232.
[ Details ]
|
|
|
Blazewicz, J., Drozdowski, M., de Werra, D., and Weglarz, J.
Deadline scheduling of multiprocessor tasks.
Discrete Applied Mathematics 65, 1-3 (1996), 81-95.
[ Details ]
|
|
|
de Werra, D., and Erschler, J.
Open shop scheduling with some additional constraints.
Graphs and Combinatorics 12 (1996), 81-93.
[ Details ]
|
|
|
Mahadev, N. V. R., Peled, U. N., de Werra, D., and Hoffman, A. J.
Restrictions and pre-assignments in preemptive open shop scheduling.
Discrete Applied Mathematics 68 (1996), 169-188.
[ Details ]
|
|
|
de Werra, D., and Gay, Y.
Chromatic scheduling and frequency assignment.
Discrete Applied Mathematics 49, 1-3 (1994), 165-174.
[ Details ]
|
|
|
Blazewicz, J., Drozdowski, M., Schmidt, G., and de Werra, D.
Scheduling independent multi processor tasks on a uniform k-processor
system.
Parallel computing 20 (1994), 15-28.
[ Details ]
|
|
|
Hilton, A. J. W., and de Werra, D.
A sufficient condition to equitable edge colorings of simple graphs.
Discrete Mathematics 128, 1-3 (1994), 179-201.
[ Details ]
|
|
|
Hasler, M., Marthy, C., Oberlin, A., and de Werra, D.
A discrete model for studying existence and uniqueness of solution
sin non linear resistive circuits.
Discrete Applied Mathematics 50, 2 (1994), 169-184.
[ Details ]
|
|
|
de Werra, D., Mahadev, N. V. R., and Solot, P.
Scheduling periodic jobs compacly within a fixed time period in open
shops.
INFOR 32 (1994), 110-120.
[ Details ]
|
|
|
Amaldi, E., Mayoraz, E., and de Werra, D.
A review of combinatorial problems arising in feed forward neural
network design.
Discrete Applied Mathematics 52, 2 (1994), 111-138.
[ Details ]
|
|
|
Amaldi, E., Cepek, O., Vlach, M., and de Werra, D.
Non preemptive open shop with restricted processing times.
Zeitschrift für OR 39 (1994), 227-241.
[ Details ]
|
|
|
de Werra, D.
On an optimization problem occurring in FMMs: a hypergraph
theoretical formulation.
Discrete Applied Mathematics 55, 2 (1994), 107-111.
[ Details ]
|
|
|
Gavril, F., Toledano Laredo, V., and de Werra, D.
Chordless paths, odd holes and kernels in graphs without
m-obstructions.
Journal of Algorithms 17, 2 (1994), 207-221.
[ Details ]
|
|
|
de Werra, D.
Extensions of colorings models for scheduling purposes.
European Journal of Oper. Research 92 (1994), 474-492.
[ Details ]
|
|
|
Dubois, N., and de Werra, D.
EPCOT : an Efficient Procedure for Coloring Optimally with
Tabu search.
Computers Math. Appl. 25 (1993), 35-45.
[ Details ]
|
|
|
de Werra, D., Hell, P., Kameda, T., Katoh, N., Solot, P., and Yamashita,
M.
Graph endpoint coloring and distributed processing: A scheduling
problem in distributed processing,.
Networks 23 (1993), 93-98.
[ Details ]
|
|
|
Hertz, A., and de Werra, D.
On the stability number of AH-free graphs.
Journal of Graph Theory 17 (1993), 53-63.
[ Details ]
|
|
|
Mahadev, N. V. R., Solot, P., and de Werra, D.
The cyclic compact open-shop scheduling problem.
Discrete Mathematics 111, 1-3 (1993), 361-366.
[ Details ]
|
|
|
de Werra, D., and Blazewicz, J.
Addendum: some preemptive open shop scheduling problems with a
renewable or a non renewable resource.
Discrete Applied Mathematics 43, 1 (1993), 103-104.
[ Details ]
|
|
|
de Werra, D., and Solot, P.
Some graph-theoretical models for scheduling in automated production
systems.
Networks 23 (1993), 651-660.
[ Details ]
|
|
|
de Werra, D., Mahadev, N. V. R., and Peled, U. N.
Edge-chromatic scheduling with simultaneity constraints.
SIAM Journal Discrete Math. 6 (1993), 631-641.
[ Details ]
|
|
|
Fiechter, C. N., Rogger, A., and de Werra, D.
Basic ideas of Tabu search with an application to traveling
salesman and quadratic assignment.
Ricerca Operativa 62 (1992), 5-28.
[ Details ]
|
|
|
de Werra, D., and Blazewicz, J.
Some preemptive open shop scheduling problems with a renewable or a
nonrenewable resource.
Discrete Applied Mathematics 35 (1992), 205-219.
[ Details ]
|
|
|
Mahadev, N. V. R., Solot, P., and de Werra, D.
Cylindrical open shop scheduling: some solvable cases.
Vishwa International Journal of Graph Theory 1
(1992), 29-52.
[ Details ]
|
|
|
de Werra, D., and Solot, P.
Compact cylindrical chromatic scheduling.
SIAM Journal on Discrete Mathmematics 4 (1991),
528-534.
[ Details ]
|
|
|
Oberlin, A., Rogger, A., de Werra, D., Bron-Pury, C., Viret-Bernal, F.,
and Bérard, C.
Idendifying mythological scenes with artificial intelligence.
Science and Archeology 33 (1991), 18-27.
[ Details ]
|
|
|
de Werra, D., Blazewicz, J., and Kubiak, W.
A preemptive open shop scheduling problem with one resource.
Operations Research Letters 10 (1991), 9-15.
[ Details ]
|
|
|
de Werra, D., and Roberts, F. S.
On the use of augmenting chains in chain packings.
Discrete Applied Mathematics 30, 2-3 (1991), 137-149.
[ Details ]
|
|
|
Bovet, J., Constantin, C., and de Werra, D.
A convoy scheduling problem.
Discrete Applied Mathematics 30, 1 (1991), 1-14.
[ Details ]
|
|
|
de Werra, D., and Widmer, M.
Loading problems with tool management in flexible manufacturing
systems: a few integer programming models.
International Journal of Flexible Manufacturing Systems
13 (1990), 71-82.
[ Details ]
|
|
|
de Werra, D.
Almost nonpreemptive schedules,.
Annals of Operations Research 26 (1990), 243-256.
[ Details ]
|
|
|
Cochand, M., Simeone, B., and de Werra, D.
Recognition of a class of unimodular functions.
Discrete Applied Mathematics 29 (1990), 243-250.
[ Details ]
|
|
|
Hertz, A., and de Werra, D.
The Tabu search metaheuristic: how we used it.
Annal of Mathematics and Artificial Intelligence 1
(1990), 111-121.
[ Details ]
|
|
|
Friden, C., Hertz, A., and de Werra, D.
TABARIS: an exact algorithm based on Tabu search for finding a
maximum independent set in a graph.
Computers and Operations Research 17, 5 (1990), 437-445.
[ Details ]
|
|
|
Blazewicz, J., Drozdowski, M., Schmidt, G., and de Werra, D.
Scheduling independent two-processor tasks on a uniform duo-processor
system.
Discrete Applied Mathematics 28, 1 (1990), 11-20.
[ Details ]
|
|
|
de Werra, D.
A note on SS/TDMA, satellite communication,.
Linear Algebra and its Applications 135, 1 (1990), 69-77.
[ Details ]
|
|
|
de Werra, D., Jacot-Decombes, L., and Masson, P.
A constrained sports scheduling problem.
Discrete Applied Mathematics 26, 1 (1990), 41-49.
[ Details ]
|
|
|
Cochand, M., de Werra, D., and Slowinski, R.
Preemptive scheduling with staircase and piecewise linear resource
availability.
Zeitschrift für Operations Research 33 (1989), 297-313.
[ Details ]
|
|
|
Chabal, N., and de Werra, D.
An interactive system for constructing timetables on a PC.
European Journal of Operational Research 40 (1989),
32-37.
[ Details ]
|
|
|
Hertz, A., and de Werra, D.
Connected sequential colorings.
Discrete Mathematics 74 (1989), 51-59.
[ Details ]
|
|
|
de Werra, D., and Hertz, A.
Tabu search: a tutorial and an application to neural networks.
OR Spektrum 11 (1989), 131-141.
[ Details ]
|
|
|
Pulleyblank, W., and de Werra, D.
Odd path packings.
European Journal of Operational Research 10 (1989),
585-595.
[ Details ]
|
|
|
de Werra, D.
Generalized edge packings.
Mathematical Programming 44 (1989), 235-245.
[ Details ]
|
|
|
de Werra, D., and Pasche, C.
Paths, chains and antipaths.
Networks 19 (1989), 107-115.
[ Details ]
|
|
|
Friden, C., Hertz, A., and de Werra, D.
STABULUS: a technique for finding stable sets in large graphs with
tabu search.
Computing 42, 1 (1989), 35-44.
[ Details ]
|
|
|
Dalang, R. C., Trotter, L. E. J., and de Werra, D.
On randomized stopping points and perfect graphs.
Journal of Combinatorial Theory, Series B 45, 3 (1988),
320-344.
[ Details |
Link ]
|
|
|
