| Approximation and hardness for token swapping T Miltzow, L Narins, Y Okamoto, G Rote, A Thomas, T Uno arXiv preprint arXiv:1602.05150, 2016 | 76 | 2016 |
| The complexity of recognizing unique sink orientations B Gärtner, A Thomas 32nd Symposium on Theoretical Aspects of Computer Science (STACS 2015) 30 …, 2015 | 17 | 2015 |
| Exponential lower bounds for history-based simplex pivot rules on abstract cubes A Thomas arXiv preprint arXiv:1706.09380, 2017 | 6 | 2017 |
| Pure Nash equilibria in graphical games and treewidth A Thomas, J van Leeuwen Algorithmica 71, 581-604, 2015 | 6 | 2015 |
| The niceness of unique sink orientations B Gärtner, A Thomas arXiv preprint arXiv:1606.07709, 2016 | 5 | 2016 |
| Advertising network formation based on stochastic diffusion search and market equilibria N Salamanos, S Lopatatzidis, M Vazirgiannis, A Thomas Proceedings of the 28th ACM International Conference on Design of …, 2010 | 5 | 2010 |
| Deterministic algorithms for unique sink orientations of grids L Barba, M Milatz, J Nummenpalo, A Thomas International Computing and Combinatorics Conference, 357-369, 2016 | 4 | 2016 |
| Unique sink orientations: complexity, structure and algorithms A Thomas ETH Zurich, 2017 | 3 | 2017 |
| Treewidth and pure Nash equilibria A Thomas, J van Leeuwen International Symposium on Parameterized and Exact Computation, 348-360, 2013 | 2 | 2013 |
| Tight exact and approximate algorithmic results on token swapping T Miltzow, L Narins, Y Okamoto, G Rote, A Thomas, T Uno Preprint, 2016 | 1 | 2016 |
| Games on Graphs-The Complexity of Pure Nash Equilibria A Thomas Technical Report UU-CS-2011-024, Dept. of Information and Computing Sciences …, 2011 | 1 | 2011 |
| The Complexity of Optimization on Grids L Barba, M Milatz, J Nummenpalo, X Sun, A Thomas, J Zhang, Z Zhang Algorithmica 81, 3494-3518, 2019 | | 2019 |
| Optimization Problems: Refinements A Thomas | | |
Yoshio OkamotoUniversity of Electro-CommunicationsVerified email at uec.ac.jp
