Pages that link to "Item:Q4210143"
From MaRDI portal
The following pages link to Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms (Q4210143):
Displaying 8 items.
- An \(\Omega\) (n log n) lower bound for decomposing a set of points into chains (Q1124331) (← links)
- Numerical schemes and rates of convergence for the Hamilton-Jacobi equation continuum limit of nondominated sorting (Q1681788) (← links)
- Interlacing and scaling exponents for the geodesic watermelon in last passage percolation (Q2159231) (← links)
- Longest increasing subsequences in windows based on canonical antichain partition (Q2371801) (← links)
- Approximating the minimum clique cover and other hard problems in subtree filament graphs (Q2506362) (← links)
- A discrete and continuous study of the \textsc{Max-Chain-Formation} problem (Q2672258) (← links)
- Anomaly Detection and Classification for Streaming Data using PDEs (Q4609601) (← links)
- Computing the all-pairs longest chains in the plane (Q5060093) (← links)
