
BigGraphVis: Leveraging Streaming Algorithms and GPU Acceleration for Visualizing Big Graphs
Graph layouts are key to exploring massive graphs. An enormous number of...
read it

Finding a Maximum Clique in a Grounded 1Bend String Graph
A grounded 1bend string graph is an intersection graph of a set of poly...
read it

On the Evolution of Neuron Communities in a Deep Learning Architecture
Deep learning techniques are increasingly being adopted for classificati...
read it

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...
read it

Simultaneous Embedding of Colored Graphs
A set of colored graphs are compatible, if for every color i, the number...
read it

APXHardness and Approximation for the kBurning Number Problem
Consider an information diffusion process on a graph G that starts with ...
read it

Compatible Paths on Labelled Point Sets
Let P and Q be finite point sets of the same cardinality in ℝ^2, each la...
read it

(Faster) MultiSided Boundary Labelling
A 1bend boundary labelling problem consists of an axisaligned rectangl...
read it

Parameterized Complexity of TwoInterval Pattern Problem
A 2interval is the union of two disjoint intervals on the real line. Tw...
read it

Simplified Emanation Graphs: A Sparse Plane Spanner with Steiner Points
Emanation graphs of grade k, introduced by Hamedmohseni, Rahmati, and Mo...
read it

Drawing HVRestricted Planar Graphs
A strict orthogonal drawing of a graph G=(V, E) in R^2 is a drawing of G...
read it

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...
read it

Token Swapping on Trees
The input to the token swapping problem is a graph with vertices v_1, v_...
read it

Polygon Simplification by Minimizing Convex Corners
Let P be a polygon with r>0 reflex vertices and possibly with holes and ...
read it

Recognition and Drawing of Stick Graphs
A Stick graph is an intersection graph of axisaligned segments such tha...
read it

Minimum SharedPower Edge Cut
We introduce a problem called the Minimum SharedPower Edge Cut (MSPEC)....
read it

Boundary Labeling for Rectangular Diagrams
Given a set of n points (sites) inside a rectangle R and n points (label...
read it

The Complexity of Drawing a Graph in a Polygonal Region
We prove that the following problem is complete for the existential theo...
read it

AngleMonotone Graphs: Construction and Local Routing
A geometric graph in the plane is anglemonotone of width γ if every pai...
read it

A Note on PlusContacts, Rectangular Duals, and BoxOrthogonal Drawings
A pluscontact representation of a planar graph G is called cbalanced i...
read it

On Upward Drawings of Trees on a Given Grid
Computing a minimumarea planar straightline drawing of a graph is know...
read it

On String Contact Representations in 3D
An axisaligned string is a simple polygonal path, where each line segme...
read it

On Compatible Triangulations with a Minimum Number of Steiner Points
Two vertexlabelled polygons are compatible if they have the same clockw...
read it
Debajyoti Mondal
is this you? claim profile