45
Publications
2.1K
Citations
23
H-Index
1981
Active since
Ker‐I Ko is an author at University of Houston specializing in engineering, computational complexity, and discrete mathematics.
Top concepts
EngineeringComputational ComplexityComputer ScienceDiscrete MathematicsCombinatorial OptimizationAutomated ReasoningApproximation TheoryMathematical ProgrammingProbabilityFormal Methods
Publications per year
1981–2016
45
45
A greedy approximation for minimum connected dominating sets
Lu Ruan, Hongwei Du, Xiaohua Jia et al. · Theoretical Computer Science · 2004 · 223 citations
Completeness, Approximation and Density
Ker‐I Ko, D. Moore · SIAM Journal on Computing · 1981 · 88 citations
Computational Complexity Theory, Engineering, Incompleteness +15
Rows per page
1–5 of 45