Evripidis Bampis
Loading Google Thumbnails...
| 2005 |
|---|
| 7 | Scheduling in Switching Networks with Set-Up Delays. Foto N. Afrati, Timos Aslanidis, Evripidis Bampis, Ioannis Milis. J. Comb. Optim. (9): 49-57 (2005). Cited by 14Web SearchBibTeXDownload |
| 6 | Scheduling trees with large communication delays on two identical processors. Foto N. Afrati, Evripidis Bampis, Lucian Finta, Ioannis Milis. J. Scheduling (8): 179-190 (2005). Cited by 1Web SearchBibTeXDownload |
| 2000 |
|---|
| 5 | Scheduling Trees with Large Communication Delays on Two Identical Processors. Foto N. Afrati, Evripidis Bampis, Lucian Finta, Ioannis Milis. Euro-Par 2000, 288-295. Cited by 2Web SearchBibTeXDownload |
| 4 | Scheduling to Minimize the Average Completion Time of Dedicated Tasks. Foto N. Afrati, Evripidis Bampis, Aleksei V. Fishkin, Klaus Jansen, Claire Kenyon. FSTTCS 2000, 454-464. Cited by 24Web SearchBibTeXDownload |
| 1999 |
|---|
| 3 | Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. Foto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein, Maxim Sviridenko. FOCS 1999, 32-44. Cited by 123Web SearchBibTeXDownload |
| 2 | Scheduling on a Constant Number of Machines. Foto N. Afrati, Evripidis Bampis, Claire Kenyon, Ioannis Milis. RANDOM-APPROX 1999, 281-287. Web SearchBibTeXDownload |
| 1996 |
|---|
| 1 | Scheduling UET-UCT Series-Parallel Graphs on Two Processors. Lucian Finta, Zhen Liu, Ioannis Milis, Evripidis Bampis. Theor. Comput. Sci. (162): 323-340 (1996). Web SearchBibTeXDownload |
from DBLP and Google Scholar
