The following pages link to Dominique de Werra (Q224825):
Displaying 50 items.
- Edge coloring: a natural model for sports scheduling (Q323273) (← links)
- Sports scheduling search space connectivity: a riffle shuffle driven approach (Q335339) (← links)
- Minimum \(d\)-blockers and \(d\)-transversals in graphs (Q411244) (← links)
- A note on chromatic properties of threshold graphs (Q418900) (← links)
- (Q537588) (redirect page) (← links)
- Weighted stability number of graphs and weighted satisfiability: the two facets of pseudo-Boolean optimization (Q537589) (← links)
- Using tabu search techniques for graph coloring (Q580987) (← links)
- Some experiments with simulated annealing for coloring graphs (Q581241) (← links)
- The cyclic compact open-shop scheduling problem (Q686491) (← links)
- TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph (Q750320) (← links)
- Scheduling independent two processor tasks on a uniform duo-processor system (Q751995) (← links)
- Odd path packings (Q757435) (← links)
- An introduction to timetabling (Q759645) (← links)
- Balanced optimization problems (Q760338) (← links)
- Stability in CAN-free graphs (Q762505) (← links)
- Variation on a theorem of König (Q797595) (← links)
- Variations on the Roy-Gallai theorem (Q816578) (← links)
- \((p,k)\)-coloring problems in line graphs (Q817821) (← links)
- The micro-world of cographs (Q831855) (← links)
- Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications (Q835582) (← links)
- Time slot scheduling of compatible jobs (Q880586) (← links)
- A note on SS/TDMA satellite communication (Q915633) (← links)
- Almost nonpreemptive schedules (Q922279) (← links)
- (Q937243) (redirect page) (← links)
- Addendum to ``Bicolored matchings in some classes of graphs'' (Q937244) (← links)
- Construction of balanced sports schedules using partitions into subleagues (Q943779) (← links)
- A tutorial on the use of graph coloring for some problems in robotics (Q948648) (← links)
- Polarity of chordal graphs (Q955313) (← links)
- Finding Hamiltonian circuits in quasi-adjoint graphs (Q955323) (← links)
- A magnetic procedure for the stability number (Q968215) (← links)
- A projective algorithm for preemptive open shop scheduling with two multiprocessor groups (Q969520) (← links)
- On split-coloring problems (Q995923) (← links)
- On the inapproximability of independent domination in \(2P_3\)-free perfect graphs (Q1006083) (← links)
- Using stable sets to bound the chromatic number (Q1014408) (← links)
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481) (← links)
- Graph coloring with cardinality constraints on the neighborhoods (Q1040081) (← links)
- Blockers and transversals (Q1043948) (← links)
- Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid (Q1045154) (← links)
- Split graphs of Dilworth number 2 (Q1063046) (← links)
- The struction of a graph: Application to CN-free graphs (Q1068855) (← links)
- A note on superbrittle graphs (Q1081614) (← links)
- On randomized stopping points and perfect graphs (Q1085176) (← links)
- Perfectly orderable graphs are quasi-parity graphs: a short proof (Q1095159) (← links)
- Generalized neighbourhoods and a class of perfectly orderable graphs (Q1103648) (← links)
- On the two-phase method for preemptive scheduling (Q1107434) (← links)
- Some models of graphs for scheduling sports competitions (Q1110456) (← links)
- An interactive system for constructing timetables on a PC (Q1117834) (← links)
- Tabu search techniques. A tutorial and an application to neural networks (Q1120479) (← links)
- Connected sequential colourings (Q1123198) (← links)
- Regular and canonical colorings (Q1135863) (← links)
