Investigations on an edge coloring problem. - Dominique de Werra (Discret. Math., 1971)

Decomposition of bipartite multigraphs into matchings. - Dominique de Werra (Z. Oper. Research, 1972)

A note on graph coloring. - Dominique de Werra (RAIRO Theor. Informatics Appl., 1974)

Some results in chromatic scheduling. - Dominique de Werra (Z. Oper. Research, 1974)

An extension of bipartite multigraphs. - Dominique de Werra (Discret. Math., 1976)

A note on a paper by D. Seinsche. - J. C. Arditti; Dominique de Werra (J. Comb. Theory B, 1976)

Some remarks on good colorations. - Dominique de Werra (J. Comb. Theory B, 1976)

Multigraphs with quasiweak odd cycles. - Dominique de Werra (J. Comb. Theory B, 1977)

Compactness and balancing in scheduling. - Daniel Brélaz; Y. Nicolier; Dominique de Werra (Math. Methods Oper. Res., 1977)

On line perfect graphs. - Dominique de Werra (Math. Program., 1978)

Color-feasible sequences of a multigraph. - Dominique de Werra (Networks, 1978)

Regular and canonical colorings. - Dominique de Werra (Discret. Math., 1979)

On the use of alternating chains and hypergraphs in edge coloring. - Dominique de Werra (J. Graph Theory, 1979)

Geography, games and graphs. - Dominique de Werra (Discret. Appl. Math., 1980)

On the existence of generalized good and equitable edge colorings. - Dominique de Werra (J. Graph Theory, 1981)

On some characterisations of totally unimodular matrices. - Dominique de Werra (Math. Program., 1981)

Minimizing irregularities in sports schedules using graph theory. - Dominique de Werra (Discret. Appl. Math., 1982)

Obstructions for regular colorings. - Dominique de Werra (J. Comb. Theory B, 1982)

Variation on a theorem of König. - Dominique de Werra (Discret. Math., 1984)

A decomposition property of polyhedra. - Dominique de Werra (Math. Program., 1984)

The struction of a graph: Application to CN-free graphs. - Peter L. Hammer; Nadimpalli V. R. Mahadev; Dominique de Werra (Comb., 1985)

Split graphs of Dilworth number 2. - Claude Benzaken; Peter L. Hammer; Dominique de Werra (Discret. Math., 1985)

Stability in CAN-free graphs. - Peter L. Hammer; Nadimpalli V. R. Mahadev; Dominique de Werra (J. Comb. Theory B, 1985)

Threshold characterization of graphs with dilworth number two. - Claude Benzaken; Peter L. Hammer; Dominique de Werra (J. Graph Theory, 1985)

Book review. - Dominique de Werra (Z. Oper. Research, 1985)

A note on strong perfectness of graphs. - Myriam Preissmann; Dominique de Werra (Math. Program., 1985)

On the multiplication of divisions: The use of graphs for sports scheduling. - Dominique de Werra (Networks, 1985)

Generalized neighbourhoods and a class of perfectly orderable graphs. - Maurice Cochand; Dominique de Werra (Discret. Appl. Math., 1986)

A note on superbrittle graphs. - Myriam Preissmann; Dominique de Werra; Nadimpalli V. R. Mahadev (Discret. Math., 1986)

Node coverings with odd chains. - Dominique de Werra (J. Graph Theory, 1986)

Using tabu search techniques for graph coloring. - Alain Hertz; Dominique de Werra (Computing, 1987)

Four classes of perfectly orderable graphs. - Vasek Chvátal; Chính T. Hoàng; Nadimpalli V. R. Mahadev; Dominique de Werra (J. Graph Theory, 1987)

Partitions into odd chains. - Dominique de Werra (Math. Program., 1987)

Some models of graphs for scheduling sports competitions. - Dominique de Werra (Discret. Appl. Math., 1988)

Perfectly orderable graphs are quasi-parity graphs: a short proof. - Alain Hertz; Dominique de Werra (Discret. Math., 1988)

On randomized stopping points and perfect graphs. - Robert C. Dalang; Leslie E. Trotter Jr.; Dominique de Werra (J. Comb. Theory B, 1988)

Consecutive colorings of graphs. - Dominique de Werra; Alain Hertz (ZOR Methods Model. Oper. Res., 1988)

From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions. - Peter L. Hammer; Bruno Simeone; Thomas M. Liebling; Dominique de Werra (SIAM J. Discret. Math., 1988)

STABULUS: A technique for finding stable sets in large graphs with tabu search. - Charles Friden; Alain Hertz; Dominique de Werra (Computing, 1989)

Connected sequential colorings. - Alain Hertz; Dominique de Werra (Discret. Math., 1989)

Odd Path Packings. - William R. Pulleyblank; Dominique de Werra (Eur. J. Comb., 1989)

Preemptive scheduling with staircase and piecewise linear resource availability. - Maurice Cochand; Dominique de Werra; Roman Slowinski (ZOR Methods Model. Oper. Res., 1989)

Generalized edge packings. - Dominique de Werra (Math. Program., 1989)

Paths, chains, and antipaths. - Dominique de Werra; C. Pasche (Networks, 1989)

The Tabu Search Metaheuristic: How we used it. - Alain Hertz; Dominique de Werra (Ann. Math. Artif. Intell., 1990)

Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph. - Charles Friden; Alain Hertz; Dominique de Werra (Comput. Oper. Res., 1990)

Scheduling independent two processor tasks on a uniform duo-processor system. - Jacek Blazewicz; Maciej Drozdowski; Günter Schmidt 002; Dominique de Werra (Discret. Appl. Math., 1990)

Preface. - Pierre Hansen; Dominique de Werra (Discret. Appl. Math., 1990)

Recognition of a class of unimodular functions. - Bruno Simeone; Dominique de Werra; Maurice Cochand (Discret. Appl. Math., 1990)

A constrained sports scheduling problem. - Dominique de Werra; Loïc Jacot-Descombes; P. Masson (Discret. Appl. Math., 1990)

A convoy scheduling problem. - Jean Bovet; C. Constantin; Dominique de Werra (Discret. Appl. Math., 1991)

Erratum. - Bruno Simeone; Dominique de Werra; Maurice Cochand (Discret. Appl. Math., 1991)

On the use of augmenting chains in chain packings. - Dominique de Werra; Fred S. Roberts (Discret. Appl. Math., 1991)

A preemptive open shop scheduling problem with one resource. - Dominique de Werra; Jacek Blazewicz; Wieslaw Kubiak (Oper. Res. Lett., 1991)

Compact Cylindrical Chromatic Scheduling. - Dominique de Werra; Ph. Solot (SIAM J. Discret. Math., 1991)

Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource. - Dominique de Werra; Jacek Blazewicz (Discret. Appl. Math., 1992)

Foreword. - Dominique de Werra; Alain Hertz (Discret. Appl. Math., 1992)

Scheduling Multiprocessor Tasks on Uniform Processors. - Jacek Blazewicz; Maciej Drozdowski; Günter Schmidt 002; Dominique de Werra (PARCO, 1993)

Some Preemptive open Shop Scheduling Problems with a Renewable or a Nonrenewable Resource. (Discrete Applied Mathematics 35 (1992) 205-219). - Dominique de Werra; Jacek Blazewicz (Discret. Appl. Math., 1993)

The cyclic compact open-shop scheduling problem. - Nadimpalli V. R. Mahadev; Ph. Solot; Dominique de Werra (Discret. Math., 1993)

On the stability number of AH-free graphs. - Alain Hertz; Dominique de Werra (J. Graph Theory, 1993)

Graph endpoint coloring and distributed processing. - Dominique de Werra; Pavol Hell; Tiko Kameda; Naoki Katoh; Ph. Solot; Masafumi Yamashita (Networks, 1993)

Some graph-theoretical models for scheduling in automated production systems. - Dominique de Werra; Ph. Solot (Networks, 1993)

Edge-Chromatic Scheduling with Simultaneity Constraints. - Dominique de Werra; Nadimpalli V. R. Mahadev; Uri N. Peled (SIAM J. Discret. Math., 1993)

A Review of Combinatorial Problems Arising in Feedforward Neural Network Design. - Edoardo Amaldi; Eddy Mayoraz; Dominique de Werra (Discret. Appl. Math., 1994)

A discrete model for studying existence and uniqueness of solutions in nonlinear resistive circuits. - M. Hasler; C. Marthy; A. Oberlin; Dominique de Werra (Discret. Appl. Math., 1994)

on an optimization Problem occurring in FMSs: A Hypergraph-theoretical Formulation. - Dominique de Werra (Discret. Appl. Math., 1994)

Chromatic Scheduling and Frequency Assignment. - Dominique de Werra; Y. Gay (Discret. Appl. Math., 1994)

A sufficient condition for equitable edge-colourings of simple graphs. - Anthony J. W. Hilton; Dominique de Werra (Discret. Math., 1994)

Chordless Paths, Odd Holes, and Kernels in Graphs without m-Obstructions. - Fanica Gavril; V. Toledano Laredo; Dominique de Werra (J. Algorithms, 1994)

Nonpreemptive open shop with restricted processing times. - Ondrej Cepek; Milan Vlach; Dominique de Werra (Math. Methods Oper. Res., 1994)

Scheduling Independent Multiprocessor Tasks on a Uniform k-Processor System. - Jacek Blazewicz; Maciej Drozdowski; Günter Schmidt 002; Dominique de Werra (Parallel Comput., 1994)

Some Combinatorial Models for Course Scheduling. - Dominique de Werra (PATAT, 1995)

Nesticity. - Pierre Hansen; Dominique de Werra (Mathematical Hierarchies and Biology, 1996)

Deadline Scheduling of Multiprocessor Tasks. - Jacek Blazewicz; Maciej Drozdowski; Dominique de Werra; Jan Weglarz (Discret. Appl. Math., 1996)

Restrictions and Preassignments in Preemptive open Shop Scheduling. - Dominique de Werra; Alan J. Hoffman; Nadimpalli V. R. Mahadev; Uri N. Peled (Discret. Appl. Math., 1996)

Open shop scheduling with some additional constraints. - Dominique de Werra; Jacques Erschler (Graphs Comb., 1996)

Preassignment Requirements in Chromatic Scheduling. - Dominique de Werra; Nadimpalli V. R. Mahadev (Discret. Appl. Math., 1997)

Restricted coloring models for timetabling. - Dominique de Werra (Discret. Math., 1997)

Mixed graph colorings. - Pierre Hansen; Julio Kuplinsky; Dominique de Werra (Math. Methods Oper. Res., 1997)

On some Properties of DNA Graphs. - Jacek Blazewicz; Alain Hertz; Daniel Kobler; Dominique de Werra (Discret. Appl. Math., 1999)

On a Multiconstrained Model for Chromatic Scheduling. - Dominique de Werra (Discret. Appl. Math., 1999)

On a Graph-theoretical Model for Cyclic Register Allocation. - Dominique de Werra; Christine Eisenbeis; Sylvain Lelait; Bruno Marmol (Discret. Appl. Math., 1999)

On perfectness of sums of graphs. - Dominique de Werra; Alain Hertz (Discret. Math., 1999)

Feasible edge colorings of trees with cardinality constraints. - Dominique de Werra; Alain Hertz; Daniel Kobler; Nadimpalli V. R. Mahadev (Discret. Math., 2000)

Variations on the theorem of Birkhoff-von Neumann and extensions. - Dominique de Werra (Electron. Notes Discret. Math., 2000)

Constraints of Availability in Timetabling and Scheduling. - Dominique de Werra (PATAT, 2002)

Weighted Node Coloring: When Stable Sets Are Expensive. - Marc Demange; Dominique de Werra; Jérôme Monnot; Vangelis Th. Paschos (WG, 2002)

A generalized class-teacher model for some timetabling problems. - Armen S. Asratian; Dominique de Werra (Eur. J. Oper. Res., 2002)

