Thomas Dueholm Hansen
According to our database1,
Thomas Dueholm Hansen
authored at least 26 papers
between 2008 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2019
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
2018
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
2017
Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017
Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017
2016
Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016
2015
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015
2014
Errata for: A subexponential lower bound for the Random Facet algorithm for Parity Games.
CoRR, 2014
CoRR, 2014
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
2013
Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor.
J. ACM, 2013
Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013
The Complexity of Interior Point Methods for Solving Discounted Turn-Based Stochastic Games.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013
2011
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
2010
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010
2009
Proceedings of the Combinatorial Optimization and Applications, 2009
2008
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008