Chen Su

List of publications from the DBLP Bibliography Server - FAQ

Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2005

2 EE Weiping Shi, Chen Su: The Rectilinear Steiner Arborescence Problem Is NP-Complete. SIAM J. Comput. 35(3): 729-740 (2005)

2000

1 EE Weiping Shi, Chen Su: The rectilinear Steiner arborescence problem is NP-complete. SODA 2000: 780-787

2005
2	EE	Weiping Shi, Chen Su: The Rectilinear Steiner Arborescence Problem Is NP-Complete. SIAM J. Comput. 35(3): 729-740 (2005)
2000
1	EE	Weiping Shi, Chen Su: The rectilinear Steiner arborescence problem is NP-complete. SODA 2000: 780-787

Coauthor Index

1 Weiping Shi [1] [2]