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, Monika H., and Pan Peng. “Constant-Time Dynamic (Δ +1)-Coloring.” ACM Transactions on Algorithms, vol. 18, no. 2, 16, Association for Computing Machinery (ACM), 2022, doi:10.1145/3501403.
View
| DOI
2022 | Journal Article | IST-REx-ID: 11702 | 
Barton, Nicholas H. “The ‘New Synthesis.’” Proceedings of the National Academy of Sciences of the United States of America, vol. 119, no. 30, e2122147119, Proceedings of the National Academy of Sciences, 2022, doi:10.1073/pnas.2122147119.
[Published Version]
View
| Files available
| DOI
| PubMed | Europe PMC
2022 | Journal Article | IST-REx-ID: 11713 |
Nikolic, Nela, et al. “Quantifying Heterologous Gene Expression during Ectopic MazF Production in Escherichia Coli.” BMC Research Notes, vol. 15, 173, Springer Nature, 2022, doi:10.1186/s13104-022-06061-9.
[Published Version]
View
| Files available
| DOI
| PubMed | Europe PMC
2022 | Conference Paper | IST-REx-ID: 11812 |
Hanauer, Kathrin, et al. “Fully Dynamic Four-Vertex Subgraph Counting.” 1st Symposium on Algorithmic Foundations of Dynamic Networks, vol. 221, 18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.SAND.2022.18.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2022 | Conference Paper | IST-REx-ID: 11808 |
Hanauer, Kathrin, et al. “Recent Advances in Fully Dynamic Graph Algorithms.” 1st Symposium on Algorithmic Foundations of Dynamic Networks, vol. 221, 1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.SAND.2022.1.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2022 | Journal Article | IST-REx-ID: 11916 |
Wirth, Melchior. “Kac Regularity and Domination of Quadratic Forms.” Advances in Operator Theory, vol. 7, no. 3, 38, Springer Nature, 2022, doi:10.1007/s43036-022-00199-w.
[Published Version]
View
| Files available
| DOI
2022 | Conference Paper | IST-REx-ID: 11918
Henzinger, Monika H., et al. “The Complexity of Average-Case Dynamic Subgraph Counting.” 33rd Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2022, pp. 459–98, doi:10.1137/1.9781611977073.23.
View
| DOI
2022 | Conference Paper | IST-REx-ID: 11930 |
Henzinger, Monika H., et al. “Practical Fully Dynamic Minimum Cut Algorithms.” 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2022, pp. 13–26, doi:10.1137/1.9781611977042.2.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2022 | Journal Article | IST-REx-ID: 11955 |
Traxler, Michael, et al. “Acridine‐functionalized Covalent Organic Frameworks (COFs) as Photocatalysts for Metallaphotocatalytic C−N Cross‐coupling.” Angewandte Chemie International Edition, vol. 61, no. 21, e202117738, Wiley, 2022, doi:10.1002/anie.202117738.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| PubMed | Europe PMC
2022 | Journal Article | IST-REx-ID: 11991 |
Krokhin, Andrei, and Jakub Opršal. “An Invitation to the Promise Constraint Satisfaction Problem.” ACM SIGLOG News, vol. 9, no. 3, Association for Computing Machinery, 2022, pp. 30–59, doi:10.1145/3559736.3559740.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv