Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXujin Chen
陈旭瑾
Person information
- unicode name: 陈旭瑾
- affiliation: Chinese Academy of Sciences, Academy of Mathematics and Systems Science, Beijing, China
- affiliation: University of Chinese Academy of Sciences, School of Mathematical Sciences, Beijing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2022
[j46]Xujin Chen, Zhuo Diao
, Xiao-Dong Hu:
On weak Pareto optimality of nonatomic routing networks. J. Comb. Optim. 44(3): 1705-1723 (2022)- [j45]Zhigang Cao, Bo Chen, Xujin Chen, Changjun Wang:
Bounding Residence Times for Atomic Dynamic Routings. Math. Oper. Res. 47(4): 3261-3281 (2022) - [j44]Xujin Chen, Minming Li, Changjun Wang, Chenhao Wang, Mengqi Zhang, Yingchao Zhao:
Mechanisms for dual-role-facility location games: Truthfulness and approximability. Theor. Comput. Sci. 932: 69-83 (2022) - [j43]Martin Hoefer, Xujin Chen, Nikolai Gravin, Ruta Mehta:
Introduction to the Special Issue on WINE'20: Part 1. ACM Trans. Economics and Comput. 10(2): 6:1 (2022) - 2021
- [j42]Zhigang Cao, Bo Chen, Xujin Chen, Changjun Wang:
Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents. Oper. Res. 69(6): 1680-1695 (2021) - [j41]Xujin Chen, Xiaodong Hu, Zhongzheng Tang, Chenhao Wang:
Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game. Inf. Process. Lett. 168: 106098 (2021) - [j40]Xujin Chen, Xiao-Dong Hu, Xiaohua Jia, Zhongzheng Tang, Chenhao Wang, Ying Zhang:
Algorithms for the metric ring star problem with fixed edge-cost ratio. J. Comb. Optim. 42(3): 499-523 (2021) - 2020
- [j39]Xujin Chen, Guoli Ding, Wenan Zang, Qiulan Zhao:
Ranking tournaments with no errors I: Structural description. J. Comb. Theory, Ser. B 141: 264-294 (2020) - [j38]Xujin Chen, Guoli Ding, Wenan Zang, Qiulan Zhao:
Ranking tournaments with no errors II: Minimax relation. J. Comb. Theory, Ser. B 142: 244-275 (2020) - [j37]Xujin Chen, Xiaodong Hu, Chenhao Wang, Xiaoying Wu:
The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler. Theor. Comput. Sci. 838: 180-194 (2020) - 2019
- [j36]Xujin Chen, Wenan Zang, Qiulan Zhao:
Densities, Matchings, and Fractional Edge-Colorings. SIAM J. Optim. 29(1): 240-261 (2019) - 2018
- [j35]Xujin Chen, Zhuo Diao, Xiaodong Hu, Zhongzheng Tang:
Covering Triangles in Edge-Weighted Graphs. Theory Comput. Syst. 62(6): 1525-1552 (2018) - 2017
- [j34]Xujin Chen, Xiaodong Hu, Changjun Wang:
Finding connected k-subgraphs with high density. Inf. Comput. 256: 160-173 (2017) - [j33]Zhigang Cao, Xujin Chen, Xiaodong Hu, Changjun Wang:
Approximation algorithms for pricing with negative network externalities. J. Comb. Optim. 33(2): 681-712 (2017) - 2016
- [j32]Xujin Chen, Xiaodong Hu, Tie-Yan Liu, Weidong Ma, Tao Qin, Pingzhong Tang, Changjun Wang, Bo Zheng:
Efficient Mechanism Design for Online Scheduling. J. Artif. Intell. Res. 56: 429-461 (2016) - [j31]Qin Chen, Xujin Chen, Wenan Zang:
A Polyhedral Description of Kernels. Math. Oper. Res. 41(3): 969-990 (2016) - [j30]Xujin Chen, Zhuo Diao, Xiaodong Hu:
Network Characterizations for Excluding Braess's Paradox. Theory Comput. Syst. 59(4): 747-780 (2016) - [j29]Xujin Chen, Xiao-Dong Hu, Changjun Wang:
Approximation for the minimum cost doubly resolving set problem. Theor. Comput. Sci. 609: 526-543 (2016) - 2015
- [j28]Xujin Chen, Xiao-Dong Hu, Weidong Ma:
Balancing Load via Small Coalitions in Selfish Ring Routing Games. Asia Pac. J. Oper. Res. 32(1): 1540003:1-1540003:27 (2015) - [j27]Xujin Chen, Donglei Du, Luis Fernando Zuluaga:
Copula-based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines. Theory Comput. Syst. 57(3): 753-781 (2015) - 2014
- [j26]Zhigang Cao, Xujin Chen, Changjun Wang:
Schedules for marketing products with negative externalities. Theor. Comput. Sci. 554: 191-206 (2014) - [j25]Xujin Chen, Benjamin Doerr, Carola Doerr, Xiaodong Hu, Weidong Ma, Rob van Stee:
The Price of Anarchy for Selfish Ring Routing is Two. ACM Trans. Economics and Comput. 2(2): 8:1-8:24 (2014) - 2013
- [j24]Xujin Chen, Leah Epstein, Elena Kleiman, Rob van Stee:
Maximizing the minimum load: The cost of selfishness. Theor. Comput. Sci. 482: 9-19 (2013) - [j23]Xujin Chen, Xiaodong Hu, Weidong Ma, Changjun Wang:
Reducing price of anarchy of selfish task allocation with more selfishness. Theor. Comput. Sci. 507: 17-33 (2013) - 2012
- [j22]Qin Chen, Xujin Chen:
Packing cycles exactly in polynomial time. J. Comb. Optim. 23(2): 167-188 (2012) - [j21]Xujin Chen, Guoli Ding, Xingxing Yu, Wenan Zang:
Bonds with parity constraints. J. Comb. Theory, Ser. B 102(3): 588-609 (2012) - [j20]Xujin Chen, Zhibin Chen, Wenan Zang:
Total Dual Integrality in Some Facility Location Problems. SIAM J. Discret. Math. 26(3): 1022-1030 (2012) - [j19]Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang:
The Maximum-Weight Stable Matching Problem: Duality and Efficiency. SIAM J. Discret. Math. 26(3): 1346-1360 (2012) - [j18]Xujin Chen, Xiaodong Hu, Weidong Ma:
Pairwise cooperations in selfish ring routing for minimax linear latency. Theor. Comput. Sci. 447: 26-37 (2012) - 2011
- [j17]Eduardo Álvarez-Miranda, Xujin Chen, Jie Hu, Xiaodong Hu, Alfredo Candia-Véjar:
Deterministic risk control for cost-effective network connections. Theor. Comput. Sci. 412(3): 257-264 (2011) - 2010
- [j16]Bo Chen, Xujin Chen, Xiaodong Hu:
The price of atomic selfish ring routing. J. Comb. Optim. 19(3): 258-278 (2010) - [j15]Xujin Chen, Zhibin Chen, Wenan Zang:
A Unified Approach to Box-Mengerian Hypergraphs. Math. Oper. Res. 35(3): 655-668 (2010) - 2009
- [j14]Xujin Chen, Bo Chen:
Approximation Algorithms for Soft-Capacitated Facility Location in Capacitated Network Design. Algorithmica 53(3): 263-297 (2009) - [j13]Xujin Chen, Jie Hu, Xiaodong Hu:
A new model for path planning with interval data. Comput. Oper. Res. 36(6): 1893-1899 (2009) - [j12]Xujin Chen, Guoli Ding, Wenan Zang:
The box-TDI system associated with 2-edge connected spanning subgraphs. Discret. Appl. Math. 157(1): 118-125 (2009) - [j11]Xujin Chen, Jie Hu, Xiaodong Hu:
A polynomial solvable minimum risk spanning tree problem with interval data. Eur. J. Oper. Res. 198(1): 43-46 (2009) - [j10]Xujin Chen, Xiaodong Hu, Jianming Zhu:
Data Gathering Schedule for Minimal Aggregation Time in Wireless Sensor Networks. Int. J. Distributed Sens. Networks 5(4): 321-337 (2009) - [j9]Xujin Chen, Bo Chen:
Cost-effective designs of fault-tolerant access networks in communication systems. Networks 53(4): 382-391 (2009) - 2008
- [j8]Xujin Chen, Xiaodong Hu, Xiaohua Jia:
Inapproximability and approximability of minimal tree routing and coloring. J. Discrete Algorithms 6(2): 341-351 (2008) - [j7]Xujin Chen, Guoli Ding, Wenan Zang:
A Characterization of Box-Mengerian Matroid Ports. Math. Oper. Res. 33(2): 497-512 (2008) - 2007
- [j6]Min Xu, Xujin Chen, Xiaodong Hu:
On the restricted forwarding index problem in communication networks. Comput. Math. Appl. 53(11): 1633-1643 (2007) - [j5]Xujin Chen, Xiaodong Hu, Wenan Zang:
A Min-Max Theorem on Tournaments. SIAM J. Comput. 37(3): 923-937 (2007) - 2006
- [j4]Xujin Chen, Wenan Zang:
An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs. Algorithmica 44(3): 195-211 (2006) - [j3]Xujin Chen, Xiaodong Hu, Tianping Shuai:
Inapproximability and approximability of maximal tree routing and coloring. J. Comb. Optim. 11(2): 219-229 (2006) - [j2]Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang:
A Min-Max Relation on Packing Feedback Vertex Sets. Math. Oper. Res. 31(4): 777-788 (2006) - 2005
- [j1]Xujin Chen, Zhiquan Hu, Wenan Zang:
Perfect Circular Arc Coloring. J. Comb. Optim. 9(3): 267-280 (2005)
Conference and Workshop Papers
- 2020
- [c33]Xujin Chen, Minming Li, Chenhao Wang:
Favorite-Candidate Voting for Eliminating the Least Popular Candidate in a Metric Space. AAAI 2020: 1894-1901 - [c32]Xujin Chen, Xiaodong Hu, Mengqi Zhang:
Sequential Location Game on Continuous Directional Star Networks. Complexity and Approximation 2020: 187-204 - 2019
- [c31]Xujin Chen, Minming Li, Changjun Wang, Chenhao Wang, Yingchao Zhao:
Truthful Mechanisms for Location Games of Dual-Role Facilities. AAMAS 2019: 1470-1478 - [c30]Xujin Chen, Xiaodong Hu, Xiaoying Wu:
The Price of Anarchy for the Load Balancing Game with a Randomizing Scheduler. COCOA 2019: 107-118 - 2018
- [c29]Xujin Chen, Xiaodong Hu, Chenhao Wang:
The Equilibrium Existence of a Robust Routing Game Under Interval Uncertainty. SAGT 2018: 189-200 - [c28]Xujin Chen, Xiaodong Hu, Xiaohua Jia, Minming Li, Zhongzheng Tang, Chenhao Wang:
Mechanism Design for Two-Opposite-Facility Location Games with Penalties on Distance. SAGT 2018: 256-260 - 2017
- [c27]Xujin Chen, Xiaodong Hu, Zhongzheng Tang, Chenhao Wang, Ying Zhang:
Algorithms for the Ring Star Problem. COCOA (2) 2017: 3-16 - [c26]Xujin Chen, Xiaodong Hu, Tie-Yan Liu, Weidong Ma, Tao Qin, Pingzhong Tang, Changjun Wang, Bo Zheng:
Efficient Mechanism Design for Online Scheduling (Extended Abstract). IJCAI 2017: 4985-4989 - [c25]Zhigang Cao, Bo Chen, Xujin Chen, Changjun Wang:
A Network Game of Dynamic Traffic. EC 2017: 695-696 - [c24]Xujin Chen, Xiaodong Hu, Changjun Wang, Ying Zhang:
Continuous Firefighting on Infinite Square Grids. TAMC 2017: 158-171 - 2016
- [c23]Xujin Chen, Zhuo Diao, Xiao-Dong Hu, Zhongzheng Tang:
Total Dual Integrality of Triangle Covering. COCOA 2016: 128-143 - [c22]Xujin Chen, Zhuo Diao:
Network Topologies for Weakly Pareto Optimal Nonatomic Selfish Routing. COCOON 2016: 27-38 - [c21]Xujin Chen, Zhuo Diao, Xiao-Dong Hu, Zhongzheng Tang:
Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles. IWOCA 2016: 266-277 - 2015
- [c20]Changjun Wang, Weidong Ma, Tao Qin, Feidiao Yang, Tie-Yan Liu, Xujin Chen, Xiao-Dong Hu:
New Mechanism for Reservation in Cloud Computing. AAMAS 2015: 1765-1766 - [c19]Zhigang Cao, Xujin Chen, Xiaodong Hu, Changjun Wang:
Pricing in Social Networks with Negative Externalities. CSoNet 2015: 14-25 - [c18]Changjun Wang, Weidong Ma, Tao Qin, Xujin Chen, Xiaodong Hu, Tie-Yan Liu:
Selling Reserved Instances in Cloud Computing. IJCAI 2015: 224-231 - [c17]Xujin Chen, Zhuo Diao, Xiao-Dong Hu:
Excluding Braess's Paradox in Nonatomic Selfish Routing. SAGT 2015: 219-230 - [c16]Xujin Chen, Xiao-Dong Hu, Changjun Wang:
Finding Connected Dense k -Subgraphs. TAMC 2015: 248-259 - 2014
- [c15]Xujin Chen, Changjun Wang:
Approximability of the Minimum Weighted Doubly Resolving Set Problem. COCOON 2014: 357-368 - 2013
- [c14]Zhigang Cao, Xujin Chen, Changjun Wang:
How to Schedule the Marketing of Products with Negative Externalities. COCOON 2013: 122-133 - [c13]Xujin Chen, Donglei Du, Luis Fernando Zuluaga:
Copula-Based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines. SAGT 2013: 231-242 - 2012
- [c12]Xujin Chen, Xiaodong Hu, Weidong Ma, Changjun Wang:
Efficiency of Dual Equilibria in Selfish Task Allocation to Selfish Machines. COCOA 2012: 312-323 - [c11]Xujin Chen, Benjamin Doerr, Xiaodong Hu, Weidong Ma, Rob van Stee, Carola Winzen:
The Price of Anarchy for Selfish Ring Routing Is Two. WINE 2012: 420-433 - 2010
- [c10]Eduardo Álvarez-Miranda, Alfredo Candia-Véjar, Xujin Chen, Xiaodong Hu, Bi Li:
Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data. AAIM 2010: 13-24 - [c9]Xujin Chen, Xiaodong Hu, Weidong Ma:
Reducing the Maximum Latency of Selfish Ring Routing via Pairwise Cooperations. COCOA (2) 2010: 31-45 - 2007
- [c8]Xujin Chen, Jie Hu, Xiaodong Hu:
The Minimum Risk Spanning Tree Problem. COCOA 2007: 81-90 - [c7]Xujin Chen, Jie Hu, Xiaodong Hu:
On the Minimum Risk-Sum Path Problem. ESCAPE 2007: 175-185 - 2006
- [c6]Jianming Zhu, Xujin Chen, Xiaodong Hu:
Minimum Multicast Time Problem in Wireless Sensor Networks. WASA 2006: 490-501 - 2005
- [c5]Xujin Chen, Xiao-Dong Hu, Xiaohua Jia:
Complexity of Minimal Tree Routing and Coloring. AAIM 2005: 6-15 - [c4]Xujin Chen, Xiao-Dong Hu, Tianping Shuai:
Routing and Coloring for Maximal Number of Trees. COCOON 2005: 199-209 - [c3]Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang:
A Min-Max Relation on Packing Feedback Vertex Sets. ISAAC 2005: 126-135 - [c2]Xujin Chen, Xiaodong Hu, Jianming Zhu:
Minimum Data Aggregation Time Problem in Wireless Sensor Networks. MSN 2005: 133-142 - 2004
- [c1]Xujin Chen, Wenan Zang:
An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs. ISAAC 2004: 306-317
Editorship
- 2024
- [e2]Xujin Chen, Bo Li:
Theory and Applications of Models of Computation - 18th Annual Conference, TAMC 2024, Hong Kong, China, May 13-15, 2024, Proceedings. Lecture Notes in Computer Science 14637, Springer 2024, ISBN 978-981-97-2339-3 [contents] - 2020
- [e1]Xujin Chen, Nikolai Gravin, Martin Hoefer, Ruta Mehta:
Web and Internet Economics - 16th International Conference, WINE 2020, Beijing, China, December 7-11, 2020, Proceedings. Lecture Notes in Computer Science 12495, Springer 2020, ISBN 978-3-030-64945-6 [contents]
Informal and Other Publications
- 2019
- [i9]Xujin Chen, Minming Li, Chenhao Wang:
Favorite-Candidate Voting for Eliminating the Least Popular Candidate in Metric Spaces. CoRR abs/1911.12109 (2019) - 2017
- [i8]Zhigang Cao, Bo Chen, Xujin Chen, Changjun Wang:
A Network Game of Dynamic Traffic. CoRR abs/1705.01784 (2017) - 2016
- [i7]Xujin Chen, Zhuo Diao, Xiaodong Hu, Zhongzheng Tang:
Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles. CoRR abs/1605.01816 (2016) - 2015
- [i6]Xujin Chen, Xiao-Dong Hu, Changjun Wang:
Finding Connected Dense $k$-Subgraphs. CoRR abs/1501.07348 (2015) - 2014
- [i5]Xujin Chen, Xiaodong Hu, Changjun Wang:
Approximability of the Minimum Weighted Doubly Resolving Set Problem. CoRR abs/1404.4676 (2014) - [i4]Zhigang Cao, Xujin Chen, Xiao-Dong Hu, Changjun Wang:
Pricing in Social Networks with Negative Externalities. CoRR abs/1410.7263 (2014) - 2013
- [i3]Zhigang Cao, Xujin Chen, Changjun Wang:
How to Schedule the Marketing of Products with Negative Externalities. CoRR abs/1303.6200 (2013) - [i2]Xujin Chen, Donglei Du, Luis Fernando Zuluaga:
Copula-based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines. CoRR abs/1306.3909 (2013) - 2012
- [i1]Xujin Chen, Benjamin Doerr, Xiaodong Hu, Weidong Ma, Rob van Stee, Carola Winzen:
The Price of Anarchy for Selfish Ring Routing is Two. CoRR abs/1210.0230 (2012)
Coauthor Index
[j46] [j41] [j40] [j37] [j35] [j34] [j33] [j32] [j30] [j29] [j28] [j25] [j23] [j19] [j18] [j17] [j16] [j13] [j11] [j10] [j8] [j6] [j5] [j3] [j2] [c32] [c30] [c29] [c28] [c27] [c26] [c24] [c23] [c21] [c20] [c19] [c18] [c17] [c16] [c12] [c11] [c10] [c9] [c8] [c7] [c6] [c5] [c4] [c3] [c2] [i7] [i6] [i5] [i4] [i1]
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-22 23:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