Circular-arc graph coloring: On chords and circuits in the meeting graph. - Dominique de Werra; Christine Eisenbeis; Sylvain Lelait; Elena Stöhr (Eur. J. Oper. Res., 2002)

Colorings and Related Topics. - Zsolt Tuza; Gregory Z. Gutin; Michael Plurnmer; Alan Tucker; Edmund Kieran Burke; Dominique de Werra; Jeffrey H. Kingston (Handbook of Graph Theory, 2003)

Struction revisited. - Gabriela Alexe; Peter L. Hammer; Vadim V. Lozin; Dominique de Werra (Discret. Appl. Math., 2003)

Special issue on stability in graphs and related topics. - Vadim V. Lozin; Dominique de Werra (Discret. Appl. Math., 2003)

Using stable sets to bound the chromatic number. - Dominique de Werra; Pierre Hansen (Inf. Process. Lett., 2003)

Coloration de graphes : fondements et applications. - Dominique de Werra; Daniel Kobler (RAIRO Oper. Res., 2003)

Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation. - Jérôme Monnot; Vangelis Th. Paschos; Dominique de Werra; Marc Demange; Bruno Escoffier (ISAAC, 2004)

The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small. - Dominique de Werra; Marc Demange; Jérôme Monnot; Vangelis Th. Paschos (WG, 2004)

On some properties of suboptimal colorings of graphs. - Ivo Blöchliger; Dominique de Werra (Networks, 2004)

Variations on the Roy-Gallai theorem. - Dominique de Werra; Pierre Hansen (4OR, 2005)

A solvable case of image reconstruction in discrete tomography. - Marie-Christine Costa; Dominique de Werra; Christophe Picouleau; David Schindl (Discret. Appl. Math., 2005)

A hypocoloring model for batch scheduling. - Dominique de Werra; Marc Demange; Jérôme Monnot; Vangelis Th. Paschos (Discret. Appl. Math., 2005)

Partitioning cographs into cliques and stable sets. - Marc Demange; Tínaz Ekim; Dominique de Werra (Discret. Optim., 2005)

Bicolored matchings in some classes of graphs. - Marie-Christine Costa; Dominique de Werra; Christophe Picouleau; Bernard Ries (Electron. Notes Discret. Math., 2005)

(p, k)-coloring problems in line graphs. - Marc Demange; Tínaz Ekim; Dominique de Werra (Electron. Notes Discret. Math., 2005)

Path colorings in bipartite graphs. - Dominique de Werra (Eur. J. Oper. Res., 2005)

On Split-Coloring Problems. - Tínaz Ekim; Dominique de Werra (J. Comb. Optim., 2005)

(p, k)-coloring problems in line graphs. - Marc Demange; Tínaz Ekim; Dominique de Werra (Theor. Comput. Sci., 2005)

Locally restricted colorings. - Ivo Blöchliger; Dominique de Werra (Discret. Appl. Math., 2006)

Some simple optimization techniques for self-organized public key management in mobile ad hoc networks. - T. Bornand-Jaccard; David Schindl; Dominique de Werra (Discret. Appl. Math., 2006)

Using graphs for some discrete tomography problems. - Marie-Christine Costa; Dominique de Werra; Christophe Picouleau (Discret. Appl. Math., 2006)

Construction of sports schedules with multiple venues. - Dominique de Werra; Tínaz Ekim; C. Raess (Discret. Appl. Math., 2006)

Good and nice colorings of balanced hypergraphs. - Dominique de Werra (Discret. Math., 2006)

Erratum. - Tínaz Ekim; Dominique de Werra (J. Comb. Optim., 2006)

On the approximation of Min Split-coloring and Min Cocoloring. - Marc Demange; Tínaz Ekim; Dominique de Werra (J. Graph Algorithms Appl., 2006)

Three is easy, two is hard: open shop sum-batch scheduling problem refined. - Irina V. Gribkovskaia; Chung-Yee Lee; Vitaly A. Strusevich; Dominique de Werra (Oper. Res. Lett., 2006)

