陈旭瑾 - 中国科学院大学

个人简介

教育背景 2001-01--2004-08 香港大学哲学博士 1997-09--2000-08 东南大学理学硕士 1993-09--1997-08 云南大学理学学士工作访问经历 2014.03-- 中科院数学与系统科学研究院研究员 2009.01--2014.02 中科院数学与系统科学研究院副研究员 2006.09--2009.02 中科院数学与系统科学研究院助理研究员 2004.09--2006.08 中科院数学与系统科学研究院博士后 2016,09-- 中国科学院大学数学科学学院教授 2012.03--2012.05 加拿大New Brunswick University, Visiting Associate Professor 2010.10--2010.11 德国Max-Planck Institute for Informatic，Visiting Associate Professor 2007.09--2008.05 美国Louisiana State University，Visiting Assistant Professor 2007.03--2007.06 中国Hong Kong University, Research Visitor 2006.03--2006.08 英国Warwick University, Visiting Fellow 基金项目 •主持国家自然科学基金委员会资助项目： - 优秀青年青年科学基金项目：运筹学（2013年– 2015年, 编号11222109） - 面上项目: 网络优化设计中的算法博弈研究（2008年– 2010年, 编号10771209） •主持国家重点研发计划子课题：科技创新2030-``新一代人工智能''重大项目课题: 非完全动态信息自适应博弈（2019年– 2022年, 编号 2018AAA0101002） •主持中国科学院前沿科学重点研究计划-从0到1原始创新项目: 网络级联效应下的序贯优化与博弈（2019年– 2024年, 编号ZDBS-LY-7008） •参加项目： - 国家自然科学基金重点项目：网络环境下的新型组合优化问题研究（2016年 - 2020年, 编号11531014） - 中科院科技创新交叉与合作团队项目：复杂环境下的网络优化理论与应用研究（2013年– 2015年） - 中科院知识创新重要方向性项目：优化方法及其在信息技术中的应用（2008年– 2010年）

研究领域

组合优化，包括多面体组合：对偶整数性、...... 算法博弈论：如网络博弈、算法机制设计、...... 离散优化问题的算法设计与分析：NP-困难问题的近似算法设计、......

近期论文

查看导师最新文章（温馨提示：请注意重名现象，建议点开原文通过作者单位确认）

