The following pages link to Md. Saidur Rahman (Q238444):
Displaying 50 items.
- A linear-time algorithm for four-partitioning four-connected planar graphs (Q287104) (← links)
- On some properties of doughnut graphs (Q334123) (← links)
- Acyclic coloring with few division vertices (Q396683) (← links)
- Point-set embeddings of plane \(3\)-trees (Q427050) (← links)
- Minimum face-spanning subgraphs of plane graphs (Q547549) (← links)
- Drawing planar graphs (Q782147) (← links)
- Good spanning trees in graph drawing (Q897943) (← links)
- Octagonal drawings of plane graphs with prescribed face areas (Q1000923) (← links)
- (Q1032038) (redirect page) (← links)
- Pairwise compatibility graphs (Q1032039) (← links)
- Rectangular grid drawings of plane graphs (Q1392851) (← links)
- Floorplans with columns (Q1699755) (← links)
- On triangle cover contact graphs (Q1702259) (← links)
- Realizability of graphs as triangle cover contact graphs (Q1704579) (← links)
- A linear algorithm for resource four-partitioning four-connected planar graphs (Q1928628) (← links)
- Acyclic colorings of graph subdivisions revisited (Q1932357) (← links)
- Positive planar satisfiability problems under 3-connectivity constraints (Q2143145) (← links)
- New results on pairwise compatibility graphs (Q2169428) (← links)
- No-bend orthogonal drawings and no-bend orthogonally convex drawings of planar graphs (extended abstract) (Q2300045) (← links)
- \(r\)-gatherings on a star (Q2327520) (← links)
- Minimum-segment convex drawings of 3-connected cubic plane graphs (Q2377378) (← links)
- Basic graph theory (Q2406112) (← links)
- On graphs that are not PCGs (Q2512661) (← links)
- (Q2766817) (← links)
- Box-Rectangular Drawings of Planar Graphs (Q2865022) (← links)
- Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n log n) Area (Q2865034) (← links)
- Generating All Triangulations of Plane Graphs (Q2865036) (← links)
- On Some Properties of Doughnut Graphs (Q2876556) (← links)
- Acyclic Coloring with Few Division Vertices (Q2876563) (← links)
- Triangle-Free Outerplanar 3-Graphs Are Pairwise Compatibility Graphs (Q2889905) (← links)
- Universal Line-Sets for Drawing Planar 3-Trees (Q2889907) (← links)
- Realizability of Graphs as Triangle Cover Contact Graphs (Q2958333) (← links)
- Multi-interval Pairwise Compatibility Graphs (Q2988811) (← links)
- (Q3043744) (← links)
- Point-Set Embeddings of Plane 3-Trees (Q3073682) (← links)
- Minimum-Layer Upward Drawings of Trees (Q3075608) (← links)
- On Graceful Labelings of Trees (Q3078402) (← links)
- Minimum-Layer Drawings of Trees (Q3078403) (← links)
- DISCOVERING PAIRWISE COMPATIBILITY GRAPHS (Q3084693) (← links)
- Acyclic Colorings of Graph Subdivisions (Q3111655) (← links)
- (Q3154374) (← links)
- Minimum-Area Drawings of Plane 3-Trees (Q3168838) (← links)
- On a Class of Planar Graphs with Straight-Line Grid Drawings on Linear Area (Q3184608) (← links)
- Monotone Grid Drawings of Planar Graphs (Q3188839) (← links)
- Embedding Plane 3-Trees in ℝ2 and ℝ3 (Q3223942) (← links)
- Minimum-Segment Convex Drawings of 3-Connected Cubic Plane Graphs (Q3578315) (← links)
- Discovering Pairwise Compatibility Graphs (Q3578340) (← links)
- Generating All Triangulations of Plane Graphs (Extended Abstract) (Q3605494) (← links)
- Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract) (Q3605507) (← links)
- Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three (Q3611877) (← links)
