The following pages link to Giuseppe Liotta (Q235642):
Displaying 50 items.
- Area requirement of visibility representations of trees (Q287042) (← links)
- Recognizing and drawing IC-planar graphs (Q290513) (← links)
- Lower and upper bounds for long induced paths in 3-connected planar graphs (Q290522) (← links)
- Simultaneous visibility representations of plane \(st\)-graphs using L-shapes (Q306259) (← links)
- (Q340543) (redirect page) (← links)
- Alternating paths and cycles of minimum length (Q340546) (← links)
- A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system (Q391976) (← links)
- The shape of orthogonal cycles in three dimensions (Q411405) (← links)
- Drawing a tree as a minimum spanning tree approximation (Q414909) (← links)
- Universal point sets for 2-coloured trees (Q436323) (← links)
- Vertex angle and crossing angle resolution of leveled tree drawings (Q456065) (← links)
- 2-layer right angle crossing drawings (Q476445) (← links)
- A linear-time algorithm for testing outer-1-planarity (Q494794) (← links)
- On partitioning the edges of 1-plane graphs (Q501676) (← links)
- Colored simultaneous geometric embeddings and universal pointsets (Q548667) (← links)
- Area, curve complexity, and crossing resolution of non-planar graph drawings (Q649108) (← links)
- Curve-constrained drawings of planar graphs (Q706719) (← links)
- On point-sets that support planar graphs (Q714901) (← links)
- Drawing graphs with right angle crossings (Q719252) (← links)
- The partial visibility representation extension problem (Q724235) (← links)
- Ortho-polygon visibility representations of embedded graphs (Q724238) (← links)
- Bounds on the crossing resolution of complete geometric graphs (Q765347) (← links)
- A characterization of complete bipartite RAC graphs (Q765516) (← links)
- Packing trees into 1-planar graphs (Q782163) (← links)
- Planar drawings with few slopes of Halin graphs and nested pseudotrees (Q832866) (← links)
- Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices (Q848671) (← links)
- The strength of weak proximity (Q849629) (← links)
- L-visibility drawings of IC-planar graphs (Q903189) (← links)
- Point-set embeddings of trees with given partial drawings (Q924086) (← links)
- Radial drawings of graphs: geometric constraints and trade-offs (Q954965) (← links)
- On the parameterized complexity of layered graph drawing (Q958215) (← links)
- Drawing colored graphs on colored points (Q959802) (← links)
- Upward drawings of triconnected digraphs. (Q960528) (← links)
- Drawing colored graphs with constrained vertex positions and few bends per edge (Q973017) (← links)
- Matched drawability of graph pairs and of graph triples (Q982951) (← links)
- Volume requirements of 3D upward drawings (Q1011762) (← links)
- Upward straight-line embeddings of directed graphs into point sets (Q1037786) (← links)
- Checking the convexity of polytopes and the planarity of subdivisions (Q1276945) (← links)
- Visualizing geometric algorithms over the Web (Q1286485) (← links)
- Drawing outerplanar minimum weight triangulations (Q1351606) (← links)
- The rectangle of influence drawability problem (Q1388129) (← links)
- Turn-regularity and optimal area drawings of orthogonal representations (Q1567307) (← links)
- Visibility representations of boxes in 2.5 dimensions (Q1615673) (← links)
- HV-planarity: algorithms and complexity (Q1628786) (← links)
- 1-page and 2-page drawings with bounded number of crossings per edge (Q1678086) (← links)
- On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs (Q1687902) (← links)
- New results on edge partitions of 1-plane graphs (Q1694686) (← links)
- Drawing subcubic planar graphs with four slopes and optimal angular resolution (Q1694729) (← links)
- Turning cliques into paths to achieve planarity (Q1725735) (← links)
- Bend-minimum orthogonal drawings in quadratic time (Q1725783) (← links)
