The following pages link to Debajyoti Mondal (Q396680):
Displaying 50 items.
- Acyclic coloring with few division vertices (Q396683) (← links)
- Point-set embeddings of plane \(3\)-trees (Q427050) (← links)
- Thickness and colorability of geometric graphs (Q679741) (← links)
- Visibility drawings of plane 3-trees with minimum area (Q691641) (← links)
- Orthogonal layout with optimal face complexity (Q1616241) (← links)
- Drawing plane triangulations with few segments (Q1622344) (← links)
- Construction and local routing for angle-monotone graphs (Q1627192) (← links)
- Table cartogram (Q1699289) (← links)
- The complexity of drawing a graph in a polygonal region (Q1725774) (← links)
- On the planar split thickness of graphs (Q1742373) (← links)
- Acyclic colorings of graph subdivisions revisited (Q1932357) (← links)
- Cool-lex order and \(k\)-ary Catalan structures (Q1932373) (← links)
- Simultaneous embedding of colored graphs (Q2045370) (← links)
- Parameterized complexity of two-interval pattern problem (Q2067621) (← links)
- Positive planar satisfiability problems under 3-connectivity constraints (Q2143145) (← links)
- StreamTable: an area proportional visualization for tables with flowing streams (Q2154088) (← links)
- On compatible triangulations with a minimum number of Steiner points (Q2192383) (← links)
- Faster multi-sided one-bend boundary labelling (Q2232239) (← links)
- Polygon simplification by minimizing convex corners (Q2272403) (← links)
- Partitioning orthogonal histograms into rectangular boxes (Q2294687) (← links)
- Minimum-segment convex drawings of 3-connected cubic plane graphs (Q2377378) (← links)
- On graphs that are not PCGs (Q2512661) (← links)
- Bottleneck convex subsets: finding \(k\) large convex sets in a point set (Q2695286) (← links)
- Emanation graph: a plane geometric spanner with Steiner points (Q2698543) (← links)
- Drawing partial 2-trees with few slopes (Q2701381) (← links)
- Orthogonal Layout with Optimal Face Complexity (Q2794350) (← links)
- A Note on Minimum-Segment Drawings of Planar Graphs (Q2838235) (← links)
- Plane 3-trees: Embeddability and Approximation (Q2842167) (← links)
- Table Cartograms (Q2849333) (← links)
- Thickness and Colorability of Geometric Graphs (Q2864305) (← links)
- On Balanced -Contact Representations (Q2867651) (← links)
- Planar and Plane Slope Number of Partial 2-Trees (Q2867678) (← links)
- Acyclic Coloring with Few Division Vertices (Q2876563) (← links)
- Universal Line-Sets for Drawing Planar 3-Trees (Q2889907) (← links)
- On the Hardness of Point-Set Embeddability (Q2889908) (← links)
- Trade-Offs in Planar Polyline Drawings (Q2936936) (← links)
- Point-Set Embeddings of Plane 3-Trees (Q3073682) (← links)
- Minimum-Layer Drawings of Trees (Q3078403) (← links)
- Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order (Q3111650) (← links)
- Acyclic Colorings of Graph Subdivisions (Q3111655) (← links)
- Hamiltonian Paths and Cycles in Planar Graphs (Q3167351) (← links)
- Minimum-Area Drawings of Plane 3-Trees (Q3168838) (← links)
- Embedding Plane 3-Trees in ℝ2 and ℝ3 (Q3223942) (← links)
- Simplified Emanation Graphs: A Sparse Plane Spanner with Steiner Points (Q3297791) (← links)
- Minimum-Segment Convex Drawings of 3-Connected Cubic Plane Graphs (Q3578315) (← links)
- Relating Graph Thickness to Planar Layers and Bend Complexity (Q4556953) (← links)
- Relating Graph Thickness to Planar Layers and Bend Complexity. (Q4598142) (← links)
- On Upward Drawings of Trees on a Given Grid (Q4625120) (← links)
- Universal Line-Sets for Drawing Planar 3-Trees (Q4910553) (← links)
- Touching Triangle Representations for 3-Connected Planar Graphs (Q4912202) (← links)
