New variants of perfect non-crossing matchings
From MaRDI portal
Publication:831710
DOI10.1007/978-3-030-67899-9_12OpenAlexW3127648435MaRDI QIDQ831710FDOQ831710
Authors: Ioannis Mantas, Marko Savić, Hendrik Schrezenmaier 
Publication date: 24 March 2022
Full work available at URL: https://arxiv.org/abs/2001.03252
Recommendations
- Non-crossing matchings
- Graphs of non-crossing perfect matchings
- Noncrossing matchings with fixed points
- Perfect matchings with crossings
- Stable noncrossing matchings
- Perfect matchings and extended polymatroid
- Perfect matching and polymatroids
- On an obstruction for perfect matchings
- Non-intersecting perfect matchings in cubic graphs (Extended abstract)
- Perfect matchings of generalized polyomino graphs
Cites Work
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
- Title not available (Why is that?)
- Long non-crossing configurations in the plane
- Geometry Helps in Matching
- Title not available (Why is that?)
- Applications of a semi-dynamic convex hull algorithm
- Title not available (Why is that?)
- Algorithms for ham-sandwich cuts
- Bottleneck non-crossing matching in the plane
- Geometry helps in bottleneck matching and related problems
- Range searching with efficient hierarchical cuttings
- Computing the extreme distances between two convex polygons
- Title not available (Why is that?)
- Fast Matching Algorithms for Points on a Polygon
- An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
- Structural properties of bichromatic non-crossing matchings
- Faster bottleneck non-crossing matchings of points in convex position
- A bottleneck matching problem with edge-crossing constraints
- Improved Grid Map Layout by Point Set Matching
- Simplex Range Searching and Its Variants: A Review
- Computing fair and bottleneck matchings in geometric graphs
Cited In (1)
This page was built for publication: New variants of perfect non-crossing matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831710)
