| SESSION 1 | |
| 9:00 | Can Network Coding Help in P2P Networks? |
| 9:30 | Distributed Algorithms for Minimum Cost Multicast with Network Coding in Wireless NetworksY. Xi and E. Yeh |
| 9:55 | Distributed Utility Maximization for Network Coding Based Multicasting: A Critical Cut ApproachY. Wu, M. Chiang, S. Kung |
| SESSION 2 | |
| Break | |
| 10:50 | Information Flows, Graphs and their Guessing Numbers |
| 11:15 | On the Benefits of Network Coding for Wireless Applications |
| 11:40 | The Vamos Network |
| lunch break | |
| SESSION 3 | |
| 2:15 | On Minimizing Network Coding Resources: An Evolutionary Approach |
| 2:40 | Network Information Flow in Navigable Small-World Networks |
| 3:05 | Min-cost Selfish Multicast with Network Coding |
| break | |
| SESSION 4 | |
| 4:00 | In the Benefits of Random Linear Coding for Unicast Applications in Disruption Tolerant Networks |
| 4:25 | An Analysis of Finite-Memory Random Linear Coding on Packet Streams |
| 4:50 | Secure Network Coding with a Cost Criterion |