Sfoglia per Autore
Planar Packings of Trees and Spider Trees
2009-01-01 Frati, Fabrizio; Geyer, M; Kaufmann, M.
An Algorithm to Construct Greedy Drawings of Triangulations
2009-01-01 Angelini, P; Frati, Fabrizio; Grilli, L.
Planar packing of trees and spider trees
2009-01-01 Frati, Fabrizio; Markus, Geyer; Michael, Kaufmann
Planar Packing of Diameter-Four Trees
2009-01-01 Frati, Fabrizio
Straight-line Rectangular Drawings of Clustered Graphs
2009-01-01 Angelini, P; Frati, Fabrizio; Kaufmann, M.
Non-Convex Representations of Graphs
2009-01-01 DI BATTISTA, Giuseppe; Frati, Fabrizio; Patrignani, Maurizio
Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
2009-01-01 DI BATTISTA, Giuseppe; Frati, Fabrizio
Constrained Simultaneous and Near-Simultaneous Embeddings
2009-01-01 Frati, Fabrizio; Michael, Kaufmann; Stephen, Kobourov
On Directed Graphs with an Upward Straight-line Embedding into Every Point Set
2009-01-01 Carla, Binucci; Emilio DI, Giacomo; Walter, Didimo; Alejandro ESTRELLA, Balderrama; Frati, Fabrizio; Stephen, Kobourov; Giuseppe, Liotta
How to Draw a Clustered Tree
2009-01-01 DI BATTISTA, Giuseppe; Drovandi, G; Frati, Fabrizio
On Embedding a Graph on the Grid with the Maximum Number of Bends and Other Bad Features
2009-01-01 DI BATTISTA, Giuseppe; Frati, Fabrizio; Patrignani, Maurizio
How to Draw a Clustered Tree
2009-01-01 DI BATTISTA, Giuseppe; Guido, Drovandi; Frati, Fabrizio
Splitting Clusters To Get C-Planarity
2010-01-01 Angelini, P; Frati, Fabrizio; Patrignani, Maurizio
Testing Planarity of Partially Embedded Graphs
2010-01-01 Angelini, P; DI BATTISTA, Giuseppe; Frati, Fabrizio; Jelinek, V; Kratochvil, J; Patrignani, Maurizio; Rutter, I.
An Algorithm to Construct Greedy Drawings of Triangulations
2010-01-01 Angelini, P; Frati, Fabrizio; Grilli, L.
Succinct Greedy Drawings Do Not Always Exist
2010-01-01 Angelini, P; DI BATTISTA, Giuseppe; Frati, Fabrizio
Acyclically 3-Colorable Planar Graphs
2010-01-01 Angelini, P; Frati, Fabrizio
A Note on Isosceles Planar Graph Drawing
2010-01-01 Frati, Fabrizio
Crossings between Curves with Many Tangencies
2010-01-01 Jacob, Fox; Frati, Fabrizio; Janos, Pach; Rom, Pinchasi
On the Queue Number of Planar Graphs
2010-01-01 DI BATTISTA, Giuseppe; Frati, Fabrizio; Pach, J.
Titolo | Data di pubblicazione | Autore(i) | File |
---|---|---|---|
Planar Packings of Trees and Spider Trees | 1-gen-2009 | Frati, Fabrizio; Geyer, M; Kaufmann, M. | |
An Algorithm to Construct Greedy Drawings of Triangulations | 1-gen-2009 | Angelini, P; Frati, Fabrizio; Grilli, L. | |
Planar packing of trees and spider trees | 1-gen-2009 | Frati, Fabrizio; Markus, Geyer; Michael, Kaufmann | |
Planar Packing of Diameter-Four Trees | 1-gen-2009 | Frati, Fabrizio | |
Straight-line Rectangular Drawings of Clustered Graphs | 1-gen-2009 | Angelini, P; Frati, Fabrizio; Kaufmann, M. | |
Non-Convex Representations of Graphs | 1-gen-2009 | DI BATTISTA, Giuseppe; Frati, Fabrizio; Patrignani, Maurizio | |
Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces | 1-gen-2009 | DI BATTISTA, Giuseppe; Frati, Fabrizio | |
Constrained Simultaneous and Near-Simultaneous Embeddings | 1-gen-2009 | Frati, Fabrizio; Michael, Kaufmann; Stephen, Kobourov | |
On Directed Graphs with an Upward Straight-line Embedding into Every Point Set | 1-gen-2009 | Carla, Binucci; Emilio DI, Giacomo; Walter, Didimo; Alejandro ESTRELLA, Balderrama; Frati, Fabrizio; Stephen, Kobourov; Giuseppe, Liotta | |
How to Draw a Clustered Tree | 1-gen-2009 | DI BATTISTA, Giuseppe; Drovandi, G; Frati, Fabrizio | |
On Embedding a Graph on the Grid with the Maximum Number of Bends and Other Bad Features | 1-gen-2009 | DI BATTISTA, Giuseppe; Frati, Fabrizio; Patrignani, Maurizio | |
How to Draw a Clustered Tree | 1-gen-2009 | DI BATTISTA, Giuseppe; Guido, Drovandi; Frati, Fabrizio | |
Splitting Clusters To Get C-Planarity | 1-gen-2010 | Angelini, P; Frati, Fabrizio; Patrignani, Maurizio | |
Testing Planarity of Partially Embedded Graphs | 1-gen-2010 | Angelini, P; DI BATTISTA, Giuseppe; Frati, Fabrizio; Jelinek, V; Kratochvil, J; Patrignani, Maurizio; Rutter, I. | |
An Algorithm to Construct Greedy Drawings of Triangulations | 1-gen-2010 | Angelini, P; Frati, Fabrizio; Grilli, L. | |
Succinct Greedy Drawings Do Not Always Exist | 1-gen-2010 | Angelini, P; DI BATTISTA, Giuseppe; Frati, Fabrizio | |
Acyclically 3-Colorable Planar Graphs | 1-gen-2010 | Angelini, P; Frati, Fabrizio | |
A Note on Isosceles Planar Graph Drawing | 1-gen-2010 | Frati, Fabrizio | |
Crossings between Curves with Many Tangencies | 1-gen-2010 | Jacob, Fox; Frati, Fabrizio; Janos, Pach; Rom, Pinchasi | |
On the Queue Number of Planar Graphs | 1-gen-2010 | DI BATTISTA, Giuseppe; Frati, Fabrizio; Pach, J. |
Legenda icone
- file ad accesso aperto
- file disponibili sulla rete interna
- file disponibili agli utenti autorizzati
- file disponibili solo agli amministratori
- file sotto embargo
- nessun file disponibile