Complexity of Minimal Tree Routing and Coloring. - Xujin Chen; Xiao-Dong Hu 001; Xiaohua Jia (AAIM, 2005)

Routing and Coloring for Maximal Number of Trees. - Xujin Chen; Xiao-Dong Hu 001; Tianping Shuai (COCOON, 2005)

Minimum Data Aggregation Time Problem in Wireless Sensor Networks. - Xujin Chen; Xiaodong Hu 001; Jianming Zhu (MSN, 2005)

Perfect Circular Arc Coloring. - Xujin Chen; Zhiquan Hu; Wenan Zang (J. Comb. Optim., 2005)

Minimum Multicast Time Problem in Wireless Sensor Networks. - Jianming Zhu; Xujin Chen; Xiaodong Hu 001 (WASA, 2006)

An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs. - Xujin Chen; Wenan Zang (Algorithmica, 2006)

Inapproximability and approximability of maximal tree routing and coloring. - Xujin Chen; Xiaodong Hu 001; Tianping Shuai (J. Comb. Optim., 2006)

A Min-Max Relation on Packing Feedback Vertex Sets. - Xujin Chen; Guoli Ding; Xiaodong Hu 001; Wenan Zang (Math. Oper. Res., 2006)

The Minimum Risk Spanning Tree Problem. - Xujin Chen; Jie Hu 009; Xiaodong Hu 001 (COCOA, 2007)

On the Minimum Risk-Sum Path Problem. - Xujin Chen; Jie Hu 009; Xiaodong Hu 001 (ESCAPE, 2007)

On the restricted forwarding index problem in communication networks. - Min Xu 005; Xujin Chen; Xiaodong Hu 001 (Comput. Math. Appl., 2007)

A Min-Max Theorem on Tournaments. - Xujin Chen; Xiaodong Hu 001; Wenan Zang (SIAM J. Comput., 2007)

Inapproximability and approximability of minimal tree routing and coloring. - Xujin Chen; Xiaodong Hu 001; Xiaohua Jia (J. Discrete Algorithms, 2008)

A Characterization of Box-Mengerian Matroid Ports. - Xujin Chen; Guoli Ding; Wenan Zang (Math. Oper. Res., 2008)

Approximation Algorithms for Soft-Capacitated Facility Location in Capacitated Network Design. - Xujin Chen; Bo Chen 002 (Algorithmica, 2009)

A new model for path planning with interval data. - Xujin Chen; Jie Hu 009; Xiaodong Hu 001 (Comput. Oper. Res., 2009)

The box-TDI system associated with 2-edge connected spanning subgraphs. - Xujin Chen; Guoli Ding; Wenan Zang (Discret. Appl. Math., 2009)

A polynomial solvable minimum risk spanning tree problem with interval data. - Xujin Chen; Jie Hu 009; Xiaodong Hu 001 (Eur. J. Oper. Res., 2009)

Data Gathering Schedule for Minimal Aggregation Time in Wireless Sensor Networks. - Xujin Chen; Xiaodong Hu 001; Jianming Zhu (Int. J. Distributed Sens. Networks, 2009)

Cost-effective designs of fault-tolerant access networks in communication systems. - Xujin Chen; Bo Chen 002 (Networks, 2009)

Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data. - Eduardo Álvarez-Miranda; Alfredo Candia-Véjar; Xujin Chen; Xiaodong Hu 001; Bi Li 004 (AAIM, 2010)

Reducing the Maximum Latency of Selfish Ring Routing via Pairwise Cooperations. - Xujin Chen; Xiaodong Hu 001; Weidong Ma (COCOA (2), 2010)

The price of atomic selfish ring routing. - Bo Chen 002; Xujin Chen; Xiaodong Hu 001 (J. Comb. Optim., 2010)

A Unified Approach to Box-Mengerian Hypergraphs. - Xujin Chen; Zhibin Chen; Wenan Zang (Math. Oper. Res., 2010)

Deterministic risk control for cost-effective network connections. - Eduardo Álvarez-Miranda; Xujin Chen; Jie Hu 009; Xiaodong Hu 001; Alfredo Candia-Véjar (Theor. Comput. Sci., 2011)

Efficiency of Dual Equilibria in Selfish Task Allocation to Selfish Machines. - Xujin Chen; Xiaodong Hu 001; Weidong Ma; Changjun Wang (COCOA, 2012)

Packing cycles exactly in polynomial time. - Qin Chen; Xujin Chen (J. Comb. Optim., 2012)

Bonds with parity constraints. - Xujin Chen; Guoli Ding; Xingxing Yu; Wenan Zang (J. Comb. Theory B, 2012)

Total Dual Integrality in Some Facility Location Problems. - Xujin Chen; Zhibin Chen; Wenan Zang (SIAM J. Discret. Math., 2012)

