Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
555 Publications
2022 | Journal Article | IST-REx-ID: 11662
Constant-time Dynamic (Δ +1)-Coloring
M.H. Henzinger, P. Peng, ACM Transactions on Algorithms 18 (2022).
View
| DOI
M.H. Henzinger, P. Peng, ACM Transactions on Algorithms 18 (2022).
2022 | Journal Article | IST-REx-ID: 11702 | 
The "New Synthesis"
N.H. Barton, Proceedings of the National Academy of Sciences of the United States of America 119 (2022).
[Published Version]
View
| Files available
| DOI
| PubMed | Europe PMC
N.H. Barton, Proceedings of the National Academy of Sciences of the United States of America 119 (2022).
2022 | Journal Article | IST-REx-ID: 11713 |
Quantifying heterologous gene expression during ectopic MazF production in Escherichia coli
N. Nikolic, M. Sauert, T.G. Albanese, I. Moll, BMC Research Notes 15 (2022).
[Published Version]
View
| Files available
| DOI
| PubMed | Europe PMC
N. Nikolic, M. Sauert, T.G. Albanese, I. Moll, BMC Research Notes 15 (2022).
2022 | Conference Paper | IST-REx-ID: 11812 |
Fully dynamic four-vertex subgraph counting
K. Hanauer, M.H. Henzinger, Q.C. Hua, in:, 1st Symposium on Algorithmic Foundations of Dynamic Networks, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
K. Hanauer, M.H. Henzinger, Q.C. Hua, in:, 1st Symposium on Algorithmic Foundations of Dynamic Networks, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
2022 | Conference Paper | IST-REx-ID: 11808 |
Recent advances in fully dynamic graph algorithms
K. Hanauer, M.H. Henzinger, C. Schulz, in:, 1st Symposium on Algorithmic Foundations of Dynamic Networks, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
K. Hanauer, M.H. Henzinger, C. Schulz, in:, 1st Symposium on Algorithmic Foundations of Dynamic Networks, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
2022 | Journal Article | IST-REx-ID: 11916 |
Kac regularity and domination of quadratic forms
M. Wirth, Advances in Operator Theory 7 (2022).
[Published Version]
View
| Files available
| DOI
M. Wirth, Advances in Operator Theory 7 (2022).
2022 | Conference Paper | IST-REx-ID: 11918
The complexity of average-case dynamic subgraph counting
M.H. Henzinger, A. Lincoln, B. Saha, in:, 33rd Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2022, pp. 459–498.
View
| DOI
M.H. Henzinger, A. Lincoln, B. Saha, in:, 33rd Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2022, pp. 459–498.
2022 | Conference Paper | IST-REx-ID: 11930 |
Practical fully dynamic minimum cut algorithms
M.H. Henzinger, A. Noe, C. Schulz, in:, 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2022, pp. 13–26.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
M.H. Henzinger, A. Noe, C. Schulz, in:, 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2022, pp. 13–26.
2022 | Journal Article | IST-REx-ID: 11955 |
Acridine‐functionalized covalent organic frameworks (COFs) as photocatalysts for metallaphotocatalytic C−N cross‐coupling
M. Traxler, S. Gisbertz, P. Pachfule, J. Schmidt, J. Roeser, S. Reischauer, J. Rabeah, B. Pieber, A. Thomas, Angewandte Chemie International Edition 61 (2022).
[Published Version]
View
| DOI
| Download Published Version (ext.)
| PubMed | Europe PMC
M. Traxler, S. Gisbertz, P. Pachfule, J. Schmidt, J. Roeser, S. Reischauer, J. Rabeah, B. Pieber, A. Thomas, Angewandte Chemie International Edition 61 (2022).
2022 | Journal Article | IST-REx-ID: 11991 |
An invitation to the promise constraint satisfaction problem
A. Krokhin, J. Opršal, ACM SIGLOG News 9 (2022) 30–59.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
A. Krokhin, J. Opršal, ACM SIGLOG News 9 (2022) 30–59.