Cover Image

Weakly Leveled Planarity with Bounded Span

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bekos, Michael, Da Lozzo, Giordano, Frati, Fabrizio, Gupta, Siddharth, Kindermann, Philipp, Liotta, Giuseppe, Rutter, Ignaz, Tollis, Ioannis G.
Format:	Preprint
Published:	2024
Subjects:	Computational Geometry Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Upward-Planar Drawings with Bounded Span
by: Angelini, Patrizio, et al.
Published: (2026)

Upward Book Embeddings of Partitioned Digraphs
by: Da Lozzo, Giordano, et al.
Published: (2026)

Internally-Convex Drawings of Outerplanar Graphs in Small Area
by: Bekos, Michael A., et al.
Published: (2025)

On Planar Straight-Line Dominance Drawings
by: Angelini, Patrizio, et al.
Published: (2025)

Unit-length Rectangular Drawings of Graphs
by: Alegria, Carlos, et al.
Published: (2022)

Upward Pointset Embeddings of Planar st-Graphs
by: Alegria, Carlos, et al.
Published: (2024)

Exact Algorithms for Clustered Planarity with Linear Saturators
by: Da Lozzo, Giordano, et al.
Published: (2024)

Clustered Planarity Variants for Level Graphs
by: Fink, Simon D., et al.
Published: (2024)

Simple Realizability of Abstract Topological Graphs
by: Da Lozzo, Giordano, et al.
Published: (2024)

From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs
by: Di Battista, Giuseppe, et al.
Published: (2021)

Parameterized Complexity of Simultaneous Planarity
by: Fink, Simon D., et al.
Published: (2023)

Morphing Planar Graph Drawings Through 3D
by: Buchin, Kevin, et al.
Published: (2022)

Ranking and Unranking of the Planar Embeddings of a Planar Graph
by: Di Battista, Giuseppe, et al.
Published: (2024)

Circle graphs can be recognized in linear time
by: Paul, Christophe, et al.
Published: (2025)

Optimal Orthogonal Drawings in Linear Time
by: Didimo, Walter, et al.
Published: (2025)

Parameterized Linear Time Transitive Closure
by: Kritikakis, Giorgos, et al.
Published: (2024)

Quantum Algorithms for One-Sided Crossing Minimization
by: Caroppo, Susanna, et al.
Published: (2024)

Constrained Level Planarity is FPT with Respect to the Vertex Cover Number
by: Klemz, Boris, et al.
Published: (2024)

FPT Approximation Schemes for Min-Sum Radii and Min-Sum Diameters Clustering
by: Grandoni, Fabrizio, et al.
Published: (2026)

Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms
by: Caroppo, Susanna, et al.
Published: (2025)

On the Exponential Growth of Geometric Shapes
by: Almalki, Nada, et al.
Published: (2023)

Min-1-Planarity is NP-Hard
by: Okada, Yuto
Published: (2026)

2-Layer Fan-Planarity in Polynomial Time
by: Kobayashi, Yasuaki, et al.
Published: (2025)

Geometric Thickness of Multigraphs is $\exists \mathbb{R}$-complete
by: Förster, Henry, et al.
Published: (2023)

Incremental Planar Nearest Neighbor Queries with Optimal Query Time
by: Iacono, John, et al.
Published: (2025)

Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimension
by: Chan, Timothy M., et al.
Published: (2025)

Planar Length-Constrained Minimum Spanning Trees
by: Hershkowitz, D Ellis, et al.
Published: (2025)

Simple Construction of Greedy Trees and Greedy Permutations
by: Chubet, Oliver, et al.
Published: (2024)

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
by: Bhore, Sujoy, et al.
Published: (2024)

Exact Subquadratic Algorithm for Many-to-Many Matching on Planar Point Sets with Integer Coordinates
by: Park, Seongbin, et al.
Published: (2026)

The Impossibility of Simultaneous Time and I/O Optimality for The Planar Maxima and Convex Hull Problems
by: Afshani, Peyman, et al.
Published: (2026)

O(1)-Distortion Planar Emulators for String Graphs
by: Chang, Hsien-Chih, et al.
Published: (2025)

Nearly-Tight Bounds for Zonotope Containment and Beyond
by: Eisenbrand, Friedrich, et al.
Published: (2026)

A Dichotomy for 1-Planarity with Restricted Crossing Types Parameterized by Treewidth
by: Cabello, Sergio, et al.
Published: (2025)

Instance and Universally Optimal Bounds for Imprecise Pareto Fronts
by: de Berg, Sarita, et al.
Published: (2026)

New Complexity and Algorithmic Bounds for Minimum Consistent Subsets
by: Banik, Aritra, et al.
Published: (2024)

Tight Bounds on the Number of Closest Pairs in Vertical Slabs
by: Biniaz, Ahmad, et al.
Published: (2025)

Optimal Bounds for Spanners and Tree Covers in Doubling Metrics
by: La, An, et al.
Published: (2025)

Tight Universal Bounds for Partially Presorted Pareto Front and Convex Hull
by: van der Hoog, Ivor, et al.
Published: (2025)

Coresets for Constrained Clustering: General Assignment Constraints and Improved Size Bounds
by: Huang, Lingxiao, et al.
Published: (2023)