NC Algorithms for Antidirected Hamiltonian Paths and Cycles in Tournaments (Extended Abstract). - Evripidis Bampis; Yannis Manoussakis; Ioannis Milis (WG, 1994)

Task Assignment in Distributed Systems Using Network Flow Methods. - Ioannis Milis (Combinatorics and Computer Science, 1995)

Scheduling UET-UCT Series-Parallel Graphs on Two Processors. - Lucian Finta; Zhen Liu 001; Ioannis Milis; Evripidis Bampis (Theor. Comput. Sci., 1996)

A Parallel Algorithm for Finding a Perfect Matching in a Planar Graph. - Evripidis Bampis; Alexander V. Karzanov; Yannis Manoussakis; Ioannis Milis (Parallel Process. Lett., 1998)

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 001; Maxim Sviridenko (FOCS, 1999)

Scheduling on a Constant Number of Machines. - Foto N. Afrati; Evripidis Bampis; Claire Kenyon; Ioannis Milis (RANDOM-APPROX, 1999)

A sufficient condition for maximum cycles in bipartite digraphs. - Yannis Manoussakis; Ioannis Milis (Discret. Math., 1999)

On the parallel complexity of the alternating Hamiltonian cycle problem. - Evripidis Bampis; Yannis Manoussakis; Ioannis Milis (RAIRO Oper. Res., 1999)

Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases. - Evripidis Bampis; Aristotelis Giannakos; Alexander V. Karzanov; Yannis Manoussakis; Ioannis Milis (RAIRO Theor. Informatics Appl., 2000)

Scheduling and Load Balancing. - Maciej Drozdowski; Ioannis Milis; Larry Rudolph; Denis Trystram (Euro-Par, 2002)

Scheduling in Switching Networks with Set-Up Delays. - Foto N. Afrati; Timos Aslanidis; Evripidis Bampis; Ioannis Milis (J. Comb. Optim., 2005)

Scheduling trees with large communication delays on two identical processors. - Foto N. Afrati; Evripidis Bampis; Lucian Finta; Ioannis Milis (J. Sched., 2005)

Designing PTASs for MIN-SUM scheduling problems. - Foto N. Afrati; Ioannis Milis (Discret. Appl. Math., 2006)

Approximating a Class of Classification Problems. - Ioannis Milis (Efficient Approximation and Online Algorithms, 2006)

Selfish Routing and Path Coloring in All-Optical Networks. - Ioannis Milis; Aris Pagourtzis; Katerina Potika (CAAN, 2007)

The densest k-subgraph problem on clique graphs. - Maria Liazi; Ioannis Milis; Fanny Pascual; Vassilis Zissimopoulos (J. Comb. Optim., 2007)

On the Maximum Edge Coloring Problem. - Giorgio Lucarelli; Ioannis Milis; Vangelis Th. Paschos (WAOA, 2008)

A constant approximation algorithm for the densest k. - Maria Liazi; Ioannis Milis; Vassilis Zissimopoulos (Inf. Process. Lett., 2008)

Max Edge Coloring of Trees - Giorgio Lucarelli; Ioannis Milis; Vangelis Th. Paschos (CoRR, 2009)

On the max-weight edge coloring problem. - Giorgio Lucarelli; Ioannis Milis; Vangelis Th. Paschos (J. Comb. Optim., 2010)

Approximating the max-edge-coloring problem. - Nicolas Bourgeois; Giorgio Lucarelli; Ioannis Milis; Vangelis Th. Paschos (Theor. Comput. Sci., 2010)

Improved approximation algorithms for the Max Edge-Coloring problem. - Giorgio Lucarelli; Ioannis Milis (Inf. Process. Lett., 2011)

Topic 3: Scheduling and Load Balancing. - Denis Trystram; Ioannis Milis; Zhihui Du; Uwe Schwiegelshohn (Euro-Par, 2012)

Approximating the Throughput by Coolest First Scheduling. - Christoph Dürr; Ioannis Milis; Julien Robert; Georgios Zois (WAOA, 2012)

The max quasi-independent set problem. - Nicolas Bourgeois; Aristotelis Giannakos; Giorgio Lucarelli; Ioannis Milis; Vangelis Th. Paschos; O. Pottié (J. Comb. Optim., 2012)

Speed scaling with power down scheduling for agreeable deadlines. - Evripidis Bampis; Christoph Dürr; Fadi Kacem; Ioannis Milis (Sustain. Comput. Informatics Syst., 2012)

Exact and Approximation Algorithms for Densest k-Subgraph. - Nicolas Bourgeois; Aristotelis Giannakos; Giorgio Lucarelli; Ioannis Milis; Vangelis Th. Paschos (WALCOM, 2013)

Energy Minimization via a Primal-Dual Algorithm for a Convex Program. - Evripidis Bampis; Vincent Chau; Dimitrios Letsios; Giorgio Lucarelli; Ioannis Milis (SEA, 2013)

On multiprocessor temperature-aware scheduling problems. - Evripidis Bampis; Dimitrios Letsios; Giorgio Lucarelli; Evangelos Markakis; Ioannis Milis (J. Sched., 2013)

Scheduling MapReduce Jobs on Unrelated Processors. - Dimitris Fotakis 001; Ioannis Milis; Emmanouil Zampetakis; Georgios Zois (EDBT/ICDT Workshops, 2014)

Energy Efficient Scheduling of MapReduce Jobs. - Evripidis Bampis; Vincent Chau; Dimitrios Letsios; Giorgio Lucarelli; Ioannis Milis; Georgios Zois (Euro-Par, 2014)

Energy-Efficient Algorithms for Non-preemptive Speed-Scaling. - Vincent Cohen-Addad; Zhentao Li; Claire Mathieu; Ioannis Milis (WAOA, 2014)

Bounded max-colorings of graphs. - Evripidis Bampis; Alexander V. Kononov; Giorgio Lucarelli; Ioannis Milis (J. Discrete Algorithms, 2014)

Special Issue: "Combinatorial Optimization: Theory of Algorithms and Complexity". - Vangelis Markakis; Ioannis Milis; Vangelis Th. Paschos (Theor. Comput. Sci., 2014)

Scheduling MapReduce Jobs and Data Shuffle on Unrelated Processors. - Dimitris Fotakis 001; Ioannis Milis; Orestis Papadigenopoulos; Emmanouil Zampetakis; Georgios Zois (SEA, 2015)

Scheduling MapReduce Jobs Under Multi-round Precedences. - Dimitris Fotakis 001; Ioannis Milis; Orestis Papadigenopoulos; Vasilis Vassalos; Georgios Zois (Euro-Par, 2016)

Bin Packing with Colocations. - Jean-Claude Bermond; Nathann Cohen; David Coudert; Dimitrios Letsios; Ioannis Milis; Stéphane Pérennes; Vassilis Zissimopoulos (WAOA, 2016)

Speed Scaling for Maximum Lateness. - Evripidis Bampis; Dimitrios Letsios; Ioannis Milis; Georgios Zois (Theory Comput. Syst., 2016)

Exact and superpolynomial approximation algorithms for the densest k-subgraph problem. - Nicolas Bourgeois; Aristotelis Giannakos; Giorgio Lucarelli; Ioannis Milis; Vangelis Th. Paschos (Eur. J. Oper. Res., 2017)

Scheduling MapReduce Jobs on Identical and Unrelated Processors. - Dimitris Fotakis 001; Ioannis Milis; Orestis Papadigenopoulos; Vasilis Vassalos; Georgios Zois (Theory Comput. Syst., 2020)