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.
SP
45th IEEE Symposium on Security and Privacy45th IEEE Symposium on Security and Privacy
CCS
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security (CCS)ACM SIGSAC Conference on Computer and Communications Security (CCS)
ATVA
ATVA 2023 - International Symposium on Automated Technology for Verification and AnalysisATVA 2023
