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.
SIAM journal on computing (Print) Distributed Edge Coloring in Time Polylogarithmic in Δ
ACM Symposium on Principles of Distributed Computing (PODC)
The Distributed Complexity Landscape on Trees Depends on the Knowledge About the Network Size
Distributed Computing Content-oblivious leader election on rings
Innovations in Graph Theory Diameter of the inversion graph
Theoretical Computer Science Pseudorandom generators for sliding-window algorithms
