Capacitated Domination Problem. - Mong-Jen Kao; Chung-Shou Liao (ISAAC, 2007)

Approximation Algorithms for the Capacitated Domination Problem. - Mong-Jen Kao; Han-Lin Chen (FAW, 2010)

Connecting Two Trees with Optimal Routing Cost. - Mong-Jen Kao; Bastian Katz; Marcus Krug; D. T. Lee; Martin Nöllenburg; Ignaz Rutter; Dorothea Wagner (CCCG, 2011)

Capacitated Domination: Constant Factor Approximations for Planar Graphs. - Mong-Jen Kao; D. T. Lee (ISAAC, 2011)

Capacitated Domination Problem. - Mong-Jen Kao; Chung-Shou Liao; D. T. Lee (Algorithmica, 2011)

Capacitated Domination: Constant Factor Approximation for Planar Graphs - Mong-Jen Kao; D. T. Lee (CoRR, 2011)

Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem. - Mong-Jen Kao; Jian-Jia Chen; Ignaz Rutter; Dorothea Wagner (ISAAC, 2012)

Optimal Time-Convex Hull under the L p Metrics. - Bang-Sin Dai; Mong-Jen Kao; D. T. Lee (WADS, 2013)

Approximating Metrics by Tree Metrics of Small Distance-Weighted Average Stretch - Mong-Jen Kao; Der-Tsai Lee; Dorothea Wagner (CoRR, 2013)

Online Power-Managing Strategy with Hard Real-Time Guarantees - Jian-Jia Chen; Mong-Jen Kao; D. T. Lee; Ignaz Rutter; Dorothea Wagner (CoRR, 2013)

Optimal Time-Convex Hull under the Lp Metrics - Bang-Sin Dai; Mong-Jen Kao; D. T. Lee (CoRR, 2013)

The density maximization problem in graphs. - Mong-Jen Kao; Bastian Katz; Marcus Krug; D. T. Lee; Ignaz Rutter; Dorothea Wagner (J. Comb. Optim., 2013)

Capacitated Domination: Problem Complexity and Approximation Algorithms. - Mong-Jen Kao; Han-Lin Chen; D. T. Lee (Algorithmica, 2015)

Online dynamic power management with hard real-time guarantees. - Jian-Jia Chen; Mong-Jen Kao; D. T. Lee; Ignaz Rutter; Dorothea Wagner (Theor. Comput. Sci., 2015)

O(f) Bi-Approximation for Capacitated Covering with Hard Capacities. - Mong-Jen Kao; Hai-Lun Tu; D. T. Lee (ISAAC, 2016)

Optimal time-convex hull for a straight-line highway in Lp-metrics. - Bang-Sin Dai; Mong-Jen Kao; D. T. Lee (Comput. Geom., 2016)

An O(f) Bi-approximation for Weighted Capacitated Covering with Hard Capacity. - Hai-Lun Tu; Mong-Jen Kao; D. T. Lee (ICS, 2018)

The Multi-service Location Problems. - Hung-I Yu; Mong-Jen Kao; D. T. Lee (ICS, 2018)

Approximation Algorithm for Vertex Cover with Multiple Covering Constraints. - Eunpyeong Hong; Mong-Jen Kao (ISAAC, 2018)

O(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities. - Mong-Jen Kao; Hai-Lun Tu; D. T. Lee (Algorithmica, 2019)

Tight approximation for partial vertex cover with hard capacities. - Mong-Jen Kao; Jia-Yau Shiau; Ching-Chi Lin; D. T. Lee (Theor. Comput. Sci., 2019)

Iterative Partial Rounding for Vertex Cover with Hard Capacities. - Mong-Jen Kao (Algorithmica, 2021)

Improved LP-based Approximation Algorithms for Facility Location with Hard Capacities. - Mong-Jen Kao (CoRR, 2021)

Approximation Algorithm for Vertex Cover with Multiple Covering Constraints. - Eunpyeong Hung; Mong-Jen Kao (Algorithmica, 2022)

Improved Approximation Algorithm for Capacitated Facility Location with Uniform Facility Cost. - Mong-Jen Kao (ISAAC, 2023)

On Min-Max Graph Balancing with Strict Negative Correlation Constraints. - Ting-Yu Kuo; Yu-Han Chen; Andrea Frosini; Sun-Yuan Hsieh; Shi-Chun Tsai; Mong-Jen Kao (ISAAC, 2023)

On the Integrality Gap of MFN Relaxation for the Capacitated Facility Location Problem. - Mong-Jen Kao (SODA, 2023)

Near-Optimal UAV Deployment for Delay-Bounded Data Collection in IoT Networks. - Shu-Wei Chang; Jian-Jhih Kuo; Mong-Jen Kao; Bozhong Chen; Qian-Jing Wang (INFOCOM, 2024)

On the Connected Minimum Sum of Radii Problem. - Hyung-Chan An; Mong-Jen Kao (ISAAC, 2024)

Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics. - Hyung-Chan An; Mong-Jen Kao; Changyeol Lee; Mu-Ting Lee (CoRR, 2025)

Job Scheduling under Base and Additional Fees, with Applications to Mixed-Criticality Scheduling. - Yi-Ting Hsieh; Mong-Jen Kao; Jhong-Yun Liu; Hung-Lung Wang (CoRR, 2025)