The following pages link to Ming-Tat Ko (Q217890):
Displaying 29 items.
- Bounded fan-out \(m\)-center problem (Q287146) (← links)
- (Q757235) (redirect page) (← links)
- On weighted rectilinear 2-center and 3-center problems (Q757236) (← links)
- (Q1045944) (redirect page) (← links)
- Bandwidth allocation algorithms for weighted maximum rate constrained link sharing policy (Q1045946) (← links)
- Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under \(l_ \infty\)-distance (Q1208455) (← links)
- Schedulable region for VBR media transmission with optimal resource allocation and utilization (Q1394833) (← links)
- Perfect edge domination and efficient edge domination in graphs (Q1613347) (← links)
- Linear-time algorithms for tree root problems (Q2346968) (← links)
- Resequencing a set of strings based on a target string (Q2354022) (← links)
- Node-searching problem on block graphs (Q2462351) (← links)
- The Hamiltonian problem on distance-hereditary graphs (Q2489947) (← links)
- Control of Feature-point-driven Facial Animation Using a Hypothetical Face (Q2758608) (← links)
- The 3-Steiner Root Problem (Q3508559) (← links)
- (Q4218431) (← links)
- (Q4246750) (← links)
- (Q4249531) (← links)
- (Q4269819) (← links)
- (Q4511223) (← links)
- (Q4697576) (← links)
- Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs (Q4785697) (← links)
- (Q4808624) (← links)
- A Faster Implementation of a Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs (Q4953245) (← links)
- A New Subclass of Integer Linear Programming Problems and Its Applications (Q5274590) (← links)
- (Q5463350) (← links)
- Linear-Time Algorithms for Tree Root Problems (Q5757900) (← links)
- Online traffic smoothing for delivery of variable bit rate media streams (Q5950272) (← links)
- Graph searching on chordal graphs (Q6487435) (← links)
- Equitable and \(m\)-bounded coloring of split graphs (Q6567664) (← links)
