 | 2011 |
|---|
| 8 |       | 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 |
| 7 | | Mong-Jen Kao,
Bastian Katz,
Marcus Krug,
D. T. Lee,
Ignaz Rutter,
Dorothea Wagner:
The Density Maximization Problem in Graphs.
COCOON 2011: 25-36 |
| 6 | | Mong-Jen Kao,
D. T. Lee:
Capacitated Domination: Constant Factor Approximations for Planar Graphs.
ISAAC 2011: 494-503 |
| 5 | | Mong-Jen Kao,
Chung-Shou Liao,
D. T. Lee:
Capacitated Domination Problem.
Algorithmica 60(2): 274-300 (2011) |
| 4 | | Mong-Jen Kao,
D. T. Lee:
Capacitated Domination: Constant Factor Approximation for Planar Graphs
CoRR abs/1108.4606: (2011) |
| 2010 |
|---|
| 3 | | Mong-Jen Kao,
Han-Lin Chen:
Approximation Algorithms for the Capacitated Domination Problem.
FAW 2010: 185-196 |
| 2 | | Mong-Jen Kao,
Han-Lin Chen:
Approximation Algorithms for the Capacitated Domination Problem
CoRR abs/1004.2839: (2010) |
| 2007 |
|---|
| 1 | | Mong-Jen Kao,
Chung-Shou Liao:
Capacitated Domination Problem.
ISAAC 2007: 256-267 |
Data released under the ODC-BY 1.0 license — See also our legal information page