Pages that link to "Item:Q5946120"
From MaRDI portal
The following pages link to Geometry helps in bottleneck matching and related problems (Q5946120):
Displaying 44 items.
- Convex transversals (Q390129) (← links)
- Approximate one-to-one point pattern matching (Q450574) (← links)
- Bounded-angle spanning tree: modeling networks with angular constraints (Q513267) (← links)
- Parametric search made practical (Q598230) (← links)
- Noisy colored point set matching (Q628337) (← links)
- A persistence landscapes toolbox for topological statistics (Q739618) (← links)
- Minimum cuts in geometric intersection graphs (Q827339) (← links)
- New variants of perfect non-crossing matchings (Q831710) (← links)
- Bottleneck partial-matching Voronoi diagrams and applications (Q902422) (← links)
- Approximating the bottleneck plane perfect matching of a point set (Q904112) (← links)
- Natural pseudo-distance and optimal matching between reduced size functions (Q966491) (← links)
- Bottleneck flows in unit capacity networks (Q976109) (← links)
- Aggregation error for location models: Survey and analysis (Q1026594) (← links)
- Two optimization problems for unit disks (Q1615636) (← links)
- Bipartite diameter and other measures under translation (Q2172648) (← links)
- New families of stable simplicial filtration functors (Q2187161) (← links)
- Structural properties of bichromatic non-crossing matchings (Q2247147) (← links)
- A functorial Dowker theorem and persistent homology of asymmetric networks (Q2316778) (← links)
- Monochromatic plane matchings in bicolored point set (Q2338213) (← links)
- Shortest paths in intersection graphs of unit disks (Q2344058) (← links)
- Optimal point movement for covering circular regions (Q2354019) (← links)
- Efficient many-to-Many point matching in one dimension (Q2373930) (← links)
- On the parameterized complexity of \(d\)-dimensional point set pattern matching (Q2380044) (← links)
- Faster bottleneck non-crossing matchings of points in convex position (Q2401333) (← links)
- Hausdorff matching and Lipschitz optimization (Q2457916) (← links)
- Matching sets of line segments (Q2662685) (← links)
- Finding Largest Common Point Sets (Q3132918) (← links)
- Improved Grid Map Layout by Point Set Matching (Q3449120) (← links)
- Geometry Helps to Compare Persistence Diagrams (Q4577947) (← links)
- TURNING SHAPE DECISION PROBLEMS INTO MEASURES (Q4669615) (← links)
- (Q5088978) (← links)
- (Q5088980) (← links)
- Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle (Q5089159) (← links)
- (Q5090454) (← links)
- Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch (Q5203793) (← links)
- AN APPROXIMATE MORPHING BETWEEN POLYLINES (Q5311633) (← links)
- FAST CLUSTERING AND MINIMUM WEIGHT MATCHING ALGORITHMS FOR VERY LARGE MOBILE BACKBONE WIRELESS NETWORKS (Q5696904) (← links)
- Maximum matchings in geometric intersection graphs (Q6050213) (← links)
- An algorithmic framework for the single source shortest path problem with applications to disk graphs (Q6101843) (← links)
- Barcodes as summary of loss function topology (Q6124396) (← links)
- New variants of perfect non-crossing matchings (Q6180638) (← links)
- Polynomial-Time Algorithms for Continuous Metrics on Atomic Clouds of Unordered Points (Q6182460) (← links)
- On the Stability of Multigraded Betti Numbers and Hilbert Functions (Q6202886) (← links)
- Bottleneck profiles and discrete Prokhorov metrics for persistence diagrams (Q6204774) (← links)
