Carla Binucci

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 43

Top Topics

Top Venues

J. Graph Algorithms Appl.

Publications

Carla Binucci, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini
Graphs Drawn With Some Vertices per Face: Density and Relationships. IEEE Access 12 (2024)
Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Antonios Symvonis
On the complexity of the storyplan problem. J. Comput. Syst. Sci. 139 (2024)
Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini
-planar Drawings of Graphs. J. Graph Algorithms Appl. 28 (2) (2024)
Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges. MFCS (2023)
Carla Binucci, Emilio Di Giacomo, Michael Kaufmann, Giuseppe Liotta, Alessandra Tappini
k-planar Placement and Packing of Δ-regular Caterpillars. CoRR (2023)
Carla Binucci, Walter Didimo, Maurizio Patrignani
$st$-Orientations with Few Transitive Edges. J. Graph Algorithms Appl. 27 (8) (2023)
Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo, Tamara Mchedlidze, Maurizio Patrignani
Upward Book Embeddability of st-Graphs: Complexity and Algorithms. Algorithmica 85 (12) (2023)
Carla Binucci, Henry Förster, Julia Katheder, Alessandra Tappini
Evaluating Animation Parameters for Morphing Edge Drawings. GD (1) (2023)
Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini
Min-k-planar Drawings of Graphs. CoRR (2023)
Carla Binucci, Henry Förster, Julia Katheder, Alessandra Tappini
Evaluating Animation Parameters for Morphing Edge Drawings. CoRR (2023)
Carla Binucci, Emilio Di Giacomo, Michael Kaufmann, Giuseppe Liotta, Alessandra Tappini
k-Planar Placement and Packing of Δ-Regular Caterpillars. Int. J. Found. Comput. Sci. 34 (7) (2023)
Carla Binucci, Walter Didimo, Fabrizio Montecchiani
1-planarity testing and embedding: An experimental study. Comput. Geom. 108 (2023)
Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges (short paper). ICTCS (2023)
Carla Binucci, Giuseppe Di Battista, Walter Didimo, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini
Nonplanar Graph Drawings with k Vertices per Face. WG (2023)
Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges. CoRR (2023)
Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini
Min-k-planar Drawings of Graphs. GD (1) (2023)
Carla Binucci, Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Fabrizio Montecchiani
Placing Arrows in Directed Graph Layouts: Algorithms and Experiments. Comput. Graph. Forum 41 (1) (2022)
Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Antonios Symvonis
On the Complexity of the Storyplan Problem. GD (2022)
Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter
On Turn-Regular Orthogonal Representations. J. Graph Algorithms Appl. 26 (3) (2022)
Carla Binucci, Walter Didimo, Maurizio Patrignani
st-Orientations with Few Transitive Edges. CoRR (2022)
Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Antonios Symvonis
On the Complexity of the Storyplan Problem. CoRR (2022)
Carla Binucci, Walter Didimo, Maurizio Patrignani
st-Orientations with Few Transitive Edges. GD (2022)
Carla Binucci, Emilio Di Giacomo, Giuseppe Liotta, Alessandra Tappini
Quasi-upward Planar Drawings with Minimum Curve Complexity. Graph Drawing (2021)
Carla Binucci, Emilio Di Giacomo, Giuseppe Liotta, Alessandra Tappini
Quasi-upward Planar Drawings with Minimum Curve Complexity. CoRR (2021)
Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter
On Turn-Regular Orthogonal Representations. Graph Drawing (2020)
Carla Binucci, Emilio Di Giacomo, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Vera Sacristán, Stephen K. Wismath
Colored anchored visibility representations in 2D and 3D space. Comput. Geom. 89 (2020)
Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter
On Turn-Regular Orthogonal Representations. CoRR (2020)
Carla Binucci, Walter Didimo, Fabrizio Montecchiani
An Experimental Study of a 1-Planarity Testing and Embedding Algorithm. WALCOM (2020)
Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo, Tamara Mchedlidze, Maurizio Patrignani
Upward Book Embeddings of st-Graphs. CoRR (2019)
Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo, Tamara Mchedlidze, Maurizio Patrignani
Upward Book Embeddings of st-Graphs. SoCG (2019)
Carla Binucci, Walter Didimo, Fabrizio Montecchiani
An Experimental Study of a 1-planarity Testing and Embedding Algorithm. CoRR (2019)
Michael A. Bekos, Carla Binucci, Michael Kaufmann, Chrysanthi N. Raftopoulou, Antonios Symvonis, Alessandra Tappini
Coloring outerplanar graphs and planar 3-trees with small monochromatic components. CoRR (2019)
Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath
Visibility representations of boxes in 2.5 dimensions. Comput. Geom. 72 (2018)
Carla Binucci, Emilio Di Giacomo, Md. Iqbal Hossain, Giuseppe Liotta
1-page and 2-page drawings with bounded number of crossings per edge. Eur. J. Comb. 68 (2018)
Carla Binucci, Markus Chimani, Walter Didimo, Martin Gronemann, Karsten Klein, Jan Kratochvíl, Fabrizio Montecchiani, Ioannis G. Tollis
Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus. J. Graph Algorithms Appl. 21 (1) (2017)
Carla Binucci, Felice De Luca, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
Designing the Content Analyzer of a Travel Recommender System. Expert Syst. Appl. 87 (2017)
Carla Binucci, Walter Didimo
Computing Quasi-Upward Planar Drawings of Mixed Graphs. Comput. J. 59 (1) (2016)
Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath
Visibility Representations of Boxes in 2.5 Dimensions. CoRR (2016)
Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath
Visibility Representations of Boxes in 2.5 Dimensions. Graph Drawing (2016)
Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini
Partial edge drawing: Homogeneity is more important than crossings and ink. IISA (2016)
Carla Binucci, Walter Didimo, Enrico Spataro
Fully dynamic semantic word clouds. IISA (2016)
Carla Binucci, Markus Chimani, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
Placing Arrows in Directed Graph Drawings. CoRR (2016)
Carla Binucci, Markus Chimani, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
Placing Arrows in Directed Graph Drawings. Graph Drawing (2016)
Patrizio Angelini, Carla Binucci, Giordano Da Lozzo, Walter Didimo, Luca Grilli, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis
Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs. Comput. Geom. 50 (2015)
Carla Binucci, Markus Chimani, Walter Didimo, Martin Gronemann, Karsten Klein, Jan Kratochvíl, Fabrizio Montecchiani, Ioannis G. Tollis
2-Layer Fan-Planarity: From Caterpillar to Stegosaurus. Graph Drawing (2015)
Carla Binucci, Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Maurizio Patrignani, Antonios Symvonis, Ioannis G. Tollis
Fan-planarity: Properties and complexity. Theor. Comput. Sci. 589 (2015)
Carla Binucci, Emilio Di Giacomo, Md. Iqbal Hossain, Giuseppe Liotta
1-Page and 2-Page Drawings with Bounded Number of Crossings per Edge. IWOCA (2015)
Carla Binucci, Felice De Luca, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
VisFLOWer: Visual analysis of touristic flows. IISA (2015)
Carla Binucci, Walter Didimo
Quasi-Upward Planar Drawings of Mixed Graphs with Few Bends: Heuristics and Exact Methods. WALCOM (2014)
Carla Binucci, Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis
Fan-Planar Graphs: Combinatorial Properties and Complexity Results. Graph Drawing (2014)
Carla Binucci, Walter Didimo, Maurizio Patrignani
Upward and quasi-upward planarity testing of embedded mixed graphs. Theor. Comput. Sci. 526 (2014)
Carla Binucci, Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis
Properties and Complexity of Fan-Planarity. CoRR (2014)
Patrizio Angelini, Carla Binucci, Giordano Da Lozzo, Walter Didimo, Luca Grilli, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis
Drawing Non-Planar Graphs with Crossing-Free Subgraphs. Graph Drawing (2013)
Patrizio Angelini, Carla Binucci, Giordano Da Lozzo, Walter Didimo, Luca Grilli, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis
Drawings of Non-planar Graphs with Crossing-free Subgraphs. CoRR (2013)
Carla Binucci, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Mariano Sartore
TRART: A system to support territorial policies. Intelligent Environments (Workshops) (2013)
Carla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis, Katharina Anna Zweig
Drawing trees in a streaming model. Inf. Process. Lett. 112 (11) (2012)
Patrizio Angelini, Carla Binucci, William S. Evans, Ferran Hurtado, Giuseppe Liotta, Tamara Mchedlidze, Henk Meijer, Yoshio Okamoto
Universal Point Subsets for Planar Graphs. ISAAC (2012)
Carla Binucci, Emilio Di Giacomo, Walter Didimo, Aimal Rextin
Switch-Regular Upward Planarity Testing of Directed Trees. J. Graph Algorithms Appl. 15 (5) (2011)
Carla Binucci, Walter Didimo
Upward Planarity Testing of Embedded Mixed Graphs. Graph Drawing (2011)
Carla Binucci, Emilio Di Giacomo, Walter Didimo, Aimal Rextin
Switch-Regular Upward Planar Embeddings of Trees. WALCOM (2010)
Carla Binucci, Emilio Di Giacomo, Walter Didimo, Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G. Kobourov, Giuseppe Liotta
Upward straight-line embeddings of directed graphs into point sets. Comput. Geom. 43 (2) (2010)
Carla Binucci, Emilio Di Giacomo, Walter Didimo, Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G. Kobourov, Giuseppe Liotta
On Directed Graphs with an Upward Straight-line. CCCG (2009)
Carla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis, Katharina Anna Zweig
Drawing Trees in a Streaming Model. Graph Drawing (2009)
Carla Binucci, Walter Didimo, Francesco Giordano
Maximum upward planar subgraphs of embedded planar digraphs. Comput. Geom. 41 (3) (2008)
Carla Binucci, Walter Didimo, Francesco Giordano
Maximum Upward Planar Subgraphs of Embedded Planar Digraphs. Graph Drawing (2007)
Melanie Badent, Carla Binucci, Emilio Di Giacomo, Walter Didimo, Stefan Felsner, Francesco Giordano, Jan Kratochvíl, Pietro Palladino, Maurizio Patrignani, Francesco Trotta
Homothetic Triangle Contact Representations of Planar Graphs. CCCG (2007)
Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato
Orthogonal drawings of graphs with vertex and edge labels. Comput. Geom. 32 (2) (2005)
Carla Binucci, Walter Didimo
Experiments on Area Compaction Algorithms for Orthogonal Drawings. CCCG (2005)
Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato
Computing Labeled Orthogonal Drawings. Graph Drawing (2002)
Carla Binucci, Walter Didimo
A Software System for Computing Labeled Orthogonal Drawings of Graphs. Electron. Notes Theor. Comput. Sci. 72 (2) (2002)
Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato
Labeling Heuristics for Orthogonal Drawings. Graph Drawing (2001)