default search action
Longkun Guo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j48]Guowei Dai
, Longkun Guo, Gregory Z. Gutin, Xiaoyan Zhang
Convergence and correctness of belief propagation for weighted min-max flow. Discret. Appl. Math. 354: 122-130 (2024) - [j47]Min-Ming Huang, Yang-Geng Fu
GMP-Net: Graph based Missing Part Patching Network for Point Cloud Completion. Eng. Appl. Artif. Intell. 130: 107656 (2024) - [j46]Eddie Cheng
A Commentary on the Progress of Big Data in Combinatorial Optimization. Parallel Process. Lett. 34(1): 2475001:1-2475001:6 (2024) - [c59]Jin Li, Qirong Zhang, Shuling Xu, Xinlong Chen, Longkun Guo, Yang-Geng Fu:
Curriculum-Enhanced Residual Soft An-Isotropic Normalization for Over-Smoothness in Deep GNNs. AAAI 2024: 13528-13536 - [c58]Longkun Guo, Chaoqi Jia, Kewen Liao, Zhigang Lu, Minhui Xue:
Efficient Constrained K-center Clustering with Background Knowledge. AAAI 2024: 20709-20717 - [c57]Fenghe Xia
Efficient Approximation Algorithms for Parallel Batch Machine Scheduling of Malleable Jobs. AAIM (1) 2024: 48-59 - [c56]Weijie Fang
Obstacle-Aware Length-Matching Routing for Any-Direction Traces in Printed Circuit Board. DAC 2024: 74:1-74:6 - [c55]Zeyu Lin
Streaming Fair k-Center Clustering over Massive Dataset with Performance Guarantee. PAKDD (3) 2024: 105-117 - [c54]Yunchao Zhang, Kewen Liao
Enhancing Policy Gradient for Traveling Salesman Problem with Data Augmented Behavior Cloning. PAKDD (2) 2024: 327-338 - [c53]Gaojie Chi, Longkun Guo:
A Local Search Algorithm for Radius-Constrained k-Median. TAMC 2024: 173-184 - [i11]Longkun Guo, Chaoqi Jia, Kewen Liao, Zhigang Lu, Minhui Xue:
Efficient Constrained k-Center Clustering with Background Knowledge. CoRR abs/2401.12533 (2024) - [i10]Weijie Fang, Longkun Guo, Jiawei Lin, Silu Xiong, Huan He, Jiacen Xu, Jianli Chen:
Obstacle-Aware Length-Matching Routing for Any-Direction Traces in Printed Circuit Board. CoRR abs/2407.19195 (2024) - 2023
- [j45]Pei Yao, Longkun Guo
Optimal algorithm for min-max line barrier coverage with mobile sensors on 2-dimensional plane. Comput. Networks 228: 109717 (2023) - [j44]Zhenning Zhang
One-pass streaming algorithm for monotone lattice submodular maximization subject to a cardinality constraint. Concurr. Comput. Pract. Exp. 35(17) (2023) - [j43]Yang-Geng Fu
Disjunctive belief rule-based reasoning for decision making with incomplete information. Inf. Sci. 625: 49-64 (2023) - [j42]Wenjie Zou, Longkun Guo
Approximation algorithm for MinSum linear barrier coverage with sink-based mobile sensors on the plane. Theor. Comput. Sci. 941: 121-130 (2023) - [j41]Longkun Guo
Submodular maximization over data streams with differential privacy noise. Theor. Comput. Sci. 944: 113625 (2023) - [c52]Jin Li
Graph Contrastive Representation Learning with Input-Aware and Cluster-Aware Regularization. ECML/PKDD (2) 2023: 666-682 - [i9]Weijie Fang, Yanggeng Fu, Jiaquan Gao, Longkun Guo, Gregory Z. Gutin, Xiaoyan Zhang:
Acceleration for Timing-Aware Gate-Level Logic Simulation with One-Pass GPU Parallelism. CoRR abs/2304.13398 (2023) - [i8]Jin Li, Qirong Zhang, Shuling Xu, Xinlong Chen, Longkun Guo, Yang-Geng Fu:
Curriculum-Enhanced Residual Soft An-Isotropic Normalization for Over-smoothness in Deep GNNs. CoRR abs/2312.08221 (2023) - 2022
- [j40]Xuening Gao, Longkun Guo
Efficient approximation algorithms for offline and online unit disk multiple coverage. Comput. Electr. Eng. 104(Part): 108444 (2022) - [j39]Ruiqi Yang, Dachuan Xu
Regularized two-stage submodular maximization under streaming. Sci. China Inf. Sci. 65(4) (2022) - [j38]Wenjie Zou, Longkun Guo
Linear time algorithm for computing min-max movement of sink-based mobile sensors for line barrier coverage. Concurr. Comput. Pract. Exp. 34(2) (2022) - [j37]Kaizhi Chen, Chengpei Le, Shangping Zhong, Longkun Guo, Ge Xu:
NNNPE: non-neighbourhood and neighbourhood preserving embedding. Connect. Sci. 34(1): 2615-2629 (2022) - [j36]Min Cui, Dachuan Xu
Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint. J. Comb. Optim. 43(5): 1671-1690 (2022) - [j35]Sai Ji, Dachuan Xu
The seeding algorithm for spherical k-means clustering with penalties. J. Comb. Optim. 44(3): 1977-1994 (2022) - [j34]Pei Yao, Longkun Guo
Exact algorithms for finding constrained minimum spanning trees. J. Comb. Optim. 44(3): 2085-2103 (2022) - [j33]Xiaoyun Tian, Dachuan Xu
Improved local search algorithms for Bregman k-means and its variants. J. Comb. Optim. 44(4): 2533-2550 (2022) - [j32]Zhicheng Liu, Longkun Guo, Donglei Du, Dachuan Xu
Maximization problems of balancing submodular relevance and supermodular diversity. J. Glob. Optim. 82(1): 179-194 (2022) - [j31]Hengquan Mei
Min-max movement of barrier coverage with sink-based mobile sensors for crowdsensing. Pervasive Mob. Comput. 85: 101653 (2022) - [j30]Jianli Chen
Mixed-Cell-Height Placement With Drain-to-Drain Abutment and Region Constraints. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 41(4): 1103-1115 (2022) - [j29]Guowei Dai
Iterative Message Passing Algorithm for Vertex-Disjoint Shortest Paths. IEEE Trans. Inf. Theory 68(6): 3870-3878 (2022) - [c51]Xuening Gao
Fast Approximation Algorithms for Multiple Coverage with Unit Disks. WoWMoM 2022: 185-193 - 2021
- [j28]Zhenning Zhang, Longkun Guo, Yishui Wang, Dachuan Xu
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) - [j27]Ziran Zhu, Zhipeng Huang, Jianli Chen, Longkun Guo
Topology-Aware Bus Routing in Complex Networks of Very-Large-Scale Integration with Nonuniform Track Configurations and Obstacles. Complex. 2021: 8843271:1-8843271:12 (2021) - [j26]Ruiqi Yang, Dachuan Xu
Sequence submodular maximization meets streaming. J. Comb. Optim. 41(1): 43-55 (2021) - [j25]Longkun Guo
On the complexity of and algorithms for detecting k-length negative cost cycles. J. Comb. Optim. 42(3): 396-408 (2021) - [j24]Hongxiang Zhang, Dachuan Xu
Parallelized maximization of nonsubmodular function subject to a cardinality constraint. Theor. Comput. Sci. 864: 129-137 (2021) - [j23]Yunyun Deng, Longkun Guo, Kewen Liao
On finding maximum disjoint paths with different colors: Computational complexity and practical LP-based algorithms. Theor. Comput. Sci. 886: 157-168 (2021) - [j22]Xin Sun, Dachuan Xu
Deterministic approximation algorithm for submodular maximization subject to a matroid constraint. Theor. Comput. Sci. 890: 1-15 (2021) - [c50]Wenjie Zou, Longkun Guo, Chunlin Hao, Lei Liu:
A Fast FPTAS for Two Dimensional Barrier Coverage Using Sink-Based Mobile Sensors with MinSum Movement. AAIM 2021: 265-276 - [c49]Binwei Lin, Zhiyong Yu, Fangwan Huang, Longkun Guo:
Pool-Based Sequential Active Learning For Regression Based on Incremental Cluster Center Selection. CBD 2021: 176-182 - [c48]Pei Yao
Target Coverage with Minimum Number of Camera Sensors. COCOA 2021: 12-24 - [c47]Xuanming Xu
Efficient Algorithms for Scheduling Parallel Jobs with Interval Constraints in Clouds. COCOA 2021: 195-202 - [c46]Di Xiao
Streaming Submodular Maximization Under Differential Privacy Noise. COCOA 2021: 431-444 - [c45]Bingshu Wang, Lanfan Jiang, Wenxing Zhu, Longkun Guo, Jianli Chen, Yao-Wen Chang:
Two-Stage Neural Network Classifier for the Data Imbalance Problem with Application to Hotspot Detection. DAC 2021: 175-180 - [c44]Longkun Guo, Wenjie Zou, Chenchen Wu, Dachuan Xu
MinSum Movement of Barrier and Target Coverage using Sink-based Mobile Sensors on the Plane. ICDCS 2021: 696-706 - [c43]Huihong Peng, Longkun Guo, Long Sun, Xiaoyan Zhang:
Demo: Resource Allocation for Wafer-Scale Deep Learning Accelerator. ICDCS 2021: 1114-1115 - [c42]Pei Yao, Longkun Guo, Jiguo Yu:
Poster: Quadratic-Time Algorithms for Optimal Min-Max Barrier Coverage with Mobile Sensors on the Plane. ICDCS 2021: 1132-1133 - [c41]Pei Yao, Longkun Guo, Peng Li, Jiawei Lin:
Improved Fast Algorithms for Optimal Min-Max Line Barrier Coverage with Mobile Sensors on the Plane. MSWiM 2021: 159-166 - 2020
- [j21]Zijing Ma
Energy-efficient non-linear k-barrier coverage in mobile sensor network. Comput. Sci. Inf. Syst. 17(3): 737-758 (2020) - [j20]Xing Chen, Haijiang Wang
Self-adaptive resource allocation for cloud-based software services based on iterative QoS prediction model. Future Gener. Comput. Syst. 105: 287-296 (2020) - [j19]Zhiyong Yu
Task allocation for crowdsensing based on submodular optimisation. Int. J. Ad Hoc Ubiquitous Comput. 33(1): 48-61 (2020) - [j18]Yang-Geng Fu
A framework for optimizing extended belief rule base systems with improved Ball trees. Knowl. Based Syst. 210: 106484 (2020) - [c40]Min Cui, Dachuan Xu
Approximation Guarantees for Parallelized Maximization of Monotone Non-submodular Function with a Cardinality Constraint. AAIM 2020: 195-203 - [c39]Hongxiang Zhang, Dachuan Xu
Parallelized Maximization of Nonsubmodular Function Subject to a Cardinality Constraint. COCOON 2020: 520-531 - [c38]Xiaoyun Tian, Dachuan Xu
An Improved Bregman k-means++ Algorithm via Local Search. COCOON 2020: 532-541 - [c37]Yuting Zhong, Longkun Guo
Group Influence Maximization in Social Networks. CSoNet 2020: 152-163 - [c36]Kaizhi Chen, Wencheng Wei, Shangping Zhong, Longkun Guo:
Blood Leukocyte Object Detection According to Model Parameter-Transfer and Deformable Convolution. PDCAT 2020: 1-16 - [c35]Long Sun, Longkun Guo, Peihuang Huang:
System-Level FPGA Routing for Logic Verification with Time-Division Multiplexing. PDCAT 2020: 210-218 - [c34]Longkun Guo, Bin Xing, Peihuang Huang, Xiaoyan Zhang:
Approximation Algorithms for the General Cluster Routing Problem. PDCAT 2020: 264-273 - [c33]Yuting Zhong, Longkun Guo, Peihuang Huang:
Maximizing Group Coverage in Social Networks. PDCAT 2020: 274-284 - [c32]Zhenning Zhang, Longkun Guo, Linyang Wang, Juan Zou:
A Streaming Model for Monotone Lattice Submodular Maximization with a Cardinality Constraint. PDCAT 2020: 362-370 - [c31]Yunyun Deng, Yi Chen, Kewen Liao
LP-Based Algorithms for Computing Maximum Vertex-Disjoint Paths with Different Colors. TAMC 2020: 107-118 - [c30]Ruiqi Yang, Dachuan Xu
Parametric Streaming Two-Stage Submodular Maximization. TAMC 2020: 193-204 - [c29]Xin Sun, Dachuan Xu
Approximation Guarantees for Deterministic Maximization of Submodular Function with a Matroid Constraint. TAMC 2020: 205-214
2010 – 2019
- 2019
- [j17]Shuangjuan Li
Optimizing the Sensor Movement for Barrier Coverage in a Sink-Based Deployed Mobile Sensor Network. IEEE Access 7: 156301-156314 (2019) - [j16]Peihuang Huang, Wenxing Zhu, Longkun Guo:
Optimizing Movement for Maximizing Lifetime of Mobile Sensors for Covering Targets on a Line. Sensors 19(2): 273 (2019) - [j15]Longkun Guo
Efficient approximation algorithms for maximum coverage with group budget constraints. Theor. Comput. Sci. 788: 53-65 (2019) - [c28]Sai Ji, Dachuan Xu
The Seeding Algorithm for Spherical k-Means Clustering with Penalties. AAIM 2019: 149-158 - [c27]Yi Chen, Peihuang Huang, Longkun Guo:
Evaluating Connection Quality between Two Individuals in Social Networks. BESC 2019: 1-6 - [c26]Hongyu Sun, Qiang He, Kewen Liao
Fast Anomaly Detection in Multiple Multi-Dimensional Data Streams. IEEE BigData 2019: 1218-1223 - [c25]Ruiqi Yang, Dachuan Xu
Sequence Submodular Maximization Meets Streaming. COCOA 2019: 565-575 - [c24]Longkun Guo, Chenchen Wu, Huahui Yu, Xiaoyan Zhang:
Strategy-Proof Cost-Sharing Mechanism Design for a Generalized Cover-Sets Problem (Extended Abstract). CSoNet 2019: 77-78 - [c23]Haijiang Wang
Self-Adaptive Resource Management Framework for Software Services in Cloud. ISPA/BDCloud/SocialCom/SustainCom 2019: 1528-1529 - [c22]Zijing Ma
Non-linear K-Barrier Coverage in Mobile Sensor Network. PAAP 2019: 12-23 - [c21]Zhendong Hao, Longkun Guo, Pei Yao, Peihuang Huang, Huihong Peng:
Efficient Algorithms for Constrained Clustering with Side Information. PAAP 2019: 275-286 - [c20]Wenjie Zou, Longkun Guo, Peihuang Huang:
Min-Max Movement of Sink-Based Mobile Sensors in the Plane for Barrier Coverage. PDCAT 2019: 1-6 - [c19]Peihuang Huang, Wenxing Zhu, Longkun Guo:
On the Complexity of and Algorithms for Min-Max Target Coverage On a Line Boundary. TAMC 2019: 313-324 - 2018
- [j14]Peihuang Huang, Wenxing Zhu
Efficient Algorithms for Flexible Sweep Coverage in Crowdsensing. IEEE Access 6: 50055-50065 (2018) - [j13]Jie Zhou, Zhiyong Yu, Wenzhong Guo, Longkun Guo, Weiping Zhu:
"t-时隙k-覆盖"群智感知任务的参与者选择方法 (Participant Selection Algorithm for t-Sweep k-Coverage Crowd Sensing Tasks). 计算机科学 45(2): 157-164 (2018) - [j12]Zhiyong Yu
Participant selection for t-sweep k-coverage crowd sensing tasks. World Wide Web 21(3): 741-758 (2018) - [c18]Yunyun Deng, Longkun Guo, Peihuang Huang:
Exact Algorithms for Finding Partial Edge-Disjoint Paths. COCOON 2018: 14-25 - [c17]Yihong Zhang
Constructing Multiple Domain Taxonomy for Text Processing Tasks. DEXA (2) 2018: 501-509 - [c16]Longkun Guo, Yunyun Deng, Kewen Liao, Qiang He, Timos Sellis, Zheshan Hu:
A Fast Algorithm for Optimally Finding Partially Disjoint Shortest Paths. IJCAI 2018: 1456-1462 - 2017
- [j11]Ping He, Hong Shen, Longkun Guo, Yidong Li
Efficient data retrieval algorithms for multiple requests in MIMO wireless networks. Int. J. Commun. Syst. 30(1) (2017) - [j10]Longkun Guo, Hong Shen
Efficient Approximation Algorithms for Multi-Antennae Largest Weight Data Retrieval. IEEE Trans. Mob. Comput. 16(12): 3320-3333 (2017) - [j9]Longkun Guo
Efficient Approximation Algorithms for the Bounded Flexible Scheduling Problem in Clouds. IEEE Trans. Parallel Distributed Syst. 28(12): 3511-3520 (2017) - [c15]Pei Yao, Longkun Guo:
Fast Approximation Algorithms for Computing Constrained Minimum Spanning Trees. COCOA (1) 2017: 103-110 - [c14]Longkun Guo, Peng Li:
On the Complexity of Detecting k-Length Negative Cost Cycles. COCOA (1) 2017: 240-250 - [c13]Longkun Guo, Min Li, Dachuan Xu
Approximation Algorithms for Maximum Coverage with Group Budget Constraints. COCOA (2) 2017: 362-376 - [i7]Longkun Guo, Hong Shen:
Approximation Algorithms for Minimizing Maximum Sensor Movement for Line Barrier Coverage in the Plane. CoRR abs/1706.01623 (2017) - 2016
- [j8]Longkun Guo:
Efficient approximation algorithms for computing k disjoint constrained shortest paths. J. Comb. Optim. 32(1): 144-158 (2016) - [c12]Longkun Guo, Hong Shen:
Privacy-Preserving Internet Traffic Publication. Trustcom/BigDataSE/ISPA 2016: 884-891 - [i6]Longkun Guo, Peng Li:
NP-Completeness of the Negative k-Cycle Problem. CoRR abs/1603.01925 (2016) - 2015
- [j7]Kaizhi Chen, Chenjun Lin, Shangping Zhong, Longkun Guo:
A parallel SRM feature extraction algorithm for steganalysis based on GPU architecture. Comput. Sci. Inf. Syst. 12(4): 1345-1359 (2015) - [j6]Longkun Guo, Hong Shen, Kewen Liao
Improved approximation algorithms for computing k disjoint paths subject to two constraints. J. Comb. Optim. 29(1): 153-164 (2015) - [j5]Kewen Liao
Improved approximation algorithms for constrained fault-tolerant resource allocation. Theor. Comput. Sci. 590: 118-128 (2015) - [c11]Nianchen Zou, Longkun Guo:
Improved Approximating Algorithms for Computing Energy Constrained Minimum Cost Steiner Trees. ICA3PP (1) 2015: 567-577 - [c10]Longkun Guo, Kewen Liao
Brief Announcement: Efficient Approximation Algorithms for Computing k Disjoint Restricted Shortest Paths. SPAA 2015: 62-64 - [i5]Longkun Guo, Wenxing Zhu, Hong Shen:
Efficient Approximation Algorithms for the Largest Weight Data Retrieval Problem. CoRR abs/1504.04679 (2015) - [i4]Longkun Guo, Kewen Liao, Hong Shen, Peng Li:
Efficient Approximation Algorithms for Computing \emph{k} Disjoint Restricted Shortest Paths. CoRR abs/1504.05519 (2015) - 2014
- [c9]Longkun Guo:
Improved LP-rounding Approximations for the k-Disjoint Restricted Shortest Paths Problem. FAW 2014: 94-104 - [c8]Longkun Guo, Nianchen Zou, Yidong Li
Approximating the Shallow-Light Steiner Tree Problem When Cost and Delay are Linearly Dependent. PAAP 2014: 99-103 - [c7]Kaizhi Chen, Chenjun Lin, Shangping Zhong, Longkun Guo:
A Parallel SRM Feature Extraction Algorithm for Steganalysis Based on GPU Architecture. PAAP 2014: 178-182 - [c6]Longkun Guo, Kewen Liao
On the Shallow-Light Steiner Tree Problem. PDCAT 2014: 56-60 - 2013
- [j4]Longkun Guo, Hong Shen:
On Finding Min-Min Disjoint Paths. Algorithmica 66(3): 641-653 (2013) - [j3]Hong Shen, Longkun Guo:
An Eight-Approximation Algorithm for Computing Rooted Three-Vertex Connected Minimum Steiner Networks. IEEE Trans. Computers 62(9): 1684-1693 (2013) - [c5]Longkun Guo, Hong Shen, Kewen Liao
Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints. COCOON 2013: 325-336 - [c4]Kewen Liao
Improved Approximation Algorithms for Constrained Fault-Tolerant Resource Allocation - (Extended Abstract). FCT 2013: 236-247 - [i3]Longkun Guo, Hong Shen, Kewen Liao:
Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints. CoRR abs/1301.5070 (2013) - 2012
- [j2]Hong Shen, Longkun Guo:
Efficient 2-Approximation Algorithms for Computing 2-Connected Steiner Minimal Networks. IEEE Trans. Computers 61(7): 954-968 (2012) - [j1]Longkun Guo, Hong Shen:
On the complexity of the edge-disjoint min-min problem in planar digraphs. Theor. Comput. Sci. 432: 58-63 (2012) - [c3]Longkun Guo, Hong Shen:
Efficient Approximation Algorithms for Computing k-Disjoint Minimum Cost Paths with Delay Constraint. PDCAT 2012: 627-631 - [i2]Kewen Liao, Hong Shen, Longkun Guo:
Constrained Fault-Tolerant Resource Allocation. CoRR abs/1208.3835 (2012) - [i1]Longkun Guo, Kewen Liao:
Improved Approximations for Shallow-Light Spanning and Steiner Trees. CoRR abs/1212.3403 (2012) - 2011
- [c2]Longkun Guo, Hong Shen:
Hardness of Finding Two Edge-Disjoint Min-Min Paths in Digraphs. FAW-AAIM 2011: 300-307 - [c1]Longkun Guo, Hong Shen:
A Polynomial Algorithm for the Vertex Disjoint Min-Min Problem in Planar Graphs. PAAP 2011: 47-51
Coauthor Index
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-12-02 21:30 CET 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: