default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarla Binucci
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j23]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: 68828-68846 (2024)- [j22]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: 103466 (2024) - [j21]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. J. Graph Algorithms Appl. 28(2): 1-35 (2024) - 2023
- [j20]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): 3521-3571 (2023) - [j19]Carla Binucci, Walter Didimo, Fabrizio Montecchiani:
1-planarity testing and embedding: An experimental study. Comput. Geom. 108: 101900 (2023) - [j18]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): 875-902 (2023) - [j17]Carla Binucci, Walter Didimo, Maurizio Patrignani:
st-Orientations with Few Transitive Edges. J. Graph Algorithms Appl. 27(8): 625-650 (2023) - [c33]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: 39-52 - [c32]Carla Binucci, Henry Förster, Julia Katheder, Alessandra Tappini:
Evaluating Animation Parameters for Morphing Edge Drawings. GD (1) 2023: 246-262 - [c31]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: 98-103 - [c30]Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli:
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges. MFCS 2023: 18:1-18:15 - [c29]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: 86-100 - [i15]Carla Binucci, Emilio Di Giacomo, Michael Kaufmann, Giuseppe Liotta, Alessandra Tappini:
k-planar Placement and Packing of Δ-regular Caterpillars. CoRR abs/2301.01226 (2023) - [i14]Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli:
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges. CoRR abs/2306.03196 (2023) - [i13]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 abs/2308.13401 (2023) - [i12]Carla Binucci, Henry Förster, Julia Katheder, Alessandra Tappini:
Evaluating Animation Parameters for Morphing Edge Drawings. CoRR abs/2309.00456 (2023) - 2022
- [j16]Carla Binucci, Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Fabrizio Montecchiani:
Placing Arrows in Directed Graph Layouts: Algorithms and Experiments. Comput. Graph. Forum 41(1): 364-376 (2022) - [j15]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): 285-306 (2022) - [c28]Carla Binucci, Walter Didimo, Maurizio Patrignani:
st-Orientations with Few Transitive Edges. GD 2022: 201-216 - [c27]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: 304-318 - [i11]Carla Binucci, Walter Didimo, Maurizio Patrignani:
st-Orientations with Few Transitive Edges. CoRR abs/2208.11414 (2022) - [i10]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 abs/2209.00453 (2022) - 2021
- [c26]Carla Binucci, Emilio Di Giacomo, Giuseppe Liotta, Alessandra Tappini:
Quasi-upward Planar Drawings with Minimum Curve Complexity. GD 2021: 195-209 - [i9]Carla Binucci, Emilio Di Giacomo, Giuseppe Liotta, Alessandra Tappini:
Quasi-upward Planar Drawings with Minimum Curve Complexity. CoRR abs/2108.10784 (2021) - 2020
- [j14]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: 101592 (2020) - [c25]Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter:
On Turn-Regular Orthogonal Representations. GD 2020: 250-264 - [c24]Carla Binucci, Walter Didimo, Fabrizio Montecchiani:
An Experimental Study of a 1-Planarity Testing and Embedding Algorithm. WALCOM 2020: 329-335 - [i8]Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter:
On Turn-Regular Orthogonal Representations. CoRR abs/2008.09002 (2020)
2010 – 2019
- 2019
- [c23]Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo, Tamara Mchedlidze, Maurizio Patrignani:
Upward Book Embeddings of st-Graphs. SoCG 2019: 13:1-13:22 - [p1]Carla Binucci, Ulrik Brandes, Tim Dwyer, Martin Gronemann, Reinhard von Hanxleden, Marc J. van Kreveld, Petra Mutzel, Marcus Schaefer, Falk Schreiber, Bettina Speckmann:
10 Reasons to Get Interested in Graph Drawing. Computing and Software Science 2019: 85-104 - [i7]Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo, Tamara Mchedlidze, Maurizio Patrignani:
Upward Book Embeddings of st-Graphs. CoRR abs/1903.07966 (2019) - [i6]Carla Binucci, Walter Didimo, Fabrizio Montecchiani:
An Experimental Study of a 1-planarity Testing and Embedding Algorithm. CoRR abs/1911.00573 (2019) - [i5]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 abs/1911.10863 (2019) - 2018
- [j13]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: 19-33 (2018) - [j12]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: 24-37 (2018) - 2017
- [j11]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: 199-208 (2017) - [j10]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): 81-102 (2017) - 2016
- [j9]Carla Binucci, Walter Didimo:
Computing Quasi-Upward Planar Drawings of Mixed Graphs. Comput. J. 59(1): 133-150 (2016) - [c22]Carla Binucci, Markus Chimani, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Placing Arrows in Directed Graph Drawings. GD 2016: 44-51 - [c21]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. GD 2016: 251-265 - [c20]Carla Binucci, Walter Didimo, Enrico Spataro:
Fully dynamic semantic word clouds. IISA 2016: 1-6 - [c19]Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini:
Partial edge drawing: Homogeneity is more important than crossings and ink. IISA 2016: 1-6 - [i4]Carla Binucci, Markus Chimani, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Placing Arrows in Directed Graph Drawings. CoRR abs/1608.08505 (2016) - [i3]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 abs/1608.08899 (2016) - 2015
- [j8]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: 34-48 (2015) - [j7]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: 76-86 (2015) - [c18]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. GD 2015: 281-294 - [c17]Carla Binucci, Felice De Luca, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
VisFLOWer: Visual analysis of touristic flows. IISA 2015: 1-6 - [c16]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: 38-51 - 2014
- [j6]Carla Binucci, Walter Didimo, Maurizio Patrignani:
Upward and quasi-upward planarity testing of embedded mixed graphs. Theor. Comput. Sci. 526: 75-89 (2014) - [c15]Carla Binucci, Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis:
Fan-Planar Graphs: Combinatorial Properties and Complexity Results. GD 2014: 186-197 - [c14]Carla Binucci, Walter Didimo:
Quasi-Upward Planar Drawings of Mixed Graphs with Few Bends: Heuristics and Exact Methods. WALCOM 2014: 298-309 - [i2]Carla Binucci, Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis:
Properties and Complexity of Fan-Planarity. CoRR abs/1406.5299 (2014) - 2013
- [c13]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. GD 2013: 292-303 - [c12]Carla Binucci, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Mariano Sartore:
TRART: A system to support territorial policies. Intelligent Environments (Workshops) 2013: 629-634 - [i1]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 abs/1308.6706 (2013) - 2012
- [j5]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): 418-422 (2012) - [c11]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: 423-432 - 2011
- [j4]Carla Binucci, Emilio Di Giacomo, Walter Didimo, Aimal Rextin:
Switch-Regular Upward Planarity Testing of Directed Trees. J. Graph Algorithms Appl. 15(5): 587-629 (2011) - [c10]Carla Binucci, Walter Didimo:
Upward Planarity Testing of Embedded Mixed Graphs. GD 2011: 427-432 - 2010
- [j3]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): 219-232 (2010) - [c9]Carla Binucci, Emilio Di Giacomo, Walter Didimo, Aimal Rextin:
Switch-Regular Upward Planar Embeddings of Trees. WALCOM 2010: 58-69
2000 – 2009
- 2009
- [c8]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: 21-24 - [c7]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. GD 2009: 292-303 - 2008
- [j2]Carla Binucci, Walter Didimo, Francesco Giordano:
Maximum upward planar subgraphs of embedded planar digraphs. Comput. Geom. 41(3): 230-246 (2008) - 2007
- [c6]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: 233-236 - [c5]Carla Binucci, Walter Didimo, Francesco Giordano:
Maximum Upward Planar Subgraphs of Embedded Planar Digraphs. GD 2007: 195-206 - 2005
- [j1]Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato:
Orthogonal drawings of graphs with vertex and edge labels. Comput. Geom. 32(2): 71-114 (2005) - [c4]Carla Binucci, Walter Didimo:
Experiments on Area Compaction Algorithms for Orthogonal Drawings. CCCG 2005: 113-116 - 2002
- [c3]Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato:
Computing Labeled Orthogonal Drawings. GD 2002: 66-73 - [c2]Carla Binucci, Walter Didimo:
A Software System for Computing Labeled Orthogonal Drawings of Graphs. GraBaTs 2002: 81-90 - 2001
- [c1]Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato:
Labeling Heuristics for Orthogonal Drawings. GD 2001: 139-153
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-27 20:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
