Weakly leveled planarity with bounded span

DOI10.1016/J.TCS.2026.115811MaRDI QIDQ6835786zbMATH OpenFDO

Authors Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Ignaz Rutter, Ioannis G. Tollis

Publication date 30 March 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.115811

zbMATH Keywords

edge spangraph drawingedge-length ratioleveled planar graphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 1693470 (Why is no real title available?)
• scientific article; zbMATH DE number 2084287 (Why is no real title available?)
• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• scientific article; zbMATH DE number 3575612 (Why is no real title available?)
• scientific article; zbMATH DE number 2159655 (Why is no real title available?)
• scientific article; zbMATH DE number 1377359 (Why is no real title available?)
• scientific article; zbMATH DE number 4121438 (Why is no real title available?)
• scientific article; zbMATH DE number 6254006 (Why is no real title available?)
• scientific article; zbMATH DE number 3315017 (Why is no real title available?)
• scientific article; zbMATH DE number 3047038 (Why is no real title available?)
• A Note on Minimum-Area Straight-Line Drawings of Planar Graphs
• A note on optimal area algorithms for upward drawings of binary trees
• A partial k-arboretum of graphs with bounded treewidth
• Algorithms for plane representations of acyclic digraphs
• Convex drawings of 3-connected plane graphs
• Drawing Graphs in the Plane with High Resolution
• Drawing planar graphs using the canonical ordering
• Exact crossing number parameterized by vertex cover
• Graph Drawing
• Height-preserving transformations of planar graph drawings
• Hierarchies and planarity theory
• How to Draw a Graph
• How to draw a planar graph on a grid
• Improved lower bounds on the area requirements of series-parallel graphs
• Kernelization. Theory of parameterized preprocessing
• Laying Out Graphs Using Queues
• Level-planar drawings with few slopes
• Level-planar drawings with few slopes
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• On edge-length ratios of partial 2-trees
• On the Angular Resolution of Planar Graphs
• On the Edge-Length Ratio of 2-Trees
• On the edge-length ratio of outerplanar graphs
• On the edge-length ratio of outerplanar graphs
• On the edge-length ratio of planar graphs
• On the parameterized complexity of layered graph drawing
• On the planar edge-length ratio of planar graphs
• On the upward book thickness problem: combinatorial and complexity results
• On the upward book thickness problem: combinatorial and complexity results
• Parameterized Algorithms for Queue Layouts
• Parameterized algorithms for book embedding problems
• Parameterized algorithms for book embedding problems
• Parameterized algorithms for queue layouts
• Parameterized algorithms for upward planarity
• Parameterized analysis and crossing minimization problems
• Planar drawings with few slopes of Halin graphs and nested pseudotrees
• Planar drawings with few slopes of Halin graphs and nested pseudotrees
• Planar graphs have bounded queue-number
• Planar graphs, via well-orderly maps and trees
• Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
• Square-contact representations of partial 2-trees and triconnected simply-nested graphs
• Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
• Straight-line drawing algorithms for hierarchical graphs and clustered graphs
• Track layouts, layered path decompositions, and leveled planarity
• Tree drawings revisited

This page was built for publication: Weakly leveled planarity with bounded span

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6835786)