The Maximum-Weight Stable Matching Problem: Duality and Efficiency. - Xujin Chen; Guoli Ding; Xiaodong Hu 001; Wenan Zang (SIAM J. Discret. Math., 2012)

Pairwise cooperations in selfish ring routing for minimax linear latency. - Xujin Chen; Xiaodong Hu 001; Weidong Ma (Theor. Comput. Sci., 2012)

How to Schedule the Marketing of Products with Negative Externalities. - Zhigang Cao 002; Xujin Chen; Changjun Wang (COCOON, 2013)

Maximizing the minimum load: The cost of selfishness. - Xujin Chen; Leah Epstein; Elena Kleiman; Rob van Stee (Theor. Comput. Sci., 2013)

Reducing price of anarchy of selfish task allocation with more selfishness. - Xujin Chen; Xiaodong Hu 001; Weidong Ma; Changjun Wang (Theor. Comput. Sci., 2013)

Approximability of the Minimum Weighted Doubly Resolving Set Problem. - Xujin Chen; Changjun Wang (COCOON, 2014)

Approximability of the Minimum Weighted Doubly Resolving Set Problem. - Xujin Chen; Xiaodong Hu 001; Changjun Wang (CoRR, 2014)

Schedules for marketing products with negative externalities. - Zhigang Cao 002; Xujin Chen; Changjun Wang (Theor. Comput. Sci., 2014)

The Price of Anarchy for Selfish Ring Routing is Two. - Xujin Chen; Benjamin Doerr; Carola Doerr; Xiaodong Hu 001; Weidong Ma; Rob van Stee (ACM Trans. Economics and Comput., 2014)

New Mechanism for Reservation in Cloud Computing. - Changjun Wang; Weidong Ma; Tao Qin 001; Feidiao Yang; Tie-Yan Liu; Xujin Chen; Xiao-Dong Hu 001 (AAMAS, 2015)

Pricing in Social Networks with Negative Externalities. - Zhigang Cao 002; Xujin Chen; Xiaodong Hu 001; Changjun Wang (CSoNet, 2015)

Selling Reserved Instances in Cloud Computing. - Changjun Wang; Weidong Ma; Tao Qin 001; Xujin Chen; Xiaodong Hu 001; Tie-Yan Liu (IJCAI, 2015)

Excluding Braess's Paradox in Nonatomic Selfish Routing. - Xujin Chen; Zhuo Diao; Xiao-Dong Hu 001 (SAGT, 2015)

Finding Connected Dense k -Subgraphs. - Xujin Chen; Xiao-Dong Hu 001; Changjun Wang (TAMC, 2015)

Balancing Load via Small Coalitions in Selfish Ring Routing Games. - Xujin Chen; Xiao-Dong Hu 001; Weidong Ma (Asia Pac. J. Oper. Res., 2015)

Copula-based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines. - Xujin Chen; Donglei Du; Luis Fernando Zuluaga (Theory Comput. Syst., 2015)

Total Dual Integrality of Triangle Covering. - Xujin Chen; Zhuo Diao; Xiao-Dong Hu 001; Zhongzheng Tang (COCOA, 2016)

Network Topologies for Weakly Pareto Optimal Nonatomic Selfish Routing. - Xujin Chen; Zhuo Diao (COCOON, 2016)

Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles. - Xujin Chen; Zhuo Diao; Xiao-Dong Hu 001; Zhongzheng Tang (IWOCA, 2016)

Efficient Mechanism Design for Online Scheduling. - Xujin Chen; Xiaodong Hu 001; Tie-Yan Liu; Weidong Ma; Tao Qin 001; Pingzhong Tang; Changjun Wang; Bo Zheng (J. Artif. Intell. Res., 2016)

A Polyhedral Description of Kernels. - Qin Chen; Xujin Chen; Wenan Zang (Math. Oper. Res., 2016)

Network Characterizations for Excluding Braess's Paradox. - Xujin Chen; Zhuo Diao; Xiaodong Hu 001 (Theory Comput. Syst., 2016)

Approximation for the minimum cost doubly resolving set problem. - Xujin Chen; Xiao-Dong Hu 001; Changjun Wang (Theor. Comput. Sci., 2016)

Algorithms for the Ring Star Problem. - Xujin Chen; Xiaodong Hu 001; Zhongzheng Tang; Chenhao Wang 001; Ying Zhang (COCOA (2), 2017)

Efficient Mechanism Design for Online Scheduling (Extended Abstract). - Xujin Chen; Xiaodong Hu 001; Tie-Yan Liu; Weidong Ma; Tao Qin 001; Pingzhong Tang; Changjun Wang; Bo Zheng (IJCAI, 2017)

A Network Game of Dynamic Traffic. - Zhigang Cao 002; Bo Chen 002; Xujin Chen; Changjun Wang (EC, 2017)

