Noncrossing longest paths and cycles

DOI10.1007/S00373-025-02985-8MaRDI QIDQ6866182zbMATH OpenFDO

Authors Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr

Publication date 29 January 2026

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00373-025-02985-8

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38)

Cites work

• scientific article; zbMATH DE number 3588048 (Why is no real title available?)
• scientific article; zbMATH DE number 1305423 (Why is no real title available?)
• scientific article; zbMATH DE number 741010 (Why is no real title available?)
• scientific article; zbMATH DE number 2064415 (Why is no real title available?)
• scientific article; zbMATH DE number 1757971 (Why is no real title available?)
• A seperation property of plane convex sets.
• Acute tours in the plane
• An approximation algorithm for a bottleneck traveling salesman problem
• Angle-restricted tours in the plane.
• Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem
• Covering paths for planar point sets
• Crossing and intersecting families of geometric graphs on point sets
• Crossing families
• Drawing Hamiltonian cycles with no large angles
• Edge-removal and non-crossing configurations in geometric graphs
• Euclidean bottleneck bounded-degree spanning tree ratios
• Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
• Improved bounds for covering paths and trees in the plane
• Long non-crossing configurations in the plane
• Maximum plane trees in multipartite geometric graphs
• Noncrossing Hamiltonian paths in geometric graphs
• On the Maximum Scatter Traveling Salesperson Problem
• Planar point sets determine many pairwise crossing segments
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Ramsey-Type Problems for Geometric Graphs
• Research Problems in Discrete Geometry
• The Angular-Metric Traveling Salesman Problem
• The Euclidean traveling salesman problem is NP-complete
• The geometric maximum traveling salesman problem

This page was built for publication: Noncrossing longest paths and cycles

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