194 results on '"BIING-FENG WANG"'
Search Results
2. Parameterized Complexity for Finding a Perfect Phylogeny from Mixed Tumor Samples.
3. Efficient algorithms for the minmax regret path center problem with length constraint on trees.
4. A Faster Algorithm for Computing the Kernel of Maximum Agreement Subtrees.
5. A new dynamic programming algorithm for the simplified partial digest problem.
6. An improved algorithm for the minmax regret path center problem on trees.
7. On the Minmax Regret Path Center Problem on Trees.
8. Fast Algorithms for Computing Path-Difference Distances.
9. An improved algorithm for the minmax regret path centdian problem on trees.
10. A New Efficient Algorithm for the Frequent Gene Team Problem.
11. Efficient algorithms for the round-trip 1-center and 1-median problems.
12. A New Efficient Algorithm for the All Sorting Reversals Problem with No Bad Components.
13. On the minmax regret path median problem on trees.
14. A Linear-Time Algorithm for the Minimum Degree Hypergraph Problem with the Consecutive Ones Property.
15. On the Minimum Degree Hypergraph Problem with Subset Size Two and the Red-Blue Set Cover Problem with the Consecutive Ones Property.
16. On the Round-Trip 1-Center and 1-Median Problems.
17. Efficient Indexes for the Positional Pattern Matching Problem and Two Related Problems over Small Alphabets.
18. Improved Algorithms for the Gene Team Problem.
19. Efficient Data Structures for the Orthogonal Range Successor Problem.
20. Constructing a Gene Team Treein Almost $O$$(n\; {\rm lg}\; n)$ Time.
21. Efficient Algorithms for the kSmallest Cuts Enumeration.
22. Optimal Algorithms for the Segment Location Problem with Range Constraints on Length and Average.
23. A Faster Query Algorithm for the Text Fingerprinting Problem.
24. Improved Algorithms for the Minmax-Regret 1-Center Problem.
25. Improved Algorithms for the Minmax Regret 1-Median Problem.
26. Efficient Algorithms for the Ring Loading Problem with Demand Splitting.
27. An Improved Algorithm for Finding k-centrums on Weighted Trees.
28. Efficient Parallel Algorithms for the r-Dominating Set and p-Center Problems on Trees.
29. The Conditional Location of a Median Path.
30. Efficient Algorithms for Two Generalized 2-Median Problems on Trees.
31. A New Dynamic Programming Algorithm for the Simplified Partial Digest Problem
32. Output-Sensitive Algorithms for Finding the Nested Common Intervals of Two General Sequences.
33. A New Efficient Algorithm for the Gene-Team Problem on General Sequences.
34. Efficient algorithms for the conditional covering problem.
35. Finding a Two-Core of a Tree in Linear Time.
36. Improved Algorithms for Finding Gene Teams and Constructing Gene Team Trees.
37. Faster query algorithms for the text fingerprinting problem.
38. Improved data structures for the orthogonal range successor problem.
39. Parallel Algorithms for the Tree Bisector Problem and Applications.
40. Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches.
41. Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph.
42. Efficient Algorithms for the Problems of Enumerating Cuts by Non-decreasing Weights.
43. Efficient algorithms for the inverse sorting problem with bound constraints under the l∞-norm and the Hamming distance.
44. Efficient algorithms for two generalized 2-median problems and the group median problem on trees.
45. Optimally Locating a Structured Facility of a Specified Length in a Weighted Tree Network.
46. Improved algorithms for the minmax-regret 1-center and 1-median problems.
47. Optimal Algorithms for the Interval Location Problem with Range Constraints on Length and Average.
48. Finding the conditional location of a median path on a tree.
49. On the Power of the Mesh with Hybrid Buses.
50. Efficient Parallel Algorithms for Optimally Locating a k-Leaf Tree in a Tree Network.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.