Cover Image

Noncrossing Longest Paths and Cycles

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Aloupis, Greg, Biniaz, Ahmad, Bose, Prosenjit, De Carufel, Jean-Lou, Eppstein, David, Maheshwari, Anil, Odak, Saeed, Smid, Michiel, Tóth, Csaba D., Valtr, Pavel
Format:	Preprint
Published:	2024
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

On Separating Path and Tree Systems in Graphs
by: Biniaz, Ahmad, et al.
Published: (2023)

Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults
by: Biniaz, Ahmad, et al.
Published: (2024)

An Improved Bound for Plane Covering Paths
by: Akitaya, Hugo A., et al.
Published: (2025)

Deciding if a DAG is Interesting is Hard
by: De Carufel, Jean-Lou, et al.
Published: (2025)

Polychromatic Coloring of Tuples in Hypergraphs
by: Biniaz, Ahmad, et al.
Published: (2025)

Euclidean Maximum Matchings in the Plane---Local to Global
by: Biniaz, Ahmad, et al.
Published: (2024)

On 1-Planar Graphs with Bounded Cop-Number
by: Bose, Prosenjit, et al.
Published: (2024)

Computing shortest paths amid non-overlapping weighted disks
by: Bose, Prosenjit, et al.
Published: (2024)

Tight Routing and Spanning Ratios of Arbitrary Triangle Delaunay Graphs
by: Bose, Prosenjit, et al.
Published: (2025)

The Exact Spanning Ratio of the Parallelogram Delaunay Graph
by: Bose, Prosenjit, et al.
Published: (2023)

Contiguous Boundary Guarding
by: Biniaz, Ahmad, et al.
Published: (2024)

Computing Oriented Spanners and their Dilation
by: Buchin, Kevin, et al.
Published: (2024)

The Spanning Ratio of the Directed $Θ_6$-Graph is 5
by: Bose, Prosenjit, et al.
Published: (2026)

Completely Independent Steiner Trees
by: Maheshwari, Anil, et al.
Published: (2026)

Linear-Time $(1+\varepsilon)$-Approximation Algorithms for Two-Line-Center Problems
by: Chung, Chaeyoon, et al.
Published: (2026)

Connected Dominating Sets in Triangulations
by: Bose, Prosenjit, et al.
Published: (2023)

Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time
by: Eppstein, David
Published: (2023)

On $k$-planar Graphs without Short Cycles
by: Bekos, Michael A., et al.
Published: (2024)

The basis number of 1-planar graphs
by: Bazargani, Saman, et al.
Published: (2024)

Scalable Machine Learning Algorithms using Path Signatures
by: Tóth, Csaba
Published: (2025)

Euclidean Noncrossing Steiner Spanners of Nearly Optimal Sparsity
by: Bhore, Sujoy, et al.
Published: (2026)

Longest Path and Cycle Transversals in Chordal Graphs
by: Long Jr., James A., et al.
Published: (2024)

Hamiltonian Cycles in Subdivided Doubles
by: Eppstein, David
Published: (2025)

So Long Sucker: Endgame Analysis
by: De Carufel, Jean-Lou, et al.
Published: (2024)

Three Edge-disjoint Plane Spanning Paths in a Point Set
by: Kindermann, Philipp, et al.
Published: (2023)

Minimum Plane Bichromatic Spanning Trees
by: Akitaya, Hugo A., et al.
Published: (2024)

A Note on Grünbaum's Conjecture about Longest Cycles and Paths
by: Kashima, Masaki, et al.
Published: (2026)

Simultaneous Embedding of Two Paths on the Grid
by: Kobourov, Stephen, et al.
Published: (2026)

Cop numbers of periodic graphs
by: De Carufel, Jean-Lou, et al.
Published: (2023)

Cops & Robber on Periodic Temporal Graphs
by: De Carufel, Jean-Lou, et al.
Published: (2024)

Sublinear Longest Path Transversals
by: Long Jr., James A., et al.
Published: (2020)

On RAC Drawings of Graphs with Two Bends per Edge
by: Tóth, Csaba D.
Published: (2023)

Noncrossing arithmetic
by: Ebrahimi-Fard, Kurusch, et al.
Published: (2024)

An Algebraic Approach to the Longest Path Problem
by: Khazali, Omar Al -
Published: (2023)

An FPTAS for Shortest-Longest Path Problem
by: Zhang, Jianwei
Published: (2024)

Noncrossing partitions of an annulus
by: Brestensky, Laura G., et al.
Published: (2022)

The Longest Duration SGRE Event in Solar Cycle 25
by: Gopalswamy, Nat, et al.
Published: (2025)

Cops and Robbers for Graphs on Surfaces with Crossings
by: Bose, Prosenjit, et al.
Published: (2025)

Computing Vertex and Edge Connectivity of Graphs Embedded with Crossings
by: Biedl, Therese, et al.
Published: (2024)