Journal Articles •Xujin Chen, Guoli Ding, Wenan Zang, Qiulan Zhao, Ranking tournaments with no errors II: Minimax relation, Journal of Combinatorial Theory, Series B 142 (2020) 244-275. •Xujin Chen, Guoli Ding, Wenan Zang, Qiulan Zhao, Ranking tournaments with no errors I: Structural description, Journal of Combinatorial Theory, Series B 141 (2020) 264-294. •Xujin Chen, Wenan Zang, Qiulan Zhao, Densities, matchings, and fractional edge-colorings, SIAM Journal on Optimization 29 (2019) 240-261. •Xujin Chen, Xiaodong Hu, Changjun Wang, Finding connected k-subgraphs with high density, Information and Computation 256 (2017) 160-173. •Qin Chen, Xujin Chen, Wenan Zang, A polyhedral description of kernels, Mathematics of Operations Research 41 (2016) 969-990. •Xujin Chen, Zhuo Diao, Xiaodong Hu, Network characterizations for excluding Braess's paradox, Theory of Computing Systems 59 (2016), 747-780. •Xujin Chen, Donglei Du, Luis F. Zuluaga, Copula-based randomized mechanisms for truthful scheduling on two unrelated machines, Theory of Computing Systems 57 (2015) 753-781. •Xujin Chen, Benjamin Doerr, Carola Doerr, Xiaodong Hu, Weidong Ma, Rob van Stee, The Price of Anarchy for Selfish Ring Routing is Two, ACM Transactions on Economics and Comput. 2 (2014) Article 8. •Xujin Chen, Xiaodong Hu, Weidong Ma, Changjun Wang, Reducing price of anarchy of selfish task allocation with more selfishness,Theoretical Computer Science 507 (2013) 17-33. •Xujin Chen, Leah Epstein, Elena Kleiman, Rob van Stee, Maximizing the minimum load: The cost of selfishness. Theoretical Computer Science 482 (2013) 9-19. •Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang, The maximum-weight stable matching problem: duality and efficiency, SIAM Journal on Discrete Mathematics 16 (2012) 1046-1060. •Xujin Chen, Zhibin Chen, Wenan Zang, Total dual integrality in some facility location problems, SIAM Journal on Discrete Mathematics 16 (2012) 1022-1030. (SJDM 2013 top 20 most read articles) •Xujin Chen, Guoli Ding, Xingxing Yu, Wenan Zang, Bonds with paritty constraints, Journal of Combinatorial Thoery, Series B 102 (2012) 588-609. •Xujin Chen, Zhibin Chen, Wanan Zang, A unified approach to box-Mengerian hypergraphs, Mathematics of Operations Research 35 (2010) 655-668. (Research Output Prize 2010-2011, HKU) •Xujin Chen, Bo Chen, Approximation algorithms for soft-capacitated facility location in capacitated network design, Algorithmica 53 (2009) 263-297. •Xujin Chen, Guoli Ding, Wanan Zang, The box-TDI system associated 2-edge-connected spanning subgraphs, Discrete Applied Mathematics 157 (2009) 118-125. •Xujin Chen, Jie Hu, Xiaodong Hu, A polynomial solvable minimum risk spanning tree problem with interval data, European Journal of Operational Research 198 (2009) 43-46. •Xujin Chen, Bo Chen, Cost-effective designs of fault-tolerant access networks in communication systems, Networks 53 (2009) 382-391. •Xujin Chen, Jie Hu, Xiaodong Hu, A new model for the path planning with interval data, Computers & Operations Research 36 (2009) 1893-1899. •Xujin Chen, Guoli Ding, Wanan Zang, A characterization of box-Mengerian matroid ports, Mathematics of Operations Research 33 (2008) 497-512. •Xujin Chen, Xiaodong Hu, Wanan Zang, A min-max theorem on tournaments, SIAM Journal on Computing 37 (2007) 923-937. •Xujin Chen, Guoli Ding, Xiaodong Hu, Wanan Zang, A min-max relation on packing feedback vertex sets, Mathematics of Operations Research 31 (2006) 777-788. •Xujin Chen, Wanan Zang, An efficient algorithm for finding maximum cycle packing in reducible flow graphs, Algorithmica 44 (2006) 195-211. •Xujin Chen, Xiaodong Hu, Tianping Shuai, Inapproximability and approximability of maximal tree routing and coloring, Journal of Combinatorial Optimization 11 (2006) 219-229. •Xujin Chen, Zhiquan Hu, Wanan Zang, Perfect circular arc coloring, Journal of Combinatorial Optimization 9 (2005) 267-280. Book Chapter •Xujin Chen, Xiaodong Hu, Wenan Zang, Dual integrality in combinatorial optimization, in Handbook of Combinatorial Optimization (P. M. Pardalos, D.-Z. Du, R. Graham, Eds.), 2nd Edition, Springer, 2013. Proceeding Papers •Zhigang Cao, Bo Chen, Xujin Chen, Changjun Wang, A network game of dynamic traffic, Proceedings of the 18th ACM Conference on Economics and Computation (EC), 2017, 695-696. •Xujin Chen, Zhuo Diao, Xiaodong Hu, Zhongzheng Tang, Sufficient conditions for Tuza's conjecture on packing and covering triangles, Proceedings of the 27th International Workshop on Combinatorial Algorithms (IWOCA), Lecture Notes in Computer Science 9843 (2016), 266-277 •Xujin Chen, Zhuo Diao, Xiaodong Hu, Excluding Braess's paradox in nonatomic selfish routing, Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT), Lecture Notes in Computer Science 9347 (2015) 219-230 •Xujin Chen, Changjun Wang, Approximability of the Minimum Weighted Doubly Resolving Set Problem, Proceedings of the 20th International Computing and Combinatorics Conference (COCOON), Lecture Notes in Computer Science 8591 (2014) 357-368. (full version at arXiv) •Zhigang Cao, Xujin Chen, Changjun Wang, How to Schedule the Marketing of Products with Negative Externalities, Proceedings of the 19th International Conference on Computing and Combinatorics (COCOON), Lecture Notes in Computer Science 7936 (2013) 122-133. •Xujin Chen, Benjamin Doerr, Xiaodong Hu, Weidong Ma, Rob van Stee, Carola Winzen, The Price of Anarchy for Selfish Ring Routing is Two, Proceedings of the 8th International Workshop on Internet and Network Economics (WINE), Lecture Notes in Computer Science 7695 (2012), 420-433. •Xujin Chen, Xiaodong Hu,Weidong Ma, Changjun Wang, Efficiency of dual equilibria in selfish task allocation to selfish machines, Proceedings of the 6th International Conference on Combinatorial Optimization and Applications (COCOA), Lecture Notes in Computer Science 7402 (2012), 312-323. (Best Paper Award) •Xujin Chen, Xiaodong Hu, Jianming Zhu, Minimum data aggregation time problem in wireless sensor networks, Proceedings of the 1st International Conferences on Mobile Ad-hoc and Sensor Networks, Lecture Notes in Computer Science 3794 (2005), 133-142.

学术兼职

•Associate Editor: Journal of Combinatorial Optimization (2013-) •编委: 系统科学与数学 (2014-) •编委应用数学学报 (2017-) •程序委员会委员： 1.WINE2020 (The 16th Conference on Web and Internet Economics, 共同主席) 2.AAIM2020 (The 14th International Conference on Algorithmic Aspects in Information and Management) 3.WAOA2018 (The 16th Workshop on Approximation and Online Algorithms) 4.SAGT2018 (The 11th International Symposium on Algorithmic Game Theory) 5.COCOA2017 (The 11th Annual International Conference on Combinatorial Optimization and Applications), COCOA2016, COCOA2015, COCOA2014, COCOA2011 6.ECCO2017 (Joint EURO/ORSC/ECCO Conference 2017 on Combinatorial Optimization)