Ioannis Milis
Ioannis Milis
Athens University E & B, Department of Informatics
Verified email at - Homepage
Cited by
Cited by
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
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
Energy-efficient algorithms for non-preemptive speed-scaling
V Cohen-Addad, Z Li, C Mathieu, I Milis
Approximation and Online Algorithms: 12th International Workshop, WAOA 2014 …, 2015
The densest k-subgraph problem on clique graphs
M Liazi, I Milis, F Pascual, V Zissimopoulos
Journal of combinatorial optimization 14, 465-474, 2007
Energy efficient scheduling of mapreduce jobs
E Bampis, V Chau, D Letsios, G Lucarelli, I Milis, G Zois
Euro-Par 2014 Parallel Processing: 20th International Conference, Porto …, 2014
A lagrangian relaxation algorithm for sparse quadratic assignment problems
IZ Milis, VF Magirou
Operations Research Letters 17 (2), 69-76, 1995
Exact and Approximation Algorithms for Densest k-Subgraph:
N Bourgeois, A Giannakos, G Lucarelli, I Milis, VT Paschos
WALCOM: Algorithms and Computation: 7th International Workshop, WALCOM 2013 …, 2013
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
Exact and superpolynomial approximation algorithms for the densest k-subgraph problem
N Bourgeois, A Giannakos, G Lucarelli, I Milis, VT Paschos
European Journal of Operational Research 262 (3), 894-903, 2017
Task assignment in distributed systems using network flow methods
I Milis
Combinatorics and Computer Science: 8th Franco-Japanese and 4th Franco …, 2005
Scheduling mapreduce jobs and data shuffle on unrelated processors
D Fotakis, I Milis, O Papadigenopoulos, E Zampetakis, G Zois
Experimental Algorithms: 14th International Symposium, SEA 2015, Paris …, 2015
On multiprocessor temperature-aware scheduling problems
E Bampis, D Letsios, G Lucarelli, E Markakis, I Milis
Journal of Scheduling 16 (5), 529-538, 2013
Speed scaling for maximum lateness
E Bampis, D Letsios, I Milis, G Zois
Computing and Combinatorics: 18th Annual International Conference, COCOON …, 2012
Selfish routing and path coloring in all-optical networks
I Milis, A Pagourtzis, K Potika
Combinatorial and Algorithmic Aspects of Networking: 4th Workshop, CAAN 2007 …, 2007
Designing PTASs for MIN-SUM scheduling problems
F Afrati, I Milis
Discrete applied mathematics 154 (4), 622-639, 2006
The system can't perform the operation now. Try again later.
Articles 1–20