Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Wang, Biing-Feng"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A linear-time algorithm for the minimum degree hypergraph problem with the consecutive ones property
Chih-Hsuan Li
,
Jhih-Hong Ye
,
Biing-Feng Wang
Lecture Notes in Computer Science
7936
, 2013, pp. 268-279
Efficient algorithms for the conditional covering problem
Robert Benkoczi
,
Binay Bhattacharya
,
Yuzhuang Hu
,
Chien-Hsin Lin
,
Qiaosheng Shi
,
Biing-Feng Wang
Information and Computation
219
, 2012, pp. 39-57
On the minimum degree hypergraph problem with subset size two and the red-blue set cover problem with the consecutive ones property
Biing-Feng Wang
,
Chih-Hsuan Li
Lecture Notes in Computer Science
7434
, 2012, pp. 169-180
Faster query algorithms for the text fingerprinting problem
Chi-Yuan Chan
,
Hung-I Yu
,
Wing-Kai Hon
,
Biing-Feng Wang
Information and Computation
209
(7), 2011, pp. 1057-1069
Efficient algorithms for the problems of enumerating cuts by non-decreasing weights
Li-Pu Yeh
,
Biing-Feng Wang
,
Hsin-Hao Su
Algorithmica
56
(3), 2010, pp. 297-312
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
Chih-Chiang Yu
,
Chien-Hsin Lin
,
Biing-Feng Wang
Journal of Computer and System Sciences
76
(8), 2010, pp. 697-708
Efficient indexes for the positional pattern matching problem and two related problems over small alphabets
Chih-Chiang Yu
,
Biing-Feng Wang
,
Chung-Chin Kuo
Lecture Notes in Computer Science
6507
, 2010, pp. 13-24
Efficient algorithms for two generalized 2-median problems and the group median problem on trees
Chi-Yuan Chan
,
Shan-Chyun Ku
,
Chi-Jen Lu
,
Biing-Feng Wang
Theoretical Computer Science
410
(8-10), 2009, pp. 867-876
Efficient algorithms for the inverse sorting problem with bound constraints under the
l_\infty
-norm and the Hamming distance
Tzu-Chin Lin
,
Chung-Chin Kuo
,
Yong-Hsiang Hsieh
,
Biing-Feng Wang
Journal of Computer and System Sciences
75
(8), 2009, pp. 451-464
Efficient data structures for the orthogonal range successor problem
Chih-Chiang Yu
,
Wing-Kai Hon
,
Biing-Feng Wang
Lecture Notes in Computer Science
5609
, 2009, pp. 96-105
Finding the conditional location of a median path on a tree
Biing-Feng Wang
,
Tzu-Chin Lin
,
Chien-Hsin Lin
,
Shan-Chyun Ku
Information and Computation
206
(7), 2008, pp. 828-839
Efficient algorithms for the
k
smallest cuts enumeration
Li-Pu Yeh
,
Biing-Feng Wang
Lecture Notes in Computer Science
5092
, 2008, pp. 434-443
Efficient algorithms for the
k
smallest cuts enumeration
Li-Pu Yeh
,
Biing-Feng Wang
Lecture Notes in Computer Science
5092
, 2008, pp. 434-443
A faster query algorithm for the text fingerprinting problem
Chi-Yuan Chan
,
Hung-I Yu
,
Wing-Kai Hon
,
Biing-Feng Wang
Lecture Notes in Computer Science
4698
, 2007, pp. 123-135
On Chen and Chen's new tree inclusion algorithm
Hai-Lung Cheng
,
Biing-Feng Wang
Information Processing Letters
103
(1), 2007, pp. 14-18
Improved algorithms for the minmax-regret 1-center problem
Tzu-Chin Lin
,
Hung-I Yu
,
Biing-Feng Wang
Lecture Notes in Computer Science
4288
, 2006, pp. 537-546
Efficient algorithms for a constrained
k
-tree core problem in a tree network
Biing-Feng Wang
,
Shietung Peng
,
Hong-Yi Yu
,
Shan-Chyun Ku
Journal of Algorithms
59
(2), 2006, pp. 107-124
Improved algorithms for the minmax regret 1-median problem
Hung-I Yu
,
Tzu-Chin Lin
,
Biing-Feng Wang
Lecture Notes in Computer Science
4112
, 2006, pp. 52-62
Linear time algorithms for the ring loading problem with demand splitting
Biing-Feng Wang
Journal of Algorithms
54
(1), 2005, pp. 45-57
Efficient algorithms for the scaled indexing problem
Biing-Feng Wang
,
Jyh-Jye Lin
,
Shan-Chyun Ku
Journal of Algorithms
52
(1), 2004, pp. 82-100
Finding
r
-dominating sets and
p
-centers of trees in parallel
Biing-Feng Wang
IEEE Transactions on Parallel and Distributed Systems
15
(8), 2004, pp. 687-698
Constructing edge-disjoint spanning trees in product networks
Shan-Chyun Ku
,
Biing-Feng Wang
,
Ting-Kai Hung
IEEE Transactions on Parallel and Distributed Systems
14
(3), 2003, pp. 213-221
Efficient algorithms for the ring loading problem with demand splitting
Biing-Feng Wang
,
Yong-Hsian Hsieh
,
Li-Pu Yeh
Lecture Notes in Computer Science
2832
, 2003, pp. 517-526
An optimal simple parallel algorithm for testing isomorphism of maximal outerplanar graphs
Shan-Chyun Ku
,
Biing-Feng Wang
Journal Parallel Distributed Computing
62
(2), 2002, pp. 221-227
The conditional location of a median path
Biing-Feng Wang
,
Shan-Chyun Ku
,
Yong-Hsian Hsieh
Lecture Notes in Computer Science
2387
, 2002, pp. 494-503
Seiten 1
2
3
>