3 citations · 5 across the 13 of their papers we have counts for
3 papers · 2 filters
Small Point-Sets Supporting Graph Stories
Giuseppe Di Battista, Walter Didimo, Luca Grilli +4
In a graph story the vertices enter a graph one at a time and each vertex persists in the graph for a fixed amount of time , called viewing window. At any time, the user can see…
Recognizing Map Graphs of Bounded Treewidth
Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo +3
A map graph is a graph admitting a representation in which vertices are nations on a spherical map and edges are shared curve segments or points between nations. We present an expl…
On the Parameterized Complexity of the -Club Cluster Edge Deletion Problem
Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli +1
We study the parameterized complexity of the -Club Cluster Edge Deletion problem: Given a graph and two integers and , is it possible to remove at most $k…