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.

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.

M. Wirth, “Kac regularity and domination of quadratic forms,” Advances in Operator Theory, vol. 7, no. 3. Springer Nature, 2022.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

A. L. Shute, “Existence and density problems in Diophantine geometry: From norm forms to Campana points,” Institute of Science and Technology Austria, 2022.