Sfoglia per Autore
An experimental study of a 1-planarity testing and embedding algorithm
2020 Binucci, C.; Didimo, W.; Montecchiani, F.
Colored anchored visibility representations in 2D and 3D space
2020 Binucci, C.; Di Giacomo, E.; Hong, S. -H.; Liotta, G.; Meijer, H.; Sacristan, V.; Wismath, S.
Quasi-upward Planar Drawings with Minimum Curve Complexity
2021 Binucci, C.; Di Giacomo, E.; Liotta, G.; Tappini, A.
On Turn-Regular Orthogonal Representations
2022 Bekos, M. A.; Binucci, C.; Di Battista, G.; Didimo, W.; Gronemann, M.; Klein, K.; Patrignani, M.; Rutter, I.
Placing Arrows in Directed Graph Layouts: Algorithms and Experiments
2022 Binucci, C.; Didimo, W.; Kaufmann, M.; Liotta, G.; Montecchiani, F.
1-planarity testing and embedding: An experimental study
2022 Binucci, C.; Didimo, W.; Montecchiani, F.
st-Orientations with Few Transitive Edges
2023 Binucci, C.; Didimo, W.; Patrignani, M.
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges
2023 Binucci, C.; Liotta, G.; Montecchiani, F.; Ortali, G.; Piselli, T.
On the Complexity of the Storyplan Problem
2023 Binucci, C.; Di Giacomo, E.; Lenhart, W. J.; Liotta, G.; Montecchiani, F.; Nollenburg, M.; Symvonis, A.
st-Orientations with Few Transitive Edges
2023 Binucci, C; Didimo, W; Patrignani, M
Min-k-planar Drawings of Graphs
2023 Binucci, C.; Bungener, A.; Di Battista, G.; Didimo, W.; Dujmovic, V.; Hong, S. -H.; Kaufmann, M.; Liotta, G.; Morin, P.; Tappini, A.
Evaluating Animation Parameters for Morphing Edge Drawings
2023 Binucci, C.; Forster, H.; Katheder, J.; Tappini, A.
Nonplanar Graph Drawings with k Vertices per Face
2023 Binucci, C.; Di Battista, G.; Didimo, W.; Hong, S. -H.; Kaufmann, M.; Liotta, G.; Morin, P.; Tappini, A.
Upward Book Embeddability of st-Graphs: Complexity and Algorithms
2023 Binucci, C.; Da Lozzo, G.; Di Giacomo, E.; Didimo, W.; Mchedlidze, T.; Patrignani, M.
K-Planar Placement and Packing of \Delta-Regular Caterpillars
2023 Binucci, C.; Di Giacomo, E.; Kaufmann, M.; Liotta, G.; Tappini, A.
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges (short paper)
2023 Binucci, C.; Liotta, G.; Montecchiani, F.; Ortali, G.; Piselli, T.
On the complexity of the storyplan problem
2024 Binucci, Carla; Di Giacomo, Emilio; Lenhart, William J.; Liotta, Giuseppe; Montecchiani, Fabrizio; Nöllenburg, Martin; Symvonis, Antonios
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| An experimental study of a 1-planarity testing and embedding algorithm | 2020 | Binucci, C.; Didimo, W.; Montecchiani, F. | |
| Colored anchored visibility representations in 2D and 3D space | 2020 | Binucci, C.; Di Giacomo, E.; Hong, S. -H.; Liotta, G.; Meijer, H.; Sacristan, V.; Wismath, S. | |
| Quasi-upward Planar Drawings with Minimum Curve Complexity | 2021 | Binucci, C.; Di Giacomo, E.; Liotta, G.; Tappini, A. | |
| On Turn-Regular Orthogonal Representations | 2022 | Bekos, M. A.; Binucci, C.; Di Battista, G.; Didimo, W.; Gronemann, M.; Klein, K.; Patrignani, M.; Rutter, I. | |
| Placing Arrows in Directed Graph Layouts: Algorithms and Experiments | 2022 | Binucci, C.; Didimo, W.; Kaufmann, M.; Liotta, G.; Montecchiani, F. | |
| 1-planarity testing and embedding: An experimental study | 2022 | Binucci, C.; Didimo, W.; Montecchiani, F. | |
| st-Orientations with Few Transitive Edges | 2023 | Binucci, C.; Didimo, W.; Patrignani, M. | |
| On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges | 2023 | Binucci, C.; Liotta, G.; Montecchiani, F.; Ortali, G.; Piselli, T. | |
| On the Complexity of the Storyplan Problem | 2023 | Binucci, C.; Di Giacomo, E.; Lenhart, W. J.; Liotta, G.; Montecchiani, F.; Nollenburg, M.; Symvonis, A. | |
| st-Orientations with Few Transitive Edges | 2023 | Binucci, C; Didimo, W; Patrignani, M | |
| Min-k-planar Drawings of Graphs | 2023 | Binucci, C.; Bungener, A.; Di Battista, G.; Didimo, W.; Dujmovic, V.; Hong, S. -H.; Kaufmann, M.; Liotta, G.; Morin, P.; Tappini, A. | |
| Evaluating Animation Parameters for Morphing Edge Drawings | 2023 | Binucci, C.; Forster, H.; Katheder, J.; Tappini, A. | |
| Nonplanar Graph Drawings with k Vertices per Face | 2023 | Binucci, C.; Di Battista, G.; Didimo, W.; Hong, S. -H.; Kaufmann, M.; Liotta, G.; Morin, P.; Tappini, A. | |
| Upward Book Embeddability of st-Graphs: Complexity and Algorithms | 2023 | Binucci, C.; Da Lozzo, G.; Di Giacomo, E.; Didimo, W.; Mchedlidze, T.; Patrignani, M. | |
| K-Planar Placement and Packing of \Delta-Regular Caterpillars | 2023 | Binucci, C.; Di Giacomo, E.; Kaufmann, M.; Liotta, G.; Tappini, A. | |
| On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges (short paper) | 2023 | Binucci, C.; Liotta, G.; Montecchiani, F.; Ortali, G.; Piselli, T. | |
| On the complexity of the storyplan problem | 2024 | Binucci, Carla; Di Giacomo, Emilio; Lenhart, William J.; Liotta, Giuseppe; Montecchiani, Fabrizio; Nöllenburg, Martin; Symvonis, Antonios |
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