Non-crossing Hamiltonian paths and cycles in output-polynomial time

Cites Work

Unnamed Item
Unnamed Item
Long non-crossing configurations in the plane
Amortized efficiency of generating planar paths in convex position
The Jordan Curve Theorem and an unpublished manuscript by Max Dehn
Analytic combinatorics of non-crossing configurations
Lower bounds on the number of crossing-free subgraphs of \(K_N\)
On local transformation of polygons with visibility properties.
An efficient algorithm for enumeration of triangulations
Reverse search for enumeration
Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
Connecting polygonizations via stretches and twangs
On simple polygonalizations with optimal area
Algorithmic enumeration of surrounding polygons
Enumeration of bipartite non-crossing geometric graphs
Counting polygon triangulations is hard
Counting triangulations and other crossing-free structures via onion layers
Gray code enumeration of plane straight-line graphs
The traveling salesman problem with few inner points
Geometric planar networks on bichromatic collinear points
Counting Plane Graphs: Flippability and Its Applications
Euclidean TSP with Few Inner Points in Linear Space
Counting Plane Graphs with Exponential Speed-Up
Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems
Visibility of a simple polygon
Crossing-Free Subgraphs
Polygons Have Ears
Forbidden Configurations in Discrete Geometry
Area-Optimal Simple Polygonalizations: The CG Challenge 2019
On Some Properties of Shortest Hamiltonian Circuits
Counting Plane Graphs: Cross-Graph Charging Schemes
Counting and enumerating crossing-free geometric graphs
Fast enumeration algorithms for non-crossing geometric graphs

This page was built for publication: Non-crossing Hamiltonian paths and cycles in output-polynomial time