Schmid, S., Svoboda, J., &; Yeo, M. X. (2024). Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2023.114353 
LibreCat: https://research-explorer.ista.ac.at/record/14820
DOI: 10.1016/j.tcs.2023.114353

Alistarh, D.-A., Ellen, F., &; Rybicki, J. (2023). Wait-free approximate agreement on graphs. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2023.113733 
LibreCat: https://research-explorer.ista.ac.at/record/12566
DOI: 10.1016/j.tcs.2023.113733
WoS: 000934262700001

Castellano, I., Giordano Bruno, A., &; Zava, N. (2023). Weakly weighted generalised quasi-metric spaces and semilattices. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2023.114129 
LibreCat: https://research-explorer.ista.ac.at/record/14362
DOI: 10.1016/j.tcs.2023.114129
WoS: 001076934000001
arXiv: 2212.08424

Petrov, T., Igler, C., Sezgin, A., Henzinger, T. A., &; Guet, C. C. (2021). Long lived transients in gene regulation. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2021.05.023 
LibreCat: https://research-explorer.ista.ac.at/record/9647
DOI: 10.1016/j.tcs.2021.05.023
WoS: 000710180500002

Chatterjee, B., Walulya, I., &; Tsigas, P. (2021). Concurrent linearizable nearest neighbour search in LockFree-kD-tree. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2021.06.041 
LibreCat: https://research-explorer.ista.ac.at/record/9827
DOI: 10.1016/j.tcs.2021.06.041
WoS: 000694718900004

Bhattacharya, S., Henzinger, M. H., &; Neumann, S. (2019). New amortized cell-probe lower bounds for dynamic problems. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2019.01.043 
LibreCat: https://research-explorer.ista.ac.at/record/11898
DOI: 10.1016/j.tcs.2019.01.043
arXiv: 1902.02304

Henzinger, M. H., &; Loitzenbauer, V. (2015). Truthful unit-demand auctions with budgets revisited. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2015.01.033 
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. Elsevier.https://doi.org/10.1016/j.tcs.2015.11.018 
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. Elsevier.https://doi.org/10.1016/j.tcs.2015.09.003 
LibreCat: https://research-explorer.ista.ac.at/record/5807
DOI: 10.1016/j.tcs.2015.09.003

Dütting, P., Henzinger, M. H., &; Weber, I. (2013). Bidder optimal assignments for general utilities. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2013.01.030 
LibreCat: https://research-explorer.ista.ac.at/record/11902
DOI: 10.1016/j.tcs.2013.01.030

Raskin, J., Schobbens, P., &; Henzinger, T. A. (2002). Axioms for real-time logics. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/S0304-3975(00)00308-X 
LibreCat: https://research-explorer.ista.ac.at/record/4407
DOI: 10.1016/S0304-3975(00)00308-X

Henzinger, T. A., &; Kopke, P. (1999). Discrete-time control for rectangular hybrid automata. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/S0304-3975(99)00038-9 
LibreCat: https://research-explorer.ista.ac.at/record/4442
DOI: 10.1016/S0304-3975(99)00038-9

Alur, R., Courcoubetis, C., Halbwachs, N., Henzinger, T. A., Ho, P., Nicollin, X.,https://doi.org/10.1016/0304-3975(94)00202-T__Yovine, S. (1995). The algorithmic analysis of hybrid systems. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/0304-3975(94)00202-T 
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. Elsevier.https://doi.org/10.1016/0304-3975(92)90319-B 
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. Elsevier.https://doi.org/10.1016/0304-3975(91)90261-Y 
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. Elsevier.https://doi.org/10.1016/0304-3975(89)90133-3 
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. Elsevier.https://doi.org/10.1016/0304-3975(85)90005-2 
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. Elsevier.https://doi.org/10.1016/0304-3975(81)90103-1 
LibreCat: https://research-explorer.ista.ac.at/record/4133
DOI: 10.1016/0304-3975(81)90103-1