Mong-Jen Kao Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2013
i5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mong-Jen Kao, Der-Tsai Lee, Dorothea Wagner: Approximating Metrics by Tree Metrics of Small Distance-Weighted Average Stretch. CoRR abs/1301.3252 (2013)
i4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
i3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Bang-Sin Dai, Mong-Jen Kao, D. T. Lee: Optimal Time-Convex Hull under the Lp Metrics. CoRR abs/1304.7833 (2013)
2012
c6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mong-Jen Kao, Chung-Shou Liao, D. T. Lee: Capacitated Domination Problem. Algorithmica 60(2): 274-300 (2011)
c5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
c4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner: The Density Maximization Problem in Graphs. COCOON 2011: 25-36
c3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mong-Jen Kao, D. T. Lee: Capacitated Domination: Constant Factor Approximations for Planar Graphs. ISAAC 2011: 494-503
i2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mong-Jen Kao, D. T. Lee: Capacitated Domination: Constant Factor Approximation for Planar Graphs. CoRR abs/1108.4606 (2011)
2010
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mong-Jen Kao, Han-Lin Chen: Approximation Algorithms for the Capacitated Domination Problem. FAW 2010: 185-196
i1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mong-Jen Kao, Han-Lin Chen: Approximation Algorithms for the Capacitated Domination Problem. CoRR abs/1004.2839 (2010)
2007
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mong-Jen Kao, Chung-Shou Liao: Capacitated Domination Problem. ISAAC 2007: 256-267

Coauthor Index

1Han-Lin Chen
[c2] [i1]
2Jian-Jia Chen
[i4] [c6]
3Bang-Sin Dai
[i3]
4Bastian Katz
[c5] [c4]
5Marcus Krug
[c5] [c4]
6D. T. Lee (Der-Tsai Lee)
[i5] [i4] [i3] [j1] [c5] [c4] [c3] [i2]
7Chung-Shou Liao
[j1] [c1]
8Martin Nöllenburg
[c5]
9Ignaz Rutter
[i4] [c6] [c5] [c4]
10Dorothea Wagner
[i5] [i4] [c6] [c5] [c4]
Last update Sat May 25 08:14:07 2013 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page