The Game Chromatic Number of Dense Random Graphs. - Ralph Keusch; Angelika Steger (Electron. J. Comb., 2014)

Average Distance in a General Class of Scale-Free Networks with Underlying Geometry. - Karl Bringmann; Ralph Keusch; Johannes Lengler (CoRR, 2016)

Greedy Routing and the Algorithmic Small-World Phenomenom. - Karl Bringmann; Ralph Keusch; Johannes Lengler; Yannic Maus; Anisur Rahaman Molla (CoRR, 2016)

Colorability Saturation Games. - Ralph Keusch (CoRR, 2016)

Sampling Geometric Inhomogeneous Random Graphs in Linear Time. - Karl Bringmann; Ralph Keusch; Johannes Lengler (ESA, 2017)

A New Upper Bound on the Game Chromatic Index of Graphs. - Ralph Keusch (Electron. J. Comb., 2018)

Geometric inhomogeneous random graphs. - Karl Bringmann; Ralph Keusch; Johannes Lengler (Theor. Comput. Sci., 2019)

Greedy routing and the algorithmic small-world phenomenon. - Karl Bringmann; Ralph Keusch; Johannes Lengler; Yannic Maus; Anisur Rahaman Molla (J. Comput. Syst. Sci., 2022)

Vertex-Coloring Graphs with 4-Edge-Weightings. - Ralph Keusch (Comb., 2023)

A solution to the 1-2-3 conjecture. - Ralph Keusch (J. Comb. Theory B, 2024)