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.
USENIX-Security
USENIX SecurityUSENIX Security
USENIX-Security
USENIX Security Symposium 2023USENIX Security Symposium 2023
UNSPECIFIED
IEEE Conference on Secure and Trustworthy Machine Learning (SaTML)IEEE SaTML
AAAI
AAAI 2023AAAI 2023
SODA
ACM-SIAM Symposium on Discrete Algorithms (SODA 2023)ACM-SIAM Symposium on Discrete Algorithms (SODA 2023)
SODA
ACM-SIAM Symposium on Discrete Algorithms (SODA 2023)ACM-SIAM Symposium on Discrete Algorithms (SODA 2023)
