On the Topologies of Local Minimum Spanning Trees. - Pier Francesco Cortese; Giuseppe Di Battista; Fabrizio Frati; Luca Grilli 001; Katharina Anna Lehmann; Giuseppe Liotta; Maurizio Patrignani; Ioannis G. Tollis; Francesco Trotta (CAAN, 2006)

Embedding Graphs Simultaneously with Fixed Edges. - Fabrizio Frati (GD, 2006)

Three-Dimensional Drawings of Bounded Degree Trees. - Fabrizio Frati; Giuseppe Di Battista (GD, 2006)

Colored Simultaneous Geometric Embeddings. - Ulrik Brandes; Cesim Erten; J. Joseph Fowler; Fabrizio Frati; Markus Geyer; Carsten Gutwenger; Seok-Hee Hong 001; Michael Kaufmann 001; Stephen G. Kobourov; Giuseppe Liotta; Petra Mutzel; Antonios Symvonis (COCOON, 2007)

Straight-Line Orthogonal Drawings of Binary and Ternary Trees. - Fabrizio Frati (GD, 2007)

A Note on Minimum-Area Straight-Line Drawings of Planar Graphs. - Fabrizio Frati; Maurizio Patrignani (GD, 2007)

Packing and Squeezing Subgraphs into Planar Graphs. - Fabrizio Frati; Markus Geyer; Michael Kaufmann 001 (MFCS, 2007)

Non-convex Representations of Graphs. - Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani (GD, 2008)

Upward Straight-Line Embeddings of Directed Graphs into Point Sets. - Alejandro Estrella-Balderrama; Fabrizio Frati; Stephen G. Kobourov (WG, 2008)

A Lower Bound on the Area Requirements of Series-Parallel Graphs. - Fabrizio Frati (WG, 2008)

On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs. - Fabrizio Frati (Int. J. Comput. Geom. Appl., 2008)

C-Planarity of C-Connected Clustered Graphs. - Pier Francesco Cortese; Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani; Maurizio Pizzonia (J. Graph Algorithms Appl., 2008)

On Directed Graphs with an Upward Straight-line. - Carla Binucci; Emilio Di Giacomo; Walter Didimo; Alejandro Estrella-Balderrama; Fabrizio Frati; Stephen G. Kobourov; Giuseppe Liotta (CCCG, 2009)

Planar Packing of Diameter-Four Trees. - Fabrizio Frati (CCCG, 2009)

Splitting Clusters to Get C-Planarity. - Patrizio Angelini; Fabrizio Frati; Maurizio Patrignani (GD, 2009)

Small Area Drawings of Outerplanar Graphs. - Giuseppe Di Battista; Fabrizio Frati (Algorithmica, 2009)

Planar packing of trees and spider trees. - Fabrizio Frati; Markus Geyer; Michael Kaufmann 001 (Inf. Process. Lett., 2009)

How to draw a clustered tree. - Giuseppe Di Battista; Guido Drovandi; Fabrizio Frati (J. Discrete Algorithms, 2009)

Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces. - Giuseppe Di Battista; Fabrizio Frati (J. Graph Algorithms Appl., 2009)

Constrained Simultaneous and Near-Simultaneous Embeddings. - Fabrizio Frati; Michael Kaufmann 001; Stephen G. Kobourov (J. Graph Algorithms Appl., 2009)

On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features. - Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani (Theory Comput. Syst., 2009)

Upward Geometric Graph Embeddings into Point Sets. - Patrizio Angelini; Fabrizio Frati; Markus Geyer; Michael Kaufmann 001; Tamara Mchedlidze; Antonios Symvonis (GD, 2010)

Improved Lower Bounds on the Area Requirements of Series-Parallel Graphs. - Fabrizio Frati (GD, 2010)

Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree. - Patrizio Angelini; Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani; Ignaz Rutter (IWOCA, 2010)

Crossings between Curves with Many Tangencies. - Jacob Fox; Fabrizio Frati; János Pach; Rom Pinchasi (WALCOM, 2010)

Upward straight-line embeddings of directed graphs into point sets. - Carla Binucci; Emilio Di Giacomo; Walter Didimo; Alejandro Estrella-Balderrama; Fabrizio Frati; Stephen G. Kobourov; Giuseppe Liotta (Comput. Geom., 2010)

Lower Bounds on the Area Requirements of Series-Parallel Graphs. - Fabrizio Frati (Discret. Math. Theor. Comput. Sci., 2010)

A note on isosceles planar graph drawing. - Fabrizio Frati (Inf. Process. Lett., 2010)

An Algorithm to Construct Greedy Drawings of Triangulations. - Patrizio Angelini; Fabrizio Frati; Luca Grilli 001 (J. Graph Algorithms Appl., 2010)

Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area. - Patrizio Angelini; Giuseppe Di Battista; Walter Didimo; Fabrizio Frati; Seok-Hee Hong 001; Michael Kaufmann 001; Giuseppe Liotta; Anna Lubiw (EGC, 2011)

Colored Simultaneous Geometric Embeddings and Universal Pointsets. - Ulrik Brandes; Cesim Erten; Alejandro Estrella-Balderrama; J. Joseph Fowler; Fabrizio Frati; Markus Geyer; Carsten Gutwenger; Seok-Hee Hong 001; Michael Kaufmann 001; Stephen G. Kobourov; Giuseppe Liotta; Petra Mutzel; et al. (Algorithmica, 2011)

Polynomial area bounds for MST embeddings of trees. - Fabrizio Frati; Michael Kaufmann 001 (Comput. Geom., 2011)

Straight-Line Rectangular Drawings of Clustered Graphs. - Patrizio Angelini; Fabrizio Frati; Michael Kaufmann 001 (Discret. Comput. Geom., 2011)

On the Perspectives Opened by Right Angle Crossing Drawings. - Patrizio Angelini; Luca Cittadini; Walter Didimo; Fabrizio Frati; Giuseppe Di Battista; Michael Kaufmann 001; Antonios Symvonis (J. Graph Algorithms Appl., 2011)

Multilevel Drawings of Clustered Graphs. - Fabrizio Frati (COCOON, 2012)

On Representing Graphs by Touching Cuboids. - David Bremner; William S. Evans; Fabrizio Frati; Laurie J. Heyer; Stephen G. Kobourov; William J. Lenhart; Giuseppe Liotta; David Rappaport; Sue Whitesides (GD, 2012)

Theory and Practice of Graph Drawing. - Tim Dwyer; Fabrizio Frati; Seok-Hee Hong 001; Karsten Klein 001 (GD, 2012)

Point-Set Embeddability of 2-Colored Trees. - Fabrizio Frati; Marc Glisse; William J. Lenhart; Giuseppe Liotta; Tamara Mchedlidze; Rahnuma Islam Nishat (GD, 2012)

Straight-line drawings of outerplanar graphs in O(dn log n) area. - Fabrizio Frati (Comput. Geom., 2012)

Beyond Clustered Planarity - Patrizio Angelini; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Vincenzo Roselli (CoRR, 2012)

Acyclically 3-colorable planar graphs. - Patrizio Angelini; Fabrizio Frati (J. Comb. Optim., 2012)

Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph. - Patrizio Angelini; Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani; Ignaz Rutter (J. Discrete Algorithms, 2012)

Monotone Drawings of Graphs. - Patrizio Angelini; Enrico Colasante; Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani (J. Graph Algorithms Appl., 2012)

Succinct greedy drawings do not always exist. - Patrizio Angelini; Giuseppe Di Battista; Fabrizio Frati (Networks, 2012)

Nonconvex Representations of Plane Graphs. - Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani (SIAM J. Discret. Math., 2012)

Universal Point Sets for Planar Graph Drawings with Circular Arcs. - Patrizio Angelini; David Eppstein; Fabrizio Frati; Michael Kaufmann 001; Sylvain Lazard; Tamara Mchedlidze; Monique Teillaud; Alexander Wolff 001 (CCCG, 2013)

Morphing Planar Graph Drawings Efficiently. - Patrizio Angelini; Fabrizio Frati; Maurizio Patrignani; Vincenzo Roselli (GD, 2013)

Strip Planarity Testing. - Patrizio Angelini; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati (GD, 2013)

SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs. - Patrizio Angelini; William S. Evans; Fabrizio Frati; Joachim Gudmundsson (ISAAC, 2013)

Morphing Planar Graph Drawings with a Polynomial Number of Steps. - Soroush Alamdari; Patrizio Angelini; Timothy M. Chan; Giuseppe Di Battista; Fabrizio Frati; Anna Lubiw; Maurizio Patrignani; Vincenzo Roselli; Sahil Singla 001; Bryan T. Wilkinson (SODA, 2013)

Nonrepetitive Colourings of Planar Graphs with O(log n) Colours. - Vida Dujmovic; Gwenaël Joret; Fabrizio Frati; David R. Wood (Electron. J. Comb., 2013)

Orthogeodesic point-set embedding of trees. - Emilio Di Giacomo; Fabrizio Frati; Radoslav Fulek; Luca Grilli 001; Marcus Krug (Comput. Geom., 2013)

Morphing Planar Graphs Drawings Efficiently. - Patrizio Angelini; Fabrizio Frati; Maurizio Patrignani; Vincenzo Roselli (CoRR, 2013)

Simultaneous Embedding of Embedded Planar graphs. - Patrizio Angelini; Giuseppe Di Battista; Fabrizio Frati (Int. J. Comput. Geom. Appl., 2013)

On the Page Number of Upward Planar Directed Acyclic Graphs. - Fabrizio Frati; Radoslav Fulek; Andres J. Ruiz-Vargas (J. Graph Algorithms Appl., 2013)

On the Queue Number of Planar Graphs. - Giuseppe Di Battista; Fabrizio Frati; János Pach (SIAM J. Comput., 2013)

Morphing Planar Graph Drawings Optimally. - Patrizio Angelini; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani; Vincenzo Roselli (ICALP (1), 2014)

On the area requirements of Euclidean minimum spanning trees. - Patrizio Angelini; Till Bruckdorfer; Marco Chiesa; Fabrizio Frati; Michael Kaufmann 001; Claudio Squarcella (Comput. Geom., 2014)

On the Complexity of Clustered-Level Planarity and T-Level Planarity. - Patrizio Angelini; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Vincenzo Roselli (CoRR, 2014)

A Survey on Small-Area Planar Graph Drawing. - Giuseppe Di Battista; Fabrizio Frati (CoRR, 2014)

Universal Point Sets for Drawing Planar Graphs with Circular Arcs. - Patrizio Angelini; David Eppstein; Fabrizio Frati; Michael Kaufmann 001; Sylvain Lazard; Tamara Mchedlidze; Monique Teillaud; Alexander Wolff 001 (J. Graph Algorithms Appl., 2014)

Multilayer Drawings of Clustered Graphs. - Fabrizio Frati (J. Graph Algorithms Appl., 2014)

On the Upward Planarity of Mixed Plane Graphs. - Fabrizio Frati; Michael Kaufmann 001; János Pach; Csaba D. Tóth; David R. Wood (J. Graph Algorithms Appl., 2014)

On the number of upward planar orientations of maximal planar graphs. - Fabrizio Frati; Joachim Gudmundsson; Emo Welzl (Theor. Comput. Sci., 2014)

Optimal Morphs of Convex Drawings. - Patrizio Angelini; Giordano Da Lozzo; Fabrizio Frati; Anna Lubiw; Maurizio Patrignani; Vincenzo Roselli (SoCG, 2015)

On the Relationship Between Map Graphs and Clique Planar Graphs. - Patrizio Angelini; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani; Ignaz Rutter (GD, 2015)

Augmenting Graphs to Minimize the Diameter. - Fabrizio Frati; Serge Gaspers; Joachim Gudmundsson; Luke Mathieson (Algorithmica, 2015)

Relaxing the constraints of clustered planarity. - Patrizio Angelini; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani; Vincenzo Roselli (Comput. Geom., 2015)

Testing Cyclic Level and Simultaneous Level Planarity. - Patrizio Angelini; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani; Ignaz Rutter (CoRR, 2015)

Compatible Connectivity Augmentation of Planar Disconnected Graphs. - Greg Aloupis; Luis Barba; Paz Carmi; Vida Dujmovic; Fabrizio Frati; Pat Morin (Discret. Comput. Geom., 2015)

Drawing Partially Embedded and Simultaneously Planar Graphs. - Timothy M. Chan; Fabrizio Frati; Carsten Gutwenger; Anna Lubiw; Petra Mutzel; Marcus Schaefer 001 (J. Graph Algorithms Appl., 2015)

Increasing-Chord Graphs On Point Sets. - Hooman Reisi Dehkordi; Fabrizio Frati; Joachim Gudmundsson (J. Graph Algorithms Appl., 2015)

Testing Planarity of Partially Embedded Graphs. - Patrizio Angelini; Giuseppe Di Battista; Fabrizio Frati; Vít Jelínek; Jan Kratochvíl; Maurizio Patrignani; Ignaz Rutter (ACM Trans. Algorithms, 2015)

The importance of being proper: (In clustered-level planarity and T-level planarity). - Patrizio Angelini; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Vincenzo Roselli (Theor. Comput. Sci., 2015)

Beyond Level Planarity. - Patrizio Angelini; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani; Ignaz Rutter (GD, 2016)

SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs. - Patrizio Angelini; William S. Evans; Fabrizio Frati; Joachim Gudmundsson (J. Graph Theory, 2016)

Clustered Graph Drawing. - Fabrizio Frati (Encyclopedia of Algorithms, 2016)

Strip Planarity Testing for Embedded Planar Graphs. - Patrizio Angelini; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati (Algorithmica, 2017)

A Lower Bound on the Diameter of the Flip Graph. - Fabrizio Frati (Electron. J. Comb., 2017)

Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017). - Fabrizio Frati; Kwan-Liu Ma (CoRR, 2017)

Intersection-Link Representations of Graphs. - Patrizio Angelini; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani; Ignaz Rutter (J. Graph Algorithms Appl., 2017)

How to Morph Planar Graph Drawings. - Soroush Alamdari; Patrizio Angelini; Fidel Barrera-Cruz; Timothy M. Chan; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Penny Haxell; Anna Lubiw; Maurizio Patrignani; Vincenzo Roselli; Sahil Singla 001; et al. (SIAM J. Comput., 2017)

On the Area Requirements of Straight-Line Orthogonal Drawings of Ternary Trees. - Barbara Covella; Fabrizio Frati; Maurizio Patrignani (IWOCA, 2018)

Stack and Queue Layouts via Layered Separators. - Vida Dujmovic; Fabrizio Frati (J. Graph Algorithms Appl., 2018)

Guest editors' foreword. - Fabrizio Frati; Kwan-Liu Ma (J. Graph Algorithms Appl., 2018)

Computing NodeTrix Representations of Clustered Graphs. - Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani (J. Graph Algorithms Appl., 2018)

Drawing planar graphs with many collinear vertices. - Giordano Da Lozzo; Vida Dujmovic; Fabrizio Frati; Tamara Mchedlidze; Vincenzo Roselli (J. Comput. Geom., 2018)

On the Edge-Length Ratio of Planar Graphs. - Manuel Borrazzo; Fabrizio Frati (GD, 2019)

Graph Stories in Small Area. - Manuel Borrazzo; Giordano Da Lozzo; Fabrizio Frati; Maurizio Patrignani (GD, 2019)

Advances on Testing C-Planarity of Embedded Flat Clustered Graphs. - Markus Chimani; Giuseppe Di Battista; Fabrizio Frati; Karsten Klein 001 (Int. J. Found. Comput. Sci., 2019)

Pole Dancing: 3D Morphs for Tree Drawings. - Elena Arseneva; Prosenjit Bose; Pilar Cano; Anthony D'Angelo; Vida Dujmovic; Fabrizio Frati; Stefan Langerman; Alessandra Tappini (J. Graph Algorithms Appl., 2019)

Simultaneous Embeddings with Few Bends and Crossings. - Fabrizio Frati; Michael Hoffmann 001; Vincent Kusters (J. Graph Algorithms Appl., 2019)

On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs. - Giordano Da Lozzo; Anthony D'Angelo; Fabrizio Frati (COCOON, 2020)

Schematic Representation of Biconnected Graphs. - Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani; Marco Tais (GD, 2020)

Upward Planar Morphs. - Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani; Vincenzo Roselli (Algorithmica, 2020)

Extending upward planar graph drawings. - Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati (Comput. Geom., 2020)

On Planar Greedy Drawings of 3-Connected Planar Graphs. - Giordano Da Lozzo; Anthony D'Angelo; Fabrizio Frati (Discret. Comput. Geom., 2020)

LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs. - Fabrizio Frati; Maurizio Patrignani; Vincenzo Roselli (J. Comput. Syst. Sci., 2020)

Graph Stories in Small Area. - Manuel Borrazzo; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani (J. Graph Algorithms Appl., 2020)

On the planar edge-length ratio of planar graphs. - Manuel Borrazzo; Fabrizio Frati (J. Comput. Geom., 2020)

Beyond level planarity: Cyclic, torus, and simultaneous level planarity. - Patrizio Angelini; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani; Ignaz Rutter (Theor. Comput. Sci., 2020)

Planar Straight-Line Realizations of 2-Trees with Prescribed Edge Lengths. - Carlos Alegría; Manuel Borrazzo; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani (GD, 2021)

2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees. - Patrizio Angelini; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani (SODA, 2021)

Every Collinear Set in a Planar Graph is Free. - Vida Dujmovic; Fabrizio Frati; Daniel Gonçalves 001; Pat Morin; Günter Rote (Discret. Comput. Geom., 2021)

Schematic Representation of Large Biconnected Graphs. - Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani; Marco Tais (J. Graph Algorithms Appl., 2021)

On the area requirements of planar straight-line orthogonal drawings of ternary trees. - Barbara Covella; Fabrizio Frati; Maurizio Patrignani (Theor. Comput. Sci., 2021)

Parameterized Algorithms for Upward Planarity. - Steven Chaplick; Emilio Di Giacomo; Fabrizio Frati; Robert Ganian; Chrysanthi N. Raftopoulou; Kirill Simonov (SoCG, 2022)

Testing Upward Planarity of Partial 2-Trees. - Steven Chaplick; Emilio Di Giacomo; Fabrizio Frati; Robert Ganian; Chrysanthi N. Raftopoulou; Kirill Simonov (GD, 2022)

Planar rectilinear drawings of outerplanar graphs in linear time. - Fabrizio Frati (Comput. Geom., 2022)

Drawing Graphs as Spanners. - Oswin Aichholzer; Manuel Borrazzo; Prosenjit Bose; Jean Cardinal; Fabrizio Frati; Pat Morin; Birgit Vogtenhuber (Discret. Comput. Geom., 2022)

How to Morph a Tree on a Small Grid. - Fidel Barrera-Cruz; Manuel Borrazzo; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani; Vincenzo Roselli (Discret. Comput. Geom., 2022)

Morphing Planar Graph Drawings Through 3D. - Kevin Buchin; William S. Evans; Fabrizio Frati; Irina Kostitsyna; Maarten Löffler; Tim Ophelders; Alexander Wolff 001 (Comput. Geom. Topol., 2023)

Recognizing DAGs with page-number 2 is NP-complete. - Michael A. Bekos; Giordano Da Lozzo; Fabrizio Frati; Martin Gronemann; Tamara Mchedlidze; Chrysanthi N. Raftopoulou (Theor. Comput. Sci., 2023)

Universal geometric graphs. - Fabrizio Frati; Michael Hoffmann 001; Csaba D. Tóth (Comb. Probab. Comput., 2023)

Weakly Leveled Planarity with Bounded Span. - Michael A. Bekos; Giordano Da Lozzo; Fabrizio Frati; Siddharth Gupta 002; Philipp Kindermann; Giuseppe Liotta; Ignaz Rutter; Ioannis G. Tollis (GD, 2024)

Large Induced Subgraphs of Bounded Degree in Outerplanar and Planar Graphs. - Marco D'Elia; Fabrizio Frati (CoRR, 2024)

Testing the planar straight-line realizability of 2-trees with prescribed edge lengths. - Carlos Alegría; Manuel Borrazzo; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani (Eur. J. Comb., 2024)

Unit-length Rectangular Drawings of Graphs. - Carlos Alegría; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Fabrizio Grosso; Maurizio Patrignani (J. Graph Algorithms Appl., 2024)

Upward planarity testing of biconnected outerplanar DAGs solves partition. - Fabrizio Frati (Theor. Comput. Sci., 2024)

Finding a Shortest Curve That Separates Few Objects from Many. - Therese Biedl; Éric Colin de Verdière; Fabrizio Frati; Anna Lubiw; Günter Rote (SoCG, 2025)

On Planar Straight-Line Dominance Drawings. - Patrizio Angelini; Michael A. Bekos; Giuseppe Di Battista; Fabrizio Frati; Luca Grilli 001; Giacomo Ortali (WADS, 2025)

From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs. - Giuseppe Di Battista; Fabrizio Frati (Discret. Math. Theor. Comput. Sci., 2025)

Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs. - Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Fabrizio Grosso; Maurizio Patrignani (J. Graph Algorithms Appl., 2025)

Upward Pointset Embeddings of Planar st-Graphs. - Carlos Alegría-Galicia; Susanna Caroppo; Giordano Da Lozzo; Marco D'Elia; Giuseppe Di Battista; Fabrizio Frati; Fabrizio Grosso; Maurizio Patrignani (Algorithmica, 2025)