default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDachuan Xu 0001
Person information
- affiliation: Beijing University of Technology, Institute of Operations Research and Information Engineering, Beijing, China
- affiliation (PhD 2002): Chinese Academy of Sciences (CAS), Academy of Mathematics and Systems Science (AMSS), Beijing, China
Other persons with the same name
- Dachuan Xu — disambiguation page
- Dachuan Xu 0002
![[0009-0009-6509-6908]](https://devdomain4test.ir/img/orcid-mark.12x12.png "0009-0009-6509-6908")
— Lanzhou Jiaotong University, Faculty of Geomatics, Lanzhou, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
Journal Articles
- 2026
[j122]Fengjuan Wang, Yiming Wang, Feifan Nong, Can Li, Yang Li, Dachuan Xu, Changjing Zhuge, Ruijie Yang:
A shortest-path and ADMM-based fluence-level optimization framework for discretized non-coplanar VMAT. Comput. Methods Programs Biomed. 285: 109488 (2026)- [j121]Yang Lv, Fengmin Wang, Xiankun Yu, Xin Li, Dachuan Xu, Ruiqi Yang:
Submodular Optimization for Heterogeneous UAV Deployment. J. Comb. Optim. 51(5): 57 (2026) - [j120]Yue Sun, Donglei Du, Longkun Guo, Dachuan Xu:
An optimal absolute approximation algorithm for computing k disjoint restricted shortest paths. J. Comput. Syst. Sci. 158: 103761 (2026) - [j119]Bo Zhao, Fengmin Wang, Dachuan Xu, Ruiqi Yang, Yifei Zou:
Distributed robust sequential submodular maximization under partition matroid constraints. J. Comput. Syst. Sci. 161: 103832 (2026) - [j118]Mengzhen Li, Runjie Miao, Chenchen Wu, Dachuan Xu:
On competitive ratio for online uniform facility location problem in random-order model. Theor. Comput. Sci. 1072: 115878 (2026) - 2025
- [j117]Jiaming Hu, Chuangbo Hao, Mengzhen Li, Yuhao Wang, Maowen Lu, Dachuan Xu:
Defeating decoys: deletion-robust submodular optimization for UAV swarm target assignment problem. CCF Trans. High Perform. Comput. 7(6): 523-536 (2025) - [j116]Chun-Ru Dong, Jun-Yan Zhang, Feng Zhang, Qiang Hua, Dachuan Xu:
A novel deep high-level concept-mining jointing hashing model for unsupervised cross-modal retrieval. High Confid. Comput. 5(2): 100274 (2025) - [j115]Ruizhi Zhou, Lingfeng Niu, Dachuan Xu:
Sparse loss-aware ternarization for neural networks. Inf. Sci. 693: 121668 (2025) - [j114]Xianyue Li, Chenchen Wu, Dachuan Xu:
Preface. Math. Found. Comput. 8(3): i-ii (2025) - 2024
- [j113]Yuefang Lian, Donglei Du, Xiao Wang, Dachuan Xu, Yang Zhou:
Stochastic Variance Reduction for DR-Submodular Maximization. Algorithmica 86(5): 1335-1364 (2024) - [j112]Yinhong Dong, Donglei Du, Qiaoming Han, Jianfeng Ren, Dachuan Xu:
A Stackelberg order execution game. Ann. Oper. Res. 336(1-2): 571-604 (2024) - [j111]Yang Lv, Chenchen Wu, Dachuan Xu, Ruiqi Yang:
H-hop independently submodular maximization problem with curvature. High Confid. Comput. 4(3): 100208 (2024) - [j110]Jiaming Hu, Dachuan Xu, Donglei Du, Cuixia Miao:
Differentially private submodular maximization with a cardinality constraint over the integer lattice. J. Comb. Optim. 47(4): 58 (2024) - [j109]Hongxiang Zhang, Dachuan Xu, Ling Gai, Zhenning Zhang:
Online learning under one sided σ-smooth function. J. Comb. Optim. 47(5): 76 (2024) - [j108]Jiachen Ju, Xiao Wang, Dachuan Xu:
Online non-monotone diminishing return submodular maximization in the bandit setting. J. Glob. Optim. 90(3): 619-649 (2024) - [j107]Yuefang Lian, Xiao Wang, Dachuan Xu, Zhongrui Zhao:
Zeroth-order Stochastic Approximation Algorithms for DR-submodular Optimization. J. Mach. Learn. Res. 25: 391:1-391:55 (2024) - [j106]Fan Yuan, Dachuan Xu, Donglei Du, Min Li:
Differentially private k-center problems. Optim. Lett. 18(8): 1791-1809 (2024) - 2023
- [j105]Qingqin Nong, Chenchen Wu, Dachuan Xu, Dongmei Zhang:
Preface. Asia Pac. J. Oper. Res. 40(1): 2302001:1-2302001:2 (2023) - [j104]Kai-Xin Gao, Zheng-Hai Huang, Xiaolei Liu, Min Wang, Shuangling Wang, Zidong Wang, Dachuan Xu, Fan Yu:
Eigenvalue-Corrected Natural Gradient Based on a New Approximation. Asia Pac. J. Oper. Res. 40(1): 2340005:1-2340005:18 (2023) - [j103]Hongxiang Zhang, Dachuan Xu, Yapu Zhang, Zhenning Zhang:
Parallelized maximization of nonmonotone one-sided σ-smooth function. Comput. Electr. Eng. 105: 108478 (2023) - [j102]Sai Ji, Dachuan Xu, Min Li, Yishui Wang, Dongmei Zhang:
Stochastic greedy algorithms for maximizing constrained submodular + supermodular functions. Concurr. Comput. Pract. Exp. 35(17) (2023) - [j101]Sai Ji, Yinhong Dong, Donglei Du, Dongzhao Wang, Dachuan Xu:
Approximation algorithms for the lower bounded correlation clustering problem. J. Comb. Optim. 45(1): 43 (2023) - [j100]Min Cui, Donglei Du, Dachuan Xu, Ruiqi Yang:
Two approximation algorithms for maximizing nonnegative weakly monotonic set functions. J. Comb. Optim. 45(1): 54 (2023) - [j99]Lu Han, Dachuan Xu, Yicheng Xu, Ping Yang:
Approximation algorithms for the individually fair k-center with outliers. J. Glob. Optim. 87(2): 603-618 (2023) - [j98]Guowei Dai, Yannan Chen, Yaping Mao, Dachuan Xu, Xiaoyan Zhang, Zan-Bo Zhang:
A distributed message passing algorithm for computing perfect demand matching. J. Parallel Distributed Comput. 179: 104706 (2023) - [j97]Zijun Wu, Rolf H. Möhring, Chunying Ren, Dachuan Xu:
A convergence analysis of the price of anarchy in atomic congestion games. Math. Program. 199(1): 937-993 (2023) - [j96]Chunying Ren, Zijun Wu, Dachuan Xu, Wenqing Xu:
A game-theoretic perspective of deep neural networks. Theor. Comput. Sci. 939: 48-62 (2023) - 2022
- [j95]Ruiqi Yang, Dachuan Xu, Longkun Guo, Dongmei Zhang:
Regularized two-stage submodular maximization under streaming. Sci. China Inf. Sci. 65(4) (2022) - [j94]Min Li, Dachuan Xu, Dongmei Zhang, Huiling Zhou:
The provably good parallel seeding algorithms for the k-means problem with penalties. Int. Trans. Oper. Res. 29(1): 158-171 (2022) - [j93]Sai Ji, Dachuan Xu, Min Li, Yishui Wang:
Approximation algorithms for two variants of correlation clustering problem. J. Comb. Optim. 43(5): 933-952 (2022) - [j92]Zhenning Zhang, Bin Liu, Yishui Wang, Dachuan Xu, Dongmei Zhang:
Maximizing a monotone non-submodular function under a knapsack constraint. J. Comb. Optim. 43(5): 1125-1148 (2022) - [j91]Bo Chen, Dachuan Xu, Guochuan Zhang:
Preface. J. Comb. Optim. 43(5): 1507-1508 (2022) - [j90]Min Cui, Dachuan Xu, Longkun Guo, Dan Wu:
Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint. J. Comb. Optim. 43(5): 1671-1690 (2022) - [j89]Lu Han, Dachuan Xu, Donglei Du, Dongmei Zhang:
An approximation algorithm for the uniform capacitated k-means problem. J. Comb. Optim. 44(3): 1812-1823 (2022) - [j88]Sai Ji, Dachuan Xu, Longkun Guo, Min Li, Dongmei Zhang:
The seeding algorithm for spherical k-means clustering with penalties. J. Comb. Optim. 44(3): 1977-1994 (2022) - [j87]Xiaoyun Tian, Dachuan Xu, Donglei Du, Ling Gai:
The spherical k-means++ algorithm via local search scheme. J. Comb. Optim. 44(4): 2375-2394 (2022) - [j86]Xiaoyun Tian, Dachuan Xu, Longkun Guo, Dan Wu:
Improved local search algorithms for Bregman k-means and its variants. J. Comb. Optim. 44(4): 2533-2550 (2022) - [j85]Yijing Wang, Dachuan Xu, Donglei Du, Yanjun Jiang:
Bicriteria streaming algorithms to balance gain and cost with cardinality constraint. J. Comb. Optim. 44(4): 2946-2962 (2022) - [j84]Zhicheng Liu, Longkun Guo, Donglei Du, Dachuan Xu, Xiaoyan Zhang:
Maximization problems of balancing submodular relevance and supermodular diversity. J. Glob. Optim. 82(1): 179-194 (2022) - [j83]Chunying Ren, Dachuan Xu, Donglei Du, Min Li:
An improved primal-dual approximation algorithm for the k-means problem with penalties. Math. Struct. Comput. Sci. 32(2): 151-163 (2022) - [j82]Ling Gai, Chenchen Wu, Dachuan Xu, Weiwei Zhang:
Selfish bin packing under Harmonic mean cost sharing mechanism. Optim. Lett. 16(5): 1445-1456 (2022) - [j81]Libing Wang, Han Xiao, Donglei Du, Dachuan Xu:
On the population monotonicity of independent set games. Oper. Res. Lett. 50(5): 470-474 (2022) - 2021
- [j80]Xingju Cai, Min Li, Guanghui Wang, Dachuan Xu:
Preface. Asia Pac. J. Oper. Res. 38(5): 2102002:1-2102002:2 (2021) - [j79]Zhenning Zhang, Longkun Guo, Yishui Wang, Dachuan Xu, Dongmei Zhang:
Streaming Algorithms for Maximizing Monotone DR-Submodular Functions with a Cardinality Constraint on the Integer Lattice. Asia Pac. J. Oper. Res. 38(5): 2140004:1-2140004:14 (2021) - [j78]Ruiqi Yang, Dachuan Xu, Yukun Cheng, Yishui Wang, Dongmei Zhang:
Streaming algorithms for robust submodular maximization. Discret. Appl. Math. 290: 112-122 (2021) - [j77]Wenjun Ni, Jia Shu, Miao Song, Dachuan Xu, Kaike Zhang:
A Branch-and-Price Algorithm for Facility Location with General Facility Cost Functions. INFORMS J. Comput. 33(1): 86-104 (2021) - [j76]Zijun Wu, Rolf H. Möhring, Yanyan Chen, Dachuan Xu:
Selfishness Need Not Be Bad. Oper. Res. 69(2): 410-435 (2021) - [j75]Ruiqi Yang, Dachuan Xu, Longkun Guo, Dongmei Zhang:
Sequence submodular maximization meets streaming. J. Comb. Optim. 41(1): 43-55 (2021) - [j74]Zhenning Zhang, Donglei Du, Chenchen Wu, Dachuan Xu, Dongmei Zhang:
A spectral partitioning algorithm for maximum directed cut problem. J. Comb. Optim. 42(3): 373-395 (2021) - [j73]Lu Han, Dachuan Xu, Dandan Liu, Chenchen Wu:
An approximation algorithm for the k-level facility location problem with outliers. Optim. Lett. 15(6): 2053-2065 (2021) - [j72]Limin Wang, Zhao Zhang, Chenchen Wu, Dachuan Xu, Xiaoyan Zhang:
Approximation algorithms for the dynamic k-level facility location problems. Theor. Comput. Sci. 853: 43-56 (2021) - [j71]Ruiqi Yang, Shuyang Gu, Chuangen Gao, Weili Wu, Hua Wang, Dachuan Xu:
A constrained two-stage submodular maximization. Theor. Comput. Sci. 853: 57-64 (2021) - [j70]Dongmei Zhang, Yukun Cheng, Min Li, Yishui Wang, Dachuan Xu:
Approximation algorithms for spherical k-means problem using local search scheme. Theor. Comput. Sci. 853: 65-77 (2021) - [j69]Yijing Wang, Dachuan Xu, Donglei Du, Ran Ma:
Bicriteria algorithms to balance coverage and cost in team formation under online model. Theor. Comput. Sci. 854: 68-76 (2021) - [j68]Hongxiang Zhang, Dachuan Xu, Longkun Guo, Jingjing Tan:
Parallelized maximization of nonsubmodular function subject to a cardinality constraint. Theor. Comput. Sci. 864: 129-137 (2021) - [j67]Xin Sun, Dachuan Xu, Longkun Guo, Min Li:
Deterministic approximation algorithm for submodular maximization subject to a matroid constraint. Theor. Comput. Sci. 890: 1-15 (2021) - 2020
- [j66]Min Li, Dachuan Xu, Jun Yue, Dongmei Zhang:
The Parallel Seeding Algorithm for k-Means Problem with Penalties. Asia Pac. J. Oper. Res. 37(4): 2040005:1-2040005:18 (2020) - [j65]Min Li, Dachuan Xu, Jun Yue, Dongmei Zhang, Peng Zhang:
The seeding algorithm for k-means problem with penalties. J. Comb. Optim. 39(1): 15-32 (2020) - [j64]Lu Han, Dachuan Xu, Yicheng Xu, Dongmei Zhang:
Approximating the τ-relaxed soft capacitated facility location problem. J. Comb. Optim. 40(3): 848-860 (2020) - [j63]Min Li, Dachuan Xu, Dongmei Zhang, Juan Zou:
The seeding algorithms for spherical k-means clustering. J. Glob. Optim. 76(4): 695-708 (2020) - [j62]Yijing Wang, Dachuan Xu, Yishui Wang, Dongmei Zhang:
Non-submodular maximization on massive data streams. J. Glob. Optim. 76(4): 729-743 (2020) - [j61]Yanjun Jiang, Yishui Wang, Dachuan Xu, Ruiqi Yang, Yong Zhang:
Streaming algorithm for maximizing a monotone non-submodular function under d-knapsack constraint. Optim. Lett. 14(5): 1235-1248 (2020) - [j60]Jian Sun, Dachuan Xu, Deren Han, Wenjing Hou, Xiaoyan Zhang:
Randomized mechanism design for decentralized network scheduling. Optim. Methods Softw. 35(4): 722-740 (2020) - [j59]Shuyang Gu, Chuangen Gao, Ruiqi Yang, Weili Wu, Hua Wang, Dachuan Xu:
A general method of active friending in different diffusion models in social networks. Soc. Netw. Anal. Min. 10(1): 41 (2020) - [j58]Yong Zhang, Francis Y. L. Chin, Sheung-Hung Poon, Hing-Fung Ting, Dachuan Xu, Dongxiao Yu:
Offline and online algorithms for single-minded selling problem. Theor. Comput. Sci. 821: 15-22 (2020) - [j57]Chuangen Gao, Shuyang Gu, Ruiqi Yang, Jiguo Yu, Weili Wu, Dachuan Xu:
Interaction-aware influence maximization and iterated sandwich method. Theor. Comput. Sci. 821: 23-33 (2020) - [j56]Yicheng Xu, Dachuan Xu, Yong Zhang, Juan Zou:
MpUFLP: Universal facility location problem in the p-th power of metric space. Theor. Comput. Sci. 838: 58-67 (2020) - 2019
- [j55]Min Li, Dachuan Xu, Dongmei Zhang, Tong Zhang:
A Streaming Algorithm for k-Means with Approximate Coreset. Asia Pac. J. Oper. Res. 36(1): 1950006:1-1950006:18 (2019) - [j54]Ruiqi Yang, Dachuan Xu, Yanjun Jiang, Yishui Wang, Dongmei Zhang:
Approximating Robust Parameterized Submodular Function Maximization in Large-Scales. Asia Pac. J. Oper. Res. 36(4): 1950022:1-1950022:24 (2019) - [j53]Sai Ji, Dachuan Xu, Donglei Du, Chenchen Wu:
Approximation algorithms for the fault-tolerant facility location problem with penalties. Discret. Appl. Math. 264: 62-75 (2019) - [j52]Yicheng Xu, Dachuan Xu, Donglei Du, Dongmei Zhang:
Approximation algorithm for squared metric facility location problem with nonuniform capacities. Discret. Appl. Math. 264: 208-217 (2019) - [j51]Dongmei Zhang, Chunlin Hao, Chenchen Wu, Dachuan Xu, Zhenning Zhang:
Local search approximation algorithms for the k-means problem with penalties. J. Comb. Optim. 37(2): 439-453 (2019) - [j50]Jin Zhang, Min Li, Yishui Wang, Chenchen Wu, Dachuan Xu:
Approximation algorithm for squared metric two-stage stochastic facility location problem. J. Comb. Optim. 38(2): 618-634 (2019) - [j49]Dongmei Zhang, Dachuan Xu, Yishui Wang, Peng Zhang, Zhenning Zhang:
Local search approximation algorithms for the sum of squares facility location problems. J. Glob. Optim. 74(4): 909-932 (2019) - [j48]Guowei Dai, Fengwei Li, Yuefang Sun, Dachuan Xu, Xiaoyan Zhang:
Convergence and correctness of belief propagation for the Chinese postman problem. J. Glob. Optim. 75(3): 813-831 (2019) - [j47]Yanjun Jiang, Dachuan Xu, Donglei Du, Dongmei Zhang:
An approximation algorithm for the dynamic facility location problem with outliers. Optim. Lett. 13(3): 561-571 (2019) - [j46]Lu Han, Dachuan Xu, Donglei Du, Chenchen Wu:
A 5-approximation algorithm for the k-prize-collecting Steiner tree problem. Optim. Lett. 13(3): 573-585 (2019) - [j45]Yicheng Xu, Dachuan Xu, Donglei Du, Chenchen Wu:
Improved approximation algorithm for universal facility location problem with linear penalties. Theor. Comput. Sci. 774: 143-151 (2019) - [j44]Longkun Guo, Min Li, Dachuan Xu:
Efficient approximation algorithms for maximum coverage with group budget constraints. Theor. Comput. Sci. 788: 53-65 (2019) - 2018
- [j43]Donglei Du, Dachuan Xu:
Editorial: Special Issue on Computing and Combinatorics. Algorithmica 80(5): 1411 (2018) - [j42]Xianzhao Zhang, Dachuan Xu, Donglei Du, Chenchen Wu:
Approximation algorithms for precedence-constrained identical machine scheduling with rejection. J. Comb. Optim. 35(1): 318-330 (2018) - [j41]Lu Han, Dachuan Xu, Donglei Du, Dongmei Zhang:
A local search approximation algorithm for the uniform capacitated k-facility location problem. J. Comb. Optim. 35(2): 409-423 (2018) - [j40]Yanjun Jiang, Dachuan Xu, Donglei Du, Chenchen Wu, Dongmei Zhang:
An approximation algorithm for soft capacitated k-facility location problem. J. Comb. Optim. 35(2): 493-511 (2018) - [j39]Dongmei Zhang, Dachuan Xu, Yishui Wang, Peng Zhang, Zhenning Zhang:
A local search approximation algorithm for a squared metric k-facility location problem. J. Comb. Optim. 35(4): 1168-1184 (2018) - [j38]Yishui Wang, Dachuan Xu, Donglei Du, Chenchen Wu:
An approximation algorithm for k-facility location problem with linear penalties using local search scheme. J. Comb. Optim. 36(1): 264-279 (2018) - [j37]Fengmin Xu, Meihua Wang, Yu-Hong Dai, Dachuan Xu:
A sparse enhanced indexation model with chance and cardinality constraints. J. Glob. Optim. 70(1): 5-25 (2018) - [j36]Chenchen Wu, Dachuan Xu, Dongmei Zhang, Peng Zhang:
Approximation algorithms for the robust/soft-capacitated 2-level facility location problems. J. Glob. Optim. 70(1): 207-222 (2018) - [j35]Qiaoming Han, Donglei Du, Dachuan Xu, Yicheng Xu:
Approximate efficiency and strategy-proofness for moneyless mechanisms on single-dipped policy domain. J. Glob. Optim. 70(4): 859-873 (2018) - [j34]Chenchen Wu, Yishui Wang, Zaixin Lu, Panos M. Pardalos, Dachuan Xu, Zhao Zhang, Ding-Zhu Du:
Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming. Math. Program. 169(1): 255-275 (2018) - [j33]Lu Han, Dachuan Xu, Min Li, Dongmei Zhang:
Approximation algorithms for the robust facility leasing problem. Optim. Lett. 12(3): 625-637 (2018) - [j32]Peng Zhang, Chenchen Wu, Dachuan Xu:
Approximation and hardness results for the Max k-Uncut problem. Theor. Comput. Sci. 749: 47-58 (2018) - [j31]Chenchen Wu, Donglei Du, Dachuan Xu:
An approximation algorithm for the k-median problem with uniform penalties via pseudo-solution. Theor. Comput. Sci. 749: 80-92 (2018) - 2017
- [j30]Yicheng Xu, Dachuan Xu, Donglei Du, Chenchen Wu:
Local search algorithm for universal facility location problem with linear penalties. J. Glob. Optim. 67(1-2): 367-378 (2017) - [j29]Yishui Wang, Dachuan Xu, Donglei Du, Chenchen Wu:
An approximation algorithm for the nth power metric facility location problem with linear penalties. Optim. Lett. 11(5): 983-993 (2017) - 2016
- [j28]Chenchen Wu, Dachuan Xu, Donglei Du, Wen-qing Xu:
An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding. J. Comb. Optim. 32(4): 1017-1035 (2016) - [j27]Fengmin Wang, Dachuan Xu, Chenchen Wu:
Combinatorial approximation algorithms for the robust facility location problem with penalties. J. Glob. Optim. 64(3): 483-496 (2016) - [j26]Dachuan Xu, Fengmin Wang, Donglei Du, Chenchen Wu:
Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique. Theor. Comput. Sci. 630: 117-125 (2016) - [j25]Dachuan Xu, Donglei Du, Ding-Zhu Du:
Editorial for Computing and Combinatorics Conference. Theor. Comput. Sci. 654: 1 (2016) - 2015
- [j24]Yu Li, Donglei Du, Naihua Xiu, Dachuan Xu:
Improved Approximation Algorithms for the Facility Location Problems with Linear/Submodular Penalties. Algorithmica 73(2): 460-482 (2015) - [j23]Donglei Du, Naihua Xiu, Dachuan Xu:
Guest Editorial. Asia Pac. J. Oper. Res. 32(1): 1502001:1-1502001:2 (2015) - [j22]Chenchen Wu, Dachuan Xu, Jiawei Zhang:
Safe Approximations for Distributionally Robust Joint Chance Constrained Program. Asia Pac. J. Oper. Res. 32(1): 1540004:1-1540004:20 (2015) - [j21]Chenchen Wu, Donglei Du, Dachuan Xu:
An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems. J. Comb. Optim. 29(1): 53-66 (2015) - [j20]Fengmin Wang, Dachuan Xu, Chenchen Wu:
Approximation algorithms for the priority facility location problem with penalties. J. Syst. Sci. Complex. 28(5): 1102-1114 (2015) - [j19]Chenchen Wu, Donglei Du, Dachuan Xu:
Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach. Theor. Comput. Sci. 562: 213-226 (2015) - 2014
- [j18]Gaidi Li, Donglei Du, Dachuan Xu, Ruyao Zhang:
A cost-sharing method for the multi-level economic lot-sizing game. Sci. China Inf. Sci. 57(1): 1-9 (2014) - [j17]Zi Xu, Donglei Du, Dachuan Xu:
Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems. J. Comb. Optim. 27(2): 315-327 (2014) - [j16]Yu Li, Donglei Du, Naihua Xiu, Dachuan Xu:
A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties. J. Comb. Optim. 27(3): 609-620 (2014) - 2013
- [j15]Yu Li, Jia Shu, Xi Wang, Naihua Xiu, Dachuan Xu, Jiawei Zhang:
Approximation Algorithms for Integrated Distribution Network Design Problems. INFORMS J. Comput. 25(3): 572-584 (2013) - [j14]Jianfeng Ren, Donglei Du, Dachuan Xu:
The complexity of two supply chain scheduling problems. Inf. Process. Lett. 113(17): 609-612 (2013) - [j13]Gaidi Li, Yu Li, Jia Shu, Dachuan Xu:
A cross-monotonic cost-sharing scheme for the concave facility location game. J. Glob. Optim. 56(4): 1325-1334 (2013) - [j12]Yu Li, Donglei Du, Naihua Xiu, Dachuan Xu:
A combinatorial 2.375-approximation algorithm for the facility location problem with submodular penalties. Theor. Comput. Sci. 476: 109-117 (2013) - 2012
- [j11]Donglei Du, Ruixing Lu, Dachuan Xu:
A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties. Algorithmica 63(1-2): 191-200 (2012) - [j10]Yu Li, Dachuan Xu, Donglei Du, Naihua Xiu:
Improved approximation algorithms for the robust fault-tolerant facility location problem. Inf. Process. Lett. 112(10): 361-364 (2012) - [j9]Zhen Wang, Dachuan Xu:
A cost-sharing method for an uncapacitated facility location game with penalties. J. Syst. Sci. Complex. 25(2): 287-292 (2012) - 2011
- [j8]Zhen Wang, Donglei Du, Adriana Felicia Gabor, Dachuan Xu:
Erratum to: "An approximation algorithm for the k-level stochastic facility location problem" [Oper. Res. Lett. 38(2010) 386-389]. Oper. Res. Lett. 39(2): 160-161 (2011) - 2010
- [j7]Donglei Du, Xing Wang, Dachuan Xu:
An approximation algorithm for the k-level capacitated facility location problem. J. Comb. Optim. 20(4): 361-368 (2010) - [j6]Zhen Wang, Donglei Du, Adriana Felicia Gabor, Dachuan Xu:
An approximation algorithm for the k-level stochastic facility location problem. Oper. Res. Lett. 38(5): 386-389 (2010) - 2009
- [j5]Dachuan Xu, Ruichun Yang:
A cost-sharing method for an economic lot-sizing game. Oper. Res. Lett. 37(2): 107-110 (2009) - 2008
- [j4]Dachuan Xu, Shuzhong Zhang:
Approximation algorithm for facility location with service installation costs. Oper. Res. Lett. 36(1): 46-50 (2008) - 2006
- [j3]Dachuan Xu, Donglei Du:
The k-level facility location game. Oper. Res. Lett. 34(4): 421-426 (2006) - 2003
- [j2]Dachuan Xu, Jiye Han, Zheng-Hai Huang, Liping Zhang:
Improved Approximation Algorithms for MAX \fracn\text2-DIRECTED-BISECTION and MAX \fracn\text2-DENSE-SUBGRAPH. J. Glob. Optim. 27(4): 399-410 (2003) - [j1]Dachuan Xu, Yinyu Ye, Jiawei Zhang:
Approximating the 2-catalog segmentation problem using semidefinite programming relaxations. Optim. Methods Softw. 18(6): 705-719 (2003)
Conference and Workshop Papers
- 2025
- [c66]Mengzhen Li, Chenchen Wu, Dachuan Xu, Yicheng Xu:
Approximating Per-Scenario Bound for the Two-Stage Stochastic Facility Location Problem. COCOON (1) 2025: 32-43 - [c65]Bo Zhao, Fengmin Wang, Dachuan Xu, Ruiqi Yang, Yifei Zou:
A Distributed Algorithm for Robust Sequential Submodular Optimization in Multi-robot Systems. TAMC 2025: 165-177 - [c64]Qinqin Gong, Xiankun Yu, Donglei Du, Dachuan Xu, Ruiqi Yang:
Parallelizing Scheduling Algorithms for Resource Allocation Under V-RAN. TAMC 2025: 192-204 - [c63]Yang Lv, Fengmin Wang, Xiankun Yu, Xin Li, Dachuan Xu, Ruiqi Yang:
Random Greedy Deployment of Heterogeneous UAVs. TAMC 2025: 330-341 - 2024
- [c62]Xianrun Chen, Dachuan Xu, Yicheng Xu, Yong Zhang:
Parameterized Approximation Algorithms for Sum of Radii Clustering and Variants. AAAI 2024: 20666-20673 - [c61]Mengzhen Li, Runjie Miao, Chenchen Wu, Dachuan Xu:
Revisit the Online Facility Location Problem with Uniform Facility Cost. AAIM (1) 2024: 133-144 - [c60]Yue Sun, Donglei Du, Longkun Guo, Dachuan Xu:
An Optimal Absolute Approximation Algorithm for Computing k Restricted Shortest Paths. COCOON (1) 2024: 16-28 - [c59]Qinqin Gong, Donglei Du, Ling Gai, Dachuan Xu, Ruiqi Yang:
Approximating Continuous Multi-agent Contracts with Lyapunov Function Methods. COCOON (2) 2024: 420-431 - [c58]Qinqin Gong, Ling Gai, Yijing Wang, Dachuan Xu, Ruiqi Yang:
Approximating Principal-Agent Problem Under Bayesian. IJTCS-FAW 2024: 185-198 - [c57]Xiaoyun Tian, Mengzhen Li, Chenchen Wu, Dachuan Xu:
The Two-Stage Stochastic Facility Location Game. PDCAT 2024: 107-116 - [c56]Jiaming Hu, Chuangbo Hao, Mengzhen Li, Yuhao Wang, Maowen Lu, Dachuan Xu:
UAV Swarm Collaborative Target Assignment Problem: A Deletion Robust Submodular Maximization Approach. PDCAT 2024: 528-533 - [c55]Chenchen Wu, Rolf H. Möhring, Yishui Wang, Dachuan Xu, Dongmei Zhang:
Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques. TAMC 2024: 197-208 - 2023
- [c54]Xin Sun, Congying Han, Chenchen Wu, Dachuan Xu, Yang Zhou:
The Regularized Submodular Maximization via the Lyapunov Method. COCOON (2) 2023: 118-143 - [c53]Xianrun Chen, Lu Han, Dachuan Xu, Yicheng Xu, Yong Zhang:
k-Median/Means with Outliers Revisited: A Simple Fpt Approximation. COCOON (2) 2023: 295-302 - 2022
- [c52]Yuefang Lian, Dachuan Xu, Donglei Du, Yang Zhou:
A Stochastic Non-monotone DR-Submodular Maximization Problem over a Convex Set. COCOON 2022: 1-11 - [c51]Hongxiang Zhang, Dachuan Xu, Ling Gai, Zhenning Zhang:
Online One-Sided Smooth Function Maximization. COCOON 2022: 177-185 - 2021
- [c50]Mengyun Chen, Kai-Xin Gao, Xiaolei Liu, Zidong Wang, Ningxi Ni, Qian Zhang, Lei Chen, Chao Ding, Zheng-Hai Huang, Min Wang, Shuangling Wang, Fan Yu, Xinyuan Zhao, Dachuan Xu:
THOR, Trace-based Hardware-driven Layer-Oriented Natural Gradient Descent Computation. AAAI 2021: 7046-7054 - [c49]Kai-Xin Gao, Xiao-Lei Liu, Zheng-Hai Huang, Min Wang, Zidong Wang, Dachuan Xu, Fan Yu:
A Trace-restricted Kronecker-Factored Approximation to Natural Gradient. AAAI 2021: 7519-7527 - [c48]Chunying Ren, Zijun Wu, Dachuan Xu, Wenqing Xu:
A Game-Theoretic Analysis of Deep Neural Networks. AAIM 2021: 369-379 - [c47]Sai Ji, Yinhong Dong, Donglei Du, Dachuan Xu:
Approximation Algorithms for the Lower Bounded Correlation Clustering Problem. CSoNet 2021: 39-49 - [c46]Min Cui, Donglei Du, Dachuan Xu, Ruiqi Yang:
Approximation Algorithm for Maximizing Nonnegative Weakly Monotonic Set Functions. CSoNet 2021: 50-58 - [c45]Jiaming Hu, Dachuan Xu, Donglei Du, Cuixia Miao:
Differentially Private Submodular Maximization over Integer Lattice. CSoNet 2021: 59-67 - [c44]Longkun Guo, Wenjie Zou, Chenchen Wu, Dachuan Xu, Ding-Zhu Du:
MinSum Movement of Barrier and Target Coverage using Sink-based Mobile Sensors on the Plane. ICDCS 2021: 696-706 - 2020
- [c43]Yijing Wang, Dachuan Xu, Donglei Du, Ran Ma:
Online Bicriteria Algorithms to Balance Coverage and Cost in Team Formation. AAIM 2020: 25-36 - [c42]Sai Ji, Dachuan Xu, Donglei Du, Ling Gai:
Approximation Algorithm for the Balanced 2-correlation Clustering Problem on Well-Proportional Graphs. AAIM 2020: 97-107 - [c41]Xiaoyun Tian, Dachuan Xu, Donglei Du, Ling Gai:
The Spherical k-means++ Algorithm via Local Search. AAIM 2020: 131-140 - [c40]Min Cui, Dachuan Xu, Longkun Guo, Dan Wu:
Approximation Guarantees for Parallelized Maximization of Monotone Non-submodular Function with a Cardinality Constraint. AAIM 2020: 195-203 - [c39]Hongxiang Zhang, Dachuan Xu, Longkun Guo, Jingjing Tan:
Parallelized Maximization of Nonsubmodular Function Subject to a Cardinality Constraint. COCOON 2020: 520-531 - [c38]Xiaoyun Tian, Dachuan Xu, Longkun Guo, Dan Wu:
An Improved Bregman k-means++ Algorithm via Local Search. COCOON 2020: 532-541 - [c37]Xin Sun, Dachuan Xu, Dongmei Zhang, Yang Zhou:
An Adaptive Algorithm for Maximization of Non-submodular Function with a Matroid Constraint. CSoNet 2020: 3-13 - [c36]Lu Han, Changjun Wang, Dachuan Xu, Dongmei Zhang:
The Prize-Collecting k-Steiner Tree Problem. PDCAT 2020: 371-378 - [c35]Ruiqi Yang, Dachuan Xu, Longkun Guo, Dongmei Zhang:
Parametric Streaming Two-Stage Submodular Maximization. TAMC 2020: 193-204 - [c34]Xin Sun, Dachuan Xu, Longkun Guo, Min Li:
Approximation Guarantees for Deterministic Maximization of Submodular Function with a Matroid Constraint. TAMC 2020: 205-214 - [c33]Chunying Ren, Dachuan Xu, Donglei Du, Min Li:
A Primal-Dual Algorithm for Euclidean k-Means Problem with Penalties. TAMC 2020: 377-389 - 2019
- [c32]Chuangen Gao, Shuyang Gu, Ruiqi Yang, Jiguo Yu, Weili Wu, Dachuan Xu:
Interaction-Aware Influence Maximization and Iterated Sandwich Method. AAIM 2019: 129-141 - [c31]Sai Ji, Dachuan Xu, Longkun Guo, Min Li, Dongmei Zhang:
The Seeding Algorithm for Spherical k-Means Clustering with Penalties. AAIM 2019: 149-158 - [c30]Sai Ji, Dachuan Xu, Min Li, Yishui Wang:
Approximation Algorithm for the Correlation Clustering Problem with Non-uniform Hard Constrained Cluster Sizes. AAIM 2019: 159-168 - [c29]Limin Wang, Zhao Zhang, Dachuan Xu, Xiaoyan Zhang:
An Approximation Algorithm for the Dynamic k-level Facility Location Problem. AAIM 2019: 284-291 - [c28]Ruiqi Yang, Shuyang Gu, Chuangen Gao, Weili Wu, Hua Wang, Dachuan Xu:
A Two-Stage Constrained Submodular Maximization. AAIM 2019: 329-340 - [c27]Dongmei Zhang, Yukun Cheng, Min Li, Yishui Wang, Dachuan Xu:
Local Search Approximation Algorithms for the Spherical k-Means Problem. AAIM 2019: 341-351 - [c26]Ruiqi Yang, Dachuan Xu, Longkun Guo, Dongmei Zhang:
Sequence Submodular Maximization Meets Streaming. COCOA 2019: 565-575 - [c25]Min Li, Yishui Wang, Dachuan Xu, Dongmei Zhang:
The Seeding Algorithm for Functional k-Means Problem. COCOON 2019: 387-396 - [c24]Yicheng Xu, Dachuan Xu, Yong Zhang, Juan Zou:
Universal Facility Location in Generalized Metric Space. COCOON 2019: 591-602 - [c23]Ruiqi Yang, Dachuan Xu, Donglei Du, Yicheng Xu, Xihong Yan:
Maximization of Constrained Non-submodular Functions. COCOON 2019: 615-626 - [c22]Zhenning Zhang, Bin Liu, Yishui Wang, Dachuan Xu, Dongmei Zhang:
Greedy Algorithm for Maximization of Non-submodular Functions Subject to Knapsack Constraint. COCOON 2019: 651-662 - [c21]Lu Han, Dachuan Xu, Yicheng Xu, Dongmei Zhang:
Approximation Algorithm for the Squared Metric Soft Capacitated Facility Location Problem (Extended Abstract). CSoNet 2019: 72-73 - [c20]Ruiqi Yang, Dachuan Xu, Yukun Cheng, Chuangen Gao, Ding-Zhu Du:
Streaming Submodular Maximization Under Noises. ICDCS 2019: 348-357 - [c19]Sai Ji, Dachuan Xu, Min Li, Yishui Wang, Dongmei Zhang:
Stochastic Greedy Algorithm Is Still Good: Maximizing Submodular + Supermodular Functions. WCGO 2019: 488-497 - [c18]Yicheng Xu, Dachuan Xu, Dongmei Zhang, Yong Zhang:
A Discretization Algorithm for k-Means with Capacity Constraints. WCGO 2019: 713-719 - [c17]Jian Sun, Dachuan Xu, Ran Ma, Xiaoyan Zhang:
Scheduling Three Identical Parallel Machines with Capacity Constraints. WCGO 2019: 1089-1096 - 2018
- [c16]Francis Y. L. Chin, Sheung-Hung Poon, Hing-Fung Ting, Dachuan Xu, Dongxiao Yu, Yong Zhang:
Approximation and Competitive Algorithms for Single-Minded Selling Problem. AAIM 2018: 98-110 - 2017
- [c15]Dongmei Zhang, Dachuan Xu, Yishui Wang, Peng Zhang, Zhenning Zhang:
A Local Search Approximation Algorithm for a Squared Metric k-Facility Location Problem. COCOA (1) 2017: 119-124 - [c14]Zhenning Zhang, Donglei Du, Chenchen Wu, Dachuan Xu, Dongmei Zhang:
A Spectral Partitioning Algorithm for Maximum Directed Cut Problem. COCOA (1) 2017: 298-312 - [c13]Longkun Guo, Min Li, Dachuan Xu:
Approximation Algorithms for Maximum Coverage with Group Budget Constraints. COCOA (2) 2017: 362-376 - [c12]Dongmei Zhang, Chunlin Hao, Chenchen Wu, Dachuan Xu, Zhenning Zhang:
A Local Search Approximation Algorithm for the k-means Problem with Penalties. COCOON 2017: 568-574 - 2016
- [c11]Peng Zhang, Chenchen Wu, Dachuan Xu, Xinghe Zhang:
Approximation and Hardness Results for the Max k-Uncut Problem. COCOA 2016: 49-61 - [c10]Chenchen Wu, Donglei Du, Dachuan Xu:
An Approximation Algorithm for the k-Median Problem with Uniform Penalties via Pseudo-Solutions. COCOA 2016: 536-546 - 2015
- [c9]Yishui Wang, Dachuan Xu, Donglei Du, Chenchen Wu:
Local Search Algorithms for k-Median and k-Facility Location Problems with Linear Penalties. COCOA 2015: 60-71 - [c8]Yicheng Xu, Dachuan Xu, Donglei Du, Chenchen Wu:
A (5.83 + ϵ)-Approximation Algorithm for Universal Facility Location Problem with Linear Penalties. COCOA 2015: 72-81 - [c7]Gaidi Li, Dachuan Xu, Donglei Du, Chenchen Wu:
Approximation Algorithms for the Multilevel Facility Location Problem with Linear/Submodular Penalties. FAW 2015: 162-169 - 2014
- [c6]Chenchen Wu, Dachuan Xu, Donglei Du, Wen-qing Xu:
A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem. COCOON 2014: 324-335 - [c5]Dachuan Xu, Fengmin Wang, Donglei Du, Chenchen Wu:
Primal-Dual Approximation Algorithms for Submodular Vertex Cover Problems with Linear/Submodular Penalties. COCOON 2014: 336-345 - 2013
- [c4]Yu Li, Donglei Du, Naihua Xiu, Dachuan Xu:
Improved Approximation Algorithms for the Facility Location Problems with Linear/submodular Penalty. COCOON 2013: 292-303 - [c3]Chenchen Wu, Donglei Du, Dachuan Xu:
An Improved Semidefinite Programming Hierarchies Rounding Approximation Algorithm for Maximum Graph Bisection Problems. COCOON 2013: 304-315 - 2010
- [c2]Zhen Wang, Donglei Du, Dachuan Xu:
A Primal-Dual Approximation Algorithm for the k-Level Stochastic Facility Location Problem. AAIM 2010: 253-260 - 2009
- [c1]Ruichun Yang, Zhen Wang, Dachuan Xu:
A Cost-Sharing Method for the Soft-Capacitated Economic Lot-Sizing Game. COCOA 2009: 166-173
Editorship
- 2025
- [e5]Donglei Du, Lu Han, Dachuan Xu:
Combinatorial Optimization and Applications - 17th International Conference, COCOA 2024, Beijing, China, December 6-8, 2024, Proceedings, Part I. Lecture Notes in Computer Science 15434, Springer 2025, ISBN 978-981-96-4444-5 [contents] - [e4]Donglei Du, Lu Han, Dachuan Xu:
Combinatorial Optimization and Applications - 17th International Conference, COCOA 2024, Beijing, China, December 6-8, 2024, Proceedings, Part II. Lecture Notes in Computer Science 15435, Springer 2025, ISBN 978-981-96-4447-6 [contents] - 2022
- [e3]Ding-Zhu Du, Donglei Du, Chenchen Wu, Dachuan Xu:
Theory and Applications of Models of Computation - 17th Annual Conference, TAMC 2022, Tianjin, China, September 16-18, 2022, Proceedings. Lecture Notes in Computer Science 13571, Springer 2022, ISBN 978-3-031-20349-7 [contents] - 2021
- [e2]Ding-Zhu Du, Donglei Du, Chenchen Wu, Dachuan Xu:
Combinatorial Optimization and Applications - 15th International Conference, COCOA 2021, Tianjin, China, December 17-19, 2021, Proceedings. Lecture Notes in Computer Science 13135, Springer 2021, ISBN 978-3-030-92680-9 [contents] - 2015
- [e1]Dachuan Xu, Donglei Du, Ding-Zhu Du:
Computing and Combinatorics - 21st International Conference, COCOON 2015, Beijing, China, August 4-6, 2015, Proceedings. Lecture Notes in Computer Science 9198, Springer 2015, ISBN 978-3-319-21397-2 [contents]
Informal and Other Publications
- 2026
- [i14]Yuefang Lian, Longkun Guo, Zhongrui Zhao, Zhigang Lu, Yanan Cai, Shuchao Pang, Dachuan Xu, Minhui Xue:
Toward Trustworthy AI: Multi-Target Adversarial Attacks and Robust Defenses for Continuous Data Summarization. CoRR abs/2606.11804 (2026) - 2025
- [i13]Tianshu Chu, Dachuan Xu, Wei Yao, Chengming Yu, Jin Zhang:
A Provably Convergent Plug-and-Play Framework for Stochastic Bilevel Optimization. CoRR abs/2505.01258 (2025) - 2024
- [i12]Tianshu Chu, Dachuan Xu, Wei Yao, Jin Zhang:
SPABA: A Single-Loop and Probabilistic Stochastic Bilevel Algorithm Achieving Optimal Sample Complexity. CoRR abs/2405.18777 (2024) - 2023
- [i11]Shengminjie Chen, Donglei Du, Wenguo Yang, Dachuan Xu, Suixiang Gao:
Continuous Non-monotone DR-submodular Maximization with Down-closed Convex Constraint. CoRR abs/2307.09616 (2023) - 2022
- [i10]Lu Han, Dachuan Xu, Yicheng Xu, Ping Yang:
Approximate the individually fair k-center with outliers. CoRR abs/2201.04849 (2022) - [i9]Xin Sun, Dachuan Xu, Yang Zhou, Chenchen Wu:
Maximizing Modular plus Non-monotone Submodular Functions. CoRR abs/2203.07711 (2022) - [i8]Donglei Du, Zhicheng Liu, Chenchen Wu, Dachuan Xu, Yang Zhou:
An improved approximation algorithm for maximizing a DR-submodular function over a convex set. CoRR abs/2203.14740 (2022) - [i7]Han Xiao, Libing Wang, Donglei Du, Dachuan Xu:
On the Population Monotonicity of Independent Set Games. CoRR abs/2203.17041 (2022) - [i6]Chunying Ren, Zijun Wu, Dachuan Xu, Xiaoguang Yang:
ρ/(1-ε)-approximate pure Nash equilibria algorithms for weighted congestion games and their runtimes. CoRR abs/2208.11309 (2022) - 2020
- [i5]Zijun Wu, Rolf H. Möhring, Chunying Ren, Dachuan Xu:
A convergence analysis of the price of anarchy in atomic congestion games. CoRR abs/2007.14769 (2020) - [i4]Kai-Xin Gao, Xiao-Lei Liu, Zheng-Hai Huang, Min Wang, Zidong Wang, Dachuan Xu, Fan Yu:
A Trace-restricted Kronecker-Factored Approximation to Natural Gradient. CoRR abs/2011.10741 (2020) - [i3]Kai-Xin Gao, Xiao-Lei Liu, Zheng-Hai Huang, Min Wang, Shuangling Wang, Zidong Wang, Dachuan Xu, Fan Yu:
Eigenvalue-corrected Natural Gradient Based on a New Approximation. CoRR abs/2011.13609 (2020) - [i2]Yishui Wang, Rolf H. Möhring, Chenchen Wu, Dachuan Xu, Dongmei Zhang:
Outliers Detection Is Not So Hard: Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques. CoRR abs/2012.10884 (2020) - 2018
- [i1]Zijun Wu, Rolf H. Möhring, Dachuan Xu:
Selfishness need not be bad: a general proof. CoRR abs/1805.07762 (2018)
Coauthor Index
[j120] [j113] [j112] [j110] [j106] [j101] [j100] [j89] [j87] [j85] [j84] [j83] [j81] [j74] [j69] [j53] [j52] [j47] [j46] [j45] [j43] [j42] [j41] [j40] [j38] [j35] [j31] [j30] [j29] [j28] [j26] [j25] [j24] [j23] [j21] [j19] [j18] [j17] [j16] [j14] [j12] [j11] [j10] [j8] [j7] [j6] [j3] [c64] [c60] [c59] [c52] [c47] [c46] [c45] [c43] [c42] [c41] [c33] [c23] [c14] [c10] [c9] [c8] [c7] [c6] [c5] [c4] [c3] [c2] [e5] [e4] [e3] [e2] [e1] [i11] [i8] [i7]
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 2026-07-14 00:59 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
