Thomas Dueholm Hansen

Cited by

	All	Since 2019
Citations	940	546
h-index	16	11
i10-index	22	13

120

2010201120122013201420152016201720182019202020212022202320246 14 27 32 47 34 55 79 82 71 96 97 93 106 83

Public access

View all

12 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Uri ZwickTel Aviv UniversityVerified email at tau.ac.il
Peter Bro MiltersenFormer Professor of Computer Science at Aarhus UniversityVerified email at cs.au.dk
Oliver FriedmannUniversity of MunichVerified email at ifi.lmu.de
Virginia Vassilevska WilliamsMITVerified email at mit.edu
Amir AbboudWeizmann Institute of ScienceVerified email at weizmann.ac.il
Haim KaplanSchool of Computer Science, Tel Aviv UniversityVerified email at post.tau.ac.il
Nikos ParotsidisGoogle ResearchVerified email at google.com
Giuseppe F. ItalianoProfessor of Computer Science, LUISS University, Rome, ItalyVerified email at luiss.it
Or ZamirTel Aviv UniversityVerified email at tauex.tau.ac.il
Shiri ChechikProfessor of Computer Science, Tel-Aviv UniversityVerified email at post.tau.ac.il
Richard Ryan WilliamsMITVerified email at mit.edu
Rasmus Ibsen-JensenLecturer, University of LiverpoolVerified email at liverpool.ac.uk
Vladimir GurvichRBS and RUTCOR, Rutgers University; Higher School of Economics, Moscow, ProfessorVerified email at hse.ru
Arturs BackursMicrosoft ResearchVerified email at microsoft.com
Kristoffer Arnsfelt HansenAssociate Professor, Department of Computer Science, Aarhus UniversityVerified email at cs.au.dk
Jakub Lackiresearch scientist, GoogleVerified email at google.com
Robert TarjanProfessor of Computer Science, Princeton UniversityVerified email at cs.princeton.edu
Bernd GärtnerProfessor of Computer Science, ETH ZurichVerified email at inf.ethz.ch
Pavel HubáčekCzech Academy of Sciences and Charles UniversityVerified email at iuuk.mff.cuni.cz
Mike PatersonEmeritus Professor of Computer Science, University of WarwickVerified email at warwick.ac.uk

Thomas Dueholm Hansen

Former Associate professor, University of Copenhagen

Verified email at di.ku.dk

Algorithms Optimization


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor TD Hansen, PB Miltersen, U Zwick Journal of the ACM (JACM) 60 (1), 1-16, 2013	175	2013
Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made A Abboud, TD Hansen, VV Williams, R Williams Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016	135	2016
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm O Friedmann, TD Hansen, U Zwick Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011	99	2011
Subtree isomorphism revisited A Abboud, A Backurs, TD Hansen, V Vassilevska Williams, O Zamir ACM Transactions on Algorithms (TALG) 14 (3), 1-23, 2018	58	2018
Faster k-SAT algorithms using biased-PPSZ TD Hansen, H Kaplan, O Zamir, U Zwick Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019	49	2019
An improved version of the random-facet pivoting rule for the simplex algorithm TD Hansen, U Zwick Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015	45	2015
Faster algorithms for computing maximal 2-connected subgraphs in sparse directed graphs S Chechik, TD Hansen, GF Italiano, V Loitzenbauer, N Parotsidis Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017	34	2017
Decremental single-source reachability and strongly connected components in O (m√ n) total update time S Chechik, TD Hansen, GF Italiano, J Łącki, N Parotsidis 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016	32	2016
Approximability and parameterized complexity of minmax values KA Hansen, TD Hansen, PB Miltersen, TB Sørensen Internet and Network Economics: 4th International Workshop, WINE 2008 …, 2008	32	2008
Worst-case analysis of strategy iteration and the simplex method TD Hansen Aarhus Universitet, Datalogisk Institut, 2012	31	2012
A faster algorithm for solving one-clock priced timed games TD Hansen, R Ibsen-Jensen, PB Miltersen International Conference on Concurrency Theory, 531-545, 2013	26	2013
Hollow heaps TD Hansen, H Kaplan, RE Tarjan, U Zwick ACM Transactions on Algorithms (TALG) 13 (3), 1-27, 2017	25	2017
ARRIVAL: next stop in CLS B Gärtner, TD Hansen, P Hubáček, K Král, H Mosaad, V Slívová arXiv preprint arXiv:1802.07702, 2018	24	2018
A subexponential lower bound for the random facet algorithm for parity games O Friedmann, TD Hansen, U Zwick Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete …, 2011	24	2011
Lower bounds for howard’s algorithm for finding minimum mean-cost cycles TD Hansen, U Zwick International Symposium on Algorithms and Computation, 415-426, 2010	24	2010
On acyclicity of games with cycles D Andersson, V Gurvich, TD Hansen Discrete Applied Mathematics 158 (10), 1049-1063, 2010	22	2010
Improved upper bounds for random-edge and random-jump on abstract cubes TD Hansen, M Paterson, U Zwick Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete …, 2014	16	2014
On pure and (approximate) strong equilibria of facility location games TD Hansen, OA Telelis International Workshop on Internet and Network Economics, 490-497, 2008	14	2008
Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles TD Hansen, H Kaplan, U Zwick Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete …, 2014	12	2014
Decremental data structures for connectivity and dominators in directed graphs L Georgiadis, TD Hansen, GF Italiano, S Krinninger, N Parotsidis arXiv preprint arXiv:1704.08235, 2017	11	2017

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors