Pages that link to "Item:Q2792796"
From MaRDI portal
The following pages link to A bottleneck matching problem with edge-crossing constraints (Q2792796):
Displaying 13 items.
- Bottleneck non-crossing matching in the plane (Q390164) (← links)
- New variants of perfect non-crossing matchings (Q831710) (← links)
- Approximating the bottleneck plane perfect matching of a point set (Q904112) (← links)
- Maximum weighted matching with few edge crossings for 2-layered bipartite graph (Q2004074) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Structural properties of bichromatic non-crossing matchings (Q2247147) (← links)
- Flip distance to some plane configurations (Q2331207) (← links)
- Monochromatic plane matchings in bicolored point set (Q2338213) (← links)
- Faster bottleneck non-crossing matchings of points in convex position (Q2401333) (← links)
- Connecting the dots (with minimum crossings) (Q5088932) (← links)
- Flip Distance to some Plane Configurations. (Q5116475) (← links)
- New variants of perfect non-crossing matchings (Q6180638) (← links)
- Non-crossing anonymous MAPF for tethered robots (Q6535407) (← links)