19 citations · 37 across the 32 of their papers we have counts for
4 papers · 1 filter
Subsetwise and Multi-Level Additive Spanners with Lightness Guarantees
Reyan Ahmed, Debajyoti Mondal, Rahnuma Islam Nishat
An \emph{additive + spanner} of an edge weighted graph is a subgraph of such that for every pair of vertices and , , wher…
Improved Outerplanarity Bounds for Planar Graphs
Therese Biedl, Debajyoti Mondal
In this paper, we study the outerplanarity of planar graphs, i.e., the number of times that we must (in a planar embedding that we can initially freely choose) remove the outerface…
Oriented Diameter of Planar Triangulations
Debajyoti Mondal, N. Parthiban, Indra Rajasingh
The diameter of an undirected or a directed graph is defined to be the maximum shortest path distance over all pairs of vertices in the graph. Given an undirected graph , we exa…
Minimum Shared-Power Edge Cut
Sergio Cabello, Kshitij Jain, Anna Lubiw +1
We introduce a problem called the Minimum Shared-Power Edge Cut (MSPEC). The input to the problem is an undirected edge-weighted graph with distinguished vertices s and t, and the…