5 citations · 7 across the 5 of their papers we have counts for
1 paper · 1 filter
Petr A. Golovach, Clément Requilé, Dimitrios M. Thilikos
The {\sc Plane Diameter Completion} problem asks, given a plane graph G and a positive integer d, if it is a spanning subgraph of a plane graph H that has diameter at most $d…