Saved in:
| Main Authors: | Dobler, Alexander, Gupta, Siddharth, Kindermann, Philipp, Montecchiani, Fabrizio, Nöllenburg, Martin |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2603.08340 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings
by: Dobler, Alexander, et al.
Published: (2024)
by: Dobler, Alexander, et al.
Published: (2024)
Optimizing Wiggle in Storylines
by: Dobler, Alexander, et al.
Published: (2025)
by: Dobler, Alexander, et al.
Published: (2025)
The Parameterized Complexity of Extending Stack Layouts
by: Depian, Thomas, et al.
Published: (2024)
by: Depian, Thomas, et al.
Published: (2024)
Parameterized Approaches to Orthogonal Compaction
by: Didimo, Walter, et al.
Published: (2022)
by: Didimo, Walter, et al.
Published: (2022)
The Parametrized Complexity of the Segment Number
by: Cornelsen, Sabine, et al.
Published: (2023)
by: Cornelsen, Sabine, et al.
Published: (2023)
Flipping Matchings is Hard
by: Binucci, Carla, et al.
Published: (2025)
by: Binucci, Carla, et al.
Published: (2025)
The Peculiarities of Extending Queue Layouts
by: Depian, Thomas, et al.
Published: (2025)
by: Depian, Thomas, et al.
Published: (2025)
Weakly Leveled Planarity with Bounded Span
by: Bekos, Michael, et al.
Published: (2024)
by: Bekos, Michael, et al.
Published: (2024)
On Layered Area-Proportional Rectangle Contact Representations
by: Haase, Carolina, et al.
Published: (2023)
by: Haase, Carolina, et al.
Published: (2023)
Geometry Matters in Planar Storyplans
by: Dobler, Alexander, et al.
Published: (2025)
by: Dobler, Alexander, et al.
Published: (2025)
On Minimizing Wiggle in Stacked Area Charts
by: Dobler, Alexander, et al.
Published: (2025)
by: Dobler, Alexander, et al.
Published: (2025)
Realizing Planar Linkages in Polygonal Domains
by: Depian, Thomas, et al.
Published: (2026)
by: Depian, Thomas, et al.
Published: (2026)
Pathways to Tractability for Geometric Thickness
by: Depian, Thomas, et al.
Published: (2024)
by: Depian, Thomas, et al.
Published: (2024)
On 1-bend Upward Point-set Embeddings of $st$-digraphs
by: Di Giacomo, Emilio, et al.
Published: (2024)
by: Di Giacomo, Emilio, et al.
Published: (2024)
Constrained Boundary Labeling
by: Depian, Thomas, et al.
Published: (2024)
by: Depian, Thomas, et al.
Published: (2024)
Three Edge-disjoint Plane Spanning Paths in a Point Set
by: Kindermann, Philipp, et al.
Published: (2023)
by: Kindermann, Philipp, et al.
Published: (2023)
Boundary Labeling in a Circular Orbit
by: Bonerath, Annika, et al.
Published: (2024)
by: Bonerath, Annika, et al.
Published: (2024)
How Many Slopes Does Polynomial Area Cost?
by: Bekos, Michael A., et al.
Published: (2026)
by: Bekos, Michael A., et al.
Published: (2026)
On $k$-Plane Insertion into Plane Drawings
by: Katheder, Julia, et al.
Published: (2024)
by: Katheder, Julia, et al.
Published: (2024)
Upward-Planar Drawings with Bounded Span
by: Angelini, Patrizio, et al.
Published: (2026)
by: Angelini, Patrizio, et al.
Published: (2026)
A Dichotomy for 1-Planarity with Restricted Crossing Types Parameterized by Treewidth
by: Cabello, Sergio, et al.
Published: (2025)
by: Cabello, Sergio, et al.
Published: (2025)
Bounding a Polygon by a Minimum Number of Vertices
by: Abrahamsen, Mikkel, et al.
Published: (2025)
by: Abrahamsen, Mikkel, et al.
Published: (2025)
Transitions in Dynamic Point Labeling
by: Depian, Thomas, et al.
Published: (2022)
by: Depian, Thomas, et al.
Published: (2022)
Visualizing Treewidth
by: Chiu, Alvin, et al.
Published: (2025)
by: Chiu, Alvin, et al.
Published: (2025)
Rectangular Duals on the Cylinder and the Torus
by: Biedl, Therese, et al.
Published: (2025)
by: Biedl, Therese, et al.
Published: (2025)
Complexity of Anchored Crossing Number and Crossing Number of Almost Planar Graphs
by: Hliněný, Petr
Published: (2023)
by: Hliněný, Petr
Published: (2023)
Saturated Drawings of Geometric Thickness k
by: Bachmann, Patricia, et al.
Published: (2025)
by: Bachmann, Patricia, et al.
Published: (2025)
Outside-Obstacle Representations with All Vertices on the Outer Face
by: Firman, Oksana, et al.
Published: (2022)
by: Firman, Oksana, et al.
Published: (2022)
Using Reinforcement Learning to Optimize the Global and Local Crossing Number
by: Brand, Timo, et al.
Published: (2025)
by: Brand, Timo, et al.
Published: (2025)
Bounding and computing obstacle numbers of graphs
by: Balko, Martin, et al.
Published: (2022)
by: Balko, Martin, et al.
Published: (2022)
Minimum Monotone Spanning Trees
by: Di Giacomo, Emilio, et al.
Published: (2024)
by: Di Giacomo, Emilio, et al.
Published: (2024)
On The Computational Complexity of Minimum Aerial Photographs for Planar Region Coverage
by: Feng, Si Wei
Published: (2025)
by: Feng, Si Wei
Published: (2025)
New Complexity and Algorithmic Bounds for Minimum Consistent Subsets
by: Banik, Aritra, et al.
Published: (2024)
by: Banik, Aritra, et al.
Published: (2024)
Geometric Thickness of Multigraphs is $\exists \mathbb{R}$-complete
by: Förster, Henry, et al.
Published: (2023)
by: Förster, Henry, et al.
Published: (2023)
Crossing Number of 3-Plane Drawings
by: Goetze, Miriam, et al.
Published: (2025)
by: Goetze, Miriam, et al.
Published: (2025)
Hypergraphs as Metro Maps: Drawing Paths with Few Bends in Trees, Cacti, and Plane 4-Graphs
by: Cornelsen, Sabine, et al.
Published: (2025)
by: Cornelsen, Sabine, et al.
Published: (2025)
On the Exponential Growth of Geometric Shapes
by: Almalki, Nada, et al.
Published: (2023)
by: Almalki, Nada, et al.
Published: (2023)
On The Heine-Borel Property and Minimum Enclosing Balls
by: Banerjee, Hridhaan, et al.
Published: (2024)
by: Banerjee, Hridhaan, et al.
Published: (2024)
Rectilinear Crossing Number of Graphs Excluding Single-Crossing Graphs as Minors
by: Dujmović, Vida, et al.
Published: (2024)
by: Dujmović, Vida, et al.
Published: (2024)
FPT Approximation Schemes for Min-Sum Radii and Min-Sum Diameters Clustering
by: Grandoni, Fabrizio, et al.
Published: (2026)
by: Grandoni, Fabrizio, et al.
Published: (2026)
Similar Items
-
Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings
by: Dobler, Alexander, et al.
Published: (2024) -
Optimizing Wiggle in Storylines
by: Dobler, Alexander, et al.
Published: (2025) -
The Parameterized Complexity of Extending Stack Layouts
by: Depian, Thomas, et al.
Published: (2024) -
Parameterized Approaches to Orthogonal Compaction
by: Didimo, Walter, et al.
Published: (2022) -
The Parametrized Complexity of the Segment Number
by: Cornelsen, Sabine, et al.
Published: (2023)