Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Torgny Andersson
Robert J. Zomer
Zvi Artstein
Scott A. Starks
Sam Li-Sheng Chen
Ananya Gangopadhyay
Hikaru Fujisaki
Michael Terry
Zhihao Li
Radu Timofte
Home
/
Author
/
SPYROS KONTOGIANNIS
Author Info
Open Visualization
Name
Affiliation
Papers
SPYROS KONTOGIANNIS
Research Academic Computer Technology Institute, Riga Feraiou, Patras, Greece and Department of Computer Science, University of Ioannina, Ioannina, Greece
38
Collaborators
Citations
PageRank
30
259
28.04
Referers
Referees
References
381
306
348
Search Limit
100
381
Publications (38 rows)
Collaborators (30 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
An Axiomatic Approach to Time-Dependent Shortest Path Oracles
0
0.34
2022
Incentivizing Truthfulness in Crowdsourced Parking Ecosystems
1
0.36
2021
Time-Dependent Alternative Route Planning: Theory And Practice
0
0.34
2021
Time-Dependent Alternative Route Planning.
0
0.34
2020
Exploiting Amorphous Data Parallelism to Speed-Up Massive Time-Dependent Shortest-Path Computations.
0
0.34
2019
Eco-aware vehicle routing in urban environments
0
0.34
2017
Multimodal route and tour planning in urban environments
0
0.34
2017
Improved Oracles for Time-Dependent Road Networks.
0
0.34
2017
A Cloud-Based Time-Dependent Routing Service.
0
0.34
2016
Hierarchical Time-Dependent Oracles.
0
0.34
2016
Engineering Oracles for Time-Dependent Road Networks.
1
0.35
2016
Analysis and Experimental Evaluation of Time-Dependent Distance Oracles.
4
0.42
2015
Preface to Special Issue on Algorithmic Game Theory.
0
0.34
2013
Distance Oracles for Time-Dependent Networks.
11
0.67
2013
Frontmatter, Table of Contents, Preface, Workshop Organization.
0
0.34
2011
Approximability of symmetric bimatrix games and related experiments
4
0.47
2011
Exploiting concavity in bimatrix games: new polynomially tractable subclasses
6
0.53
2010
Algorithmic Game Theory - Third International Symposium, SAGT 2010, Athens, Greece, October 18-20, 2010. Proceedings
27
1.83
2010
Well Supported Approximate Equilibria in Bimatrix Games
22
0.97
2010
Preface
0
0.34
2009
Recent Advances in Approximability of Bimatrix Nash.
0
0.34
2009
Robust Line Planning under Unknown Incentives and Elasticity of Frequencies
2
0.41
2008
Equilibrium Points in Fear of Correlated Threats
4
0.61
2008
Well supported approximate equilibria in bimatrix games: a graph theoretic approach
4
0.54
2007
On the support size of stable strategies in random games
1
0.46
2007
Efficient algorithms for constant well supported approximate equilibria in bimatrix games
16
1.59
2007
Probabilistic techniques in algorithmic game theory
0
0.34
2007
Polynomial algorithms for approximating Nash equilibria of bimatrix games
31
2.39
2006
Internet and Network Economics, Second International Workshop, WINE 2006, Patras, Greece, December 15-17, 2006, Proceedings
28
4.06
2006
Atomic selfish routing in networks: a survey
13
0.70
2005
Counting Stable Strategies in Random Evolutionary Games
1
0.42
2005
Evolutionary games: an algorithmic view
0
0.34
2005
The contribution of game theory to complex systems
2
0.39
2005
Selfish unsplittable flows
68
4.20
2004
Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines
1
0.35
2002
Robust Parallel Computations through Randomization
5
0.42
2000
“Dynamic-fault-prone BSP”: a paradigm for robust computations in changing environments
3
0.41
1998
Efficient computations on fault-prone BSP machines
4
0.44
1997
1