Debajyoti Mondal

From MaRDI portal
Person:396680

Available identifiers

zbMath Open mondal.debajyotiMaRDI QIDQ396680

List of research outcomes





PublicationDate of PublicationType
Approximation algorithms for minimum ply covering of points with unit squares and unit disks2024-12-12Paper
On the oriented diameter of planar triangulations2024-11-28Paper
StreamTable: an area proportional visualization for tables with flowing streams2024-11-18Paper
On the 3-tree core of plane graphs2024-11-12Paper
Finding a maximum clique in a disk graph2024-10-16Paper
Linear-time rectilinear drawings of subdivisions of triconnected cubic planar graphs with orthogonally convex faces2024-04-09Paper
Relating planar graph drawings to planar satisfiability problems2024-03-26Paper
Minimum ply covering of points with unit squares2023-11-24Paper
Improved and generalized algorithms for burning a planar point set2023-11-24Paper
Minimum shared‐power edge cut2023-11-15Paper
Parameterized complexity of two-interval pattern problem2023-11-02Paper
Bounds for the oriented diameter of planar triangulations2023-08-03Paper
Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set2023-07-21Paper
Token Swapping on Trees2023-05-31Paper
Drawing partial 2-trees with few slopes2023-04-28Paper
Emanation graph: a plane geometric spanner with Steiner points2023-04-24Paper
Bottleneck convex subsets: finding \(k\) large convex sets in a point set2023-03-30Paper
Finding a Maximum Clique in a Grounded 1-Bend String Graph2023-03-30Paper
The complexity of drawing a graph in a polygonal region2022-11-14Paper
APX-hardness and approximation for the \(k\)-burning number problem2022-09-16Paper
StreamTable: an area proportional visualization for tables with flowing streams2022-07-13Paper
Positive planar satisfiability problems under 3-connectivity constraints2022-05-31Paper
Computing maximum independent set on outerstring graphs and their relatives2022-04-08Paper
Parameterized complexity of two-interval pattern problem2022-01-18Paper
Faster multi-sided one-bend boundary labelling2021-10-04Paper
Simultaneous embedding of colored graphs2021-08-12Paper
Local routing in convex subdivisions2021-02-11Paper
Boundary labeling for rectangular diagrams2020-08-25Paper
On compatible triangulations with a minimum number of Steiner points2020-08-17Paper
Simplified emanation graphs: a sparse plane spanner with Steiner points2020-07-20Paper
Partitioning orthogonal histograms into rectangular boxes2020-02-12Paper
Computing maximum independent set on outerstring graphs and their relatives2020-01-16Paper
Recognition and drawing of stick graphs2019-11-13Paper
Polygon simplification by minimizing convex corners2019-09-10Paper
Construction and Local Routing for Angle-Monotone Graphs2019-05-24Paper
On upward drawings of trees on a given grid2019-02-20Paper
The complexity of drawing a graph in a polygonal region2019-02-15Paper
Recognition and drawing of stick graphs2019-02-15Paper
Relating graph thickness to planar layers and bend complexity2018-11-28Paper
Construction and local routing for angle-monotone graphs2018-11-22Paper
Drawing plane triangulations with few segments2018-11-19Paper
Orthogonal layout with optimal face complexity2018-11-01Paper
On the planar split thickness of graphs2018-04-11Paper
Table cartogram2018-02-19Paper
Thickness and colorability of geometric graphs2018-01-19Paper
Relating graph thickness to planar layers and bend complexity2017-12-19Paper
A necessary condition and a sufficient condition for pairwise compatibility graphs2017-04-05Paper
Drawing Planar Graphs with Reduced Height2017-04-05Paper
Polygon simplification by minimizing convex corners2016-09-02Paper
On the planar split thickness of graphs2016-05-03Paper
Orthogonal layout with optimal face complexity2016-03-10Paper
Plane 3-trees: embeddability and approximation2015-05-20Paper
Local routing in convex subdivisions2015-02-20Paper
On graphs that are not PCGs2015-01-30Paper
Trade-Offs in Planar Polyline Drawings2015-01-07Paper
Drawing planar graphs with reduced height2015-01-07Paper
Acyclic coloring with few division vertices2014-08-19Paper
Acyclic coloring with few division vertices2014-08-13Paper
Indexed geometric jumbled pattern matching2014-06-30Paper
Drawing HV-Restricted Planar Graphs2014-03-31Paper
Planar and plane slope number of partial 2-trees2013-12-20Paper
On balanced +-contact representations2013-12-20Paper
Thickness and colorability of geometric graphs2013-12-06Paper
Table cartograms2013-09-17Paper
Plane 3-trees: embeddability and approximation (extended abstract)2013-08-12Paper
A note on minimum-segment drawings of planar graphs2013-07-09Paper
Minimum-segment convex drawings of 3-connected cubic plane graphs2013-06-28Paper
On graphs that are not PCGs2013-04-12Paper
Touching triangle representations for 3-connected planar graphs2013-04-03Paper
Universal line-sets for drawing planar 3-trees2013-03-19Paper
Acyclic colorings of graph subdivisions revisited2013-01-18Paper
Cool-lex order and \(k\)-ary Catalan structures2013-01-18Paper
Visibility drawings of plane 3-trees with minimum area2012-12-03Paper
Hamiltonian Paths and Cycles in Planar Graphs2012-11-02Paper
Point-set embeddings of plane \(3\)-trees2012-06-13Paper
On the hardness of point-set embeddability (extended abstract)2012-06-08Paper
Universal line-sets for drawing planar 3-trees2012-06-08Paper
Embedding plane 3-trees in \(\mathbb R^{2}\) and \(\mathbb R^{3}\)2012-03-09Paper
Acyclic colorings of graph subdivisions2012-01-13Paper
Ranking and loopless generation of \(k\)-ary Dyck words in cool-lex order2012-01-13Paper
Minimum-area drawings of plane 3-trees2011-04-19Paper
Minimum-layer drawings of trees (extended abstract)2011-02-20Paper
Point-set embeddings of plane 3-trees (extended abstract)2011-02-11Paper
Minimum-segment convex drawings of 3-connected cubic plane graphs (extended abstract)2010-07-20Paper

Research outcomes over time

This page was built for person: Debajyoti Mondal