43 results on '"Lin, Guohui"'
Search Results
2. Corrigendum to “Complexity and approximability of the happy set problem” [Theor. Comput. Sci. 866 (2021) 123–144]
3. Intensity-dependent mass search for improving metabolite database matches in chemical isotope labeling LC-QTOF-MS-based metabolomics
4. Machine learning classification of plant genotypes grown under different light conditions through the integration of multi-scale time-series data
5. An Efficient Polynomial-Time Approximation Scheme for Parallel Multi-Stage Open Shops
6. Parameterized algorithms for the Happy Set problem
7. An improved approximation algorithm for the minimum common integer partition problem
8. Cross-cultural adaptation and measurement properties of the VISA-A questionnaire for Chinese patients with Achilles Tendinopathy
9. Minimizing total job completion time in MapReduce scheduling
10. Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles
11. Improved hardness and approximation results for single allocation hub location problems
12. Complexity and approximability of the happy set problem
13. Investigation of Zn- and Pb-rich deposits on water-wall tubes in three coal-fired boilers
14. Exact algorithms for the repetition-bounded longest common subsequence problem
15. An approximation scheme for rejection-allowed single-machine rescheduling
16. Approximation algorithms for the three-machine proportionate mixed shop scheduling
17. Open-shop scheduling for unit jobs under precedence constraints
18. Online minimum latency problem with edge uncertainty
19. Communication scheduling in data gathering networks of heterogeneous sensors with data compression: Algorithms and empirical experiments
20. Diagnostic value of blood parameters for community-acquired pneumonia
21. An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops
22. Size-constrained tree partitioning: Approximating the multicast k-tree routing problem
23. Corrigendum to “An FPTAS for the parallel two-stage flowshop problem” [Theoret. Comput. Sci. 657 (2017) 64–72]
24. An FPTAS for the parallel two-stage flowshop problem
25. The Steiner traveling salesman problem with online advanced edge blockages
26. Smoothed heights of tries and patricia tries
27. Improved parameterized and exact algorithms for cut problems on trees
28. Competitive algorithms for unbounded one-way trading
29. The Steiner Traveling Salesman Problem with online edge blockages
30. Approximating the minimum independent dominating set in perturbed graphs
31. Approximating the maximum multiple RNA interaction problem
32. On the approximability of the exemplar adjacency number problem for genomes with gene repetitions
33. Preface
34. An improved approximation algorithm for the complementary maximal strip recovery problem
35. The three column Bandpass problem is solvable in linear time
36. A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
37. Strictly chordal graphs are leaf powers
38. Vertex covering by paths on trees with its applications in machine translation
39. A space-efficient algorithm for sequence alignment with inversions and reversals
40. The longest common subsequence problem for arc-annotated sequences
41. Approximation algorithms for NMR spectral peak assignment
42. The longest common subsequence problem for sequences with nested arc annotations
43. On the terminal Steiner tree problem
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.