Ioannis Milis
Ioannis Milis
Athens University E & B, Department of Informatics
Bestätigte E-Mail-Adresse bei - Startseite
Zitiert von
Zitiert von
Approximation schemes for minimizing average weighted completion time with release dates
F Afrati, E Bampis, C Chekuri, D Karger, C Kenyon, S Khanna, I Milis, ...
40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039 …, 1999
Scheduling UET-UCT series-parallel graphs on two processors
L Finta, Z Liu, I Mills, E Bampis
Theoretical Computer Science 162 (2), 323-340, 1996
An algorithm for the multiprocessor assignment problem
V Magirou, I Milis
Operations research letters 8 (6), 351-356, 1989
A constant approximation algorithm for the densest k-subgraph problem on chordal graphs
M Liazi, I Milis, V Zissimopoulos
Information Processing Letters 108 (1), 29-32, 2008
Scheduling in switching networks with set-up delays
F Afrati, T Aslanidis, E Bampis, I Milis
Journal of Combinatorial Optimization 9 (1), 49-57, 2005
The densest k-subgraph problem on clique graphs
M Liazi, I Milis, F Pascual, V Zissimopoulos
Journal of combinatorial optimization 14 (4), 465-474, 2007
Energy-efficient algorithms for non-preemptive speed-scaling
V Cohen-Addad, Z Li, C Mathieu, I Milis
International Workshop on Approximation and Online Algorithms, 107-118, 2014
Speed scaling with power down scheduling for agreeable deadlines
E Bampis, C Dürr, F Kacem, I Milis
Sustainable Computing: Informatics and Systems 2 (4), 184-189, 2012
Exact and Approximation Algorithms for Densest k-Subgraph
N Bourgeois, A Giannakos, G Lucarelli, I Milis, VT Paschos
International Workshop on Algorithms and Computation, 114-125, 2013
Energy efficient scheduling of mapreduce jobs
E Bampis, V Chau, D Letsios, G Lucarelli, I Milis, G Zois
European Conference on Parallel Processing, 198-209, 2014
A Lagrangian relaxation algorithm for sparse quadratic assignment problems
IZ Milis, VF Magirou
Operations Research Letters 17 (2), 69-76, 1995
The max quasi-independent set problem
N Bourgeois, A Giannakos, G Lucarelli, I Milis, VT Paschos, O Pottié
Journal of Combinatorial Optimization 23 (1), 94-117, 2012
On the max-weight edge coloring problem
G Lucarelli, I Milis, VT Paschos
Journal of Combinatorial Optimization 20 (4), 429-442, 2010
Speed scaling for maximum lateness
E Bampis, D Letsios, I Milis, G Zois
International Computing and Combinatorics Conference, 25-36, 2012
Task assignment in distributed systems using network flow methods
I Milis
Franco-Japanese and Franco-Chinese Conference on Combinatorics and Computer …, 1995
Selfish routing and path coloring in all-optical networks
I Milis, A Pagourtzis, K Potika
Workshop on Combinatorial and Algorithmic Aspects of Networking, 71-84, 2007
Approximating the max-edge-coloring problem
N Bourgeois, G Lucarelli, I Milis, VT Paschos
Theoretical Computer Science 411 (34-36), 3055-3067, 2010
On the maximum edge coloring problem
G Lucarelli, I Milis, VT Paschos
International Workshop on Approximation and Online Algorithms, 279-292, 2008
Scheduling mapreduce jobs and data shuffle on unrelated processors
D Fotakis, I Milis, O Papadigenopoulos, E Zampetakis, G Zois
International Symposium on Experimental Algorithms, 137-150, 2015
Designing PTASs for MIN-SUM scheduling problems
F Afrati, I Milis
Discrete applied mathematics 154 (4), 622-639, 2006
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20