3 citations · 10 across the 16 of their papers we have counts for
24 papers
Improved and Generalized Algorithms for Burning a Planar Point Set
Prashant Gokhale, J. Mark Keil, Debajyoti Mondal
Given a set of points in the plane, a point burning process is a discrete time process to burn all the points of where fires must be initiated at the given points. Specific…
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…
Leveraging Structural Properties of Source Code Graphs for Just-In-Time Bug Prediction
Md Nadim, Debajyoti Mondal, Chanchal K. Roy
The most common use of data visualization is to minimize the complexity for proper understanding. A graph is one of the most commonly used representations for understanding relatio…
Positive Planar Satisfiability Problems under 3-Connectivity Constraints
Md. Manzurul Hasan, Debajyoti Mondal, Md. Saidur Rahman
A 3-SAT problem is called positive and planar if all the literals are positive and the clause-variable incidence graph (i.e., SAT graph) is planar. The NAE 3-SAT and 1-in-3-SAT are…
Bottleneck Convex Subsets: Finding Large Convex Sets in a Point Set
Stephane Durocher, J. Mark Keil, Saeed Mehrabi +1
Chvátal and Klincsek (1980) gave an -time algorithm for the problem of finding a maximum-cardinality convex subset of an arbitrary given set of points in the plane.…
BigGraphVis: Leveraging Streaming Algorithms and GPU Acceleration for Visualizing Big Graphs
Ehsan Moradi, Debajyoti Mondal
Graph layouts are key to exploring massive graphs. An enormous number of nodes and edges do not allow network analysis software to produce meaningful visualization of the pervasive…