|
|
Ad. hoc. networking; Parameterized Computation; Bioinformatics |
| CPSC 608 Database Systems, Fall 2007 Office Hour: 2pm-3pm, Wednesday and Friday, or by appointment. | |
| CPSC 289-502 Special Topics on Discrete Structures for Computing, Spring 2007 | |
| CPSC 121 Foundations of Engineering II( Lab section 501-502 ), Fall 2006 |
| S. Lu, F. Zhang, J. Chen, and S.-H. Sze, Finding Pathway Structures in Protein Interaction Networks, Algorithmica, 48(4), 363-374(2007). | |
| J. Chen, F. Zhang, On Product Covering in Supply Chain Models: Natural Complete Problems for W[3] and W[4], Theor. Comput. Sci. 363(3), 278-288 (2006). |
| F. Zhang, A. Jiang and J. Chen, Sorting based data centric storage, IEEE NCA 2008, to appear. | |
| J. Chen, I. Kanj, J. Meng, G. Xia and F. Zhang, On the pseudo-achromatic number problem, WG 2008, to appear. | |
| F. Zhang, A. Jiang and J. Chen, Robust Planarization of Unlocalized Wireless Sensor Networks, IEEE INFOCOM 2008, April 2008. | |
| F. Zhang, H. Li, A. Jiang, J. Chen and P. Luo, Face Tracing Based Geographic Routing in Nonplanar Wireless Networks, IEEE INFOCOM, May 2007. | |
| J. Chen, A. Jiang, I. Kanj, G. Xia and F. Zhang, Separability and Topology Control of Quasi Unit Disk Graphs, IEEE INFOCOM, May 2007. | |
| J. Chen, S. Lu, S.-H. Sze, and F. Zhang, Improved algorithms for path, matching, and packing problems, SODA 2007, 298-307. | |
| J. Chen, I. Kanj, J. Meng, G. Xia, F. Zhang, On the Effective Enumerability of NP Problems, IWPEC 2006, 215-226. | |
| J. Chen, F. Zhang, On Product Covering in Supply Chain Models, Natural Complete Problems for W[3] and W[4], AAIM 2005, 400-410. |