Xujin Chen
Title
Cited by
Cited by
Year
Minimum data aggregation time problem in wireless sensor networks
X Chen, X Hu, J Zhu
International conference on mobile ad-hoc and sensor networks, 133-142, 2005
3232005
Approximation algorithms for soft-capacitated facility location in capacitated network design
X Chen, B Chen
Algorithmica 53 (3), 263-297, 2009
352009
Selling reserved instances in cloud computing
C Wang, W Ma, T Qin, X Chen, X Hu, TY Liu
Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015
242015
Approximability of the minimum weighted doubly resolving set problem
X Chen, C Wang
International Computing and Combinatorics Conference, 357-368, 2014
222014
A new model for path planning with interval data
X Chen, J Hu, X Hu
Computers & operations research 36 (6), 1893-1899, 2009
202009
Copula-based randomized mechanisms for truthful scheduling on two unrelated machines
X Chen, D Du, LF Zuluaga
Theory of Computing Systems 57 (3), 753-781, 2015
162015
Excluding braess’s paradox in nonatomic selfish routing
X Chen, Z Diao, X Hu
International Symposium on Algorithmic Game Theory, 219-230, 2015
152015
Data gathering schedule for minimal aggregation time in wireless sensor networks
X Chen, X Hu, J Zhu
International Journal of Distributed Sensor Networks 5 (4), 321-337, 2009
152009
Mechanism design for two-opposite-facility location games with penalties on distance
X Chen, X Hu, X Jia, M Li, Z Tang, C Wang
International Symposium on Algorithmic Game Theory, 256-260, 2018
132018
A network game of dynamic traffic
Z Cao, B Chen, X Chen, C Wang
Proceedings of the 2017 ACM Conference on Economics and Computation, 695-696, 2017
132017
A min-max theorem on tournaments
X Chen, X Hu, W Zang
SIAM Journal on Computing 37 (3), 923-937, 2007
132007
Approximation algorithms for pricing with negative network externalities
Z Cao, X Chen, X Hu, C Wang
Journal of Combinatorial Optimization 33 (2), 681-712, 2017
122017
Network characterizations for excluding Braess’s paradox
X Chen, Z Diao, X Hu
Theory of Computing Systems 59 (4), 747-780, 2016
122016
A polynomial solvable minimum risk spanning tree problem with interval data
X Chen, J Hu, X Hu
European Journal of Operational Research 198 (1), 43-46, 2009
112009
Maximizing the minimum load: The cost of selfishness
X Chen, L Epstein, E Kleiman, R van Stee
Theoretical Computer Science 482, 9-19, 2013
102013
The price of atomic selfish ring routing
B Chen, X Chen, X Hu
Journal of combinatorial optimization 19 (3), 258-278, 2010
102010
The box-TDI system associated with 2-edge connected spanning subgraphs
X Chen, G Ding, W Zang
Discrete applied mathematics 157 (1), 118-125, 2009
102009
Truthful mechanisms for location games of dual-role facilities
X Chen, M Li, C Wang, C Wang, Y Zhao
Proceedings of the 18th International Conference on Autonomous Agents and …, 2019
92019
A unified approach to box-Mengerian hypergraphs
X Chen, Z Chen, W Zang
Mathematics of Operations Research 35 (3), 655-668, 2010
92010
Cost‐effective designs of fault‐tolerant access networks in communication systems
X Chen, B Chen
Networks: An International Journal 53 (4), 382-391, 2009
92009
The system can't perform the operation now. Try again later.
Articles 1–20