Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation
S. Schmid, J. Svoboda, M.X. Yeo, Theoretical Computer Science 989 (2024).

Weakly weighted generalised quasi-metric spaces and semilattices
I. Castellano, A. Giordano Bruno, N. Zava, Theoretical Computer Science 977 (2023).

Wait-free approximate agreement on graphs
D.-A. Alistarh, F. Ellen, J. Rybicki, Theoretical Computer Science 948 (2023).

Long lived transients in gene regulation
T. Petrov, C. Igler, A. Sezgin, T.A. Henzinger, C.C. Guet, Theoretical Computer Science 893 (2021) 1–16.

Concurrent linearizable nearest neighbour search in LockFree-kD-tree
B. Chatterjee, I. Walulya, P. Tsigas, Theoretical Computer Science 886 (2021) 27–48.

Dynamic resource allocation games
G. Avni, T.A. Henzinger, O. Kupferman, Theoretical Computer Science 807 (2020) 42–55.

New amortized cell-probe lower bounds for dynamic problems
S. Bhattacharya, M. Henzinger, S. Neumann, Theoretical Computer Science 779 (2019) 72–87.

Truthful unit-demand auctions with budgets revisited
M. Henzinger, V. Loitzenbauer, Theoretical Computer Science 573 (2015) 1–15.

From prima quadraginta octant to lattice sphere through primitive integer operations
R. Biswas, P. Bhowmick, Theoretical Computer Science 624 (2015) 56–72.

On different topological classes of spherical geodesic paths and circles inZ3
R. Biswas, P. Bhowmick, Theoretical Computer Science 605 (2015) 146–163.

Alternating traps in Muller and parity games
A. Grinshpun, P. Phalitnonkiat, S. Rubin, A. Tarfulea, Theoretical Computer Science 521 (2014) 73–91.

Bidder optimal assignments for general utilities
P. Dütting, M. Henzinger, I. Weber, Theoretical Computer Science 478 (2013) 22–32.

Axioms for real-time logics
J. Raskin, P. Schobbens, T.A. Henzinger, Theoretical Computer Science 274 (2002) 151–182.

Discrete-time control for rectangular hybrid automata
T.A. Henzinger, P. Kopke, Theoretical Computer Science 221 (1999) 369–392.

The algorithmic analysis of hybrid systems
R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P. Ho, X. Nicollin, A. Olivero, J. Sifakis, S. Yovine, Theoretical Computer Science 138 (1995) 3–34.

Arrangements of curves in the plane - topology, combinatorics, and algorithms
H. Edelsbrunner, L. Guibas, J. Pach, R. Pollack, R. Seidel, M. Sharir, Theoretical Computer Science 92 (1992) 319–336.

A singly exponential stratification scheme for real semi-algebraic varieties and its applications
B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, Theoretical Computer Science 84 (1991) 77–105.

Testing the necklace condition for shortest tours and optimal factors in the plane
H. Edelsbrunner, G. Rote, E. Welzl, Theoretical Computer Science 66 (1989) 157–180.

Finding Transversals for Sets of Simple Geometric-Figures
H. Edelsbrunner, Theoretical Computer Science 35 (1985) 55–69.

A space-optimal solution of general region location
H. Edelsbrunner, H. Maurer, Theoretical Computer Science 16 (1981) 329–336.