24 results on '"Lin, Guohui"'
Search Results
2. Smoothed heights of tries and patricia tries
3. Improved parameterized and exact algorithms for cut problems on trees
4. Competitive algorithms for unbounded one-way trading
5. Approximating the maximum multiple RNA interaction problem
6. Approximating the minimum independent dominating set in perturbed graphs
7. On the approximability of the exemplar adjacency number problem for genomes with gene repetitions
8. Size-constrained tree partitioning: Approximating the multicast [formula omitted]-tree routing problem
9. The three column Bandpass problem is solvable in linear time
10. A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
11. Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles
12. Improved hardness and approximation results for single allocation hub location problems
13. Complexity and approximability of the happy set problem
14. Exact algorithms for the repetition-bounded longest common subsequence problem
15. Approximation algorithms for the three-machine proportionate mixed shop scheduling
16. Open-shop scheduling for unit jobs under precedence constraints
17. A space-efficient algorithm for sequence alignment with inversions and reversals
18. Approximation algorithms for NMR spectral peak assignment
19. An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops
20. Corrigendum to “An FPTAS for the parallel two-stage flowshop problem” [Theoret. Comput. Sci. 657 (2017) 64–72]
21. An FPTAS for the parallel two-stage flowshop problem
22. Preface
23. Size-constrained tree partitioning: Approximating the multicast k-tree routing problem
24. PII: S0304-3975(13)00703-2
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.