Publications Récentes

	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 ]