The following pages link to Biing-Feng Wang (Q269485):
Displaying 11 items.
- Efficient algorithms for the round-trip 1-center and 1-median problems (Q269488) (← links)
- Faster query algorithms for the text fingerprinting problem (Q549671) (← links)
- Improved data structures for the orthogonal range successor problem (Q617543) (← links)
- Efficient algorithms for the conditional covering problem (Q690494) (← links)
- Efficient algorithms for the problems of enumerating cuts by non-decreasing weights (Q848944) (← links)
- Finding the conditional location of a median path on a tree (Q937298) (← links)
- Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches (Q972328) (← links)
- Efficient algorithms for two generalized 2-median problems and the group median problem on trees (Q1006061) (← links)
- Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance (Q1034103) (← links)
- An optimal simple parallel algorithm for testing isomorphism of maximal outerplanar graphs (Q1604311) (← links)
- An improved algorithm for the minmax regret path centdian problem on trees (Q1672003) (← links)
