Orestis A. Telelis In greek: Ορέστης Α. Τελέλης Center for Algorithmic Game Theory Computer Science Department Aarhus University, Denmark

• October 2007 - September 2009: Researcher
  CAGT, Dept. of Computer Science, University of Aarhus, Denmark
• March 2007 - September 2007: Researcher
  IBISC, Universite D'Evry, Val d'Essonne France
• 2003 - 2006: Ph.D. Studies,
  Dept. of Informatics and Telecommunications University of Athens, Greece
  Thesis: "Set Covering and Network Design: Dynamic and Approximation Algorithms" (english abstract)
• 2001 - 2003: M.Sc. "Advanced Information Systems"
  Dept. of Informatics and Telecommunications University of Athens, Greece
  M.Sc. Thesis (in Greek)
• 1996-2000: Undergraduate Studies ("Ptychion")
  Dept. of Informatics and Telecommunications University of Athens, Greece

• Combinatorial Optimization (Approximation Algorithms, Network Optimization)
• Algorithmic Game Theory (Network Optimization with Selfish Agents)
• Data Structures and Complexity (Dynamic Graph Algorithms)
• Random Combinatorial Structures

• 2003-2005: IST-2001-33116 Project FLAGS
  "Foundational Aspects of Global Computing Systems"
  
• 2001-2003: IST-1999-10655 Project MISSION
  "Multi-Agent Integration of Shared Statistical Information over the Internet"
  
• 1998-2000: ESPRIT IV 24960 Project PARROT
  "Parralel Crew Rostering"
  

Publications

• Selfish Scheduling with Setup Times,
  Laurent Gourves, Jerome Monnot, Orestis Telelis
  Proceedings of the International Workshop on Internet and Network Economics (WINE) 2009,to appear.

• Improved Bounds for Facility Location Games with Fair Cost Allocation,
  Thomas Dueholm Hansen, O. A. Telelis
  Proceedings of the International Conference on Combinatorial Optimization and Applications (COCOA),
  Springer LNCS 5573, 2009, to appear (pdf)

• Probabilistic Models for the Steiner Tree Problem,
  Vangelis Th. Paschos, O. A. Telelis, Vassilis Zissimopoulos
  to appear in Networks, 2009. (pdf)

• On Pure and (approximate) Strong Equilibria of Facility Location Games
  Thomas Dueholm Hansen, Orestis A. Telelis
  Extended version, with additional results, arXiv:0809.4792

• On Pure and (approximate) Strong Equilibria of Facility Location Games
  Thomas Dueholm Hansen, Orestis A. Telelis
  Proceedings of the 4th International Workshop on Internet and Network Economics (WINE),
  Springer LNCS 5385, 2008: 490-497 (pdf)
  

• On Labeled Traveling Salesman Problems
  Basile Couetoux, Laurent Gourves, Jerome Monnot, Orestis A. Telelis
  Proceedings of the 19th International Conference on Algorithms and Computation (ISAAC),
  Springer LNCS 5369, 2008: 776-787 (pdf)

• On the Social Cost of Distributed Selfish Content Replication
  Gerasimos G. Pollatos, Orestis A. Telelis, Vassilis Zissimopoulos
  In Proceedings of the 7th IFIP-TC6 International Conference
  on Networking (Networking), Springer LNCS 4982, 2008: 195-206 (pdf).

• Dynamic Bottleneck Optimization for k-Edge and 2-Vertex Connectivity,
  Orestis A. Telelis, Vassilis Zissimopoulos
  Information Processing Letters, 106(6):251-257, 2008 (pdf)

• Steiner Forests on Stochastic Metric Graphs,
  V. Th. Paschos, O. A. Telelis, Vassilis Zissimopoulos
  Proceedings of The 1st International Conference on Combinatorial Optimization and Applications
  COCOA'07, Springer LNCS 4616, pp. 112-123, 2007 (pdf)

• Fully Dynamic Directed Minimum Spanning Trees,
  Gerasimos G. Pollatos, O. A. Telelis, Vassilis Zissimopoulos,
  Under Revision, 2006.

• Updating Directed Minimum Cost Spanning Trees
  Gerasimos G. Pollatos, O. A. Telelis, Vassilis Zissimopoulos
  Proceedings of the 5th Workshop on Experimental Algorithms,
  WEA'06, Springer, LNCS 4007, pp. 291-302, 2006. (pdf), (slides pdf)

• Distributed Selfish Replication
  N. Laoutaris, O. Telelis, V. Zissimopoulos, I. Stavrakakis
  IEEE Transactions on Parallel and Distributed Systems, 17(12), pages 1401-1413, 2006. (pdf)

• Dynamic Bottleneck Optimization for 2-Vertex and Strong Connectivity
  O. A. Telelis, V. Zissimopoulos
  Proceedings of the 2nd Balkan Conference in Informatics (Algorithms and Complexity), pp. 52-59, 2005.(pdf)

• Local Utility Aware Content Replication
  N. Laoutaris, O. Telelis, V. Zissimopoulos, I. Stavrakakis
  In Proceedings of the Fourth IFIP International Conference on Networking,
  NETWORKING'05, pp 455-468, 2005 (pdf)

• Absolute o(log m) Error in Approximating Random Set Covering: An Average Case Analysis
  O. A. Telelis, V. Zissimopoulos
  Information Processing Letters, vol. 94, issue 4, pages 171-177, 2005. (pdf)

• Dynamic Maintenance of Approximate Set Covers (abstract)
  O. Telelis, V. Zissimopoulos
  In Proceedings of the 20th European Conference on Operational Research, EURO XX, 2004.

• Guiding Constructive Search with Statistical Instance-Based Learning
  O. A. Telelis, P. Stamatopoulos
  International Journal on Artificial Intelligence Tools, Vol. 11, No. 2, 2002.(pdf)

• Heuristic Backbone Sampling for Maximum Satisfiability
  O. A. Telelis, P. Stamatopoulos
  Proceedings of the 2nd Hellenic Conference on Artificial Intelligence SETN-2002, pp. 129-139, Thessaloniki, 2002. (pdf)
  

• Combinatorial Optimization through Statistical Instance-Based Learning
  O. Telelis, P. Stamatopoulos
  Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence,
  ICTAI '01, pp. 203-209, Dallas, 2001. (pdf)

Manuscripts

• A Short Survey of Approximation Algorithms
  for Combinatorial Optimization Under Uncertainty (pdf, bib)
  A really good bibliographic compilation but not an exhaustive
  or highly structured description of results. Permanently in progresss.
• Notes on the Dynamic Connectivity Lower Bounds (pdf)
  
• Slides from a presentation on "Perfect Graphs" (in Greek). (ps)
  Related Stuff:
  • The Conjecture is Solved: The Strong Perfect Graph Theorem!!