Hansen, T. D., Ibsen-Jensen, R. & Miltersen, P. B. (2013).
A Faster Algorithm for Solving One-Clock Priced Timed Games. In P. R. D*Argenio & H. Melgratti (Eds.),
CONCUR 2013 – Concurrency Theory: 24th International Conference, CONCUR 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings (pp. 531-545). Springer VS.
https://doi.org/10.1007/978-3-642-40184-8_37
Hansen, T. D. & Ibsen-Jensen, R. (2013).
The complexity of interior point methods for solving discounted turn-based stochastic games. In
The Nature of Computation, Logic, Algorithms, Applications: 9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013. Proceedings (pp. 252-262). Springer VS.
https://doi.org/10.1007/978-3-642-39053-1_29
Hansen, K. A., Komarath, B., Sarma M. N., J.
, Talebanfard, N. & Skyum, S. (2014).
Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth. In E. Csuhaj-Varjú, M. Dietzfelbinger & Z. Ésik (Eds.),
Mathematical Foundations of Computer Science 2014: 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II (pp. 336-347 ). Springer VS.
https://doi.org/10.1007/978-3-662-44465-8_29
Hansen, T. D., Kaplan, H., Tarjan, R. E. & Zwick, U. (2015).
Hollow Heaps. In M. M. Halldórsson, K. Iwama, N. Kobayashi & B. Speckmann (Eds.),
Automata, Languages, and Programming: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I (Vol. Part 1, pp. 689-700). Springer VS.
https://doi.org/10.1007/978-3-662-47672-7_56