Christodoulou, G., K. Mehlhorn and E. Pyrga: Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms. In: Algorithms - ESA 2011 : 19th Annual European Symposium, (Eds.) Demetrescu, Camil; Halldórsson, Mangús M. Lecture Notes in Computer Science. Springer, Berlin (2011) 119-130.
doi: 10.1007/978-3-642-23719-5_11
url: http://dx.doi.org/10.1007/978-3-642-23719-5_11
localid: C1256428004B93B8-D203A9C35EF58BBAC12579A3004010FD-Becker2011
Pyrga, E.: Algorithmic Game Theory and Networks. Doktorarbeit, Universität des Saarlandes, Saarbrücken (2010).
localid: C1256428004B93B8-52F6ED55CD6BDF80C125783A003A69DE-PyrgaPhD2010
Christodoulou, G., K. Ligett and E. Pyrga: Contention Resolution under Selfishness. In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. II, (Eds.) Abramsky, Samson; Gavoille, Cyril; Kirchner, Claude; Meyer auf der Heide, Friedhelm; Spirakis, Paul. Lecture Notes in Computer Science. Springer, Berlin (2010) 430-441.
doi: 10.1007/978-3-642-14162-1_36
url: http://dx.doi.org/10.1007/978-3-642-14162-1_36
localid: C1256428004B93B8-30945EFEF69FAA0BC125781F0044245C-CPL2010
Christodoulou, G., C. Chung, K. Ligett, E. Pyrga and R. van Stee: On the price of stability for undirected network design. In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, (Eds.) Bampis, Evripidis; Jansen, Klaus. Lecture Notes in Computer Science. Springer, Berlin (2010) 86-97.
doi: 10.1007/978-3-642-12450-1_8
localid: C1256428004B93B8-15740B661D36E848C12577F40050BB78-CCLPS2009
Pyrga, E. and C. Chung: Stochastic Stability in Internet Router Congestion Games. In: Algorithmic Game Theory Second International Symposium, SAGT 2009, (Eds.) Mavronicolas, Marios; Papadoupoulou, Vicky G. Lecture Notes in Computer Science. Springer, Berlin (2009) 183-195.
doi: 10.1007/978-3-642-04645-2
url: http://www.springerlink.com/content/84q7k636h068v511/fulltext.pdf
localid: C1256428004B93B8-CC5EE47F8F1710FBC12576C7004D112A-Pyrga2009
Pyrga, E. and S. Ray: New existence Proofs for epsilon-nets. In: Proceedings of the Twenty-Fourth Annual Symposium on Computational Geometry (SCG'08), (Eds.) Teillaud, Monique; Welzl, Emo. ACM, New York, NY (2008) 199-207.
doi: 10.1145/1377676.1377708
url: http://portal.acm.org/citation.cfm?id=1377708
localid: C125756E0038A185-0147C7B47463E990C125755B003FEC0D-Pyrga2008
Gotsman, C., K. Kaligosi, K. Mehlhorn, D. Michail and E. Pyrga: Cycle Bases of Graphs and Sampled Manifolds. In: Computer Aided Geometric Design 24, 8/9, 464-480 (2007).
doi: 10.1016/j.cagd.2006.07.001
localid: C12573CC004A8E26-CE8DCB4C127284AAC125728E003EFD6F-GKMMP06
Pyrga, E., F. Schulz, D. Wagner and C. Zaroliagis: Efficient models for timetable information in public transportation systems. In: ACM Journal of Experimental Algorithmics 12, 2.4.1-2.4.39 (2007).
doi: 10.1145/1227161.1227166
localid: C12573CC004A8E26-11C670EE17289C83C1257355004DAEDB-Pyrga2007
Pyrga, E.: Shortest Paths in Time-Dependent Networks and their Applications. Universität des Saarlandes, Saarbrücken, Saarland (2005).
localid: C1256428004B93B8-634E44B0D3AA54F3C12570AE0044FCDA-PyrgaDipl05
http://edoc.mpg.de
The Max Planck Society does not take any responsibility for the content of this export.