19 citations · 37 across the 32 of their papers we have counts for
6 papers · 1 filter
A Note on Plus-Contacts, Rectangular Duals, and Box-Orthogonal Drawings
Therese Biedl, Debajyoti Mondal
A plus-contact representation of a planar graph is called -balanced if for every plus shape , the number of other plus shapes incident to each arm of is at most $…
On Upward Drawings of Trees on a Given Grid
Therese Biedl, Debajyoti Mondal
Computing a minimum-area planar straight-line drawing of a graph is known to be NP-hard for planar graphs, even when restricted to outerplanar graphs. However, the complexity quest…
On String Contact Representations in 3D
Debajyoti Mondal
An axis-aligned string is a simple polygonal path, where each line segment is parallel to an axis in . Given a graph , a string contact representation of m…
On Compatible Triangulations with a Minimum Number of Steiner Points
Anna Lubiw, Debajyoti Mondal
Two vertex-labelled polygons are \emph{compatible} if they have the same clockwise cyclic ordering of vertices. The definition extends to polygonal regions (polygons with holes) an…
A New Approach to GraphMaps, a System Browsing Large Graphs as Interactive Maps
Debajyoti Mondal, Lev Nachmanson
A GraphMaps is a system that visualizes a graph using zoom levels, which is similar to a geographic map visualization. GraphMaps reveals the structural properties of the graph and…
Exploring Increasing-Chord Paths and Trees
Yeganeh Bahoo, Stephane Durocher, Sahar Mehrpour +1
A straight-line drawing of a graph is a drawing of in the Euclidean plane, where every vertex in is mapped to a distinct point, and every edge in is mappe…