The following pages link to Dominique de Werra (Q224825):
Displayed 50 items.
- Geography, games and graphs (Q1147625) (← links)
- Remarks on the requirement matrix of school timetable problems and regular embeddings of graphs (Q1149373) (← links)
- Obstructions for regular colorings (Q1160139) (← links)
- Chromatic optimisation: Limitations, objectives, uses, references (Q1162931) (← links)
- Minimizing irregularities in sports schedules using graph theory (Q1165871) (← links)
- On the use of augmenting chains in chain packings (Q1174179) (← links)
- Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource (Q1186309) (← links)
- A note on a paper by D. Seinsche (Q1213880) (← links)
- Some remarks on good colorations (Q1216325) (← links)
- An extension of bipartite multigraphs (Q1220938) (← links)
- Uniqueness of colorings (Q1244242) (← links)
- Multigraphs with quasiweak odd cycles (Q1245852) (← links)
- STABULUS: A technique for finding stable sets in large graphs with tabu search (Q1262136) (← links)
- Extensions of coloring models for scheduling purposes (Q1268282) (← links)
- The combinatorics of timetabling (Q1278524) (← links)
- What is my objective function? (Q1278819) (← links)
- On a multiconstrained model for chromatic scheduling (Q1293198) (← links)
- On a graph-theoretical model for cyclic register allocation (Q1296576) (← links)
- On perfectness of sums of graphs (Q1296974) (← links)
- Scheduling independent multiprocessor tasks on a uniform \(k\)-processor system (Q1315909) (← links)
- A sufficient condition for equitable edge-colourings of simple graphs (Q1322183) (← links)
- Chromatic scheduling and frequency assignment (Q1327228) (← links)
- A review of combinatorial problems arising in feedforward neural network design (Q1331904) (← links)
- On an optimization problem occurring in FMSs: A hypergraph-theoretical formulation (Q1339399) (← links)
- The tabu search metaheuristic: How we used it (Q1356212) (← links)
- Restricted coloring models for timetabling (Q1356739) (← links)
- Mixed graph colorings (Q1360876) (← links)
- Preassignment requirements in chromatic scheduling (Q1363744) (← links)
- A partial view of OR in Switzerland (Q1390314) (← links)
- Partitioning the edge set of a bipartite graph into chain packings: Complexity of some variations (Q1399253) (← links)
- Variations on the theorem of Birkhoff-von Neumann and extensions (Q1401565) (← links)
- Foreword: Special issue on stability in graphs and related topics (Q1414577) (← links)
- Struction revisited (Q1414580) (← links)
- Feasible edge colorings of trees with cardinality constraints (Q1579549) (← links)
- What are the worst cases in constrained last-in-first-out pick-up and delivery problems? (Q1651694) (← links)
- Minimal graphs for matching extensions (Q1686047) (← links)
- A hypocoloring model for batch scheduling (Q1765371) (← links)
- Path colorings in bipartite graphs (Q1767676) (← links)
- Addendum: Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource (Q1801674) (← links)
- EPCOT: An efficient procedure for coloring optimally with Tabu Search (Q1802494) (← links)
- Generalized edge packings (Q1825138) (← links)
- Partitions of graphs into coverings and hypergraphs into transversals (Q1844692) (← links)
- A generalized class-teacher model for some timetabling problems (Q1848400) (← links)
- Open shop scheduling with some additional constraints (Q1911243) (← links)
- Deadline scheduling of multiprocessor tasks (Q1917262) (← links)
- Restrictions and preassignments in preemptive open shop scheduling (Q1917354) (← links)
- On some coloring problems in grids (Q1939251) (← links)
- On some properties of DNA graphs (Q1961230) (← links)
- Recoloring subgraphs of \(K_{2n}\) for sports scheduling (Q2034794) (← links)
- Minimal graphs for 2-factor extension (Q2185731) (← links)