Janosch Ruff

According to our database, Janosch Ruff authored at least 6 papers between 2023 and 2026.

Collaborative distances:

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

2026

On Distributed Colouring of Hyperbolic Random Graphs.

Yannic Maus, Janosch Ruff

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025

Robust Algorithms for Finding Cliques in Random Intersection Graphs via Sum-of-Squares.

Andreas-Nikolas Göbel, Janosch Ruff, Leon Schiller

CoRR, November, 2025

Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for Colouring.

Samuel Baguley, Yannic Maus, Janosch Ruff, George Skretas

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

Strategic Network Creation for Enabling Greedy Routing.

Julian Berger, Tobias Friedrich, Pascal Lenzner, Paraskevi Machaira, Janosch Ruff

Proceedings of the Thirty-Ninth AAAI Conference on Artificial Intelligence, 2025

2024

Run Time Bounds for Integer-Valued OneMax Functions.

Jonathan Gadea Harder, Timo Kötzing, Xiaoyue Li, Aishwarya Radhakrishnan, Janosch Ruff

Proceedings of the Genetic and Evolutionary Computation Conference, 2024

2023

On the Giant Component of Geometric Inhomogeneous Random Graphs.

Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Janosch Ruff, Ziena Zeif

Proceedings of the 31st Annual European Symposium on Algorithms, 2023