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 Conference on Computer and Communications Security (CCS) A Qualitative Study on Ethics Perspectives in Cryptography Research
DISC International Symposium on Distributed Computing (DISC) Is a LOCAL algorithm computable?
DISC International Symposium on Distributed Computing (DISC) Generalizing LCL Complexity Gaps to Unbounded Degree via Monadic Second-Order Properties
International Symposium on Parameterized and Exact Computation (IPEC) Exploring Minimal Blocking Sets for Kernelization Lower Bounds for F-Minor Deletion
SIAM Journal on Discrete Mathematics From Chinese Postman to Salesman and Beyond II: Inapproximability and Parameterized Complexity
