Senior Research Associate, Network Dynamics and Simulation Science Laboratory

Professional Preparation

Northeastern University, Computer Science, Ph.D., 2005.
Boston College, Economics, M.A., 1998.
Nanjing University, China, Economics, B.A., 1995.

Research Interests

Modeling, simulation, and analysis of large scale social networks; computational epidemiology, computational economics; algorithmic mechanism design for markets in networks; approximation algorithms for network optimization problems.

Selected Publications

J. Chen, R. Kleinberg, L. Lovasz, R. Rajaraman, R. Sundaram, and A. Vetta. (Almost) Tight Bounds and Existence Theorems for Confluent Flows. In Journal of the ACM(JACM), Volume 54, Issue 4, Article 16, July 2007.

J. Chen, R. Rajaraman, and R. Sundaram. Meet and Merge: Approximation Algorithms for Confluent Flows. In Journal of Computer and System Sciences (JCSS), special STOC 2003 issue, 72(3):468-489, May 2006.

J. Chen, L. Jia, X. Liu, G. Noubir, and R. Sundaram. Minimum Energy Accumulative Routing in Wireless Networks. In Proceedings of IEEE INFOCOM 2005.

Copyright Virginia Bioinformatics Institute © 2005