Search the dblp DataBase

Publications of Author

1. Evripidis Bampis, Yannis Manoussakis, Ioannis Milis
   On the Parallel Complexity of the Alternating Hamiltonian Cycle Problem. [Citation Graph (0, 0)][DBLP]
   Combinatorics and Computer Science, 1995, pp:367-377 [Conf]
   
2. Ioannis Milis
   Task Assignment in Distributed Systems Using Network Flow Methods. [Citation Graph (0, 0)][DBLP]
   Combinatorics and Computer Science, 1995, pp:396-405 [Conf]
   
3. Foto N. Afrati, Evripidis Bampis, Lucian Finta, Ioannis Milis
   Scheduling Trees with Large Communication Delays on Two Identical Processors. [Citation Graph (0, 0)][DBLP]
   Euro-Par, 2000, pp:288-295 [Conf]
   
4. Maciej Drozdowski, Ioannis Milis, Larry Rudolph, Denis Trystram
   Scheduling and Load Balancing. [Citation Graph (0, 0)][DBLP]
   Euro-Par, 2002, pp:187-188 [Conf]
   
5. Foto N. Afrati, Ioannis Milis
   Designing PTASs for MIN-SUM Scheduling Problems. [Citation Graph (0, 0)][DBLP]
   FCT, 2001, pp:432-444 [Conf]
   
6. 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. [Citation Graph (0, 0)][DBLP]
   FOCS, 1999, pp:32-44 [Conf]
   
7. Foto N. Afrati, Evripidis Bampis, Claire Kenyon, Ioannis Milis
   Scheduling on a Constant Number of Machines. [Citation Graph (0, 0)][DBLP]
   RANDOM-APPROX, 1999, pp:281-287 [Conf]
   
8. Evripidis Bampis, Yannis Manoussakis, Ioannis Milis
   NC Algorithms for Antidirected Hamiltonian Paths and Cycles in Tournaments (Extended Abstract). [Citation Graph (0, 0)][DBLP]
   WG, 1994, pp:387-394 [Conf]
   
9. Foto N. Afrati, Ioannis Milis
   Designing PTASs for MIN-SUM scheduling problems. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2006, v:154, n:4, pp:622-639 [Journal]
   
10. 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. [Citation Graph (0, 0)][DBLP]
    ITA, 2000, v:34, n:2, pp:87-98 [Journal]
    
11. Foto N. Afrati, Timos Aslanidis, Evripidis Bampis, Ioannis Milis
    Scheduling in Switching Networks with Set-Up Delays. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2005, v:9, n:1, pp:49-57 [Journal]
    
12. Evripidis Bampis, Alexander V. Karzanov, Yannis Manoussakis, Ioannis Milis
    A Parallel Algorithm for Finding a Perfect Matching in a Planar Graph. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:3, pp:399-405 [Journal]
    
13. Foto N. Afrati, Evripidis Bampis, Lucian Finta, Ioannis Milis
    Scheduling trees with large communication delays on two identical processors. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2005, v:8, n:2, pp:179-190 [Journal]
    
14. Lucian Finta, Zhen Liu, Ioannis Milis, Evripidis Bampis
    Scheduling UET-UCT Series-Parallel Graphs on Two Processors. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:162, n:2, pp:323-340 [Journal]
    
15. Yannis Manoussakis, Ioannis Milis
    A sufficient condition for maximum cycles in bipartite digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:207, n:1-3, pp:161-171 [Journal]
    
16. 
    Selfish Routing and Path Coloring in All-Optical Networks. [Citation Graph (, )][DBLP]
    
    
17. 
    The max quasi-independent set Problem. [Citation Graph (, )][DBLP]
    
    
18. 
    On the Maximum Edge Coloring Problem. [Citation Graph (, )][DBLP]
    
    
19. 
    Approximating the Max Edge-Coloring Problem. [Citation Graph (, )][DBLP]
    
    
20. 
    Max Edge Coloring of Trees [Citation Graph (, )][DBLP]
    
    
21. 
    Bounded Max-Colorings of Graphs [Citation Graph (, )][DBLP]
    
    
22. 
    Proceedings Fourth Athens Colloquium on Algorithms and Complexity [Citation Graph (, )][DBLP]