K. Hanauer, M. H. Henzinger, and Q. C. Hua, “Fully dynamic four-vertex subgraph counting,” in 1st Symposium on Algorithmic Foundations of Dynamic Networks, Virtual, 2022, vol. 221.
LibreCat: https://research-explorer.ista.ac.at/record/11812
DOI: 10.4230/LIPIcs.SAND.2022.18
arXiv: 2106.15524

K. Hanauer, M. H. Henzinger, and C. Schulz, “Recent advances in fully dynamic graph algorithms,” in 1st Symposium on Algorithmic Foundations of Dynamic Networks, Virtual, 2022, vol. 221.
LibreCat: https://research-explorer.ista.ac.at/record/11808
DOI: 10.4230/LIPIcs.SAND.2022.1
arXiv: 2102.11169

M. Wirth, “Kac regularity and domination of quadratic forms,” Advances in Operator Theory, vol. 7, no. 3. Springer Nature, 2022.
LibreCat: https://research-explorer.ista.ac.at/record/11916
DOI: 10.1007/s43036-022-00199-w

M. H. Henzinger, A. Lincoln, and B. Saha, “The complexity of average-case dynamic subgraph counting,” in 33rd Annual ACM-SIAM Symposium on Discrete Algorithms, Alexandria, VA, United States, 2022, pp. 459–498.
LibreCat: https://research-explorer.ista.ac.at/record/11918
DOI: 10.1137/1.9781611977073.23

M. H. Henzinger, A. Noe, and C. Schulz, “Practical fully dynamic minimum cut algorithms,” in 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments, Alexandria, VA, United States, 2022, pp. 13–26.
LibreCat: https://research-explorer.ista.ac.at/record/11930
DOI: 10.1137/1.9781611977042.2
arXiv: 2101.05033

M. Traxler et al., “Acridinefunctionalized covalent organic frameworks (COFs) as photocatalysts for metallaphotocatalytic CN crosscoupling,” Angewandte Chemie International Edition, vol. 61, no. 21. Wiley, 2022.
LibreCat: https://research-explorer.ista.ac.at/record/11955
DOI: 10.1002/anie.202117738
PMID: 35188714

A. Krokhin and J. Oprsal, “An invitation to the promise constraint satisfaction problem,” ACM SIGLOG News, vol. 9, no. 3. Association for Computing Machinery, pp. 30–59, 2022.
LibreCat: https://research-explorer.ista.ac.at/record/11991
DOI: 10.1145/3559736.3559740
arXiv: 2208.13538

J. A. Palacci, “A soft active matter that can climb walls,” Science, vol. 377, no. 6607. American Association for the Advancement of Science, pp. 710–711, 2022.
LibreCat: https://research-explorer.ista.ac.at/record/11996
DOI: 10.1126/science.adc9202
PMID: 35951689 

A. Brunnbauer et al., “Latent imagination facilitates zero-shot transfer in autonomous racing,” in 2022 International Conference on Robotics and Automation, Philadelphia, PA, United States, 2022, pp. 7513–7520.
LibreCat: https://research-explorer.ista.ac.at/record/12010
DOI: 10.1109/ICRA46639.2022.9811650
arXiv: 2103.04909

B. B. GOSWAMI, S.-I. An, and R. Murtugudde, “Role of the Tibetan plateau glaciers in the Asian summer monsoon,” Climatic Change, vol. 173, no. 3–4. Springer Nature, 2022.
LibreCat: https://research-explorer.ista.ac.at/record/12007
DOI: 10.1007/s10584-022-03426-8

Y. Zhang, S. Jaggi, M. Langberg, and A. D. Sarwate, “The capacity of causal adversarial channels,” in 2022 IEEE International Symposium on Information Theory, Espoo, Finland, 2022, vol. 2022, pp. 2523–2528.
LibreCat: https://research-explorer.ista.ac.at/record/12011
DOI: 10.1109/ISIT50566.2022.9834709
arXiv: 2205.06708

A. K. Yadav, M. Alimohammadi, Y. Zhang, A. J. Budkuley, and S. Jaggi, “New results on AVCs with omniscient and myopic adversaries,” in 2022 IEEE International Symposium on Information Theory, Espoo, Finland, 2022, vol. 2022, pp. 2535–2540.
LibreCat: https://research-explorer.ista.ac.at/record/12017
DOI: 10.1109/ISIT50566.2022.9834632

P. Joshi, A. Purkayastha, Y. Zhang, A. J. Budkuley, and S. Jaggi, “On the capacity of additive AVCs with feedback,” in 2022 IEEE International Symposium on Information Theory, Espoo, Finland, 2022, vol. 2022, pp. 504–509.
LibreCat: https://research-explorer.ista.ac.at/record/12013
DOI: 10.1109/ISIT50566.2022.9834850

D. Fathollahi and M. Mondelli, “Polar coded computing: The role of the scaling exponent,” in 2022 IEEE International Symposium on Information Theory, Espoo, Finland, 2022, vol. 2022, pp. 2154–2159.
LibreCat: https://research-explorer.ista.ac.at/record/12016
DOI: 10.1109/ISIT50566.2022.9834712
arXiv: 2201.10082

S. Torkamani, J. B. Ebrahimi, P. Sadeghi, R. G. L. D’Oliveira, and M. Médard, “Heterogeneous differential privacy via graphs,” in 2022 IEEE International Symposium on Information Theory, Espoo, Finland, 2022, vol. 2022, pp. 1623–1628.
LibreCat: https://research-explorer.ista.ac.at/record/12012
DOI: 10.1109/ISIT50566.2022.9834711
arXiv: 2203.15429

Y. Zhang and S. Vatedka, “Lower bounds on list decoding capacity using error exponents,” in 2022 IEEE International Symposium on Information Theory, Espoo, Finland, 2022, vol. 2022, pp. 1324–1329.
LibreCat: https://research-explorer.ista.ac.at/record/12018
DOI: 10.1109/ISIT50566.2022.9834815

Y. Zhang and S. Vatedka, “Lower bounds for multiple packing,” in 2022 IEEE International Symposium on Information Theory, Espoo, Finland, 2022, vol. 2022, pp. 3085–3090.
LibreCat: https://research-explorer.ista.ac.at/record/12015
DOI: 10.1109/ISIT50566.2022.9834443

Y. Zhang and S. Vatedka, “List-decodability of Poisson Point Processes,” in 2022 IEEE International Symposium on Information Theory, Espoo, Finland, 2022, vol. 2022, pp. 2559–2564.
LibreCat: https://research-explorer.ista.ac.at/record/12014
DOI: 10.1109/ISIT50566.2022.9834512

N. Polyanskii and Y. Zhang, “List-decodable zero-rate codes for the Z-channel,” in 2022 IEEE International Symposium on Information Theory, Espoo, Finland, 2022, vol. 2022, pp. 2553–2558.
LibreCat: https://research-explorer.ista.ac.at/record/12019
DOI: 10.1109/ISIT50566.2022.9834829

A. L. Shute, “Existence and density problems in Diophantine geometry: From norm forms to Campana points,” Institute of Science and Technology Austria, 2022.
LibreCat: https://research-explorer.ista.ac.at/record/12072
DOI: 10.15479/at:ista:12072