Der-Tsai Lee

From MaRDI portal
Person:1186183

Available identifiers

zbMath Open lee.der-tsaiWikidataQ5261122 ScholiaQ5261122MaRDI QIDQ1186183

List of research outcomes

PublicationDate of PublicationType
Steiner problems on directed acyclic graphs2024-01-29Paper
Efficient computation of the geodesic Voronoi diagram of points in a simple polygon2023-05-08Paper
Finding maximum sum segments in sequences with uncertainty2020-12-16Paper
https://portal.mardi4nfdi.de/entity/Q51362852020-11-25Paper
Tight approximation for partial vertex cover with hard capacities2019-06-06Paper
Higher-Order Geodesic Voronoi Diagrams in a Polygonal Domain with Holes2019-05-15Paper
\(O(f)\) bi-criteria approximation for capacitated covering with hard capacities2019-05-07Paper
The (1|1)-Centroid Problem in the Plane with Distance Constraints2018-08-02Paper
https://portal.mardi4nfdi.de/entity/Q46438442018-05-29Paper
https://portal.mardi4nfdi.de/entity/Q46365232018-04-19Paper
https://portal.mardi4nfdi.de/entity/Q46365502018-04-19Paper
The multi-service center problem2017-11-16Paper
https://portal.mardi4nfdi.de/entity/Q29654862017-03-03Paper
Optimal time-convex hull for a straight-line highway in \(L_p\)-metrics2016-04-12Paper
Broadcasting in weighted trees under the postal model2016-02-26Paper
Online dynamic power management with hard real-time guarantees2015-07-24Paper
The \(k\)-nearest-neighbor Voronoi diagram revisited2015-05-26Paper
Capacitated domination: problem complexity and approximation algorithms2015-05-21Paper
The density maximization problem in graphs2013-12-09Paper
Voronoi Diagrams and Delaunay Triangulations2013-10-17Paper
Optimal Time-Convex Hull under the L p Metrics2013-08-12Paper
Power domination in circular-arc graphs2013-03-05Paper
COMPUTING THE STRETCH FACTOR AND MAXIMUM DETOUR OF PATHS, TREES, AND CYCLES IN THE NORMED SPACE2012-11-23Paper
Higher Order City Voronoi Diagrams2012-08-14Paper
Capacitated Domination: Constant Factor Approximations for Planar Graphs2011-12-16Paper
Finding Maximum Sum Segments in Sequences with Uncertainty2011-12-16Paper
An Output-Sensitive Approach for the L 1/L  ∞  k-Nearest-Neighbor Voronoi Diagram2011-09-16Paper
The Density Maximization Problem in Graphs2011-08-17Paper
Capacitated domination problem2011-05-10Paper
Spanning Ratio and Maximum Detour of Rectilinear Paths in the L 1 Plane2010-12-09Paper
Broadcasting in Heterogeneous Tree Networks2010-07-20Paper
Efficient algorithms for the sum selection problem and \(k\) maximum sums problem2010-03-09Paper
Geometric Minimum Diameter Minimum Cost Spanning Tree Problem2009-12-17Paper
Optimal Randomized Algorithm for the Density Selection Problem2009-12-17Paper
Fast algorithms for the density finding problem2009-06-17Paper
Maximizing the Number of Independent Labels in the Plane2009-03-10Paper
Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem2008-04-24Paper
Randomized algorithm for the sum selection problem2007-06-06Paper
Algorithms and Computation2006-11-14Paper
Computing and Combinatorics2006-01-11Paper
THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH2005-12-09Paper
LABELING POINTS ON A SINGLE LINE2005-10-18Paper
https://portal.mardi4nfdi.de/entity/Q30247822005-07-04Paper
THE L VORONOI DIAGRAM OF SEGMENTS AND VLSI APPLICATIONS2005-06-10Paper
Two variations of the minimum Steiner problem2005-05-17Paper
https://portal.mardi4nfdi.de/entity/Q44278722003-09-14Paper
SKEW VORONOI DIAGRAMS2000-05-07Paper
An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications1996-02-04Paper
Parallel enclosing rectangle on SIMD machines1992-06-28Paper
Dynamic Voronoi diagrams1983-01-01Paper
On k-Nearest Neighbor Voronoi Diagrams in the Plane1982-01-01Paper
An Algorithm for Transformation of an Arbitrary Switching Function to a Completely Symmetric Function1976-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Der-Tsai Lee