1 citations · 1 across the 16 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DS2022
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…
cs.DS2022
Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution
Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani +1
We continue the study of the area requirement of convex straight-line grid drawings of 3-connected plane graphs, which has been intensively investigated in the last decades. Motiva…