Bing Yang

13 papers A* 1B 3C 2Misc 1Journal 2Unranked 4
YearRankTypeTitle / Venue / Authors
2010 J jnl
Minimum-Cost Multiple Paths Subject to Minimum Link and Node Sharing in a Network.
IEEE/ACM Trans. Netw.
S. Q. Zheng, Jianping Wang, Bing Yang, Mei Yang
2008 J jnl
Design and Performance Evaluation of Sequence Partition Algorithms.
J. Comput. Sci. Technol.
Bing Yang, Jing Chen, Enyue Lu, Si-Qing Zheng
2008 B conf
Fault Tolerant Service Composition in Service Overlay Networks.
GLOBECOM
Jin Wang, Jianping Wang, Naijie Gu, Bing Yang
2007 C conf
A Comparative Study of Efficient Algorithms for Partitioning a Sequence into Monotone Subsequences.
TAMC
Bing Yang, Jing Chen, Enyue Lu, S. Q. Zheng
2007 A* conf
Finding Minimum-Cost Paths with Minimum Sharability.
INFOCOM
Si-Qing Zheng, Bing Yang, Mei Yang, Jianping Wang
2007 — conf
Finding Two Disjoint Paths in a Network with MinSum-MinMin Objective Function.
FCS
Bing Yang, S. Q. Zheng, Enyue Lu
2006 C conf
Finding Min-Sum Disjoint Shortest Paths from a Single Source to All Pairs of Destinations.
TAMC
Bing Yang, S. Q. Zheng
2006 — conf
Message Scheduling on a Wormhole-Switched Linear Client-Server Network.
PDCS
Bing Yang, Ashwin Gumaste, Enyue Lu, Si-Qing Zheng
2005 Misc conf
A Fast Parallel Routing Algorithm for Strictly Nonblocking Switching Networks.
PDPTA
Enyue Lu, S. Q. Zheng, Bing Yang
2005 B conf
Finding Two Disjoint Paths in a Network with Normalized
ISAAC
Bing Yang, S. Q. Zheng, Enyue Lu
2005 — conf
Finding Two Disjoint Paths in a Network with Normalized alpha-MIN-SUM Objective Function.
IASTED PDCS
Bing Yang, S. Q. Zheng, Enyue Lu
2005 — conf
Minimum Cost Paths Subject to Minimum Vulnerability for Reliable Communications.
ISPAN
Bing Yang, Mei Yang, Jianping Wang, S. Q. Zheng
2004 B conf
A class of self-routing strictly nonblocking photonic switching networks.
GLOBECOM
Enyue Lu, Mei Yang, Bing Yang, S. Q. Zheng