The following pages link to Francis Y. L. Chin (Q328688):
Displaying 50 items.
- (Q228669) (redirect page) (← links)
- (Q1237344) (redirect page) (← links)
- Triangulations without minimum-weight drawing (Q294766) (← links)
- Constrained pairwise and center-star sequences alignment problems (Q328691) (← links)
- Constant-competitive tree node assignment (Q391778) (← links)
- Non-adaptive complex group testing with multiple positive sets (Q393127) (← links)
- Minimum Manhattan network is NP-complete (Q540439) (← links)
- (Q590650) (redirect page) (← links)
- Online tree node assignment with resource augmentation (Q652619) (← links)
- Online pricing for bundles of multiple items (Q742127) (← links)
- Online algorithms for 1-space bounded 2-dimensional bin packing and square packing (Q744097) (← links)
- Online call control in cellular networks revisited (Q763482) (← links)
- A general program scheme for finding bridges (Q787676) (← links)
- Efficient inference control for range SUM queries (Q797310) (← links)
- Improved on-line broadcast scheduling with deadlines (Q835602) (← links)
- Greedy online frequency allocation in cellular networks (Q845962) (← links)
- A constant-competitive algorithm for online OVSF code assignment (Q848939) (← links)
- Competitive algorithms for unbounded one-way trading (Q897958) (← links)
- On-line scheduling of parallel jobs on two machines (Q954945) (← links)
- A 1-local asymptotic 13/9-competitive algorithm for multicoloring hexagonal graphs (Q1040645) (← links)
- A tight lower bound for job scheduling with cancellation (Q1044744) (← links)
- Distributed election in complete networks (Q1112606) (← links)
- A fast error evaluation algorithm for polynomial approximation (Q1237345) (← links)
- Escaping a grid by edge-disjoint paths (Q1402223) (← links)
- Maximum weight triangulation and graph drawing (Q1606921) (← links)
- Unbounded one-way trading on distributions with monotone hazard rate (Q1699812) (← links)
- Efficient algorithm for transversal of disjoint convex polygons. (Q1853055) (← links)
- Transversal of disjoint convex polygons. (Q1853175) (← links)
- Online scheduling with partial job values: does timesharing or randomization help? (Q1879362) (← links)
- Approximate and dynamic rank aggregation (Q1884843) (← links)
- Improved competitive algorithms for online scheduling with partial job values (Q1884846) (← links)
- Uniformly inserting points on square grid (Q1944133) (← links)
- A linear-time certifying algorithm for recognizing generalized series-parallel graphs (Q2104935) (← links)
- Offline and online algorithms for single-minded selling problem (Q2173298) (← links)
- Approximating the minimum triangulation of convex 3-polytopes with bounded degrees (Q2387200) (← links)
- Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing (Q2392739) (← links)
- Online bin packing of fragile objects with application in cellular networks (Q2426651) (← links)
- Algorithms for placing monitors in a flow network (Q2441585) (← links)
- Online competitive algorithms for maximizing weighted throughput of unit jobs (Q2458928) (← links)
- Construction of the nearest neighbor embracing graph of a point set (Q2479573) (← links)
- A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time (Q2498983) (← links)
- Constant competitive algorithms for unbounded one-way trading under monotone hazard rate (Q2668551) (← links)
- (Q2728899) (← links)
- (Q2729090) (← links)
- (Q2768283) (← links)
- Online Pricing for Multi-type of Items (Q2897984) (← links)
- Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing (Q3004684) (← links)
- Non-adaptive Complex Group Testing with Multiple Positive Sets (Q3010399) (← links)
- Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing (Q3060778) (← links)
- ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING (Q3069730) (← links)
- Improved Competitive Algorithms for Online Scheduling with Partial Job Values (Q3082949) (← links)
