Add to ORKGWe study the following problem: for given integers $d,k$ and graph $G$, can we obtain a graph with diameter $d$ via at most $k$ edge deletions ? We determine the computational complexity of this and related problems for different values of $d$
Given a graph G = (V,E) and an integer D ≥ 1, we consider the problem of augmenting G by the smalles...
Full version of an IPEC'22 paperAn extremity is a vertex such that the removal of its closed neighbo...
We study the parameterized complexity of the $s$-Club Cluster Edge Deletion problem: Given a graph $...
We study the following problem: for given integers $d,k$ and graph $G$, can we obtain a graph with d...
AbstractFor given integers n and D, what is the minimum number of edges in a graph on n vertices wit...
We study the problem of augmenting a weighted graph by inserting edges of bounded total cost while m...
This paper is devoted to the fast and exact diameter computation in graphs with n vertices and m edg...
Abstract. We study the problem of augmenting a weighted graph by inserting edges of bounded total co...
Given a graph G=(V,E) and a positive integer D, we consider the problem of finding a minimum number ...
International audienceThe Outerplanar Diameter Improvement problem asks, given a graph $G$ and an in...
In this paper we study two variants of the problem of adding edges to a graph so as to reduce the re...
International audienceThe Outerplanar Diameter Improvement problem asks, given a graph G and an inte...
© Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, and Nicole Wein; lic...
In this paper, we study two variants of the problem of adding edges to a graph so as to reduce the r...
AbstractIn this paper, we study two variants of the problem of adding edges to a graph so as to redu...
Given a graph G = (V,E) and an integer D ≥ 1, we consider the problem of augmenting G by the smalles...
Full version of an IPEC'22 paperAn extremity is a vertex such that the removal of its closed neighbo...
We study the parameterized complexity of the $s$-Club Cluster Edge Deletion problem: Given a graph $...
We study the following problem: for given integers $d,k$ and graph $G$, can we obtain a graph with d...
AbstractFor given integers n and D, what is the minimum number of edges in a graph on n vertices wit...
We study the problem of augmenting a weighted graph by inserting edges of bounded total cost while m...
This paper is devoted to the fast and exact diameter computation in graphs with n vertices and m edg...
Abstract. We study the problem of augmenting a weighted graph by inserting edges of bounded total co...
Given a graph G=(V,E) and a positive integer D, we consider the problem of finding a minimum number ...
International audienceThe Outerplanar Diameter Improvement problem asks, given a graph $G$ and an in...
In this paper we study two variants of the problem of adding edges to a graph so as to reduce the re...
International audienceThe Outerplanar Diameter Improvement problem asks, given a graph G and an inte...
© Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, and Nicole Wein; lic...
In this paper, we study two variants of the problem of adding edges to a graph so as to reduce the r...
AbstractIn this paper, we study two variants of the problem of adding edges to a graph so as to redu...
Given a graph G = (V,E) and an integer D ≥ 1, we consider the problem of augmenting G by the smalles...
Full version of an IPEC'22 paperAn extremity is a vertex such that the removal of its closed neighbo...
We study the parameterized complexity of the $s$-Club Cluster Edge Deletion problem: Given a graph $...