The following pages link to Emilio Di Giacomo (Q290520):
Displaying 14 items.
- Universal slope sets for upward planar drawings (Q5918782) (← links)
- 2-colored point-set embeddings of partial 2-trees (Q5919105) (← links)
- 2-colored point-set embeddings of partial 2-trees (Q5925531) (← links)
- k-Planar Placement and Packing of Δ-Regular Caterpillars (Q6066468) (← links)
- Upward book embeddability of \(st\)-graphs: complexity and algorithms (Q6066758) (← links)
- On the complexity of the storyplan problem (Q6078287) (← links)
- Testing upward planarity of partial 2-trees (Q6117044) (← links)
- On the complexity of the storyplan problem (Q6172205) (← links)
- Packing Trees into 1-planar Graphs (Q6328555) (← links)
- Parameterized algorithms for upward planarity (Q6539539) (← links)
- On 1-bend upward point-set embeddings of \(st\)-digraphs (Q6547912) (← links)
- Planar drawings with few slopes of Halin graphs and nested pseudotrees (Q6586655) (← links)
- On the parameterized complexity of bend-minimum orthogonal planarity (Q6618248) (← links)
- On the parameterized complexity of bend-minimum orthogonal planarity (Q6623586) (← links)
