Our story is about hardness of problems in P, but its roots begin with two algorithmic
approaches that have been developed to cope with NP-hard problems: approximation …

Among the most fundamental graph parameters is the Diameter, the largest distance
between any pair of vertices in a graph. Computing the Diameter of a graph with m edges …

We prove several tight results on the fine-grained complexity of approximating the diameter
of a graph. First, we prove that, for any ε> 0, assuming the Strong Exponential Time …

The min-distance between two nodes $ u, v $ is defined as the minimum of the distance from
$ v $ to $ u $ or from $ u $ to $ v $, and is a natural distance metric in DAGs. As with the …

In a weighed directed graph G=(V,E,ω) with m edges and n vertices, we are interested in its
basic graph parameters such as diameter, radius and eccentricities, under the nonstandard …

Computing the diameter of a graph, ie the largest distance, is a fundamental problem that is
central in fine-grained complexity. In undirected graphs, the Strong Exponential Time …

The min-diameter of a directed graph $ G $ is a measure of the largest distance between
nodes. It is equal to the maximum min-distance $ d_ {min}(u, v) $ across all pairs $ u, v\in V …

This thesis is about finding useful structures in a graph using fast algorithms, or showing that
no such fast algorithms exist using popular fine-grained hypotheses from the field of Fine …

Powered lower limb exoskeletons (LLEs) are innovative wearable robots that allow
independent walking in people with severe gait impairments, or even to augment lower limb …

The diameter of a graph is one of the most basic and fundamental attributes of a graph. It is
defined as the distance between the pair of vertices that is the farthest apart. The diameter of …