Fabrizio Montecchiani

From MaRDI portal
Person:290512

Available identifiers

zbMath Open montecchiani.fabrizioDBLP46/10267WikidataQ62053747 ScholiaQ62053747MaRDI QIDQ290512

List of research outcomes





PublicationDate of PublicationType
On the parameterized complexity of computing \(st\)-orientations with few transitive edges2024-12-03Paper
On the parameterized complexity of bend-minimum orthogonal planarity2024-10-24Paper
Strictly-convex drawings of 3-connected planar graphs2024-10-18Paper
Optimal-area visibility representations of outer-1-plane graphs2024-10-18Paper
Extending orthogonal planar graph drawings is fixed-parameter tractable2024-10-16Paper
On the parameterized complexity of bend-minimum orthogonal planarity2024-10-14Paper
Upward and orthogonal planarity are W[1]-hard parameterized by treewidth2024-10-14Paper
Planar drawings with few slopes of Halin graphs and nested pseudotrees2024-08-13Paper
On 1-bend upward point-set embeddings of \(st\)-digraphs2024-05-31Paper
Recognizing map graphs of bounded treewidth2024-05-27Paper
Convex grid drawings of planar graphs with constant edge-vertex resolution2024-02-23Paper
Recognizing map graphs of bounded treewidth2024-01-25Paper
Book embeddings of nonplanar graphs with small faces in few pages2023-11-02Paper
Book embeddings of \(k\)-framed graphs and \(k\)-map graphs2023-10-30Paper
On the complexity of the storyplan problem2023-10-24Paper
Strictly-convex drawings of 3-connected planar graphs2023-08-16Paper
On the complexity of the storyplan problem2023-08-16Paper
On the parameterized complexity of \(s\)-club cluster deletion problems2023-08-14Paper
On the parameterized complexity of s-club cluster deletion problems2023-08-01Paper
https://portal.mardi4nfdi.de/entity/Q61040722023-06-05Paper
On the upward book thickness problem: combinatorial and complexity results2023-04-27Paper
Geodesic obstacle representation of graphs2022-11-16Paper
Parameterized Algorithms for Queue Layouts2022-11-14Paper
1-planarity testing and embedding: an experimental study2022-10-06Paper
Convex grid drawings of planar graphs with constant edge-vertex resolution2022-08-30Paper
Universal slope sets for upward planar drawings2022-08-18Paper
Polyline Drawings with Topological Constraints2022-07-21Paper
A user study on hybrid graph visualizations2022-07-01Paper
Optimal-area visibility representations of outer-1-plane graphs2022-07-01Paper
On the upward book thickness problem: combinatorial and complexity results2022-07-01Paper
On morphing 1-planar drawings2022-06-08Paper
Planar drawings with few slopes of Halin graphs and nested pseudotrees2022-03-25Paper
Orthogonal planarity testing of bounded treewidth graphs2022-01-31Paper
Crossing numbers of beyond-planar graphs2021-12-01Paper
Parameterized Algorithms for Queue Layouts2021-12-01Paper
Storyline Visualizations with Ubiquitous Actors2021-12-01Paper
VAIM: Visual Analytics for Influence Maximization2021-12-01Paper
Grid drawings of graphs with constant edge-vertex resolution2021-09-17Paper
https://portal.mardi4nfdi.de/entity/Q50026932021-07-28Paper
Edge Partitions and Visibility Representations of 1-planar Graphs2021-07-22Paper
Generalized LR-drawings of trees2021-05-14Paper
Ortho-polygon visibility representations of 3-connected 1-plane graphs2021-03-18Paper
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles2021-01-19Paper
Parameterized Algorithms for Book Embedding Problems2020-12-18Paper
ChordLink: a new hybrid visualization model2020-10-26Paper
Crossing numbers of beyond-planar graphs2020-10-26Paper
Parameterized algorithms for book embedding problems2020-10-26Paper
Sketched representations and orthogonal planarity of bounded treewidth graphs2020-10-26Paper
1-bend upward planar slope number of SP-digraphs2020-10-23Paper
An experimental study of a 1-planarity testing and embedding algorithm2020-07-22Paper
Planar graphs of bounded degree have bounded queue number2020-01-30Paper
Polyline drawings with topological constraints2020-01-29Paper
Planar Graphs of Bounded Degree Have Bounded Queue Number2019-10-11Paper
Universal slope sets for 1-bend planar drawings2019-05-17Paper
Gap-Planar Graphs2019-02-20Paper
Edge partitions of optimal 2-plane and 3-plane graphs2019-02-20Paper
Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles2019-02-15Paper
Ortho-polygon visibility representations of 3-connected 1-plane graphs2019-02-15Paper
Universal slope sets for upward planar drawings2019-02-15Paper
Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation2019-01-11Paper
Edge partitions of optimal 2-plane and 3-plane graphs2018-11-22Paper
Visibility representations of boxes in 2.5 dimensions2018-10-31Paper
Embedding-preserving rectangle visibility representations of nonplanar graphs2018-10-30Paper
Gap-planar graphs2018-09-24Paper
A universal slope set for 1-bend planar drawings2018-08-13Paper
Ortho-polygon visibility representations of embedded graphs2018-07-25Paper
Bounded stub resolution for some maximal 1-planar graphs2018-06-05Paper
Drawing subcubic planar graphs with four slopes and optimal angular resolution2018-02-06Paper
New results on edge partitions of 1-plane graphs2018-02-06Paper
https://portal.mardi4nfdi.de/entity/Q31328532018-01-30Paper
On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs2018-01-04Paper
Progress on Partial Edge Drawings2017-10-12Paper
An annotated bibliography on 1-planarity2017-09-28Paper
On RAC drawings of 1-planar graphs2017-09-07Paper
On Guarding Orthogonal Polygons with Sliding Cameras2017-05-05Paper
Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus2017-04-05Paper
Vertex-Coloring with Defects2017-04-05Paper
On RAC drawings of 1-planar graphs2017-02-21Paper
Ortho-polygon visibility representations of embedded graphs2017-02-21Paper
Visibility representations of boxes in 2.5 dimensions2017-02-21Paper
1-Bend Upward Planar Drawings of SP-Digraphs2017-02-21Paper
A Distributed Multilevel Force-Directed Algorithm2017-02-21Paper
Placing Arrows in Directed Graph Drawings2017-02-21Paper
Recognizing and drawing IC-planar graphs2017-02-10Paper
A Million Edge Drawing for a Fistful of Dollars2017-02-10Paper
Kojaph: Visual Definition and Exploration of Patterns in Graph Databases2017-02-10Paper
2-Layer Fan-Planarity: From Caterpillar to Stegosaurus2017-02-10Paper
On partitioning the edges of 1-plane graphs2017-01-09Paper
Simultaneous Visibility Representations of Plane st-graphs Using L-shapes2016-10-21Paper
Simultaneous visibility representations of plane \(st\)-graphs using L-shapes2016-08-31Paper
Recognizing and drawing IC-planar graphs2016-06-01Paper
Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs2016-01-15Paper
Fast layout computation of clustered networks: algorithmic advances and experimental analysis2016-01-14Paper
Drawing Outer 1-planar Graphs with Few Slopes2016-01-07Paper
L-visibility drawings of IC-planar graphs2016-01-05Paper
Fan-planarity: properties and complexity2015-06-01Paper
Drawing Outer 1-planar Graphs with Few Slopes2015-01-07Paper
Fan-Planar Graphs: Combinatorial Properties and Complexity Results2015-01-07Paper
The Planar Slope Number of Subcubic Graphs2014-03-31Paper
1-Bend Orthogonal Partial Edge Drawing2014-03-24Paper
Drawing Non-Planar Graphs with Crossing-Free Subgraphs2013-12-20Paper
Exploring Complex Drawings via Edge Stratification2013-12-20Paper
Area requirement of graph drawings with few crossings per edge2013-07-31Paper
Progress on Partial Edge Drawings2013-04-03Paper
h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area2012-11-06Paper

Research outcomes over time

This page was built for person: Fabrizio Montecchiani