Xujin Chen

J. Comb. Optim., 2022

2021

Algorithms for the metric ring star problem with fixed edge-cost ratio.

[BibT_eX]

[DOI]

J. Comb. Optim., 2021

Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2021

Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents.

[BibT_eX]

[DOI]

Oper. Res., 2021

2020

The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Ranking tournaments with no errors II: Minimax relation.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2020

Ranking tournaments with no errors I: Structural description.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2020

Sequential Location Game on Continuous Directional Star Networks.

[BibT_eX]

[DOI]

Mengqi Zhang

Proceedings of the Complexity and Approximation - In Memory of Ker-I Ko, 2020

Favorite-Candidate Voting for Eliminating the Least Popular Candidate in a Metric Space.

[BibT_eX]

[DOI]

Minming Li

Chenhao Wang

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Densities, Matchings, and Fractional Edge-Colorings.

[BibT_eX]

[DOI]

Qiulan Zhao

SIAM J. Optim., 2019

Favorite-Candidate Voting for Eliminating the Least Popular Candidate in Metric Spaces.

[BibT_eX]

[DOI]

Minming Li

Chenhao Wang

CoRR, 2019

The Price of Anarchy for the Load Balancing Game with a Randomizing Scheduler.

[BibT_eX]

[DOI]

Xiaoying Wu

Proceedings of the Combinatorial Optimization and Applications, 2019

Truthful Mechanisms for Location Games of Dual-Role Facilities.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018

Covering Triangles in Edge-Weighted Graphs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2018

The Equilibrium Existence of a Robust Routing Game Under Interval Uncertainty.

[BibT_eX]

[DOI]

Chenhao Wang

Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

Mechanism Design for Two-Opposite-Facility Location Games with Penalties on Distance.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

2017

Approximation algorithms for pricing with negative network externalities.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

Finding connected k-subgraphs with high density.

[BibT_eX]

[DOI]

Inf. Comput., 2017

Continuous Firefighting on Infinite Square Grids.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2017

