| 2009 |
|---|
| 21 | EE | Giorgio Lucarelli,
Ioannis Milis,
Vangelis Th. Paschos:
Max Edge Coloring of Trees
CoRR abs/0901.4002: (2009) |
| 20 | EE | Evripidis Bampis,
Alexander Kononov,
Giorgio Lucarelli,
Ioannis Milis:
Bounded Max-Colorings of Graphs
CoRR abs/0904.1705: (2009) |
| 2008 |
|---|
| 19 | EE | Giorgio Lucarelli,
Ioannis Milis,
Vangelis Th. Paschos:
On the Maximum Edge Coloring Problem.
WAOA 2008: 279-292 |
| 18 | EE | Maria Liazi,
Ioannis Milis,
Vassilis Zissimopoulos:
A constant approximation algorithm for the densest k.
Inf. Process. Lett. 108(1): 29-32 (2008) |
| 2007 |
|---|
| 17 | EE | Ioannis Milis,
Aris Pagourtzis,
Katerina Potika:
Selfish Routing and Path Coloring in All-Optical Networks.
CAAN 2007: 71-84 |
| 16 | EE | 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 | EE | Foto N. Afrati,
Ioannis Milis:
Designing PTASs for MIN-SUM scheduling problems.
Discrete Applied Mathematics 154(4): 622-639 (2006) |
| 2005 |
|---|
| 14 | EE | 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 | EE | 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 | EE | Maciej Drozdowski,
Ioannis Milis,
Larry Rudolph,
Denis Trystram:
Scheduling and Load Balancing.
Euro-Par 2002: 187-188 |
| 2001 |
|---|
| 11 | EE | Foto N. Afrati,
Ioannis Milis:
Designing PTASs for MIN-SUM Scheduling Problems.
FCT 2001: 432-444 |
| 2000 |
|---|
| 10 | EE | 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 | EE | 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 | EE | 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 | EE | 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 |