Continuous Firefighting on Infinite Square Grids. - Xujin Chen; Xiaodong Hu 001; Changjun Wang; Ying Zhang (TAMC, 2017)

Finding connected k-subgraphs with high density. - Xujin Chen; Xiaodong Hu 001; Changjun Wang (Inf. Comput., 2017)

Approximation algorithms for pricing with negative network externalities. - Zhigang Cao 002; Xujin Chen; Xiaodong Hu 001; Changjun Wang (J. Comb. Optim., 2017)

Mechanism Design for Two-Opposite-Facility Location Games with Penalties on Distance. - Xujin Chen; Xiaodong Hu 001; Xiaohua Jia; Minming Li; Zhongzheng Tang; Chenhao Wang 001 (SAGT, 2018)

The Equilibrium Existence of a Robust Routing Game Under Interval Uncertainty. - Xujin Chen; Xiaodong Hu 001; Chenhao Wang 001 (SAGT, 2018)

Covering Triangles in Edge-Weighted Graphs. - Xujin Chen; Zhuo Diao; Xiaodong Hu 001; Zhongzheng Tang (Theory Comput. Syst., 2018)

Truthful Mechanisms for Location Games of Dual-Role Facilities. - Xujin Chen; Minming Li; Changjun Wang; Chenhao Wang 001; Yingchao Zhao 001 (AAMAS, 2019)

The Price of Anarchy for the Load Balancing Game with a Randomizing Scheduler. - Xujin Chen; Xiaodong Hu 001; Xiaoying Wu (COCOA, 2019)

Favorite-Candidate Voting for Eliminating the Least Popular Candidate in Metric Spaces. - Xujin Chen; Minming Li; Chenhao Wang 001 (CoRR, 2019)

Densities, Matchings, and Fractional Edge-Colorings. - Xujin Chen; Wenan Zang; Qiulan Zhao (SIAM J. Optim., 2019)

Favorite-Candidate Voting for Eliminating the Least Popular Candidate in a Metric Space. - Xujin Chen; Minming Li; Chenhao Wang 001 (AAAI, 2020)

Sequential Location Game on Continuous Directional Star Networks. - Xujin Chen; Xiaodong Hu 001; Mengqi Zhang (Complexity and Approximation, 2020)

Ranking tournaments with no errors I: Structural description. - Xujin Chen; Guoli Ding; Wenan Zang; Qiulan Zhao (J. Comb. Theory B, 2020)

Ranking tournaments with no errors II: Minimax relation. - Xujin Chen; Guoli Ding; Wenan Zang; Qiulan Zhao (J. Comb. Theory B, 2020)

The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler. - Xujin Chen; Xiaodong Hu 001; Chenhao Wang 001; Xiaoying Wu (Theor. Comput. Sci., 2020)

Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents. - Zhigang Cao 002; Bo Chen 002; Xujin Chen; Changjun Wang (Oper. Res., 2021)

Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game. - Xujin Chen; Xiaodong Hu 001; Zhongzheng Tang; Chenhao Wang 001 (Inf. Process. Lett., 2021)

Algorithms for the metric ring star problem with fixed edge-cost ratio. - Xujin Chen; Xiao-Dong Hu 001; Xiaohua Jia; Zhongzheng Tang; Chenhao Wang 001; Ying Zhang (J. Comb. Optim., 2021)

On weak Pareto optimality of nonatomic routing networks. - Xujin Chen; Zhuo Diao; Xiao-Dong Hu 001 (J. Comb. Optim., 2022)

Mechanisms for dual-role-facility location games: Truthfulness and approximability. - Xujin Chen; Minming Li; Changjun Wang; Chenhao Wang 001; Mengqi Zhang; Yingchao Zhao 001 (Theor. Comput. Sci., 2022)

Introduction to the Special Issue on WINE'20: Part 1. - Martin Hoefer 001; Xujin Chen; Nikolai Gravin; Ruta Mehta (ACM Trans. Economics and Comput., 2022)

Bounding Residence Times for Atomic Dynamic Routings. - Zhigang Cao 002; Bo Chen 002; Xujin Chen; Changjun Wang (Math. Oper. Res., 2022)

When does additional information lead to longer travel time in multi-origin-destination networks? - Xujin Chen; Xiaodong Hu 001; Xinqi Jing; Zhongzheng Tang (CoRR, 2024)

Algorithms for maximum social welfare of online random trading. - Xujin Chen; Xiaodong Hu 001; Chenhao Wang 001; Xiaoying Wu; Mengqi Zhang (Discret. Appl. Math., 2024)

Packing Feedback Arc Sets in Tournaments Exactly. - Xujin Chen; Guoli Ding; Wenan Zang; Qiulan Zhao (Math. Oper. Res., 2024)

Mixed Graph Covering with Target Constraints. - Xujin Chen; Xiyuan Deng; Xiao-Dong Hu 001; Changjun Wang (IJTCS-FAW, 2025)