Schmid, Stefan, Jakub Svoboda, and Michelle X Yeo. “Weighted Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation.”https://doi.org/10.1016/j.tcs.2023.114353__Theoretical Computer Science. Elsevier, 2024.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, Dan-Adrian, Faith Ellen, and Joel Rybicki. “Wait-Free Approximate Agreement on Graphs.”https://doi.org/10.1016/j.tcs.2023.113733__Theoretical Computer Science. Elsevier, 2023.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, Ilaria, Anna Giordano Bruno, and Nicolò Zava. “Weakly Weighted Generalised Quasi-Metric Spaces and Semilattices.”https://doi.org/10.1016/j.tcs.2023.114129__Theoretical Computer Science. Elsevier, 2023.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, Tatjana, Claudia Igler, Ali Sezgin, Thomas A Henzinger, and Calin C Guet. “Long Lived Transients in Gene Regulation.”https://doi.org/10.1016/j.tcs.2021.05.023__Theoretical Computer Science. Elsevier, 2021.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, Bapi, Ivan Walulya, and Philippas Tsigas. “Concurrent Linearizable Nearest Neighbour Search in LockFree-KD-Tree.”https://doi.org/10.1016/j.tcs.2021.06.041__Theoretical Computer Science. Elsevier, 2021.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, Sayan, Monika H Henzinger, and Stefan Neumann. “New Amortized Cell-Probe Lower Bounds for Dynamic Problems.”https://doi.org/10.1016/j.tcs.2019.01.043__Theoretical Computer Science. Elsevier, 2019.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, Monika H, and Veronika Loitzenbauer. “Truthful Unit-Demand Auctions with Budgets Revisited.”https://doi.org/10.1016/j.tcs.2015.01.033__Theoretical Computer Science. Elsevier, 2015.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, Ranita, and Partha Bhowmick. “From Prima Quadraginta Octant to Lattice Sphere through Primitive Integer Operations.”https://doi.org/10.1016/j.tcs.2015.11.018__Theoretical Computer Science. Elsevier, 2015.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, Ranita, and Partha Bhowmick. “On Different Topological Classes of Spherical Geodesic Paths and Circles InZ3.”https://doi.org/10.1016/j.tcs.2015.09.003__Theoretical Computer Science. Elsevier, 2015.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, Paul, Monika H Henzinger, and Ingmar Weber. “Bidder Optimal Assignments for General Utilities.”https://doi.org/10.1016/j.tcs.2013.01.030__Theoretical Computer Science. Elsevier, 2013.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, Jean, Pierre Schobbens, and Thomas A Henzinger. “Axioms for Real-Time Logics.”https://doi.org/10.1016/S0304-3975(00)00308-X__Theoretical Computer Science. Elsevier, 2002.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, Thomas A, and Peter Kopke. “Discrete-Time Control for Rectangular Hybrid Automata.”https://doi.org/10.1016/S0304-3975(99)00038-9__Theoretical Computer Science. Elsevier, 1999.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, Rajeev, Costas Courcoubetis, Nicolas Halbwachs, Thomas A Henzinger, Pei Ho, Xavier Nicollin, Alfredo Olivero, Joseph Sifakis, and Sergio Yovine. “The Algorithmic Analysis of Hybrid Systems.”https://doi.org/10.1016/0304-3975(94)00202-T__Theoretical Computer Science. Elsevier, 1995.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, Herbert, Leonidas Guibas, János Pach, Richard Pollack, Raimund Seidel, and Micha Sharir. “Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms.”https://doi.org/10.1016/0304-3975(92)90319-B__Theoretical Computer Science. Elsevier, 1992.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, Bernard, Herbert Edelsbrunner, Leonidas Guibas, and Micha Sharir. “A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications.”https://doi.org/10.1016/0304-3975(91)90261-Y__Theoretical Computer Science. Elsevier, 1991.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, Herbert, Günter Rote, and Emo Welzl. “Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.”https://doi.org/10.1016/0304-3975(89)90133-3__Theoretical Computer Science. Elsevier, 1989.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, Herbert. “Finding Transversals for Sets of Simple Geometric-Figures.”https://doi.org/10.1016/0304-3975(85)90005-2__Theoretical Computer Science. Elsevier, 1985.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, Herbert, and Hermann Maurer. “A Space-Optimal Solution of General Region Location.”https://doi.org/10.1016/0304-3975(81)90103-1__Theoretical Computer Science. Elsevier, 1981.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