default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDominique de Werra
Person information
- affiliation: Swiss Federal Institute of Technology in Lausanne, Switzerland
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j157]Celso C. Ribeiro, Sebastián Urrutia, Dominique de Werra:
A tutorial on graph models for scheduling round-robin sports tournaments. Int. Trans. Oper. Res. 30(6): 3267-3295 (2023)- 2022
- [j156]Bogdan Alecu
, Vadim V. Lozin, Dominique de Werra:
The micro-world of cographs. Discret. Appl. Math. 312: 3-14 (2022) - 2021
- [j155]Sebastián Urrutia, Dominique de Werra, Tiago Januario:
Recoloring subgraphs of K2n for sports scheduling. Theor. Comput. Sci. 877: 36-45 (2021) - 2020
- [j154]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau:
Minimal graphs for 2-factor extension. Discret. Appl. Math. 282: 65-79 (2020) - [j153]Bogdan Alecu, Vadim V. Lozin, Dominique de Werra, Viktor Zamaraev:
Letter graphs and geometric grid classes of permutations: Characterization and recognition. Discret. Appl. Math. 283: 482-494 (2020) - [c10]Bogdan Alecu, Vadim V. Lozin, Dominique de Werra:
The Micro-world of Cographs. IWOCA 2020: 30-42
2010 – 2019
- 2018
- [j152]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau:
Minimal graphs for matching extensions. Discret. Appl. Math. 234: 47-55 (2018) - [j151]Sebastián Urrutia, Dominique de Werra:
What are the worst cases in constrained Last-In-First-Out pick-up and delivery problems? Eur. J. Oper. Res. 270(2): 430-434 (2018) - [j150]Alain Hertz, Vadim V. Lozin, Bernard Ries, Viktor Zamaraev, Dominique de Werra:
Dominating induced matchings in graphs containing no long claw. J. Graph Theory 88(1): 18-39 (2018) - [i4]Bogdan Alecu, Vadim V. Lozin, Dominique de Werra, Viktor Zamaraev:
Letter graphs and geometric grid classes of permutations: characterization and recognition. CoRR abs/1804.11217 (2018) - 2017
- [c9]Bogdan Alecu, Vadim V. Lozin, Viktor Zamaraev, Dominique de Werra:
Letter Graphs and Geometric Grid Classes of Permutations: Characterization and Recognition. IWOCA 2017: 195-205 - 2016
- [j149]Tiago Januario, Sebastián Urrutia, Dominique de Werra:
Sports scheduling search space connectivity: A riffle shuffle driven approach. Discret. Appl. Math. 211: 113-120 (2016) - [j148]Tiago Januario, Sebastián Urrutia, Celso C. Ribeiro, Dominique de Werra:
Edge coloring: A natural model for sports scheduling. Eur. J. Oper. Res. 254(1): 1-8 (2016) - [j147]Konrad Kazimierz Dabrowski, Vadim V. Lozin, Dominique de Werra, Victor Zamaraev:
Combinatorics and Algorithms for Augmenting Graphs. Graphs Comb. 32(4): 1339-1352 (2016) - [e2]Begoña Vitoriano, Greg H. Parlier, Dominique de Werra:
Proceedings of 5th the International Conference on Operations Research and Enterprise Systems (ICORES 2016), Rome, Italy, February 23-25, 2016. SciTePress 2016, ISBN 978-989-758-171-7 [contents] - [i3]Marc Demange, Dominique de Werra:
Choosability with limited number of colors. CoRR abs/1601.01768 (2016) - 2015
- [j146]Marta Szachniuk, Maria Cristina De Cola, Giovanni Felici, Dominique de Werra, Jacek Blazewicz:
Optimal pathway reconstruction on 3D NMR maps. Discret. Appl. Math. 182: 134-149 (2015) - [e1]Dominique de Werra, Greg H. Parlier, Begoña Vitoriano:
Operations Research and Enterprise Systems - 4th International Conference, ICORES 2015, Lisbon, Portugal, January 10-12, 2015, Revised Selected Papers. Communications in Computer and Information Science 577, Springer 2015, ISBN 978-3-319-27679-3 [contents] - [i2]Alain Hertz, Vadim V. Lozin, Bernard Ries, Victor Zamaraev, Dominique de Werra:
Dominating induced matchings in graphs containing no long claw. CoRR abs/1505.02558 (2015) - 2014
- [j145]Dominique de Werra, Nelson Maculan, Ali Ridha Mahjoub:
Preface. Discret. Appl. Math. 164: 1 (2014) - [j144]Tínaz Ekim, Nadimpalli V. R. Mahadev, Dominique de Werra:
Corrigendum to "Polar cographs" [Discrete Appl. Math. 156(2008) 1652-1660]. Discret. Appl. Math. 171: 158 (2014) - [i1]Konrad K. Dabrowski, Dominique de Werra, Vadim V. Lozin, Victor Zamaraev:
Combinatorics and algorithms for augmenting graphs. CoRR abs/1410.8774 (2014) - 2013
- [j143]Marc Demange, Dominique de Werra:
On some coloring problems in grids. Theor. Comput. Sci. 472: 9-27 (2013) - 2012
- [j142]Benjamin Lévêque, Dominique de Werra:
Graph transformations preserving the stability number. Discret. Appl. Math. 160(18): 2752-2759 (2012) - [j141]Bernard Ries, Dominique de Werra, Rico Zenklusen:
A note on chromatic properties of threshold graphs. Discret. Math. 312(10): 1838-1843 (2012) - [j140]Cédric Bentz, Marie-Christine Costa, Christophe Picouleau, Bernard Ries, Dominique de Werra:
d-Transversals of stable sets and vertex covers in weighted bipartite graphs. J. Discrete Algorithms 17: 95-102 (2012) - [c8]Dominique de Werra:
Some Graph Problems Arising in Elementary Robotics. ICORES 2012 - 2011
- [j139]Endre Boros, Yves Crama, Dominique de Werra, Pierre Hansen, Frédéric Maffray:
The mathematics of Peter L. Hammer (1936-2006): graphs, optimization, and Boolean models. Ann. Oper. Res. 188(1): 1-18 (2011) - [j138]Cédric Bentz, Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries:
Minimum d-Transversals of Maximum-Weight Stable Sets in Trees. Electron. Notes Discret. Math. 38: 129-134 (2011) - [j137]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau:
Minimum d-blockers and d-transversals in graphs. J. Comb. Optim. 22(4): 857-872 (2011) - 2010
- [j136]Dominique de Werra, Marie-Christine Costa, Christophe Picouleau, Bernard Ries:
On the use of graphs in discrete tomography. Ann. Oper. Res. 175(1): 287-307 (2010) - [j135]Bernard Ries, Cédric Bentz, Christophe Picouleau, Dominique de Werra, Marie-Christine Costa, Rico Zenklusen:
Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid. Discret. Math. 310(1): 132-146 (2010) - [j134]Tínaz Ekim, Bernard Ries, Dominique de Werra:
Split-critical and uniquely split-colorable graphs. Discret. Math. Theor. Comput. Sci. 12(5): 1-24 (2010) - [j133]Tamás Kis, Dominique de Werra, Wieslaw Kubiak:
A projective algorithm for preemptive open shop scheduling with two multiprocessor groups. Oper. Res. Lett. 38(2): 129-132 (2010)
2000 – 2009
- 2009
- [j132]Dominique de Werra, Marc Demange, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos:
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. Discret. Appl. Math. 157(4): 819-832 (2009) - [j131]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries:
Graph coloring with cardinality constraints on the neighborhoods. Discret. Optim. 6(4): 362-369 (2009) - [j130]Rico Zenklusen, Bernard Ries, Christophe Picouleau, Dominique de Werra, Marie-Christine Costa, Cédric Bentz:
Blockers and transversals. Discret. Math. 309(13): 4306-4314 (2009) - [j129]Benjamin Lévêque, Dominique de Werra:
Graph transformations preserving the stability number. Electron. Notes Discret. Math. 35: 3-8 (2009) - [j128]Marc Demange, Tínaz Ekim, Dominique de Werra:
A tutorial on the use of graph coloring for some problems in robotics. Eur. J. Oper. Res. 192(1): 41-55 (2009) - [j127]Alain Hertz, Dominique de Werra:
A Magnetic Procedure for the Stability Number. Graphs Comb. 25(5): 707-716 (2009) - [j126]Cédric Bentz, Marie-Christine Costa, Christophe Picouleau, Bernard Ries, Dominique de Werra:
Degree-constrained edge partitioning in graphs arising from discrete tomography. J. Graph Algorithms Appl. 13(2): 99-118 (2009) - [j125]Dominique de Werra:
From L. Euler to D. König. RAIRO Oper. Res. 43(3): 247-251 (2009) - [j124]Yury L. Orlovich, Valery S. Gordon, Dominique de Werra:
On the inapproximability of independent domination in 2P3-free perfect graphs. Theor. Comput. Sci. 410(8-10): 977-982 (2009) - 2008
- [j123]Dominique de Werra, Marie-Christine Costa, Christophe Picouleau, Bernard Ries:
On the use of graphs in discrete tomography. 4OR 6(2): 101-123 (2008) - [j122]Tínaz Ekim, Nadimpalli V. R. Mahadev, Dominique de Werra:
Polar cographs. Discret. Appl. Math. 156(10): 1652-1660 (2008) - [j121]Dominique de Werra, Endre Boros, Jacques Carlier, Alain Hertz, Marino Widmer:
Foreword. Discret. Appl. Math. 156(13): 2437-2438 (2008) - [j120]Tínaz Ekim, Pavol Hell, Juraj Stacho, Dominique de Werra:
Polarity of chordal graphs. Discret. Appl. Math. 156(13): 2469-2479 (2008) - [j119]Jacek Blazewicz, Marta Kasprzak, Benjamin Leroy-Beaulieu, Dominique de Werra:
Finding Hamiltonian circuits in quasi-adjoint graphs. Discret. Appl. Math. 156(13): 2573-2580 (2008) - [j118]Bernard Ries, Dominique de Werra:
On two coloring problems in mixed graphs. Eur. J. Comb. 29(3): 712-725 (2008) - [j117]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries:
Addendum to "Bicolored Matchings in Some Classes of Graphs". Graphs Comb. 24(2): 127-128 (2008) - [j116]Cédric Bentz, Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries:
On a graph coloring problem arising from discrete tomography. Networks 51(4): 256-267 (2008) - [j115]A. Geinoz, Tínaz Ekim, Dominique de Werra:
Construction of balanced sports schedules using partitions into subleagues. Oper. Res. Lett. 36(3): 279-282 (2008) - [j114]Dominique de Werra, Tamás Kis, Wieslaw Kubiak:
Preemptive open shop scheduling with multiprocessors: polynomial cases and applications. J. Sched. 11(1): 75-83 (2008) - 2007
- [j113]Dominique de Werra, Peter L. Hammer:
Weighted stability number of graphs and weighted satisfiability: The two facets of pseudo-Boolean optimization. Ann. Oper. Res. 149(1): 67-73 (2007) - [j112]Tínaz Ekim, Nadimpalli V. R. Mahadev, Dominique de Werra:
Polar cographs. Electron. Notes Discret. Math. 28: 317-323 (2007) - [j111]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries:
Bicolored Matchings in Some Classes of Graphs. Graphs Comb. 23(1): 47-60 (2007) - [j110]Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos:
Time slot scheduling of compatible jobs. J. Sched. 10(2): 111-127 (2007) - 2006
- [j109]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau:
Using graphs for some discrete tomography problems. Discret. Appl. Math. 154(1): 35-46 (2006) - [j108]Dominique de Werra, Tínaz Ekim, C. Raess:
Construction of sports schedules with multiple venues. Discret. Appl. Math. 154(1): 47-58 (2006) - [j107]Ivo Blöchliger, Dominique de Werra:
Locally restricted colorings. Discret. Appl. Math. 154(1): 158-165 (2006) - [j106]T. Bornand-Jaccard, David Schindl, Dominique de Werra:
Some simple optimization techniques for self-organized public key management in mobile ad hoc networks. Discret. Appl. Math. 154(8): 1223-1235 (2006) - [j105]Dominique de Werra:
Good and nice colorings of balanced hypergraphs. Discret. Math. 306(19-20): 2630-2636 (2006) - [j104]Tínaz Ekim, Dominique de Werra:
Erratum. J. Comb. Optim. 11(1): 125 (2006) - [j103]Marc Demange, Tínaz Ekim, Dominique de Werra:
On the approximation of Min Split-coloring and Min Cocoloring. J. Graph Algorithms Appl. 10(2): 297-315 (2006) - [j102]Irina V. Gribkovskaia, Chung-Yee Lee, Vitaly A. Strusevich, Dominique de Werra:
Three is easy, two is hard: open shop sum-batch scheduling problem refined. Oper. Res. Lett. 34(4): 459-464 (2006) - 2005
- [j101]Dominique de Werra, Pierre Hansen:
Variations on the Roy-Gallai theorem. 4OR 3(3): 243-251 (2005) - [j100]Dominique de Werra, Marc Demange, Jérôme Monnot, Vangelis Th. Paschos:
A hypocoloring model for batch scheduling. Discret. Appl. Math. 146(1): 3-26 (2005) - [j99]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, David Schindl:
A solvable case of image reconstruction in discrete tomography. Discret. Appl. Math. 148(3): 240-245 (2005) - [j98]Marc Demange, Tínaz Ekim, Dominique de Werra:
Partitioning cographs into cliques and stable sets. Discret. Optim. 2(2): 145-153 (2005) - [j97]Marc Demange, Tínaz Ekim, Dominique de Werra:
(p, k)-coloring problems in line graphs. Electron. Notes Discret. Math. 19: 49-55 (2005) - [j96]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries:
Bicolored matchings in some classes of graphs. Electron. Notes Discret. Math. 22: 207-211 (2005) - [j95]Dominique de Werra:
Path colorings in bipartite graphs. Eur. J. Oper. Res. 164(3): 575-584 (2005) - [j94]Tínaz Ekim, Dominique de Werra:
On Split-Coloring Problems. J. Comb. Optim. 10(3): 211-225 (2005) - [j93]Marc Demange, Tínaz Ekim, Dominique de Werra:
(p, k)-coloring problems in line graphs. Theor. Comput. Sci. 349(3): 462-474 (2005) - 2004
- [j92]Ivo Blöchliger, Dominique de Werra:
On some properties of suboptimal colorings of graphs. Networks 43(2): 103-108 (2004) - [c7]Jérôme Monnot, Vangelis Th. Paschos, Dominique de Werra, Marc Demange, Bruno Escoffier:
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation. ISAAC 2004: 896-907 - [c6]Dominique de Werra, Marc Demange, Jérôme Monnot, Vangelis Th. Paschos:
The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small. WG 2004: 377-388 - 2003
- [j91]Vadim V. Lozin, Dominique de Werra:
Special issue on stability in graphs and related topics. Discret. Appl. Math. 132(1-3): 1-2 (2003) - [j90]Gabriela Alexe, Peter L. Hammer, Vadim V. Lozin, Dominique de Werra:
Struction revisited. Discret. Appl. Math. 132(1-3): 27-46 (2003) - [j89]Dominique de Werra:
Variations on the Theorem of Birkhoff - von Neumann and Extensions. Graphs Comb. 19(2): 263-278 (2003) - [j88]Dominique de Werra, Pierre Hansen:
Using stable sets to bound the chromatic number. Inf. Process. Lett. 87(3): 127-131 (2003) - [j87]Dominique de Werra, Daniel Kobler:
Coloration de graphes : fondements et applications. RAIRO Oper. Res. 37(1): 29-66 (2003) - [p1]Zsolt Tuza, Gregory Z. Gutin, Michael Plurnmer, Alan Tucker, Edmund Kieran Burke, Dominique de Werra, Jeffrey H. Kingston:
Colorings and Related Topics. Handbook of Graph Theory 2003: 340-483 - 2002
- [j86]Dominique de Werra, Christine Eisenbeis, Sylvain Lelait, Elena Stöhr:
Circular-arc graph coloring: On chords and circuits in the meeting graph. Eur. J. Oper. Res. 136(3): 483-500 (2002) - [j85]Armen S. Asratian, Dominique de Werra:
A generalized class-teacher model for some timetabling problems. Eur. J. Oper. Res. 143(3): 531-542 (2002) - [c5]Dominique de Werra:
Constraints of Availability in Timetabling and Scheduling. PATAT 2002: 3-23 - [c4]Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos:
Weighted Node Coloring: When Stable Sets Are Expensive. WG 2002: 114-125 - 2000
- [j84]Dominique de Werra, Alain Hertz, Daniel Kobler, Nadimpalli V. R. Mahadev:
Feasible edge colorings of trees with cardinality constraints. Discret. Math. 222(1-3): 61-72 (2000) - [j83]Dominique de Werra:
Variations on the theorem of Birkhoff-von Neumann and extensions. Electron. Notes Discret. Math. 5: 97-99 (2000)
1990 – 1999
- 1999
- [j82]Dominique de Werra, Christine Eisenbeis, Sylvain Lelait, Bruno Marmol:
On a Graph-theoretical Model for Cyclic Register Allocation. Discret. Appl. Math. 93(2-3): 191-203 (1999) - [j81]Dominique de Werra:
On a Multiconstrained Model for Chromatic Scheduling. Discret. Appl. Math. 94(1-3): 171-180 (1999) - [j80]Jacek Blazewicz, Alain Hertz, Daniel Kobler, Dominique de Werra:
On some Properties of DNA Graphs. Discret. Appl. Math. 98(1-2): 1-19 (1999) - [j79]Dominique de Werra, Alain Hertz:
On perfectness of sums of graphs. Discret. Math. 195(1-3): 93-101 (1999) - 1997
- [j78]Dominique de Werra, Nadimpalli V. R. Mahadev:
Preassignment Requirements in Chromatic Scheduling. Discret. Appl. Math. 76(1-3): 93-101 (1997) - [j77]Dominique de Werra:
Restricted coloring models for timetabling. Discret. Math. 165-166: 161-170 (1997) - [j76]Pierre Hansen, Julio Kuplinsky, Dominique de Werra:
Mixed graph colorings. Math. Methods Oper. Res. 45(1): 145-160 (1997) - 1996
- [j75]Jacek Blazewicz, Maciej Drozdowski, Dominique de Werra, Jan Weglarz:
Deadline Scheduling of Multiprocessor Tasks. Discret. Appl. Math. 65(1-3): 81-95 (1996) - [j74]Dominique de Werra, Alan J. Hoffman, Nadimpalli V. R. Mahadev, Uri N. Peled:
Restrictions and Preassignments in Preemptive open Shop Scheduling. Discret. Appl. Math. 68(1-2): 169-188 (1996) - [j73]Dominique de Werra, Jacques Erschler:
Open shop scheduling with some additional constraints. Graphs Comb. 12(1): 81-93 (1996) - [c3]Pierre Hansen, Dominique de Werra:
Nesticity. Mathematical Hierarchies and Biology 1996: 225-232 - 1995
- [c2]Dominique de Werra:
Some Combinatorial Models for Course Scheduling. PATAT 1995: 296-308 - 1994
- [j72]Dominique de Werra, Y. Gay:
Chromatic Scheduling and Frequency Assignment. Discret. Appl. Math. 49(1-3): 165-174 (1994) - [j71]M. Hasler, C. Marthy, A. Oberlin, Dominique de Werra:
A discrete model for studying existence and uniqueness of solutions in nonlinear resistive circuits. Discret. Appl. Math. 50(2): 169-184 (1994) - [j70]Edoardo Amaldi, Eddy Mayoraz, Dominique de Werra:
A Review of Combinatorial Problems Arising in Feedforward Neural Network Design. Discret. Appl. Math. 52(2): 111-138 (1994) - [j69]Dominique de Werra:
on an optimization Problem occurring in FMSs: A Hypergraph-theoretical Formulation. Discret. Appl. Math. 55(2): 107-111 (1994) - [j68]Anthony J. W. Hilton, Dominique de Werra:
A sufficient condition for equitable edge-colourings of simple graphs. Discret. Math. 128(1-3): 179-201 (1994) - [j67]Fanica Gavril, V. Toledano Laredo, Dominique de Werra:
Chordless Paths, Odd Holes, and Kernels in Graphs without m-Obstructions. J. Algorithms 17(2): 207-221 (1994) - [j66]Ondrej Cepek, Milan Vlach, Dominique de Werra:
Nonpreemptive open shop with restricted processing times. Math. Methods Oper. Res. 39(2): 227-241 (1994) - [j65]Jacek Blazewicz, Maciej Drozdowski, Günter Schmidt, Dominique de Werra:
Scheduling Independent Multiprocessor Tasks on a Uniform k-Processor System. Parallel Comput. 20(1): 15-28 (1994) - 1993
- [j64]Dominique de Werra, Jacek Blazewicz:
Some Preemptive open Shop Scheduling Problems with a Renewable or a Nonrenewable Resource. (Discrete Applied Mathematics 35 (1992) 205-219). Discret. Appl. Math. 43(1): 103-104 (1993) - [j63]Nadimpalli V. R. Mahadev, Ph. Solot, Dominique de Werra:
The cyclic compact open-shop scheduling problem. Discret. Math. 111(1-3): 361-366 (1993) - [j62]Alain Hertz, Dominique de Werra:
On the stability number of AH-free graphs. J. Graph Theory 17(1): 53-63 (1993) - [j61]Dominique de Werra, Pavol Hell, Tiko Kameda, Naoki Katoh, Ph. Solot, Masafumi Yamashita:
Graph endpoint coloring and distributed processing. Networks 23(2): 93-98 (1993) - [j60]Dominique de Werra, Ph. Solot:
Some graph-theoretical models for scheduling in automated production systems. Networks 23(8): 651-660 (1993) - [j59]Dominique de Werra, Nadimpalli V. R. Mahadev, Uri N. Peled:
Edge-Chromatic Scheduling with Simultaneity Constraints. SIAM J. Discret. Math. 6(4): 631-641 (1993) - [c1]Jacek Blazewicz, Maciej Drozdowski, Günter Schmidt, Dominique de Werra:
Scheduling Multiprocessor Tasks on Uniform Processors. PARCO 1993: 249-256 - 1992
- [j58]Dominique de Werra, Alain Hertz:
Foreword. Discret. Appl. Math. 35(3): 175-176 (1992) - [j57]Dominique de Werra, Jacek Blazewicz:
Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource. Discret. Appl. Math. 35(3): 205-219 (1992) - 1991
- [j56]Jean Bovet, C. Constantin, Dominique de Werra:
A convoy scheduling problem. Discret. Appl. Math. 30(1): 1-14 (1991) - [j55]Dominique de Werra, Fred S. Roberts:
On the use of augmenting chains in chain packings. Discret. Appl. Math. 30(2-3): 137-149 (1991) - [j54]Bruno Simeone, Dominique de Werra, Maurice Cochand:
Erratum. Discret. Appl. Math. 32(1): 77 (1991) - [j53]Dominique de Werra, Jacek Blazewicz, Wieslaw Kubiak:
A preemptive open shop scheduling problem with one resource. Oper. Res. Lett. 10(1): 9-15 (1991) - [j52]Dominique de Werra, Ph. Solot:
Compact Cylindrical Chromatic Scheduling. SIAM J. Discret. Math. 4(4): 528-534 (1991) - 1990
- [j51]Alain Hertz, Dominique de Werra:
The Tabu Search Metaheuristic: How we used it. Ann. Math. Artif. Intell. 1: 111-121 (1990) - [j50]Charles Friden, Alain Hertz, Dominique de Werra:
Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph. Comput. Oper. Res. 17(5): 437-445 (1990) - [j49]Dominique de Werra, Loïc Jacot-Descombes, P. Masson:
A constrained sports scheduling problem. Discret. Appl. Math. 26(1): 41-49 (1990) - [j48]Jacek Blazewicz, Maciej Drozdowski, Günter Schmidt, Dominique de Werra:
Scheduling independent two processor tasks on a uniform duo-processor system. Discret. Appl. Math. 28(1): 11-20 (1990) - [j47]Pierre Hansen, Dominique de Werra:
Preface. Discret. Appl. Math. 29(2-3): 129 (1990) - [j46]Bruno Simeone, Dominique de Werra, Maurice Cochand:
Recognition of a class of unimodular functions. Discret. Appl. Math. 29(2-3): 243-250 (1990)
1980 – 1989
- 1989
- [j45]Charles Friden, Alain Hertz, Dominique de Werra:
STABULUS: A technique for finding stable sets in large graphs with tabu search. Computing 42(1): 35-44 (1989) - [j44]Alain Hertz, Dominique de Werra:
Foreword. Discret. Math. 74(1-2): 1-2 (1989) - [j43]Alain Hertz, Dominique de Werra:
Connected sequential colorings. Discret. Math. 74(1-2): 51-59 (1989) - [j42]William R. Pulleyblank, Dominique de Werra:
Odd Path Packings. Eur. J. Comb. 10(6): 585-595 (1989) - [j41]Maurice Cochand, Dominique de Werra, Roman Slowinski:
Preemptive scheduling with staircase and piecewise linear resource availability. ZOR Methods Model. Oper. Res. 33(5): 297-313 (1989) - [j40]Dominique de Werra:
Generalized edge packings. Math. Program. 44(1-3): 235-245 (1989) - [j39]Dominique de Werra, C. Pasche:
Paths, chains, and antipaths. Networks 19(1): 107-115 (1989) - 1988
- [j38]Dominique de Werra:
Some models of graphs for scheduling sports competitions. Discret. Appl. Math. 21(1): 47-65 (1988) - [j37]Alain Hertz, Dominique de Werra:
Perfectly orderable graphs are quasi-parity graphs: a short proof. Discret. Math. 68(1): 111-113 (1988) - [j36]Robert C. Dalang, Leslie E. Trotter Jr., Dominique de Werra:
On randomized stopping points and perfect graphs. J. Comb. Theory B 45(3): 320-344 (1988) - [j35]Dominique de Werra, Alain Hertz:
Consecutive colorings of graphs. ZOR Methods Model. Oper. Res. 32(1): 1-8 (1988) - [j34]Peter L. Hammer, Bruno Simeone, Thomas M. Liebling, Dominique de Werra:
From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions. SIAM J. Discret. Math. 1(2): 174-184 (1988) - 1987
- [j33]Alain Hertz, Dominique de Werra:
Using tabu search techniques for graph coloring. Computing 39(4): 345-351 (1987) - [j32]Vasek Chvátal, Chính T. Hoàng, Nadimpalli V. R. Mahadev, Dominique de Werra:
Four classes of perfectly orderable graphs. J. Graph Theory 11(4): 481-495 (1987) - [j31]Dominique de Werra:
Partitions into odd chains. Math. Program. 37(1): 41-50 (1987) - 1986
- [j30]Maurice Cochand, Dominique de Werra:
Generalized neighbourhoods and a class of perfectly orderable graphs. Discret. Appl. Math. 15(2-3): 213-220 (1986) - [j29]Myriam Preissmann, Dominique de Werra, Nadimpalli V. R. Mahadev:
A note on superbrittle graphs. Discret. Math. 61(2-3): 259-267 (1986) - [j28]Dominique de Werra:
Node coverings with odd chains. J. Graph Theory 10(2): 177-185 (1986) - 1985
- [j27]Peter L. Hammer, Nadimpalli V. R. Mahadev, Dominique de Werra:
The struction of a graph: Application to CN-free graphs. Comb. 5(2): 141-147 (1985) - [j26]Claude Benzaken, Peter L. Hammer, Dominique de Werra:
Split graphs of Dilworth number 2. Discret. Math. 55(2): 123-127 (1985) - [j25]Peter L. Hammer, Nadimpalli V. R. Mahadev, Dominique de Werra:
Stability in CAN-free graphs. J. Comb. Theory B 38(1): 23-30 (1985) - [j24]Claude Benzaken, Peter L. Hammer, Dominique de Werra:
Threshold characterization of graphs with dilworth number two. J. Graph Theory 9(2): 245-267 (1985) - [j23]Dominique de Werra:
Book review. Z. Oper. Research 29(1): 46 (1985) - [j22]Myriam Preissmann, Dominique de Werra:
A note on strong perfectness of graphs. Math. Program. 31(3): 321-326 (1985) - [j21]Dominique de Werra:
On the multiplication of divisions: The use of graphs for sports scheduling. Networks 15(1): 125-136 (1985) - 1984
- [j20]Dominique de Werra:
Variation on a theorem of König. Discret. Math. 51(3): 319-321 (1984) - [j19]Dominique de Werra:
A decomposition property of polyhedra. Math. Program. 30(3): 261-266 (1984) - 1982
- [j18]Dominique de Werra:
Minimizing irregularities in sports schedules using graph theory. Discret. Appl. Math. 4(3): 217-226 (1982) - [j17]Dominique de Werra:
Obstructions for regular colorings. J. Comb. Theory B 32(3): 326-335 (1982) - 1981
- [j16]Dominique de Werra:
On the existence of generalized good and equitable edge colorings. J. Graph Theory 5(3): 247-258 (1981) - [j15]Dominique de Werra:
On some characterisations of totally unimodular matrices. Math. Program. 20(1): 14-21 (1981) - 1980
- [j14]Dominique de Werra:
Geography, games and graphs. Discret. Appl. Math. 2(4): 327-337 (1980)
1970 – 1979
- 1979
- [j13]Dominique de Werra:
Regular and canonical colorings. Discret. Math. 27(3): 309-316 (1979) - [j12]Dominique de Werra:
On the use of alternating chains and hypergraphs in edge coloring. J. Graph Theory 3(2): 175-182 (1979) - 1978
- [j11]Dominique de Werra:
On line perfect graphs. Math. Program. 15(1): 236-238 (1978) - [j10]Dominique de Werra:
Color-feasible sequences of a multigraph. Networks 8(1): 7-16 (1978) - 1977
- [j9]Dominique de Werra:
Multigraphs with quasiweak odd cycles. J. Comb. Theory B 23(1): 75-82 (1977) - [j8]Daniel Brélaz, Y. Nicolier, Dominique de Werra:
Compactness and balancing in scheduling. Math. Methods Oper. Res. 21(1): 65-73 (1977) - 1976
- [j7]Dominique de Werra:
An extension of bipartite multigraphs. Discret. Math. 14(2): 133-138 (1976) - [j6]Dominique de Werra:
Some remarks on good colorations. J. Comb. Theory B 21(1): 57-64 (1976) - [j5]J. C. Arditti, Dominique de Werra:
A note on a paper by D. Seinsche. J. Comb. Theory B 21(1): 90 (1976) - 1974
- [j4]Dominique de Werra:
A note on graph coloring. RAIRO Theor. Informatics Appl. 8(1): 49-53 (1974) - [j3]Dominique de Werra:
Some results in chromatic scheduling. Z. Oper. Research 18(5): 167-175 (1974) - 1972
- [j2]Dominique de Werra:
Decomposition of bipartite multigraphs into matchings. Z. Oper. Research 16(3): 85-90 (1972) - 1971
- [j1]Dominique de Werra:
Investigations on an edge coloring problem. Discret. Math. 1(2): 167-179 (1971)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
