The following pages link to Der-Tsai Lee (Q1186183):
Displaying 50 items.
- (Q248947) (redirect page) (← links)
- Optimal time-convex hull for a straight-line highway in \(L_p\)-metrics (Q265715) (← links)
- The density maximization problem in graphs (Q386420) (← links)
- Capacitated domination problem (Q534769) (← links)
- Randomized algorithm for the sum selection problem (Q884471) (← links)
- Fast algorithms for the density finding problem (Q1024779) (← links)
- Parallel enclosing rectangle on SIMD machines (Q1186184) (← links)
- The multi-service center problem (Q1680546) (← links)
- \(O(f)\) bi-criteria approximation for capacitated covering with hard capacities (Q1741845) (← links)
- Two variations of the minimum Steiner problem (Q1774532) (← links)
- An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications (Q1900895) (← links)
- Power domination in circular-arc graphs (Q1939660) (← links)
- Finding maximum sum segments in sequences with uncertainty (Q2216439) (← links)
- Efficient algorithms for the sum selection problem and \(k\) maximum sums problem (Q2268857) (← links)
- Capacitated domination: problem complexity and approximation algorithms (Q2345937) (← links)
- The \(k\)-nearest-neighbor Voronoi diagram revisited (Q2346966) (← links)
- Online dynamic power management with hard real-time guarantees (Q2354765) (← links)
- Tight approximation for partial vertex cover with hard capacities (Q2420573) (← links)
- Optimal Time-Convex Hull under the L p Metrics (Q2842163) (← links)
- Voronoi Diagrams and Delaunay Triangulations (Q2854053) (← links)
- Higher Order City Voronoi Diagrams (Q2904543) (← links)
- (Q2965486) (← links)
- (Q3024782) (← links)
- Spanning Ratio and Maximum Detour of Rectilinear Paths in the L 1 Plane (Q3060767) (← links)
- The Density Maximization Problem in Graphs (Q3087936) (← links)
- An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi Diagram (Q3092218) (← links)
- Capacitated Domination: Constant Factor Approximations for Planar Graphs (Q3104645) (← links)
- Finding Maximum Sum Segments in Sequences with Uncertainty (Q3104675) (← links)
- The (1|1)-Centroid Problem in the Plane with Distance Constraints (Q3177899) (← links)
- Broadcasting in Heterogeneous Tree Networks (Q3578337) (← links)
- Maximizing the Number of Independent Labels in the Plane (Q3612584) (← links)
- Geometric Minimum Diameter Minimum Cost Spanning Tree Problem (Q3652215) (← links)
- Optimal Randomized Algorithm for the Density Selection Problem (Q3652287) (← links)
- Dynamic Voronoi diagrams (Q3665003) (← links)
- On k-Nearest Neighbor Voronoi Diagrams in the Plane (Q3953183) (← links)
- An Algorithm for Transformation of an Arbitrary Switching Function to a Completely Symmetric Function (Q4138646) (← links)
- (Q4427872) (← links)
- (Q4636523) (← links)
- The (1|1)-Centroid Problem on the Plane Concerning Distance Constraints (Q4636550) (← links)
- (Q4643844) (← links)
- COMPUTING THE STRETCH FACTOR AND MAXIMUM DETOUR OF PATHS, TREES, AND CYCLES IN THE NORMED SPACE (Q4650090) (← links)
- THE L<sub>∞</sub> VORONOI DIAGRAM OF SEGMENTS AND VLSI APPLICATIONS (Q4682157) (← links)
- SKEW VORONOI DIAGRAMS (Q4949988) (← links)
- Tight approximation for partial vertex cover with hard capacities (Q5136285) (← links)
- Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem (Q5459141) (← links)
- LABELING POINTS ON A SINGLE LINE (Q5696540) (← links)
- THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH (Q5711095) (← links)
- Computing and Combinatorics (Q5717005) (← links)
- Higher-Order Geodesic Voronoi Diagrams in a Polygonal Domain with Holes (Q5741826) (← links)
- Algorithms and Computation (Q5897884) (← links)
