Bhattacharya S, Henzinger MH, Neumann S. 2019. New amortized cell-probe lower bounds for dynamic problems. Theoretical Computer Science. 779, 72–87.
LibreCat: https://research-explorer.ista.ac.at/record/11898
DOI: 10.1016/j.tcs.2019.01.043
arXiv: 1902.02304

Henzinger MH, Loitzenbauer V. 2015. Truthful unit-demand auctions with budgets revisited. Theoretical Computer Science. 573, 1–15.
LibreCat: https://research-explorer.ista.ac.at/record/11901
DOI: 10.1016/j.tcs.2015.01.033

Biswas R, Bhowmick P. 2015. From prima quadraginta octant to lattice sphere through primitive integer operations. Theoretical Computer Science. 624(4), 56–72.
LibreCat: https://research-explorer.ista.ac.at/record/5804
DOI: 10.1016/j.tcs.2015.11.018

Biswas R, Bhowmick P. 2015. On different topological classes of spherical geodesic paths and circles inZ3. Theoretical Computer Science. 605(11), 146–163.
LibreCat: https://research-explorer.ista.ac.at/record/5807
DOI: 10.1016/j.tcs.2015.09.003

Dütting P, Henzinger MH, Weber I. 2013. Bidder optimal assignments for general utilities. Theoretical Computer Science. 478(3), 22–32.
LibreCat: https://research-explorer.ista.ac.at/record/11902
DOI: 10.1016/j.tcs.2013.01.030

Raskin J, Schobbens P, Henzinger TA. 2002. Axioms for real-time logics. Theoretical Computer Science. 274(1–2), 151–182.
LibreCat: https://research-explorer.ista.ac.at/record/4407
DOI: 10.1016/S0304-3975(00)00308-X

Henzinger TA, Kopke P. 1999. Discrete-time control for rectangular hybrid automata. Theoretical Computer Science. 221(1–2), 369–392.
LibreCat: https://research-explorer.ista.ac.at/record/4442
DOI: 10.1016/S0304-3975(99)00038-9

Alur R, Courcoubetis C, Halbwachs N, Henzinger TA, Ho P, Nicollin X, Olivero A, Sifakis J, Yovine S. 1995. The algorithmic analysis of hybrid systems. Theoretical Computer Science. 138(1), 3–34.
LibreCat: https://research-explorer.ista.ac.at/record/4613
DOI: 10.1016/0304-3975(94)00202-T

Edelsbrunner H, Guibas L, Pach J, Pollack R, Seidel R, Sharir M. 1992. Arrangements of curves in the plane - topology, combinatorics, and algorithms. Theoretical Computer Science. 92(2), 319–336.
LibreCat: https://research-explorer.ista.ac.at/record/4047
DOI: 10.1016/0304-3975(92)90319-B

Chazelle B, Edelsbrunner H, Guibas L, Sharir M. 1991. A singly exponential stratification scheme for real semi-algebraic varieties and its applications. Theoretical Computer Science. 84(1), 77–105.
LibreCat: https://research-explorer.ista.ac.at/record/4052
DOI: 10.1016/0304-3975(91)90261-Y

Edelsbrunner H, Rote G, Welzl E. 1989. Testing the necklace condition for shortest tours and optimal factors in the plane. Theoretical Computer Science. 66(2), 157–180.
LibreCat: https://research-explorer.ista.ac.at/record/4084
DOI: 10.1016/0304-3975(89)90133-3

Edelsbrunner H. 1985. Finding Transversals for Sets of Simple Geometric-Figures. Theoretical Computer Science. 35(1), 55–69.
LibreCat: https://research-explorer.ista.ac.at/record/4116
DOI: 10.1016/0304-3975(85)90005-2

Edelsbrunner H, Maurer H. 1981. A space-optimal solution of general region location. Theoretical Computer Science. 16(3), 329–336.
LibreCat: https://research-explorer.ista.ac.at/record/4133
DOI: 10.1016/0304-3975(81)90103-1