Preliminary Program
THURSDAY, AUGUST 23, 2007 |
|
| 10:00 - 10:30 | Registration and Reception |
| 10:30 - 11:30 | Elias Koutsoupias (UoA) |
| 11:30 - 12:00 | Giorgio Lucarelli (AUEB) On a generalized graph coloring/batch scheduling problem |
| 12:00 - 12:20 | Coffee break |
| 12:20 - 12:50 | Spyridon Antonakopoulos (Columbia) Buy-at-Bulk Network Design with Protection |
| 12:50 - 13:20 | Nikos Tzevelekos (Oxford) Full Abstraction for Nominal General References |
| 13:20 - 13:50 | Aggelina Vidali (UoA) A lower bound of 1+φ for truthful mechanisms |
| 13:50 - 15:30 | Lunch break - Free time |
| 15:30 - 16:30 | Evangelos Kranakis (Carleton) Locality and Location Awareness |
| 16:30 - 17:00 | Vangelis Paschos (Paris-Dauphine) Non-polynomial approximation? Why not? |
| 17:00 - 17:30 | Christos Nomikos (UoI) On the Semantic Approaches to Boolean Grammars |
| 17:30 - 17:50 | Coffee break |
| 17:50 - 18:20 | Aristotelis Giannakos (Paris-Dauphine) On the performance of congestion games for optimum satisfiability problems |
| 18:20 - 18:50 | Christodoulos Fragoudakis (NTUA) Maximizing the guarded boundary of an art gallery is apx complete |
| 18:50 - 19:20 | Stamatis Stefanakos (Rome "La Sapienza") Reliable Routings in Networks with Generalized Link Failure Events |
| 20:30 - | Conference dinner |
FRIDAY, AUGUST 24, 2007 |
|
| 10:30 - 11:30 | Mihalis Yannakakis (Columbia U) On the Complexity of Nash Equilibria and other Fixed Point Problems |
| 11:30 - 12:00 | Iordanis Kerenidis (CNRS) Introduction to Quantum Information Theory |
| 12:00 - 12:20 | Coffee break |
| 12:20 - 12:50 | Euripides Markou (McMaster) Connectivity in ad-hoc networks with selfish nodes |
| 12:50 - 13:20 | Costis Georgiou (Toronto) Integrality gaps of 2-o(1) for vertex cover SDPs in the Lovasz-Schrijver hierarchy |
| 13:20 - 13:50 | Vangelis Markakis (CWI) New Algorithms for Approximate Nash Equilibria in Bimatrix Games |
| 13:50 - 15:30 | Lunch break - Free time |
| 15:30 - 16:00 | Aris Pagourtzis (NTUA) Randomized and Approximation Algorithms for Blue-Red Matching |
| 16:00 - 16:30 | David Richerby (UoA) Graph searching in a crime wave |
| 16:30 - 17:00 | Elias Tsigaridas (INRIA-LORIA Lorraine) On the complexity of real solving bivariate polynomial systems |
| 17:00 - 17:30 | Giorgos Christodoulou (Max-Planck) Mechanism Design for fractional scheduling on unrelated machines |
| 17:30 - 17:50 | Coffee break |
| 17:50 - 18:20 | George Kollios (Boston) Proof-Infused Streams: Enabling Authentication of Sliding Window Queries On Streams |
| 18:20 - 18:50 | Orestis Telelis (U d' Evry) Selfish Data Replication on Clustered Network Hierarchies |
| 18:60 - 19:20 | Dimitris Michail (Max-Planck-Institute fur Informatik) Approximate Cycle Bases |
| 19:20 - 19:50 | Maria Liazi (UoA) The densest k-subgraph problem on chordal graphs |