![]() | ![]() |
| 2012 | ||
|---|---|---|
| 32 | Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Evangelos Markakis, Ioannis Milis: On Multiprocessor Temperature-Aware Scheduling Problems. FAW-AAIM 2012: 149-160 | |
| 31 | 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) | |
| 2011 | ||
| 30 | Giorgio Lucarelli, Ioannis Milis: Improved Approximation Algorithms for the Max-Edge Coloring Problem. TAPAS 2011: 206-216 | |
| 29 | Evripidis Bampis, Christoph Dürr, Fadi Kacem, Ioannis Milis: Speed scaling with power down scheduling for agreeable deadlines CoRR abs/1111.3398: (2011) | |
| 28 | Giorgio Lucarelli, Ioannis Milis: Improved approximation algorithms for the Max Edge-Coloring problem. Inf. Process. Lett. 111(16): 819-823 (2011) | |
| 2010 | ||
| 27 | Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos, O. Pottié: The max quasi-independent set Problem. CSR 2010: 60-71 | |
| 26 | Evripidis Bampis, Alexander Kononov, Giorgio Lucarelli, Ioannis Milis: Bounded Max-colorings of Graphs. ISAAC (1) 2010: 353-365 | |
| 25 | Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos: On the max-weight edge coloring problem. J. Comb. Optim. 20(4): 429-442 (2010) | |
| 24 | Nicolas Bourgeois, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos: Approximating the max-edge-coloring problem. Theor. Comput. Sci. 411(34-36): 3055-3067 (2010) | |
| 2009 | ||
| 23 | Evangelos Markakis, Ioannis Milis: Proceedings Fourth Athens Colloquium on Algorithms and Complexity ACAC 2009 | |
| 22 | Nicolas Bourgeois, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos: Approximating the Max Edge-Coloring Problem. IWOCA 2009: 83-94 | |
| 21 | Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos: Max Edge Coloring of Trees CoRR abs/0901.4002: (2009) | |
| 20 | Evripidis Bampis, Alexander Kononov, Giorgio Lucarelli, Ioannis Milis: Bounded Max-Colorings of Graphs CoRR abs/0904.1705: (2009) | |
| 2008 | ||
| 19 | Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos: On the Maximum Edge Coloring Problem. WAOA 2008: 279-292 | |
| 18 | Maria Liazi, Ioannis Milis, Vassilis Zissimopoulos: A constant approximation algorithm for the densest k. Inf. Process. Lett. 108(1): 29-32 (2008) | |
| 2007 | ||
| 17 | Ioannis Milis, Aris Pagourtzis, Katerina Potika: Selfish Routing and Path Coloring in All-Optical Networks. CAAN 2007: 71-84 | |
| 16 | Maria Liazi, Ioannis Milis, Fanny Pascual, Vassilis Zissimopoulos: The densest k-subgraph problem on clique graphs. J. Comb. Optim. 14(4): 465-474 (2007) | |
| 2006 | ||
| 15 | Foto N. Afrati, Ioannis Milis: Designing PTASs for MIN-SUM scheduling problems. Discrete Applied Mathematics 154(4): 622-639 (2006) | |
| 2005 | ||
| 14 | 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) | |
| 13 | 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 | ||
| 12 | Maciej Drozdowski, Ioannis Milis, Larry Rudolph, Denis Trystram: Scheduling and Load Balancing. Euro-Par 2002: 187-188 | |
| 2001 | ||
| 11 | Foto N. Afrati, Ioannis Milis: Designing PTASs for MIN-SUM Scheduling Problems. FCT 2001: 432-444 | |
| 2000 | ||
| 10 | Foto N. Afrati, Evripidis Bampis, Lucian Finta, Ioannis Milis: Scheduling Trees with Large Communication Delays on Two Identical Processors. Euro-Par 2000: 288-295 | |
| 9 | 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) | |
| 1999 | ||
| 8 | 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 | |
| 7 | Foto N. Afrati, Evripidis Bampis, Claire Kenyon, Ioannis Milis: Scheduling on a Constant Number of Machines. RANDOM-APPROX 1999: 281-287 | |
| 6 | Yannis Manoussakis, Ioannis Milis: A sufficient condition for maximum cycles in bipartite digraphs. Discrete Mathematics 207(1-3): 161-171 (1999) | |
| 1998 | ||
| 5 | 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 | ||
| 4 | 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 | ||
| 3 | Evripidis Bampis, Yannis Manoussakis, Ioannis Milis: On the Parallel Complexity of the Alternating Hamiltonian Cycle Problem. Combinatorics and Computer Science 1995: 367-377 | |
| 2 | Ioannis Milis: Task Assignment in Distributed Systems Using Network Flow Methods. Combinatorics and Computer Science 1995: 396-405 | |
| 1994 | ||
| 1 | Evripidis Bampis, Yannis Manoussakis, Ioannis Milis: NC Algorithms for Antidirected Hamiltonian Paths and Cycles in Tournaments (Extended Abstract). WG 1994: 387-394 | |
Colors in the list of coauthors
Last update Mon Jun 4 20:40:43 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page