Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Ioannis Milis
2010 – today
- 2013
[j15]Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Evangelos Markakis, Ioannis Milis: On multiprocessor temperature-aware scheduling problems. J. Scheduling 16(5): 529-538 (2013)- [c20]Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos: Exact and Approximation Algorithms for Densest k-Subgraph. WALCOM 2013: 114-125
- [c19]Evripidis Bampis, Vincent Chau, Dimitrios Letsios, Giorgio Lucarelli, Ioannis Milis: Energy Minimization via a Primal-Dual Algorithm for a Convex Program. SEA 2013: 366-377
- 2012
- [j14]Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos, O. Pottié: The max quasi-independent set problem. J. Comb. Optim. 23(1): 94-117 (2012)
- [c18]Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Evangelos Markakis, Ioannis Milis: On Multiprocessor Temperature-Aware Scheduling Problems. FAW-AAIM 2012: 149-160
- [c17]Evripidis Bampis, Dimitrios Letsios, Ioannis Milis, Georgios Zois: Speed Scaling for Maximum Lateness. COCOON 2012: 25-36
- [c16]Denis Trystram, Ioannis Milis, Zhihui Du, Uwe Schwiegelshohn: Topic 3: Scheduling and Load Balancing. Euro-Par 2012: 115
- [c15]Christoph Dürr, Ioannis Milis, Julien Robert, Georgios Zois: Approximating the Throughput by Coolest First Scheduling. WAOA 2012: 187-200
- [e2]Ali Ridha Mahjoub, Vangelis Markakis, Ioannis Milis, Vangelis Th. Paschos (Eds.): Combinatorial Optimization - Second International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7422, Springer 2012, ISBN 978-3-642-32146-7
- 2011
- [j13]Giorgio Lucarelli, Ioannis Milis: Improved approximation algorithms for the Max Edge-Coloring problem. Inf. Process. Lett. 111(16): 819-823 (2011)
- [c14]Giorgio Lucarelli, Ioannis Milis: Improved Approximation Algorithms for the Max-Edge Coloring Problem. TAPAS 2011: 206-216
- [i3]Evripidis Bampis, Christoph Dürr, Fadi Kacem, Ioannis Milis: Speed scaling with power down scheduling for agreeable deadlines. CoRR abs/1111.3398 (2011)
- 2010
- [j12]Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos: On the max-weight edge coloring problem. J. Comb. Optim. 20(4): 429-442 (2010)
- [j11]Nicolas Bourgeois, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos: Approximating the max-edge-coloring problem. Theor. Comput. Sci. 411(34-36): 3055-3067 (2010)
- [c13]Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos, O. Pottié: The max quasi-independent set Problem. CSR 2010: 60-71
- [c12]Evripidis Bampis, Alexander Kononov, Giorgio Lucarelli, Ioannis Milis: Bounded Max-colorings of Graphs. ISAAC (1) 2010: 353-365
2000 – 2009
- 2009
- [c11]Nicolas Bourgeois, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos: Approximating the Max Edge-Coloring Problem. IWOCA 2009: 83-94
- [e1]Evangelos Markakis, Ioannis Milis (Eds.): Proceedings Fourth Athens Colloquium on Algorithms and Complexity. EPTCS 4, 2009
- [i2]Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos: Max Edge Coloring of Trees. CoRR abs/0901.4002 (2009)
- [i1]Evripidis Bampis, Alexander Kononov, Giorgio Lucarelli, Ioannis Milis: Bounded Max-Colorings of Graphs. CoRR abs/0904.1705 (2009)
- 2008
- [j10]Maria Liazi, Ioannis Milis, Vassilis Zissimopoulos: A constant approximation algorithm for the densest k. Inf. Process. Lett. 108(1): 29-32 (2008)
- [c10]Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos: On the Maximum Edge Coloring Problem. WAOA 2008: 279-292
- 2007
- [j9]Maria Liazi, Ioannis Milis, Fanny Pascual, Vassilis Zissimopoulos: The densest k-subgraph problem on clique graphs. J. Comb. Optim. 14(4): 465-474 (2007)
- [c9]Ioannis Milis, Aris Pagourtzis, Katerina Potika: Selfish Routing and Path Coloring in All-Optical Networks. CAAN 2007: 71-84
- 2006
- [j8]Foto N. Afrati, Ioannis Milis: Designing PTASs for MIN-SUM scheduling problems. Discrete Applied Mathematics 154(4): 622-639 (2006)
- 2005
- [j7]Foto N. Afrati, Timos Aslanidis, Evripidis Bampis, Ioannis Milis: Scheduling in Switching Networks with Set-Up Delays. J. Comb. Optim. 9(1): 49-57 (2005)
- [j6]Foto N. Afrati, Evripidis Bampis, Lucian Finta, Ioannis Milis: Scheduling trees with large communication delays on two identical processors. J. Scheduling 8(2): 179-190 (2005)
- 2002
- [c8]Maciej Drozdowski, Ioannis Milis, Larry Rudolph, Denis Trystram: Scheduling and Load Balancing. Euro-Par 2002: 187-188
- 2001
- [c7]
- 2000
- [j5]Evripidis Bampis, Aristotelis Giannakos, Alexander V. Karzanov, Yannis Manoussakis, Ioannis Milis: Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases. ITA 34(2): 87-98 (2000)
- [c6]Foto N. Afrati, Evripidis Bampis, Lucian Finta, Ioannis Milis: Scheduling Trees with Large Communication Delays on Two Identical Processors. Euro-Par 2000: 288-295
1990 – 1999
- 1999
- [j4]Yannis Manoussakis, Ioannis Milis: A sufficient condition for maximum cycles in bipartite digraphs. Discrete Mathematics 207(1-3): 161-171 (1999)
- [j3]Evripidis Bampis, Yannis Manoussakis, Ioannis Milis: On the parallel complexity of the alternating Hamiltonian cycle problem. RAIRO - Operations Research 33(4): 421-437 (1999)
- [c5]Foto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein, Maxim Sviridenko: Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. FOCS 1999: 32-44
- [c4]Foto N. Afrati, Evripidis Bampis, Claire Kenyon, Ioannis Milis: Scheduling on a Constant Number of Machines. RANDOM-APPROX 1999: 281-287
- 1998
- [j2]Evripidis Bampis, Alexander V. Karzanov, Yannis Manoussakis, Ioannis Milis: A Parallel Algorithm for Finding a Perfect Matching in a Planar Graph. Parallel Processing Letters 8(3): 399-405 (1998)
- 1996
- [j1]Lucian Finta, Zhen Liu, Ioannis Milis, Evripidis Bampis: Scheduling UET-UCT Series-Parallel Graphs on Two Processors. Theor. Comput. Sci. 162(2): 323-340 (1996)
- 1995
- [c3]Evripidis Bampis, Yannis Manoussakis, Ioannis Milis: On the Parallel Complexity of the Alternating Hamiltonian Cycle Problem. Combinatorics and Computer Science 1995: 367-377
- [c2]Ioannis Milis: Task Assignment in Distributed Systems Using Network Flow Methods. Combinatorics and Computer Science 1995: 396-405
- 1994
- [c1]Evripidis Bampis, Yannis Manoussakis, Ioannis Milis: NC Algorithms for Antidirected Hamiltonian Paths and Cycles in Tournaments (Extended Abstract). WG 1994: 387-394
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:04 CEST by the dblp team