In our highly interdependent world, graph problems are at the algorithmic heart of many computational challenges. One focus of this research area is to explore and harness the ultimate limits of algorithmic techniques for solving hard computational problems, particularly on graphs. Pushing forward the theoretical foundations in this area will allow us to reap the rewards in practice many times over. On the other hand, the hardness of certain computational problems also forms the basis of cryptography as we know it today.
SIAM Journal on Discrete Mathematics From Chinese Postman to Salesman and Beyond II: Inapproximability and Parameterized Complexity
Advances in Cryptology (CRYPTO) Chosen Ciphertext Secure Pseudorandom Codes in the Standard Model
Advances in Cryptology (CRYPTO) Lattice-Based Updatable Public-Key Encryption for Group Messaging
MCU 2026 Embedding arbitrary Boolean circuits into fungal automata with arbitrary update sequences
Privacy Enhancing Technologies Symposium (PETS) When Threshold Meets Anamorphic Signatures: What is Possible and What is Not!