A Network Game of Dynamic Traffic.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Efficient Mechanism Design for Online Scheduling (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Algorithms for the Ring Star Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

Approximation for the minimum cost doubly resolving set problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Network Characterizations for Excluding Braess's Paradox.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2016

A Polyhedral Description of Kernels.

[BibT_eX]

[DOI]

Qin Chen

Math. Oper. Res., 2016

Efficient Mechanism Design for Online Scheduling.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2016

Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Network Topologies for Weakly Pareto Optimal Nonatomic Selfish Routing.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

Total Dual Integrality of Triangle Covering.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Copula-based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines.

[BibT_eX]

[DOI]

Donglei Du

Luis Fernando Zuluaga

Theory Comput. Syst., 2015

Balancing Load via Small Coalitions in Selfish Ring Routing Games.

[BibT_eX]

[DOI]

Weidong Ma

Asia Pac. J. Oper. Res., 2015

Finding Connected Dense k -Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2015

Excluding Braess's Paradox in Nonatomic Selfish Routing.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015

Selling Reserved Instances in Cloud Computing.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Pricing in Social Networks with Negative Externalities.

[BibT_eX]

[DOI]

Proceedings of the Computational Social Networks - 4th International Conference, 2015

New Mechanism for Reservation in Cloud Computing.

[BibT_eX]

[DOI]

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014

The Price of Anarchy for Selfish Ring Routing is Two.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2014

Schedules for marketing products with negative externalities.

[BibT_eX]

[DOI]

Zhigang Cao

Theor. Comput. Sci., 2014

Approximability of the Minimum Weighted Doubly Resolving Set Problem.

[BibT_eX]

[DOI]

CoRR, 2014

Approximability of the Minimum Weighted Doubly Resolving Set Problem.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2013

Reducing price of anarchy of selfish task allocation with more selfishness.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Maximizing the minimum load: The cost of selfishness.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

How to Schedule the Marketing of Products with Negative Externalities.

[BibT_eX]

[DOI]

Zhigang Cao

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012

Pairwise cooperations in selfish ring routing for minimax linear latency.

[BibT_eX]

[DOI]

Weidong Ma

Theor. Comput. Sci., 2012

The Maximum-Weight Stable Matching Problem: Duality and Efficiency.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

Total Dual Integrality in Some Facility Location Problems.

[BibT_eX]

[DOI]

Zhibin Chen

SIAM J. Discret. Math., 2012

Bonds with parity constraints.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2012

Packing cycles exactly in polynomial time.

[BibT_eX]

[DOI]

Qin Chen

J. Comb. Optim., 2012

Efficiency of Dual Equilibria in Selfish Task Allocation to Selfish Machines.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2012

2011

Deterministic risk control for cost-effective network connections.

[BibT_eX]

[DOI]

Eduardo Álvarez-Miranda

Theor. Comput. Sci., 2011

2010

A Unified Approach to Box-Mengerian Hypergraphs.

[BibT_eX]

[DOI]

Zhibin Chen

Math. Oper. Res., 2010

The price of atomic selfish ring routing.

[BibT_eX]

[DOI]

Bo Chen

J. Comb. Optim., 2010

Reducing the Maximum Latency of Selfish Ring Routing via Pairwise Cooperations.

[BibT_eX]

[DOI]

Weidong Ma

Proceedings of the Combinatorial Optimization and Applications, 2010

Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data.

[BibT_eX]

[DOI]

Eduardo Álvarez-Miranda

Proceedings of the Algorithmic Aspects in Information and Management, 2010

2009

Cost-effective designs of fault-tolerant access networks in communication systems.

[BibT_eX]

[DOI]

Bo Chen

Networks, 2009

Data Gathering Schedule for Minimal Aggregation Time in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Jianming Zhu

Int. J. Distributed Sens. Networks, 2009

A polynomial solvable minimum risk spanning tree problem with interval data.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2009

The box-TDI system associated with 2-edge connected spanning subgraphs.

[BibT_eX]

[DOI]

Guoli Ding

Discret. Appl. Math., 2009

A new model for path planning with interval data.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2009

Approximation Algorithms for Soft-Capacitated Facility Location in Capacitated Network Design.

[BibT_eX]

[DOI]

Bo Chen

Algorithmica, 2009

2008

A Characterization of Box-Mengerian Matroid Ports.

[BibT_eX]

[DOI]

Guoli Ding

Math. Oper. Res., 2008

Inapproximability and approximability of minimal tree routing and coloring.

[BibT_eX]

[DOI]

Xiaohua Jia

J. Discrete Algorithms, 2008

2007

A Min-Max Theorem on Tournaments.

[BibT_eX]

[DOI]

SIAM J. Comput., 2007

On the restricted forwarding index problem in communication networks.

[BibT_eX]

[DOI]

Min Xu

Comput. Math. Appl., 2007

On the Minimum Risk-Sum Path Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics, 2007

The Minimum Risk Spanning Tree Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2007

2006

A Min-Max Relation on Packing Feedback Vertex Sets.

[BibT_eX]

[DOI]

Math. Oper. Res., 2006

Inapproximability and approximability of maximal tree routing and coloring.

[BibT_eX]

[DOI]

Tianping Shuai

J. Comb. Optim., 2006

An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2006

Minimum Multicast Time Problem in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Jianming Zhu

Proceedings of the Wireless Algorithms, 2006

2005

Perfect Circular Arc Coloring.

[BibT_eX]

[DOI]

Zhiquan Hu

J. Comb. Optim., 2005

Minimum Data Aggregation Time Problem in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Jianming Zhu

Proceedings of the Mobile Ad-hoc and Sensor Networks, First International Conference, 2005

Routing and Coloring for Maximal Number of Trees.

[BibT_eX]

[DOI]

Tianping Shuai

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Complexity of Minimal Tree Routing and Coloring.

[BibT_eX]

[DOI]