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.
554 Publications
2022 | Journal Article | IST-REx-ID: 11662
Henzinger, M. H., & Peng, P. (2022). Constant-time Dynamic (Δ +1)-Coloring. ACM Transactions on Algorithms. Association for Computing Machinery (ACM). https://doi.org/10.1145/3501403
View
| DOI
2022 | Journal Article | IST-REx-ID: 11702 | 
Barton, N. H. (2022). The “New Synthesis.” Proceedings of the National Academy of Sciences of the United States of America. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.2122147119
[Published Version]
View
| Files available
| DOI
| PubMed | Europe PMC
2022 | Journal Article | IST-REx-ID: 11713 |
Nikolic, N., Sauert, M., Albanese, T. G., & Moll, I. (2022). Quantifying heterologous gene expression during ectopic MazF production in Escherichia coli. BMC Research Notes. Springer Nature. https://doi.org/10.1186/s13104-022-06061-9
[Published Version]
View
| Files available
| DOI
| PubMed | Europe PMC
2022 | Conference Paper | IST-REx-ID: 11812 |
Hanauer, K., Henzinger, M. H., & Hua, Q. C. (2022). Fully dynamic four-vertex subgraph counting. In 1st Symposium on Algorithmic Foundations of Dynamic Networks (Vol. 221). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAND.2022.18
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2022 | Conference Paper | IST-REx-ID: 11808 |
Hanauer, K., Henzinger, M. H., & Schulz, C. (2022). Recent advances in fully dynamic graph algorithms. In 1st Symposium on Algorithmic Foundations of Dynamic Networks (Vol. 221). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAND.2022.1
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2022 | Journal Article | IST-REx-ID: 11916 |
Wirth, M. (2022). Kac regularity and domination of quadratic forms. Advances in Operator Theory. Springer Nature. https://doi.org/10.1007/s43036-022-00199-w
[Published Version]
View
| Files available
| DOI
2022 | Conference Paper | IST-REx-ID: 11918
Henzinger, M. H., Lincoln, A., & Saha, B. (2022). The complexity of average-case dynamic subgraph counting. In 33rd Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 459–498). Alexandria, VA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977073.23
View
| DOI
2022 | Conference Paper | IST-REx-ID: 11930 |
Henzinger, M. H., Noe, A., & Schulz, C. (2022). Practical fully dynamic minimum cut algorithms. In 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments (pp. 13–26). Alexandria, VA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977042.2
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2022 | Journal Article | IST-REx-ID: 11955 |
Traxler, M., Gisbertz, S., Pachfule, P., Schmidt, J., Roeser, J., Reischauer, S., … Thomas, A. (2022). Acridine‐functionalized covalent organic frameworks (COFs) as photocatalysts for metallaphotocatalytic C−N cross‐coupling. Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.202117738
[Published Version]
View
| DOI
| Download Published Version (ext.)
| PubMed | Europe PMC
2022 | Journal Article | IST-REx-ID: 11991 |
Krokhin, A., & Opršal, J. (2022). An invitation to the promise constraint satisfaction problem. ACM SIGLOG News. Association for Computing Machinery. https://doi.org/10.1145/3559736.3559740
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv