| 2013 | ||
|---|---|---|
| i5 | Mong-Jen Kao, Der-Tsai Lee, Dorothea Wagner: Approximating Metrics by Tree Metrics of Small Distance-Weighted Average Stretch. CoRR abs/1301.3252 (2013) | |
| i4 | Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner: Online Power-Managing Strategy with Hard Real-Time Guarantees. CoRR abs/1304.1590 (2013) | |
| i3 | Bang-Sin Dai, Mong-Jen Kao, D. T. Lee: Optimal Time-Convex Hull under the Lp Metrics. CoRR abs/1304.7833 (2013) | |
| 2012 | ||
| c6 | Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter, Dorothea Wagner: Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem. ISAAC 2012: 75-84 | |
| 2011 | ||
| j1 | Mong-Jen Kao, Chung-Shou Liao, D. T. Lee: Capacitated Domination Problem. Algorithmica 60(2): 274-300 (2011) | |
| c5 | Mong-Jen Kao, Bastian Katz, Marcus Krug, Der-Tsai Lee, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner: Connecting Two Trees with Optimal Routing Cost. CCCG 2011 | |
| c4 | Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner: The Density Maximization Problem in Graphs. COCOON 2011: 25-36 | |
| c3 | Mong-Jen Kao, D. T. Lee: Capacitated Domination: Constant Factor Approximations for Planar Graphs. ISAAC 2011: 494-503 | |
| i2 | Mong-Jen Kao, D. T. Lee: Capacitated Domination: Constant Factor Approximation for Planar Graphs. CoRR abs/1108.4606 (2011) | |
| 2010 | ||
| c2 | Mong-Jen Kao, Han-Lin Chen: Approximation Algorithms for the Capacitated Domination Problem. FAW 2010: 185-196 | |
| i1 | Mong-Jen Kao, Han-Lin Chen: Approximation Algorithms for the Capacitated Domination Problem. CoRR abs/1004.2839 (2010) | |
| 2007 | ||
| c1 | ||
| 1 | Han-Lin Chen | |
| 2 | Jian-Jia Chen | |
| 3 | Bang-Sin Dai | |
| 4 | Bastian Katz | |
| 5 | Marcus Krug | |
| 6 | D. T. Lee (Der-Tsai Lee) | |
| 7 | Chung-Shou Liao | |
| 8 | Martin Nöllenburg | |
| 9 | Ignaz Rutter | |
| 10 | Dorothea Wagner |
Data released under the ODC-BY 1.0 license — See also our legal information page