19 citations · 37 across the 32 of their papers we have counts for
42 papers
Finding Cliques in Geometric Intersection Graphs with Grounded or Stabbed Constraints
J. Mark Keil, Debajyoti Mondal
A geometric intersection graph is constructed over a set of geometric objects, where each vertex represents a distinct object and an edge connects two vertices if and only if the c…
Computing Conforming Partitions with Low Stabbing Number for Rectilinear Polygons
Therese Biedl, Stephane Durocher, Debajyoti Mondal +2
A conforming partition of a rectilinear n-gon P (possibly with holes) is a partition of P into rectangles without using Steiner points (i.e., all corners of all rectangles must lie…
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…
Quantum Speedup for Some Geometric 3SUM-Hard Problems and Beyond
J. Mark Keil, Fraser McLeod, Debajyoti Mondal
The classical 3SUM conjecture states that the class of 3SUM-hard problems does not admit a truly subquadratic -time algorithm, where , in classical computing. The…
The Maximum Clique Problem in a Disk Graph Made Easy
J. Mark Keil, Debajyoti Mondal
A disk graph is an intersection graph of disks in . Determining the computational complexity of finding a maximum clique in a disk graph is a long-standing open probl…
Finding a Maximum Clique in a Disk Graph
Jared Espenant, J. Mark Keil, Debajyoti Mondal
A disk graph is an intersection graph of disks in the Euclidean plane, where the disks correspond to the vertices of the graph and a pair of vertices are adjacent if and only if th…
Pathways to Leverage Transcompiler based Data Augmentation for Cross-Language Clone Detection
Subroto Nag Pinku, Debajyoti Mondal, Chanchal K. Roy
Software clones are often introduced when developers reuse code fragments to implement similar functionalities in the same or different software systems. Many high-performing clone…
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…
Minimum Ply Covering of Points with Unit Squares
Stephane Durocher, J. Mark Keil, Debajyoti Mondal
Given a set of points and a set of axis-parallel unit squares in the Euclidean plane, a minimum ply cover of with is a subset of that covers and minimizes t…
Burning Number for the Points in the Plane
J. Mark Keil, Debajyoti Mondal, Ehsan Moradi
The burning process on a graph starts with a single burnt vertex, and at each subsequent step, burns the neighbors of the currently burnt vertices, as well as one other unburnt…
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…
Finding a Maximum Clique in a Grounded 1-Bend String Graph
J. Mark Keil, Debajyoti Mondal, Ehsan Moradi +1
A grounded 1-bend string graph is an intersection graph of a set of polygonal lines, each with one bend, such that the lines lie above a common horizontal line and have exac…
On the Evolution of Neuron Communities in a Deep Learning Architecture
Sakib Mostafa, Debajyoti Mondal
Deep learning techniques are increasingly being adopted for classification tasks over the past decade, yet explaining how deep learning architectures can achieve state-of-the-art p…
StreamTable: An Area Proportional Visualization for Tables with Flowing Streams
Jared Espenant, Debajyoti Mondal
Let be a two-dimensional table with each cell weighted by a nonzero positive number. A StreamTable visualization of represents the columns as non-overlapping vertical strea…
Simultaneous Embedding of Colored Graphs
Debajyoti Mondal
A set of colored graphs are compatible, if for every color , the number of vertices of color is the same in every graph. A simultaneous embedding of compatibly colored g…
APX-Hardness and Approximation for the k-Burning Number Problem
Debajyoti Mondal, N. Parthiban, V. Kavitha +1
Consider an information diffusion process on a graph that starts with burnt vertices, and at each subsequent step, burns the neighbors of the currently burnt vertices, as…
Compatible Paths on Labelled Point Sets
Elena Arseneva, Yeganeh Bahoo, Ahmad Biniaz +8
Let and be finite point sets of the same cardinality in , each labelled from to . Two noncrossing geometric graphs and spanning and …
(Faster) Multi-Sided Boundary Labelling
Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal
A 1-bend boundary labelling problem consists of an axis-aligned rectangle , points (called sites) in the interior, and points (called ports) on the labels along the boun…
Parameterized Complexity of Two-Interval Pattern Problem
Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal
A \emph{2-interval} is the union of two disjoint intervals on the real line. Two 2-intervals and are \emph{disjoint} if their intersection is empty (i.e., no interval o…