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 Security Symposium 2023USENIX Security Symposium 2023
USENIX-Security
USENIX SecurityUSENIX Security
USENIX
32nd USENIX Security Symposium32nd USENIX Security Symposium
Proceedings on Privacy Enhancing Technologies (PoPETs)
SP
Proceedings of the 44rd IEEE Symposium on Security and Privacy44rd IEEE Symposium on Security and Privacy
ICALP
International Colloquium on Automata, Languages and ProgrammingInternational Colloquium on Automata, Languages and Programming
