The following pages link to Vladimir Estivill-Castro (Q1209144):
Displaying 35 items.
- (Q208470) (redirect page) (← links)
- Right invariant metrics and measures of presortedness (Q1209145) (← links)
- Illumination of polygons with vertex lights (Q1350220) (← links)
- On the chromatic number of tree graphs (Q1587620) (← links)
- A new measure of presortedness (Q1822995) (← links)
- An adaptive generic sorting algorithm that uses variable partitioning<sup>∗</sup> (Q2710787) (← links)
- (Q2768936) (← links)
- (Q2777822) (← links)
- (Q2777828) (← links)
- (Q2843923) (← links)
- (Q2845518) (← links)
- Is It FPT to Cover Points with Tours on Minimum Number of Bends (Errata)? (Q2950590) (← links)
- FPT-ALGORITHMS FOR MINIMUM-BENDS TOURS (Q2999094) (← links)
- Single Parameter FPT-Algorithms for Non-trivial Games (Q3000500) (← links)
- CLUSTERING WEB VISITORS BY BAST, ROBUST AND CONVERGENT ALGORITHMS (Q3021966) (← links)
- (Q3448083) (← links)
- The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel (Q3499737) (← links)
- The Rectilinear k-Bends TSP (Q3578326) (← links)
- Randomized adaptive sorting (Q4034707) (← links)
- (Q4445706) (← links)
- (Q4470523) (← links)
- (Q4472042) (← links)
- Illumination of Orthogonal Polygons with Orthogonal Floodlights (Q4513201) (← links)
- Local search for <i>Hamiltonian Path</i> with applications to clustering visitation paths (Q4661201) (← links)
- (Q4792737) (← links)
- (Q4802576) (← links)
- (Q4802577) (← links)
- (Q4862345) (← links)
- (Q4888910) (← links)
- (Q4929402) (← links)
- Two-floodlight illumination of convex polygons (Q5057422) (← links)
- Reduction rules deliver efficient FPT-algorithms for covering points with lines (Q5406200) (← links)
- Algorithms and Computation (Q5897919) (← links)
- Robust distance-based clustering with applications to spatial data mining (Q5945909) (← links)
- Illumination with orthogonal floodlights (Q6487984) (← links)