Weighted stability number of graphs and weighted satisfiability: The two facets of pseudo-Boolean optimization. - Dominique de Werra; Peter L. Hammer (Ann. Oper. Res., 2007)

Time slot scheduling of compatible jobs. - Marc Demange; Dominique de Werra; Jérôme Monnot; Vangelis Th. Paschos (J. Sched., 2007)

On the use of graphs in discrete tomography. - Dominique de Werra; Marie-Christine Costa; Christophe Picouleau; Bernard Ries (4OR, 2008)

Finding Hamiltonian circuits in quasi-adjoint graphs. - Jacek Blazewicz; Marta Kasprzak; Benjamin Leroy-Beaulieu; Dominique de Werra (Discret. Appl. Math., 2008)

Polarity of chordal graphs. - Tínaz Ekim; Pavol Hell; Juraj Stacho; Dominique de Werra (Discret. Appl. Math., 2008)

Polar cographs. - Tínaz Ekim; Nadimpalli V. R. Mahadev; Dominique de Werra (Discret. Appl. Math., 2008)

Foreword. - Dominique de Werra; Endre Boros; Jacques Carlier; Alain Hertz; Marino Widmer (Discret. Appl. Math., 2008)

On two coloring problems in mixed graphs. - Bernard Ries; Dominique de Werra (Eur. J. Comb., 2008)

Addendum to "Bicolored Matchings in Some Classes of Graphs". - Marie-Christine Costa; Dominique de Werra; Christophe Picouleau; Bernard Ries (Graphs Comb., 2008)

On a graph coloring problem arising from discrete tomography. - Cédric Bentz; Marie-Christine Costa; Dominique de Werra; Christophe Picouleau; Bernard Ries (Networks, 2008)

Construction of balanced sports schedules using partitions into subleagues. - A. Geinoz; Tínaz Ekim; Dominique de Werra (Oper. Res. Lett., 2008)

Preemptive open shop scheduling with multiprocessors: polynomial cases and applications. - Dominique de Werra; Tamás Kis; Wieslaw Kubiak (J. Sched., 2008)

Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. - Dominique de Werra; Marc Demange; Bruno Escoffier; Jérôme Monnot; Vangelis Th. Paschos (Discret. Appl. Math., 2009)

Graph coloring with cardinality constraints on the neighborhoods. - Marie-Christine Costa; Dominique de Werra; Christophe Picouleau; Bernard Ries (Discret. Optim., 2009)

Blockers and transversals. - Rico Zenklusen; Bernard Ries; Christophe Picouleau; Dominique de Werra; Marie-Christine Costa; Cédric Bentz (Discret. Math., 2009)

A tutorial on the use of graph coloring for some problems in robotics. - Marc Demange; Tínaz Ekim; Dominique de Werra (Eur. J. Oper. Res., 2009)

A Magnetic Procedure for the Stability Number. - Alain Hertz; Dominique de Werra (Graphs Comb., 2009)

Degree-constrained edge partitioning in graphs arising from discrete tomography. - Cédric Bentz; Marie-Christine Costa; Christophe Picouleau; Bernard Ries; Dominique de Werra (J. Graph Algorithms Appl., 2009)

From L. Euler to D. König. - Dominique de Werra (RAIRO Oper. Res., 2009)

On the inapproximability of independent domination in 2P3-free perfect graphs. - Yury L. Orlovich; Valery S. Gordon; Dominique de Werra (Theor. Comput. Sci., 2009)

Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid. - Bernard Ries; Cédric Bentz; Christophe Picouleau; Dominique de Werra; Marie-Christine Costa; Rico Zenklusen (Discret. Math., 2010)

Split-critical and uniquely split-colorable graphs. - Tínaz Ekim; Bernard Ries; Dominique de Werra (Discret. Math. Theor. Comput. Sci., 2010)

A projective algorithm for preemptive open shop scheduling with two multiprocessor groups. - Tamás Kis; Dominique de Werra; Wieslaw Kubiak (Oper. Res. Lett., 2010)

