| Issue Date | Title | Author(s) | Relation | scopus | WOS | Fulltext/Archive link |
|---|---|---|---|---|---|---|
| 2015 | Capacitated Domination: Problem Complexity and Approximation Algorithms | Mong-Jen Kao; Han-Lin Chen; D.T. Lee | Algorithmica 72(1), 1-43 | |||
| 2016 | O(f) Bi-approximation for Capacitated Covering with Hard Capacities | Mong-Jen Kao; Hai-Lun Tu; D.T. Lee | ||||
| 2019 | O(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities（AACT 2019 Best Journal Paper Award) | Mong-Jen Kao; Hai-Lun Tu; D.T. Lee | Algorithmica 81, 1800-1817 | |||
| 2014 | Online Dynamic Power Management with Hard Real-Time Guarantees | Jian-Jia Chen; Mong-Jen Kao; D. T. Lee ; Ignaz Rutter; Dorothea Wagner | ||||
| 2015 | Online Dynamic Power Management with Hard Real-Time Guarantees | Jian-Jia Chen; Mong-Jen Kao; D.T. Lee ; Ignaz Rutter; Dorothea Wagner | Theoretical Comput. Sci. 595, 46-64 | |||
| 2016 | Optimal Time-Convex Hull for a Straight-Line Highway in Lp-Metrics | B.-S. Dai; Mong-Jen Kao; D.T. Lee | Computational Geometry: Theory and Applications 53, 1-20 | |||
| 2013 | Optimal Time-Convex Hull under the L_p Metrics | Bang-Sin Dai; Mong-Jen Kao; D. T. Lee | ||||
| 2013 | The Density Maximization Problem in Graphs | Mong-Jen Kao; Bastian Katz; Marcus Krug; D.T. Lee ; Ignaz Rutter; Dorothea Wagner | Journal of Combinatorial Optimization 26(4), 723-754 | |||
| 2017 | Tight Approximation for Partial Vertex Cover with Hard Capacities | Jia-Yau Shiao; Mong-Jen Kao; Ching-Chi Lin; D. T. Lee |
