The following pages link to Carla Binucci (Q436545):
Displaying 42 items.
- Drawing trees in a streaming model (Q436551) (← links)
- An experimental study of a 1-planarity testing and embedding algorithm (Q782206) (← links)
- Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs (Q904086) (← links)
- Maximum upward planar subgraphs of embedded planar digraphs (Q945947) (← links)
- Upward straight-line embeddings of directed graphs into point sets (Q1037786) (← links)
- Visibility representations of boxes in 2.5 dimensions (Q1615673) (← links)
- 1-page and 2-page drawings with bounded number of crossings per edge (Q1678086) (← links)
- 10 reasons to get interested in graph drawing (Q2075765) (← links)
- 1-planarity testing and embedding: an experimental study (Q2088879) (← links)
- Quasi-upward planar drawings with minimum curve complexity (Q2151443) (← links)
- Colored anchored visibility representations in 2D and 3D space (Q2206717) (← links)
- Fan-planarity: properties and complexity (Q2346379) (← links)
- Upward and quasi-upward planarity testing of embedded mixed graphs (Q2437763) (← links)
- Orthogonal drawings of graphs with vertex and edge labels (Q2573336) (← links)
- 1-Page and 2-Page Drawings with Bounded Number of Crossings per Edge (Q2798215) (← links)
- Switch-regular upward planarity testing of directed trees (Q2865045) (← links)
- Drawing Non-Planar Graphs with Crossing-Free Subgraphs (Q2867666) (← links)
- Fan-Planar Graphs: Combinatorial Properties and Complexity Results (Q2936925) (← links)
- 2-Layer Fan-Planarity: From Caterpillar to Stegosaurus (Q2959764) (← links)
- Placing Arrows in Directed Graph Drawings (Q2961503) (← links)
- Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus (Q2971387) (← links)
- (Q3043712) (← links)
- Upward Planarity Testing of Embedded Mixed Graphs (Q3223974) (← links)
- Switch-Regular Upward Planar Embeddings of Trees (Q3404429) (← links)
- Drawing Trees in a Streaming Model (Q3557886) (← links)
- (Q4422263) (← links)
- Universal Point Subsets for Planar Graphs (Q4909559) (← links)
- On Turn-Regular Orthogonal Representations (Q5014121) (← links)
- On Turn-Regular Orthogonal Representations (Q5049999) (← links)
- Upward Book Embeddings of st-Graphs (Q5088940) (← links)
- Maximum Upward Planar Subgraphs of Embedded Planar Digraphs (Q5452223) (← links)
- Quasi-Upward Planar Drawings of Mixed Graphs with Few Bends: Heuristics and Exact Methods (Q5746266) (← 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)
- \(st\)-orientations with few transitive edges (Q6117048) (← links)
- $st$-Orientations with Few Transitive Edges (Q6141787) (← links)
- On the complexity of the storyplan problem (Q6172205) (← links)
- Min-\(k\)-planar drawings of graphs (Q6560142) (← links)
- Evaluating animation parameters for morphing edge drawings (Q6560153) (← links)
- Min-\(k\)-planar drawings of graphs (Q6616240) (← links)
- On the parameterized complexity of computing \(st\)-orientations with few transitive edges (Q6647642) (← links)