The mathematics of Peter L. Hammer (1936-2006): graphs, optimization, and Boolean models. - Endre Boros; Yves Crama; Dominique de Werra; Pierre Hansen; Frédéric Maffray (Ann. Oper. Res., 2011)

Minimum d-Transversals of Maximum-Weight Stable Sets in Trees. - Cédric Bentz; Marie-Christine Costa; Dominique de Werra; Christophe Picouleau; Bernard Ries (Electron. Notes Discret. Math., 2011)

Minimum d-blockers and d-transversals in graphs. - Marie-Christine Costa; Dominique de Werra; Christophe Picouleau (J. Comb. Optim., 2011)

Some Graph Problems Arising in Elementary Robotics. - Dominique de Werra (ICORES, 2012)

Graph transformations preserving the stability number. - Benjamin Lévêque; Dominique de Werra (Discret. Appl. Math., 2012)

A note on chromatic properties of threshold graphs. - Bernard Ries; Dominique de Werra; Rico Zenklusen (Discret. Math., 2012)

d-Transversals of stable sets and vertex covers in weighted bipartite graphs. - Cédric Bentz; Marie-Christine Costa; Christophe Picouleau; Bernard Ries; Dominique de Werra (J. Discrete Algorithms, 2012)

On some coloring problems in grids. - Marc Demange; Dominique de Werra (Theor. Comput. Sci., 2013)

Corrigendum to "Polar cographs" [Discrete Appl. Math. 156(2008) 1652-1660]. - Tínaz Ekim; Nadimpalli V. R. Mahadev; Dominique de Werra (Discret. Appl. Math., 2014)

Preface. - Dominique de Werra; Nelson Maculan; Ali Ridha Mahjoub (Discret. Appl. Math., 2014)

Optimal pathway reconstruction on 3D NMR maps. - Marta Szachniuk; Maria Cristina De Cola; Giovanni Felici; Dominique de Werra; Jacek Blazewicz (Discret. Appl. Math., 2015)

Choosability with limited number of colors. - Marc Demange; Dominique de Werra (CoRR, 2016)

Sports scheduling search space connectivity: A riffle shuffle driven approach. - Tiago Januario; Sebastián Urrutia; Dominique de Werra (Discret. Appl. Math., 2016)

Edge coloring: A natural model for sports scheduling. - Tiago Januario; Sebastián Urrutia; Celso C. Ribeiro; Dominique de Werra (Eur. J. Oper. Res., 2016)

Combinatorics and Algorithms for Augmenting Graphs. - Konrad Kazimierz Dabrowski; Vadim V. Lozin; Dominique de Werra; Victor Zamaraev (Graphs Comb., 2016)

Minimal graphs for matching extensions. - Marie-Christine Costa; Dominique de Werra; Christophe Picouleau (Discret. Appl. Math., 2018)

What are the worst cases in constrained Last-In-First-Out pick-up and delivery problems? - Sebastián Urrutia; Dominique de Werra (Eur. J. Oper. Res., 2018)

Dominating induced matchings in graphs containing no long claw. - Alain Hertz; Vadim V. Lozin; Bernard Ries; Viktor Zamaraev; Dominique de Werra (J. Graph Theory, 2018)

Letter graphs and geometric grid classes of permutations: Characterization and recognition. - Bogdan Alecu; Vadim V. Lozin; Dominique de Werra; Viktor Zamaraev (Discret. Appl. Math., 2020)

Minimal graphs for 2-factor extension. - Marie-Christine Costa; Dominique de Werra; Christophe Picouleau (Discret. Appl. Math., 2020)

Recoloring subgraphs of K2n for sports scheduling. - Sebastián Urrutia; Dominique de Werra; Tiago Januario (Theor. Comput. Sci., 2021)

The micro-world of cographs. - Bogdan Alecu; Vadim V. Lozin; Dominique de Werra (Discret. Appl. Math., 2022)

A tutorial on graph models for scheduling round-robin sports tournaments. - Celso C. Ribeiro; Sebastián Urrutia; Dominique de Werra (Int. Trans. Oper. Res., 2023)