Image de couverture de livre

Three Edge-disjoint Plane Spanning Paths in a Point Set

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Kindermann, Philipp, Kratochvíl, Jan, Liotta, Giuseppe, Valtr, Pavel
Format:	Preprint
Publié:	2023
Sujets:	Computational Geometry
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Edge-Constrained Hamiltonian Paths on a Point Set
par: Antić, Todor, et autres
Publié: (2025)

Simultaneous Embedding of Two Paths on the Grid
par: Kobourov, Stephen, et autres
Publié: (2026)

Weakly Leveled Planarity with Bounded Span
par: Bekos, Michael, et autres
Publié: (2024)

Parameterized Approaches to Orthogonal Compaction
par: Didimo, Walter, et autres
Publié: (2022)

A Linear Time Algorithm for Finding Minimum Flip Sequences between Plane Spanning Paths in Convex Point Sets
par: Aichholzer, Oswin, et autres
Publié: (2025)

On $k$-Plane Insertion into Plane Drawings
par: Katheder, Julia, et autres
Publié: (2024)

Further Connectivity Results on Plane Spanning Path Reconfiguration
par: Boucard, Valentino, et autres
Publié: (2024)

Tangling and Untangling Trees on Point-sets
par: Di Battista, Giuseppe, et autres
Publié: (2025)

On the Connectivity of the Flip Graph of Plane Spanning Paths
par: Kleist, Linda, et autres
Publié: (2024)

On Layered Area-Proportional Rectangle Contact Representations
par: Haase, Carolina, et autres
Publié: (2023)

Upward-Planar Drawings with Bounded Span
par: Angelini, Patrizio, et autres
Publié: (2026)

Minimum Plane Bichromatic Spanning Trees
par: Akitaya, Hugo A., et autres
Publié: (2024)

Noncrossing Longest Paths and Cycles
par: Aloupis, Greg, et autres
Publié: (2024)

Constrained Flips in Plane Spanning Trees
par: Aichholzer, Oswin, et autres
Publié: (2025)

How many times can two minimum spanning trees cross?
par: Antić, Todor, et autres
Publié: (2026)

An Improved Bound for Plane Covering Paths
par: Akitaya, Hugo A., et autres
Publié: (2025)

Bounding and computing obstacle numbers of graphs
par: Balko, Martin, et autres
Publié: (2022)

Two Results on Outer-String Graphs
par: Antić, Todor, et autres
Publié: (2026)

Optimal Orthogonal Drawings in Linear Time
par: Didimo, Walter, et autres
Publié: (2025)

Structural Properties of Shortest Flip Sequences Between Plane Spanning Trees
par: Aichholzer, Oswin, et autres
Publié: (2026)

Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
par: Barequet, Gill, et autres
Publié: (2025)

How Many Slopes Does Polynomial Area Cost?
par: Bekos, Michael A., et autres
Publié: (2026)

The Complexity of Extending Storylines with Minimum Local Crossing Number
par: Dobler, Alexander, et autres
Publié: (2026)

Outerplanar and Forest Storyplans
par: Fiala, Jiří, et autres
Publié: (2023)

Hypercube drawings with no long plane paths
par: Antić, Todor, et autres
Publié: (2026)

Saturated Drawings of Geometric Thickness k
par: Bachmann, Patricia, et autres
Publié: (2025)

Grounded String Representations of Series-Parallel Graphs without Transitive Edges
par: Cornelsen, Sabine, et autres
Publié: (2026)

Expected Length of the Euclidean Minimum Spanning Tree and 1-norms of Chromatic Persistence Diagrams in the Plane
par: Draganov, Ondřej, et autres
Publié: (2025)

The Parametrized Complexity of the Segment Number
par: Cornelsen, Sabine, et autres
Publié: (2023)

Subquadratic Approximation Algorithms for Separating Two Points with Objects in the Plane
par: Lynch, Jayson, et autres
Publié: (2025)

Rectangular Duals on the Cylinder and the Torus
par: Biedl, Therese, et autres
Publié: (2025)

Homotopy-Aware Multi-Agent Path Planning on Plane
par: Kasaura, Kazumi
Publié: (2023)

Separating Two Points with Obstacles in the Plane: Improved Upper and Lower Bounds
par: Spalding-Jamieson, Jack, et autres
Publié: (2025)

Minimum-Weight Half-Plane Hitting Set
par: Liu, Gang, et autres
Publié: (2025)

On Small Pair Decompositions for Point Sets
par: Buchin, Kevin, et autres
Publié: (2026)

Visual Complexity of Point Set Mappings
par: Meulemans, Wouter, et autres
Publié: (2024)

On Triangular Separation of Bichromatic Point Sets
par: Bergold, Helena, et autres
Publié: (2025)

Hypergraphs as Metro Maps: Drawing Paths with Few Bends in Trees, Cacti, and Plane 4-Graphs
par: Cornelsen, Sabine, et autres
Publié: (2025)

Min-$k$-planar Drawings of Graphs
par: Binucci, Carla, et autres
Publié: (2023)

Minimum Monotone Spanning Trees
par: Di Giacomo, Emilio, et autres
Publié: (2024)