default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Dueholm Hansen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c24]Thomas Dueholm Hansen, Haim Kaplan, Or Zamir, Uri Zwick:
Faster k-SAT algorithms using biased-PPSZ. STOC 2019: 578-589- 2018
- [j4]Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir:
Subtree Isomorphism Revisited. ACM Trans. Algorithms 14(3): 27:1-27:23 (2018) - [c23]Bernd Gärtner, Thomas Dueholm Hansen, Pavel Hubácek
, Karel Král, Hagar Mosaad, Veronika Slívová:
ARRIVAL: Next Stop in CLS. ICALP 2018: 60:1-60:13 - [i14]Bernd Gärtner, Thomas Dueholm Hansen, Pavel Hubácek, Karel Král, Hagar Mosaad, Veronika Slívová:
ARRIVAL: Next Stop in CLS. CoRR abs/1802.07702 (2018) - 2017
- [j3]Thomas Dueholm Hansen, Haim Kaplan, Robert E. Tarjan, Uri Zwick:
Hollow Heaps. ACM Trans. Algorithms 13(3): 42:1-42:27 (2017) - [c22]Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, Nikos Parotsidis:
Decremental Data Structures for Connectivity and Dominators in Directed Graphs. ICALP 2017: 42:1-42:15 - [c21]Karl Bringmann, Thomas Dueholm Hansen, Sebastian Krinninger:
Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs. ICALP 2017: 124:1-124:16 - [c20]Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Veronika Loitzenbauer, Nikos Parotsidis:
Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. SODA 2017: 1900-1918 - [i13]Karl Bringmann, Thomas Dueholm Hansen, Sebastian Krinninger:
Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs. CoRR abs/1704.08122 (2017) - [i12]Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, Nikos Parotsidis:
Decremental Data Structures for Connectivity and Dominators in Directed Graphs. CoRR abs/1704.08235 (2017) - [i11]Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Veronika Loitzenbauer, Nikos Parotsidis:
Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. CoRR abs/1705.10709 (2017) - 2016
- [c19]Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Jakub Lacki, Nikos Parotsidis:
Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time. FOCS 2016: 315-324 - [c18]Thomas Dueholm Hansen, Uri Zwick:
Random-Edge Is Slower Than Random-Facet on Abstract Cubes. ICALP 2016: 51:1-51:14 - [c17]Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir:
Subtree Isomorphism Revisited. SODA 2016: 1256-1271 - [c16]Amir Abboud, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Ryan Williams:
Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made. STOC 2016: 375-388 - 2015
- [c15]Thomas Dueholm Hansen, Haim Kaplan, Robert Endre Tarjan, Uri Zwick:
Hollow Heaps. ICALP (1) 2015: 689-700 - [c14]Thomas Dueholm Hansen, Uri Zwick:
An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm. STOC 2015: 209-218 - [i10]Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir:
Subtree Isomorphism Revisited. CoRR abs/1510.04622 (2015) - [i9]Thomas Dueholm Hansen, Haim Kaplan, Robert E. Tarjan, Uri Zwick:
Hollow Heaps. CoRR abs/1510.06535 (2015) - [i8]Amir Abboud, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Ryan Williams:
Simulating Branching Programs with Edit Distance and Friends or: A Polylog Shaved is a Lower Bound Made. CoRR abs/1511.06022 (2015) - 2014
- [c13]Thomas Dueholm Hansen, Haim Kaplan, Uri Zwick:
Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles. SODA 2014: 847-860 - [c12]Thomas Dueholm Hansen, Mike Paterson, Uri Zwick:
Improved upper bounds for Random-Edge and Random-Jump on abstract cubes. SODA 2014: 874-881 - [i7]Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick:
Random-Facet and Random-Bland require subexponential time even for shortest paths. CoRR abs/1410.7530 (2014) - [i6]Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick:
Errata for: A subexponential lower bound for the Random Facet algorithm for Parity Games. CoRR abs/1410.7871 (2014) - 2013
- [j2]Thomas Dueholm Hansen, Peter Bro Miltersen, Uri Zwick:
Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor. J. ACM 60(1): 1:1-1:16 (2013) - [c11]Thomas Dueholm Hansen, Rasmus Ibsen-Jensen:
The Complexity of Interior Point Methods for Solving Discounted Turn-Based Stochastic Games. CiE 2013: 252-262 - [c10]Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen:
A Faster Algorithm for Solving One-Clock Priced Timed Games. CONCUR 2013: 531-545 - [i5]Thomas Dueholm Hansen, Rasmus Ibsen-Jensen:
The complexity of interior point methods for solving discounted turn-based stochastic games. CoRR abs/1304.1888 (2013) - 2012
- [i4]Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen:
A Faster Algorithm for Solving One-Clock Priced Timed Games. CoRR abs/1201.3498 (2012) - 2011
- [c9]Thomas Dueholm Hansen, Peter Bro Miltersen, Uri Zwick:
Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor. ICS 2011: 253-263 - [c8]Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick:
A subexponential lower bound for the Random Facet algorithm for Parity Games. SODA 2011: 202-216 - [c7]Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick:
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm. STOC 2011: 283-292 - 2010
- [j1]Daniel Andersson, Vladimir Gurvich, Thomas Dueholm Hansen:
On acyclicity of games with cycles. Discret. Appl. Math. 158(10): 1049-1063 (2010) - [c6]Thomas Dueholm Hansen, Uri Zwick:
Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles. ISAAC (1) 2010: 415-426 - [i3]Thomas Dueholm Hansen, Peter Bro Miltersen, Uri Zwick:
Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor. CoRR abs/1008.0530 (2010)
2000 – 2009
- 2009
- [c5]Daniel Andersson, Vladimir Gurvich, Thomas Dueholm Hansen:
On Acyclicity of Games with Cycles. AAIM 2009: 15-28 - [c4]Thomas Dueholm Hansen, Orestis Telelis:
Improved Bounds for Facility Location Games with Fair Cost Allocation. COCOA 2009: 174-185 - 2008
- [c3]Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen:
On Range of Skill. AAAI 2008: 277-282 - [c2]Thomas Dueholm Hansen, Orestis Telelis:
On Pure and (Approximate) Strong Equilibria of Facility Location Games. WINE 2008: 490-497 - [c1]Kristoffer Arnsfelt Hansen, Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen:
Approximability and Parameterized Complexity of Minmax Values. WINE 2008: 684-695 - [i2]Kristoffer Arnsfelt Hansen, Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen:
Approximability and parameterized complexity of minmax values. CoRR abs/0806.4344 (2008) - [i1]Thomas Dueholm Hansen, Orestis Telelis:
On Pure and (approximate) Strong Equilibria of Facility Location Games. CoRR abs/0809.4792 (2008)
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 2025-01-21 00:14 CET 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:
