Carla Binucci

From MaRDI portal
Person:436545

Available identifiers

zbMath Open binucci.carlaDBLP19/2484WikidataQ62053788 ScholiaQ62053788MaRDI QIDQ436545

List of research outcomes





PublicationDate of PublicationType
On the parameterized complexity of computing \(st\)-orientations with few transitive edges2024-12-03Paper
Min-\(k\)-planar drawings of graphs2024-10-08Paper
Min-\(k\)-planar drawings of graphs2024-06-21Paper
Evaluating animation parameters for morphing edge drawings2024-06-21Paper
Nonplanar Graph Drawings with k Vertices per Face2024-05-03Paper
$st$-Orientations with Few Transitive Edges2023-12-20Paper
Upward book embeddability of \(st\)-graphs: complexity and algorithms2023-12-13Paper
k-Planar Placement and Packing of Δ-Regular Caterpillars2023-11-16Paper
On the complexity of the storyplan problem2023-10-24Paper
\(st\)-orientations with few transitive edges2023-08-16Paper
On the complexity of the storyplan problem2023-08-16Paper
On Turn-Regular Orthogonal Representations2022-11-14Paper
1-planarity testing and embedding: an experimental study2022-10-06Paper
Upward Book Embeddings of st-Graphs2022-07-18Paper
Quasi-upward planar drawings with minimum curve complexity2022-07-01Paper
10 reasons to get interested in graph drawing2022-02-16Paper
On Turn-Regular Orthogonal Representations2021-12-01Paper
Colored anchored visibility representations in 2D and 3D space2020-10-23Paper
An experimental study of a 1-planarity testing and embedding algorithm2020-07-22Paper
Coloring outerplanar graphs and planar 3-trees with small monochromatic components2019-11-25Paper
Visibility representations of boxes in 2.5 dimensions2018-10-31Paper
1-page and 2-page drawings with bounded number of crossings per edge2017-11-14Paper
Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus2017-04-05Paper
Visibility representations of boxes in 2.5 dimensions2017-02-21Paper
Placing Arrows in Directed Graph Drawings2017-02-21Paper
2-Layer Fan-Planarity: From Caterpillar to Stegosaurus2017-02-10Paper
1-Page and 2-Page Drawings with Bounded Number of Crossings per Edge2016-04-04Paper
Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs2016-01-15Paper
Fan-planarity: properties and complexity2015-06-01Paper
Fan-Planar Graphs: Combinatorial Properties and Complexity Results2015-01-07Paper
Upward and quasi-upward planarity testing of embedded mixed graphs2014-03-13Paper
Quasi-Upward Planar Drawings of Mixed Graphs with Few Bends: Heuristics and Exact Methods2014-02-18Paper
Drawing Non-Planar Graphs with Crossing-Free Subgraphs2013-12-20Paper
Switch-regular upward planarity testing of directed trees2013-11-28Paper
Universal Point Subsets for Planar Graphs2013-03-21Paper
Drawing trees in a streaming model2012-07-25Paper
Upward Planarity Testing of Embedded Mixed Graphs2012-03-09Paper
Drawing Trees in a Streaming Model2010-04-27Paper
Switch-Regular Upward Planar Embeddings of Trees2010-02-09Paper
Upward straight-line embeddings of directed graphs into point sets2009-11-16Paper
Maximum upward planar subgraphs of embedded planar digraphs2008-09-19Paper
Maximum Upward Planar Subgraphs of Embedded Planar Digraphs2008-03-25Paper
Orthogonal drawings of graphs with vertex and edge labels2005-11-07Paper
https://portal.mardi4nfdi.de/entity/Q30437122004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44222632003-09-03Paper

Research outcomes over time

This page was built for person: Carla Binucci