Showing cs.DSShow all
3 papers · 1 filter
cs.DS2024
Exact Algorithms for Clustered Planarity with Linear Saturators
Giordano Da Lozzo, Robert Ganian, Siddharth Gupta +3
We study Clustered Planarity with Linear Saturators, which is the problem of augmenting an -vertex planar graph whose vertices are partitioned into independent sets (called clus…
cs.DS2023
Collective Graph Exploration Parameterized by Vertex Cover
Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
We initiate the study of the parameterized complexity of the {\sc Collective Graph Exploration} ({\sc CGE}) problem. In {\sc CGE}, the input consists of an undirected connected gra…
cs.DS2023
Drawn Tree Decomposition: New Approach for Graph Drawing Problems
Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
Over the past decade, we witness an increasing amount of interest in the design of exact exponential-time and parameterized algorithms for problems in Graph Drawing. Unfortunately,…