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.
ACM Symposium on Theory of Computing (STOC)
IEEE Symposium on Security and Privacy (S&P)
International Conference on the Theory and Application of Cryptographic Techniques (EuroCrypt)
