96 citations · 376 across the 69 of their papers we have counts for
91 papers
Improved Approximate Distance Oracles: Bypassing the Thorup-Zwick Bound in Dense Graphs
Davide Bilò, Shiri Chechik, Keerti Choudhary +3
Despite extensive research on distance oracles, there are still large gaps between the best constructions for spanners and distance oracles. Notably, there exist sparse spanners wi…
On the Giant Component of Geometric Inhomogeneous Random Graphs
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann +2
In this paper we study the threshold model of \emph{geometric inhomogeneous random graphs} (GIRGs); a generative random graph model that is closely related to \emph{hyperbolic rand…
Analysis of the (1+1) EA on LeadingOnes with Constraints
Tobias Friedrich, Timo Kötzing, Aneta Neumann +2
Understanding how evolutionary algorithms perform on constrained problems has gained increasing attention in recent years. In this paper, we study how evolutionary algorithms optim…
Temporal Network Creation Games
Davide Bilò, Sarel Cohen, Tobias Friedrich +4
Most networks are not static objects, but instead they change over time. This observation has sparked rigorous research on temporal graphs within the last years. In temporal graphs…
Evolutionary Diversity Optimisation in Constructing Satisfying Assignments
Adel Nikfarjam, Ralf Rothenberger, Frank Neumann +1
Computing diverse solutions for a given problem, in particular evolutionary diversity optimisation (EDO), is a hot research topic in the evolutionary computation community. This pa…
Approximate Distance Sensitivity Oracles in Subquadratic Space
Davide Bilò, Shiri Chechik, Keerti Choudhary +4
An -edge fault-tolerant distance sensitive oracle (-DSO) with stretch is a data structure that preprocesses a given undirected, unweighted graph with vertice…