12 citations · 12 across the 4 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018
Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity
Giordano Da Lozzo, David Eppstein, Michael T. Goodrich +1
The C-Planarity problem asks for a drawing of a , i.e., a graph whose vertices belong to properly nested clusters, in which each cluster is represented by…
cs.DS2018
Exploiting Hopsets: Improved Distance Oracles for Graphs of Constant Highway Dimension and Beyond
Siddharth Gupta, Adrian Kosowski, Laurent Viennot
For fixed , we consider the task of adding to a graph a set of weighted shortcut edges on the same vertex set, such that the length of a shortest -hop path between…