The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Dominique de Werra: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:896-907 [Conf]
  2. Jacek Blazewicz, Maciej Drozdowski, G. Schmidt, Dominique de Werra
    Scheduling Multiprocessor Tasks on Uniform Processors. [Citation Graph (0, 0)][DBLP]
    PARCO, 1993, pp:249-256 [Conf]
  3. Dominique de Werra
    Constraints of Availability in Timetabling and Scheduling. [Citation Graph (0, 0)][DBLP]
    PATAT, 2002, pp:3-23 [Conf]
  4. Dominique de Werra
    Some Combinatorial Models for Course Scheduling. [Citation Graph (0, 0)][DBLP]
    PATAT, 1995, pp:296-308 [Conf]
  5. Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos
    Weighted Node Coloring: When Stable Sets Are Expensive. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:114-125 [Conf]
  6. 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. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:377-388 [Conf]
  7. Dominique de Werra, Pierre Hansen
    Variations on the Roy-Gallai theorem. [Citation Graph (0, 0)][DBLP]
    4OR, 2005, v:3, n:3, pp:243-251 [Journal]
  8. Alain Hertz, Dominique de Werra
    The Tabu Search Metaheuristic: How we used it. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1990, v:1, n:, pp:- [Journal]
  9. Peter L. Hammer, Nadimpalli V. R. Mahadev, Dominique de Werra
    The struction of a graph: Application to CN-free graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1985, v:5, n:2, pp:141-147 [Journal]
  10. Charles Friden, Alain Hertz, Dominique de Werra
    Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1990, v:17, n:5, pp:437-445 [Journal]
  11. Gabriela Alexe, Peter L. Hammer, Vadim V. Lozin, Dominique de Werra
    Struction revisited. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:132, n:1-3, pp:27-46 [Journal]
  12. Edoardo Amaldi, Eddy Mayoraz, Dominique de Werra
    A Review of Combinatorial Problems Arising in Feedforward Neural Network Design. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:52, n:2, pp:111-138 [Journal]
  13. Jacek Blazewicz, Maciej Drozdowski, Dominique de Werra, Jan Weglarz
    Deadline Scheduling of Multiprocessor Tasks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:65, n:1-3, pp:81-95 [Journal]
  14. Jacek Blazewicz, Alain Hertz, Daniel Kobler, Dominique de Werra
    On some Properties of DNA Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:98, n:1-2, pp:1-19 [Journal]
  15. Ivo Blöchliger, Dominique de Werra
    Locally restricted colorings. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:1, pp:158-165 [Journal]
  16. T. Bornand-Jaccard, D. Schindl, Dominique de Werra
    Some simple optimization techniques for self-organized public key management in mobile ad hoc networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:8, pp:1223-1235 [Journal]
  17. Marie-Christine Costa, Dominique de Werra, Christophe Picouleau
    Using graphs for some discrete tomography problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:1, pp:35-46 [Journal]
  18. Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, D. Schindl
    A solvable case of image reconstruction in discrete tomography. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:148, n:3, pp:240-245 [Journal]
  19. M. Hasler, C. Marthy, A. Oberlin, Dominique de Werra
    A discrete model for studying existence and uniqueness of solutions in nonlinear resistive circuits. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:50, n:2, pp:169-184 [Journal]
  20. Vadim V. Lozin, Dominique de Werra
    Special issue on stability in graphs and related topics. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:132, n:1-3, pp:1-2 [Journal]
  21. Dominique de Werra
    On a Multiconstrained Model for Chromatic Scheduling. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:94, n:1-3, pp:171-180 [Journal]
  22. Dominique de Werra
    on an optimization Problem occurring in FMSs: A Hypergraph-theoretical Formulation. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:55, n:2, pp:107-111 [Journal]
  23. 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). [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:43, n:1, pp:103-104 [Journal]
  24. Dominique de Werra, Marc Demange, Jérôme Monnot, Vangelis Th. Paschos
    A hypocoloring model for batch scheduling. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:146, n:1, pp:3-26 [Journal]
  25. Dominique de Werra, Christine Eisenbeis, Sylvain Lelait, Bruno Marmol
    On a Graph-theoretical Model for Cyclic Register Allocation. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:93, n:2-3, pp:191-203 [Journal]
  26. Dominique de Werra, Tinaz Ekim, C. Raess
    Construction of sports schedules with multiple venues. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:1, pp:47-58 [Journal]
  27. Dominique de Werra, Y. Gay
    Chromatic Scheduling and Frequency Assignment. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:165-174 [Journal]
  28. Dominique de Werra, Alan J. Hoffman, Nadimpalli V. R. Mahadev, Uri N. Peled
    Restrictions and Preassignments in Preemptive open Shop Scheduling. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:68, n:1-2, pp:169-188 [Journal]
  29. Dominique de Werra, Nadimpalli V. R. Mahadev
    Preassignment Requirements in Chromatic Scheduling. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:76, n:1-3, pp:93-101 [Journal]
  30. Dominique de Werra, Alain Hertz, Daniel Kobler, Nadimpalli V. R. Mahadev
    Feasible edge colorings of trees with cardinality constraints. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:61-72 [Journal]
  31. Dominique de Werra
    Good and nice colorings of balanced hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:19-20, pp:2630-2636 [Journal]
  32. Dominique de Werra
    Variations on the Theorem of Birkhoff - von Neumann and Extensions. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2003, v:19, n:2, pp:263-278 [Journal]
  33. Dominique de Werra, Pierre Hansen
    Using stable sets to bound the chromatic number. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:3, pp:127-131 [Journal]
  34. Fanica Gavril, V. Toledano Laredo, Dominique de Werra
    Chordless Paths, Odd Holes, and Kernels in Graphs without m-Obstructions. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:17, n:2, pp:207-221 [Journal]
  35. Tinaz Ekim, Dominique de Werra
    On Split-Coloring Problems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2005, v:10, n:3, pp:211-225 [Journal]
  36. Tinaz Ekim, Dominique de Werra
    Erratum. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2006, v:11, n:1, pp:125- [Journal]
  37. Robert C. Dalang, Leslie E. Trotter Jr., Dominique de Werra
    On randomized stopping points and perfect graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:45, n:3, pp:320-344 [Journal]
  38. Peter L. Hammer, Nadimpalli V. R. Mahadev, Dominique de Werra
    Stability in CAN-free graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:38, n:1, pp:23-30 [Journal]
  39. Dominique de Werra
    Obstructions for regular colorings. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1982, v:32, n:3, pp:326-335 [Journal]
  40. Dominique de Werra
    Multigraphs with quasiweak odd cycles. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1977, v:23, n:1, pp:75-82 [Journal]
  41. Dominique de Werra
    Some remarks on good colorations. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1976, v:21, n:1, pp:57-64 [Journal]
  42. J. C. Arditti, Dominique de Werra
    A note on a paper by D. Seinsche. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1976, v:21, n:1, pp:90- [Journal]
  43. Ivo Blöchliger, Dominique de Werra
    On some properties of suboptimal colorings of graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:43, n:2, pp:103-108 [Journal]
  44. 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. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:4, pp:459-464 [Journal]
  45. Jacek Blazewicz, Maciej Drozdowski, Günter Schmidt II, Dominique de Werra
    Scheduling Independent Multiprocessor Tasks on a Uniform k-Processor System. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1994, v:20, n:1, pp:15-28 [Journal]
  46. Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos
    Time slot scheduling of compatible jobs. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2007, v:10, n:2, pp:111-127 [Journal]
  47. Peter L. Hammer, Bruno Simeone, Thomas M. Liebling, Dominique de Werra
    From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:2, pp:174-184 [Journal]
  48. Dominique de Werra, Nadimpalli V. R. Mahadev, Uri N. Peled
    Edge-Chromatic Scheduling with Simultaneity Constraints. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1993, v:6, n:4, pp:631-641 [Journal]
  49. Dominique de Werra, Ph. Solot
    Compact Cylindrical Chromatic Scheduling. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:4, pp:528-534 [Journal]
  50. Marc Demange, Tinaz Ekim, Dominique de Werra
    (p, k)-coloring problems in line graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:349, n:3, pp:462-474 [Journal]
  51. Dominique de Werra
    Path colorings in bipartite graphs. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:164, n:3, pp:575-584 [Journal]
  52. Armen S. Asratian, Dominique de Werra
    A generalized class-teacher model for some timetabling problems. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2002, v:143, n:3, pp:531-542 [Journal]
  53. Dominique de Werra
    Variation on a theorem of König. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:51, n:3, pp:319-321 [Journal]
  54. Claude Benzaken, Peter L. Hammer, Dominique de Werra
    Split graphs of Dilworth number 2. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:2, pp:123-127 [Journal]
  55. M. Preissmann, Dominique de Werra, Nadimpalli V. R. Mahadev
    A note on superbrittle graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:259-267 [Journal]
  56. Alain Hertz, Dominique de Werra
    Perfectly orderable graphs are quasi-parity graphs: a short proof. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:68, n:1, pp:111-113 [Journal]
  57. Alain Hertz, Dominique de Werra
    Connected sequential colorings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:74, n:1-2, pp:51-59 [Journal]
  58. Alain Hertz, Dominique de Werra
    Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:74, n:1-2, pp:1-2 [Journal]
  59. Dominique de Werra, Alain Hertz
    On perfectness of sums of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:195, n:1-3, pp:93-101 [Journal]
  60. Dominique de Werra
    Restricted coloring models for timetabling. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:161-170 [Journal]
  61. Nadimpalli V. R. Mahadev, Ph. Solot, Dominique de Werra
    The cyclic compact open-shop scheduling problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:361-366 [Journal]
  62. Anthony J. W. Hilton, Dominique de Werra
    A sufficient condition for equitable edge-colourings of simple graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:128, n:1-3, pp:179-201 [Journal]

  63. On the use of graphs in discrete tomography. [Citation Graph (, )][DBLP]


  64. Polarity of chordal graphs. [Citation Graph (, )][DBLP]


  65. Polar cographs. [Citation Graph (, )][DBLP]


  66. Foreword. [Citation Graph (, )][DBLP]


  67. Finding Hamiltonian circuits in quasi-adjoint graphs. [Citation Graph (, )][DBLP]


  68. A convoy scheduling problem. [Citation Graph (, )][DBLP]


  69. On the use of augmenting chains in chain packings. [Citation Graph (, )][DBLP]


  70. Erratum. [Citation Graph (, )][DBLP]


  71. Foreword. [Citation Graph (, )][DBLP]


  72. Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource. [Citation Graph (, )][DBLP]


  73. Some models of graphs for scheduling sports competitions. [Citation Graph (, )][DBLP]


  74. A constrained sports scheduling problem. [Citation Graph (, )][DBLP]


  75. Scheduling independent two processor tasks on a uniform duo-processor system. [Citation Graph (, )][DBLP]


  76. Recognition of a class of unimodular functions. [Citation Graph (, )][DBLP]


  77. Preface. [Citation Graph (, )][DBLP]


  78. Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. [Citation Graph (, )][DBLP]


  79. Blockers and transversals. [Citation Graph (, )][DBLP]


  80. Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid. [Citation Graph (, )][DBLP]


  81. On two coloring problems in mixed graphs. [Citation Graph (, )][DBLP]


Search in 0.085secs, Finished in 0.087secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002