Debajyoti Mondal

research

∙ 03/14/2023

Finding a Maximum Clique in a Disk Graph

A disk graph is an intersection graph of disks in the Euclidean plane, w...

0 Jared Espenant, et al. ∙

research

∙ 03/02/2023

Pathways to Leverage Transcompiler based Data Augmentation for Cross-Language Clone Detection

Software clones are often introduced when developers reuse code fragment...

0 Subroto Nag Pinku, et al. ∙

research

∙ 09/26/2022

Improved and Generalized Algorithms for Burning a Planar Point Set

Given a set P of points in the plane, a point burning process is a discr...

0 Prashant Gokhale, et al. ∙

research

∙ 08/12/2022

Minimum Ply Covering of Points with Unit Squares

Given a set P of points and a set U of axis-parallel unit squares in the...

0 Stephane Durocher, et al. ∙

research

∙ 05/10/2022

Burning Number for the Points in the Plane

The burning process on a graph G starts with a single burnt vertex, and ...

0 J. Mark Keil, et al. ∙

research

∙ 03/08/2022

Oriented Diameter of Planar Triangulations

The diameter of an undirected or a directed graph is defined to be the m...

0 Debajyoti Mondal, et al. ∙

research

∙ 01/25/2022

Leveraging Structural Properties of Source Code Graphs for Just-In-Time Bug Prediction

The most common use of data visualization is to minimize the complexity ...

0 Md Nadim, et al. ∙

research

∙ 08/27/2021

Positive Planar Satisfiability Problems under 3-Connectivity Constraints

A 3-SAT problem is called positive and planar if all the literals are po...

0 Md. Manzurul Hasan, et al. ∙

research

∙ 08/27/2021

Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set

Chvátal and Klincsek (1980) gave an O(n^3)-time algorithm for the proble...

0 Stephane Durocher, et al. ∙

research

∙ 08/01/2021

BigGraphVis: Leveraging Streaming Algorithms and GPU Acceleration for Visualizing Big Graphs

Graph layouts are key to exploring massive graphs. An enormous number of...

0 Ehsan Moradi, et al. ∙

research

∙ 07/12/2021

Finding a Maximum Clique in a Grounded 1-Bend String Graph

A grounded 1-bend string graph is an intersection graph of a set of poly...

0 J. Mark Keil, et al. ∙

research

∙ 06/08/2021

On the Evolution of Neuron Communities in a Deep Learning Architecture

Deep learning techniques are increasingly being adopted for classificati...

0 Sakib Mostafa, et al. ∙

research

∙ 03/28/2021

StreamTable: An Area Proportional Visualization for Tables with Flowing Streams

Let M be an r× c table with each cell weighted by a nonzero positive num...

0 Jared Espenant, et al. ∙

research

∙ 01/17/2021

Simultaneous Embedding of Colored Graphs

A set of colored graphs are compatible, if for every color i, the number...

0 Debajyoti Mondal, et al. ∙

research

∙ 06/25/2020

APX-Hardness and Approximation for the k-Burning Number Problem

Consider an information diffusion process on a graph G that starts with ...

0 Debajyoti Mondal, et al. ∙

research

∙ 04/16/2020

Compatible Paths on Labelled Point Sets

Let P and Q be finite point sets of the same cardinality in ℝ^2, each la...

0 Elena Arseneva, et al. ∙

research

∙ 02/22/2020

(Faster) Multi-Sided Boundary Labelling

A 1-bend boundary labelling problem consists of an axis-aligned rectangl...

0 Prosenjit Bose, et al. ∙

research

∙ 02/12/2020

Parameterized Complexity of Two-Interval Pattern Problem

A 2-interval is the union of two disjoint intervals on the real line. Tw...

0 Prosenjit Bose, et al. ∙

research

∙ 10/23/2019

Simplified Emanation Graphs: A Sparse Plane Spanner with Steiner Points

Emanation graphs of grade k, introduced by Hamedmohseni, Rahmati, and Mo...

0 Bardia Hamedmohse, et al. ∙

research

∙ 04/14/2019

Drawing HV-Restricted Planar Graphs

A strict orthogonal drawing of a graph G=(V, E) in R^2 is a drawing of G...

0 Stephane Durocher, et al. ∙

research

∙ 03/17/2019

Computing Maximum Independent Set on Outerstring Graphs and Their Relatives

A graph G with n vertices is called an outerstring graph if it has an in...

0 Prosenjit Bose, et al. ∙

research

∙ 03/16/2019

Token Swapping on Trees

The input to the token swapping problem is a graph with vertices v_1, v_...

0 Ahmad Biniaz, et al. ∙

research

∙ 12/13/2018

Polygon Simplification by Minimizing Convex Corners

Let P be a polygon with r>0 reflex vertices and possibly with holes and ...

0 Yeganeh Bahoo, et al. ∙

research

∙ 08/29/2018

Recognition and Drawing of Stick Graphs

A Stick graph is an intersection graph of axis-aligned segments such tha...

0 Felice De Luca, et al. ∙

research

∙ 06/12/2018

Minimum Shared-Power Edge Cut

We introduce a problem called the Minimum Shared-Power Edge Cut (MSPEC)....

0 Sergio Cabello, et al. ∙

research

∙ 03/28/2018

Boundary Labeling for Rectangular Diagrams

Given a set of n points (sites) inside a rectangle R and n points (label...

0 Prosenjit Bose, et al. ∙

research

∙ 02/19/2018

The Complexity of Drawing a Graph in a Polygonal Region

We prove that the following problem is complete for the existential theo...

0 Anna Lubiw, et al. ∙

research

∙ 01/19/2018

Angle-Monotone Graphs: Construction and Local Routing

A geometric graph in the plane is angle-monotone of width γ if every pai...

0 Anna Lubiw, et al. ∙

research

∙ 08/31/2017

A Note on Plus-Contacts, Rectangular Duals, and Box-Orthogonal Drawings

A plus-contact representation of a planar graph G is called c-balanced i...

0 Therese Biedl, et al. ∙

research

∙ 08/31/2017

On Upward Drawings of Trees on a Given Grid

Computing a minimum-area planar straight-line drawing of a graph is know...

0 Therese Biedl, et al. ∙

research

∙ 07/10/2017

On String Contact Representations in 3D

An axis-aligned string is a simple polygonal path, where each line segme...

0 Debajyoti Mondal, et al. ∙

research

∙ 06/28/2017

On Compatible Triangulations with a Minimum Number of Steiner Points

Two vertex-labelled polygons are compatible if they have the same clockw...

0 Anna Lubiw, et al. ∙

Debajyoti Mondal

Featured Co-authors