Xu-jin Chen

From MaRDI portal
Person:403432

Available identifiers

zbMath Open chen.xujinMaRDI QIDQ403432

List of research outcomes

PublicationDate of PublicationType
Packing Feedback Arc Sets in Tournaments Exactly2024-03-05Paper
Bounding Residence Times for Atomic Dynamic Routings2023-01-09Paper
On weak Pareto optimality of nonatomic routing networks2022-10-04Paper
Mechanisms for dual-role-facility location games: truthfulness and approximability2022-09-16Paper
Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents2022-02-16Paper
Algorithms for the metric ring star problem with fixed edge-cost ratio2021-11-25Paper
Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game2021-03-11Paper
The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler2020-09-01Paper
Sequential Location Game on Continuous Directional Star Networks2020-07-20Paper
The price of anarchy for the load balancing game with a randomizing scheduler2020-05-13Paper
Ranking tournaments with no errors. II: Minimax relation2020-04-07Paper
Ranking tournaments with no errors. I: Structural description2020-01-15Paper
Densities, Matchings, and Fractional Edge-Colorings2019-02-08Paper
The equilibrium existence of a robust routing game under interval uncertainty2018-11-08Paper
Mechanism design for two-opposite-facility location games with penalties on distance2018-11-08Paper
Embedding games with strategic complements into games with strategic substitutes2018-10-26Paper
Covering triangles in edge-weighted graphs2018-08-03Paper
Algorithms for the ring star problem2018-03-26Paper
Finding connected \(k\)-subgraphs with high density2017-09-28Paper
Continuous Firefighting on Infinite Square Grids2017-05-19Paper
Approximation algorithms for pricing with negative network externalities2017-02-22Paper
Network characterizations for excluding Braess's paradox2017-02-01Paper
Total Dual Integrality of Triangle Covering2017-02-01Paper
Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles2016-09-29Paper
Network Topologies for Weakly Pareto Optimal Nonatomic Selfish Routing2016-09-02Paper
A Polyhedral Description of Kernels2016-08-10Paper
Copula-based randomized mechanisms for truthful scheduling on two unrelated machines2016-01-13Paper
Approximation for the minimum cost doubly resolving set problem2015-12-11Paper
Excluding Braess’s Paradox in Nonatomic Selfish Routing2015-11-04Paper
Finding Connected Dense $$k$$-Subgraphs2015-09-30Paper
Balancing Load via Small Coalitions in Selfish Ring Routing Games2015-04-15Paper
https://portal.mardi4nfdi.de/entity/Q29235632014-11-03Paper
Schedules for marketing products with negative externalities2014-10-06Paper
Approximability of the Minimum Weighted Doubly Resolving Set Problem2014-09-26Paper
Risk models for the prize collecting Steiner tree problems with interval data2014-08-29Paper
Stability vs. optimality in selfish ring routing2014-06-11Paper
Reducing price of anarchy of selfish task allocation with more selfishness2014-01-16Paper
Maximizing the minimum load: the cost of selfishness2014-01-09Paper
Copula-Based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines2013-10-23Paper
How to Schedule the Marketing of Products with Negative Externalities2013-06-11Paper
Total Dual Integrality in Some Facility Location Problems2013-01-04Paper
The Maximum-Weight Stable Matching Problem: Duality and Efficiency2013-01-04Paper
Efficiency of Dual Equilibria in Selfish Task Allocation to Selfish Machines2012-11-02Paper
Pairwise cooperations in selfish ring routing for minimax linear latency2012-08-13Paper
Packing cycles exactly in polynomial time2012-05-23Paper
Bonds with parity constraints2012-05-11Paper
A Characterization of Box-Mengerian Matroid Ports2011-04-27Paper
A Unified Approach to Box-Mengerian Hypergraphs2011-04-27Paper
Deterministic risk control for cost-effective network connections2011-01-28Paper
Reducing the Maximum Latency of Selfish Ring Routing via Pairwise Cooperations2011-01-10Paper
Cost-effective designs of fault-tolerant access networks in communication systems2010-11-24Paper
Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data2010-07-20Paper
The price of atomic selfish ring routing2010-06-11Paper
https://portal.mardi4nfdi.de/entity/Q36403502009-11-11Paper
A polynomial solvable minimum risk spanning tree problem with interval data2009-06-30Paper
Approximation algorithms for soft-capacitated facility location in capacitated network design2009-06-17Paper
The box-TDI system associated with 2-edge connected spanning subgraphs2009-03-04Paper
On the Minimum Risk-Sum Path Problem2009-03-03Paper
The Minimum Risk Spanning Tree Problem2009-03-03Paper
A new model for path planning with interval data2009-02-12Paper
On the restricted forwarding index problem in communication networks2009-01-27Paper
Inapproximability and approximability of minimal tree routing and coloring2008-08-08Paper
A Min-Max Theorem on Tournaments2008-06-19Paper
A Min-Max Relation on Packing Feedback Vertex Sets2008-05-27Paper
Algorithms and Computation2006-11-14Paper
Inapproximability and approximability of maximal tree routing and coloring2006-08-14Paper
An efficient algorithm for finding maximum cycle packings in reducible flow graphs2006-06-14Paper
Computing and Combinatorics2006-01-11Paper
Algorithms and Computation2005-12-22Paper
Algorithmic Applications in Management2005-11-30Paper
Perfect circular arc coloring2005-10-18Paper
https://portal.mardi4nfdi.de/entity/Q44633672004-05-27Paper
https://portal.mardi4nfdi.de/entity/Q45459832002-08-18Paper
https://portal.mardi4nfdi.de/entity/Q27216892001-07-10Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Xu-jin Chen