| |
| 2008 | ||
|---|---|---|
| 12 | EE | Alain Quilliot: Preemptive scheduling and antichain polyhedra. Discrete Applied Mathematics 156(17): 3267-3275 (2008) |
| 2007 | ||
| 11 | EE | Jean Damay, Alain Quilliot, Eric Sanlaville: Linear programming based algorithms for preemptive and non-preemptive RCPSP. European Journal of Operational Research 182(3): 1012-1022 (2007) |
| 2005 | ||
| 10 | EE | Aziz Moukrim, Alain Quilliot: Optimal preemptive scheduling on a fixed number of identical parallel machines. Oper. Res. Lett. 33(2): 143-150 (2005) |
| 1998 | ||
| 9 | Aziz Moukrim, Alain Quilliot: Scheduling with Communication Delays and Data Routing in Message Passing Architectures. IPPS/SPDP Workshops 1998: 438-451 | |
| 1994 | ||
| 8 | EE | Alain Quilliot, Sun Xiao Chao: Algorithmic Characterizations of Interval ordered Hypergraphs and Applications. Discrete Applied Mathematics 51(1-2): 159-170 (1994) |
| 1993 | ||
| 7 | EE | Alain Quilliot: Une extension du problème du point fixe pour des graphes simples. Discrete Mathematics 111(1-3): 435-445 (1993) |
| 1988 | ||
| 6 | EE | Alain Quilliot: On the problem of how to represent a graph taking into account an additional structure. J. Comb. Theory, Ser. B 44(1): 1-21 (1988) |
| 1985 | ||
| 5 | EE | Alain Quilliot: Representation theorems for graphs whose the vertex set is partially ordered. Discrete Mathematics 53: 207-219 (1985) |
| 4 | EE | Alain Quilliot: A retraction problem in graph theory. Discrete Mathematics 54(1): 61-71 (1985) |
| 3 | Alain Quilliot: On the Helly Property Working as a Compactness Criterion on Graphs. J. Comb. Theory, Ser. A 40(1): 186-193 (1985) | |
| 2 | EE | Alain Quilliot: A short note about pursuit games played on a graph with a given genus. J. Comb. Theory, Ser. B 38(1): 89-92 (1985) |
| 1983 | ||
| 1 | Alain Quilliot: An Application of the Helly Property to the Partially Ordered Sets. J. Comb. Theory, Ser. A 35(2): 185-198 (1983) | |
| 1 | Sun Xiao Chao | [8] |
| 2 | Jean Damay | [11] |
| 3 | Aziz Moukrim | [9] [10] |
| 4 | Eric Sanlaville | [11] |