Ralph Keusch

According to our database, Ralph Keusch authored at least 10 papers between 2014 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

A solution to the 1-2-3 conjecture.

Ralph Keusch

J. Comb. Theory B, 2024

2023

Vertex-Coloring Graphs with 4-Edge-Weightings.

Ralph Keusch

Comb., June, 2023

2019

Geometric inhomogeneous random graphs.

Karl Bringmann, Ralph Keusch, Johannes Lengler

Theor. Comput. Sci., 2019

2018

A New Upper Bound on the Game Chromatic Index of Graphs.

Ralph Keusch

Electron. J. Comb., 2018

2017

Greedy Routing and the Algorithmic Small-World Phenomenon.

Karl Bringmann, Ralph Keusch, Johannes Lengler, Yannic Maus, Anisur Rahaman Molla

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Sampling Geometric Inhomogeneous Random Graphs in Linear Time.

Karl Bringmann, Ralph Keusch, Johannes Lengler

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016

Colorability Saturation Games.

Ralph Keusch

CoRR, 2016

Greedy Routing and the Algorithmic Small-World Phenomenom.

Karl Bringmann, Ralph Keusch, Johannes Lengler, Yannic Maus, Anisur Rahaman Molla

CoRR, 2016

Average Distance in a General Class of Scale-Free Networks with Underlying Geometry.

Karl Bringmann, Ralph Keusch, Johannes Lengler

CoRR, 2016

2014

The Game Chromatic Number of Dense Random Graphs.

Ralph Keusch, Angelika Steger

Electron. J. Comb., 2014