default search action
Evangelia Pyrga
Person information
- affiliation: Max Planck Institute for Informatics, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [j4]Giorgos Christodoulou
, Kurt Mehlhorn, Evangelia Pyrga:
Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms. Algorithmica 69(3): 619-640 (2014) - [j3]George Christodoulou
Contention Resolution under Selfishness. Algorithmica 70(4): 675-693 (2014) - 2012
- [c9]Haris Aziz
Individual-based stability in hedonic games depending on the best or worst players. AAMAS 2012: 1311-1312 - [i2]George Christodoulou, Kurt Mehlhorn, Evangelia Pyrga:
Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms. CoRR abs/1202.2877 (2012) - 2011
- [c8]George Christodoulou
Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms. ESA 2011: 119-130 - [i1]Haris Aziz, Paul Harrenstein, Evangelia Pyrga:
Individual-based stability in hedonic games depending on the best or worst players. CoRR abs/1105.1824 (2011) - 2010
- [b1]Evangelia Pyrga:
Algorithmic game theory and networks. Saarland University, Germany, 2010 - [c7]George Christodoulou
Contention Resolution under Selfishness. ICALP (2) 2010: 430-441
2000 – 2009
- 2009
- [c6]Christine Chung
Stochastic Stability in Internet Router Congestion Games. SAGT 2009: 183-195 - [c5]George Christodoulou
On the Price of Stability for Undirected Network Design. WAOA 2009: 86-97 - 2008
- [c4]Evangelia Pyrga, Saurabh Ray:
New existence proofs epsilon-nets. SCG 2008: 199-207 - 2007
- [j2]Craig Gotsman
Cycle bases of graphs and sampled manifolds. Comput. Aided Geom. Des. 24(8-9): 464-480 (2007) - [j1]Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis
Efficient models for timetable information in public transportation systems. ACM J. Exp. Algorithmics 12: 2.4:1-2.4:39 (2007) - 2004
- [c3]Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis:
Experimental Comparison of Shortest Path Approaches for Timetable Information. ALENEX/ANALC 2004: 88-99 - [c2]Georgia Hadjicharalambous, Petrica C. Pop
The Railway Traveling Salesman Problem. ATMOS 2004: 264-275 - 2003
- [c1]Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis
Towards Realistic Modeling of Time-Table Information through the Time-Dependent Approach. ATMOS 2003: 85-103
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: