Hardness of Finding Two Edge-Disjoint Min-Min Paths in Digraphs. - Longkun Guo; Hong Shen 001 (FAW-AAIM, 2011)

A Polynomial Algorithm for the Vertex Disjoint Min-Min Problem in Planar Graphs. - Longkun Guo; Hong Shen 001 (PAAP, 2011)

Efficient Approximation Algorithms for Computing k-Disjoint Minimum Cost Paths with Delay Constraint. - Longkun Guo; Hong Shen 001 (PDCAT, 2012)

Constrained Fault-Tolerant Resource Allocation - Kewen Liao; Hong Shen 001; Longkun Guo (CoRR, 2012)

Improved Approximations for Shallow-Light Spanning and Steiner Trees - Longkun Guo; Kewen Liao (CoRR, 2012)

Efficient 2-Approximation Algorithms for Computing 2-Connected Steiner Minimal Networks. - Hong Shen 001; Longkun Guo (IEEE Trans. Computers, 2012)

On the complexity of the edge-disjoint min-min problem in planar digraphs. - Longkun Guo; Hong Shen 001 (Theor. Comput. Sci., 2012)

Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints. - Longkun Guo; Hong Shen 001; Kewen Liao (COCOON, 2013)

Improved Approximation Algorithms for Constrained Fault-Tolerant Resource Allocation - (Extended Abstract). - Kewen Liao; Hong Shen 001; Longkun Guo (FCT, 2013)

On Finding Min-Min Disjoint Paths. - Longkun Guo; Hong Shen 001 (Algorithmica, 2013)

An Eight-Approximation Algorithm for Computing Rooted Three-Vertex Connected Minimum Steiner Networks. - Hong Shen 001; Longkun Guo (IEEE Trans. Computers, 2013)

Improved LP-rounding Approximations for the k-Disjoint Restricted Shortest Paths Problem. - Longkun Guo (FAW, 2014)

Approximating the Shallow-Light Steiner Tree Problem When Cost and Delay are Linearly Dependent. - Longkun Guo; Nianchen Zou; Yidong Li (PAAP, 2014)

On the Shallow-Light Steiner Tree Problem. - Longkun Guo; Kewen Liao; Hong Shen 001 (PDCAT, 2014)

Improved Approximating Algorithms for Computing Energy Constrained Minimum Cost Steiner Trees. - Nianchen Zou; Longkun Guo (ICA3PP (1), 2015)

Brief Announcement: Efficient Approximation Algorithms for Computing k Disjoint Restricted Shortest Paths. - Longkun Guo; Kewen Liao; Hong Shen 001; Peng Li (SPAA, 2015)

A parallel SRM feature extraction algorithm for steganalysis based on GPU architecture. - Kaizhi Chen; Chenjun Lin; Shangping Zhong; Longkun Guo (Comput. Sci. Inf. Syst., 2015)

Efficient Approximation Algorithms for Computing emph{k} Disjoint Restricted Shortest Paths. - Longkun Guo; Kewen Liao; Hong Shen 001; Peng Li (CoRR, 2015)

Efficient Approximation Algorithms for the Largest Weight Data Retrieval Problem. - Longkun Guo; Wenxing Zhu; Hong Shen 001 (CoRR, 2015)

Improved approximation algorithms for computing k disjoint paths subject to two constraints. - Longkun Guo; Hong Shen 001; Kewen Liao (J. Comb. Optim., 2015)

Improved approximation algorithms for constrained fault-tolerant resource allocation. - Kewen Liao; Hong Shen 001; Longkun Guo (Theor. Comput. Sci., 2015)

Privacy-Preserving Internet Traffic Publication. - Longkun Guo; Hong Shen 001 (Trustcom/BigDataSE/ISPA, 2016)

NP-Completeness of the Negative k-Cycle Problem. - Longkun Guo; Peng Li (CoRR, 2016)

Efficient approximation algorithms for computing k disjoint constrained shortest paths. - Longkun Guo (J. Comb. Optim., 2016)

On the Complexity of Detecting k-Length Negative Cost Cycles. - Longkun Guo; Peng Li (COCOA (1), 2017)

Approximation Algorithms for Maximum Coverage with Group Budget Constraints. - Longkun Guo; Min Li 028; Dachuan Xu (COCOA (2), 2017)

Fast Approximation Algorithms for Computing Constrained Minimum Spanning Trees. - Pei Yao; Longkun Guo (COCOA (1), 2017)

Approximation Algorithms for Minimizing Maximum Sensor Movement for Line Barrier Coverage in the Plane. - Longkun Guo; Hong Shen 001 (CoRR, 2017)

Efficient data retrieval algorithms for multiple requests in MIMO wireless networks. - Ping He; Hong Shen 001; Longkun Guo; Yidong Li (Int. J. Commun. Syst., 2017)

Efficient Approximation Algorithms for Multi-Antennae Largest Weight Data Retrieval. - Longkun Guo; Hong Shen 001; Wenxing Zhu (IEEE Trans. Mob. Comput., 2017)

Efficient Approximation Algorithms for the Bounded Flexible Scheduling Problem in Clouds. - Longkun Guo; Hong Shen 001 (IEEE Trans. Parallel Distributed Syst., 2017)

Exact Algorithms for Finding Partial Edge-Disjoint Paths. - Yunyun Deng; Longkun Guo; Peihuang Huang (COCOON, 2018)

Constructing Multiple Domain Taxonomy for Text Processing Tasks. - Yihong Zhang 001; Yongrui Qin; Longkun Guo (DEXA (2), 2018)

A Fast Algorithm for Optimally Finding Partially Disjoint Shortest Paths. - Longkun Guo; Yunyun Deng; Kewen Liao; Qiang He 001; Timos Sellis; Zheshan Hu (IJCAI, 2018)

Efficient Algorithms for Flexible Sweep Coverage in Crowdsensing. - Peihuang Huang; Wenxing Zhu; Kewen Liao; Timos Sellis; Zhiyong Yu 001; Longkun Guo (IEEE Access, 2018)

"t-时隙k-覆盖"群智感知任务的参与者选择方法 (Participant Selection Algorithm for t-Sweep k-Coverage Crowd Sensing Tasks). - Jie Zhou; Zhiyong Yu 001; Wenzhong Guo; Longkun Guo; Weiping Zhu 005 (计算机科学, 2018)

Participant selection for t-sweep k-coverage crowd sensing tasks. - Zhiyong Yu 001; Jie Zhou; Wenzhong Guo; Longkun Guo; Zhiwen Yu 001 (World Wide Web, 2018)

Evaluating Connection Quality between Two Individuals in Social Networks. - Yi Chen; Peihuang Huang; Longkun Guo (BESC, 2019)

Fast Anomaly Detection in Multiple Multi-Dimensional Data Streams. - Hongyu Sun; Qiang He 001; Kewen Liao; Timos Sellis; Longkun Guo; Xuyun Zhang; Jun Shen 001; Feifei Chen 001 (IEEE BigData, 2019)

Strategy-Proof Cost-Sharing Mechanism Design for a Generalized Cover-Sets Problem (Extended Abstract). - Longkun Guo; Chenchen Wu; Huahui Yu; Xiaoyan Zhang 001 (CSoNet, 2019)

Self-Adaptive Resource Management Framework for Software Services in Cloud. - Haijiang Wang 002; Yun Ma 003; Xianghan Zheng; Xing Chen 002; Longkun Guo (ISPA/BDCloud/SocialCom/SustainCom, 2019)

Efficient Algorithms for Constrained Clustering with Side Information. - Zhendong Hao; Longkun Guo; Pei Yao; Peihuang Huang; Huihong Peng (PAAP, 2019)

Non-linear K-Barrier Coverage in Mobile Sensor Network. - Zijing Ma; Shuangjuan Li; Longkun Guo; Guohua Wang (PAAP, 2019)

Min-Max Movement of Sink-Based Mobile Sensors in the Plane for Barrier Coverage. - Wenjie Zou; Longkun Guo; Peihuang Huang (PDCAT, 2019)

On the Complexity of and Algorithms for Min-Max Target Coverage On a Line Boundary. - Peihuang Huang; Wenxing Zhu; Longkun Guo (TAMC, 2019)

Optimizing the Sensor Movement for Barrier Coverage in a Sink-Based Deployed Mobile Sensor Network. - Shuangjuan Li; Hong Shen 001; Qiong Huang 001; Longkun Guo (IEEE Access, 2019)

Optimizing Movement for Maximizing Lifetime of Mobile Sensors for Covering Targets on a Line. - Peihuang Huang; Wenxing Zhu; Longkun Guo (Sensors, 2019)

Efficient approximation algorithms for maximum coverage with group budget constraints. - Longkun Guo; Min Li 028; Dachuan Xu (Theor. Comput. Sci., 2019)

An Improved Bregman k-means++ Algorithm via Local Search. - Xiaoyun Tian; Dachuan Xu; Longkun Guo; Dan Wu (COCOON, 2020)

Group Influence Maximization in Social Networks. - Yuting Zhong; Longkun Guo (CSoNet, 2020)

Blood Leukocyte Object Detection According to Model Parameter-Transfer and Deformable Convolution. - Kaizhi Chen; Wencheng Wei; Shangping Zhong; Longkun Guo (PDCAT, 2020)

Approximation Algorithms for the General Cluster Routing Problem. - Longkun Guo; Bin Xing; Peihuang Huang; Xiaoyan Zhang 001 (PDCAT, 2020)

System-Level FPGA Routing for Logic Verification with Time-Division Multiplexing. - Long Sun; Longkun Guo; Peihuang Huang (PDCAT, 2020)

A Streaming Model for Monotone Lattice Submodular Maximization with a Cardinality Constraint. - Zhenning Zhang; Longkun Guo; Linyang Wang; Juan Zou (PDCAT, 2020)

Maximizing Group Coverage in Social Networks. - Yuting Zhong; Longkun Guo; Peihuang Huang (PDCAT, 2020)

LP-Based Algorithms for Computing Maximum Vertex-Disjoint Paths with Different Colors. - Yunyun Deng; Yi Chen; Kewen Liao; Longkun Guo (TAMC, 2020)

Approximation Guarantees for Deterministic Maximization of Submodular Function with a Matroid Constraint. - Xin Sun; Dachuan Xu; Longkun Guo; Min Li 028 (TAMC, 2020)

Parametric Streaming Two-Stage Submodular Maximization. - Ruiqi Yang; Dachuan Xu; Longkun Guo; Dongmei Zhang 002 (TAMC, 2020)

Energy-efficient non-linear k-barrier coverage in mobile sensor network. - Zijing Ma; Shuangjuan Li; Longkun Guo; Guohua Wang (Comput. Sci. Inf. Syst., 2020)

Self-adaptive resource allocation for cloud-based software services based on iterative QoS prediction model. - Xing Chen 002; Haijiang Wang 002; Yun Ma 003; Xianghan Zheng; Longkun Guo (Future Gener. Comput. Syst., 2020)

Task allocation for crowdsensing based on submodular optimisation. - Zhiyong Yu 001; Weiping Zhu 005; Longkun Guo; Wenzhong Guo; Zhiwen Yu 001 (Int. J. Ad Hoc Ubiquitous Comput., 2020)

A framework for optimizing extended belief rule base systems with improved Ball trees. - Yang-Geng Fu; Jin-Hui Zhuang; Yu-Peng Chen; Longkun Guo; Ying-Ming Wang 001 (Knowl. Based Syst., 2020)

A Fast FPTAS for Two Dimensional Barrier Coverage Using Sink-Based Mobile Sensors with MinSum Movement. - Wenjie Zou; Longkun Guo; Chunlin Hao; Lei Liu (AAIM, 2021)

Pool-Based Sequential Active Learning For Regression Based on Incremental Cluster Center Selection. - Binwei Lin; Zhiyong Yu 001; Fangwan Huang; Longkun Guo (CBD, 2021)

Streaming Submodular Maximization Under Differential Privacy Noise. - Di Xiao 005; Longkun Guo; Kewen Liao; Pei Yao (COCOA, 2021)

Efficient Algorithms for Scheduling Parallel Jobs with Interval Constraints in Clouds. - Xuanming Xu; Longkun Guo (COCOA, 2021)

Target Coverage with Minimum Number of Camera Sensors. - Pei Yao; Longkun Guo; Shuangjuan Li; Huihong Peng (COCOA, 2021)

Two-Stage Neural Network Classifier for the Data Imbalance Problem with Application to Hotspot Detection. - Bingshu Wang; Lanfan Jiang; Wenxing Zhu; Longkun Guo; Jianli Chen; Yao-Wen Chang (DAC, 2021)

MinSum Movement of Barrier and Target Coverage using Sink-based Mobile Sensors on the Plane. - Longkun Guo; Wenjie Zou; Chenchen Wu; Dachuan Xu; Ding-Zhu Du (ICDCS, 2021)

Demo: Resource Allocation for Wafer-Scale Deep Learning Accelerator. - Huihong Peng; Longkun Guo; Long Sun; Xiaoyan Zhang 001 (ICDCS, 2021)

Poster: Quadratic-Time Algorithms for Optimal Min-Max Barrier Coverage with Mobile Sensors on the Plane. - Pei Yao; Longkun Guo; Jiguo Yu (ICDCS, 2021)

Improved Fast Algorithms for Optimal Min-Max Line Barrier Coverage with Mobile Sensors on the Plane. - Pei Yao; Longkun Guo; Peng Li; Jiawei Lin (MSWiM, 2021)

Streaming Algorithms for Maximizing Monotone DR-Submodular Functions with a Cardinality Constraint on the Integer Lattice. - Zhenning Zhang; Longkun Guo; Yishui Wang; Dachuan Xu; Dongmei Zhang 002 (Asia Pac. J. Oper. Res., 2021)

Topology-Aware Bus Routing in Complex Networks of Very-Large-Scale Integration with Nonuniform Track Configurations and Obstacles. - Ziran Zhu; Zhipeng Huang 009; Jianli Chen; Longkun Guo (Complex., 2021)

On the complexity of and algorithms for detecting k-length negative cost cycles. - Longkun Guo; Peng Li (J. Comb. Optim., 2021)

Sequence submodular maximization meets streaming. - Ruiqi Yang; Dachuan Xu; Longkun Guo; Dongmei Zhang 002 (J. Comb. Optim., 2021)

On finding maximum disjoint paths with different colors: Computational complexity and practical LP-based algorithms. - Yunyun Deng; Longkun Guo; Kewen Liao; Yi Chen (Theor. Comput. Sci., 2021)

Deterministic approximation algorithm for submodular maximization subject to a matroid constraint. - Xin Sun; Dachuan Xu; Longkun Guo; Min Li 028 (Theor. Comput. Sci., 2021)

Parallelized maximization of nonsubmodular function subject to a cardinality constraint. - Hongxiang Zhang; Dachuan Xu; Longkun Guo; Jingjing Tan (Theor. Comput. Sci., 2021)

Fast Approximation Algorithms for Multiple Coverage with Unit Disks. - Xuening Gao; Longkun Guo; Kewen Liao (WoWMoM, 2022)

Efficient approximation algorithms for offline and online unit disk multiple coverage. - Xuening Gao; Longkun Guo; Kewen Liao (Comput. Electr. Eng., 2022)

Regularized two-stage submodular maximization under streaming. - Ruiqi Yang; Dachuan Xu; Longkun Guo; Dongmei Zhang 002 (Sci. China Inf. Sci., 2022)

Linear time algorithm for computing min-max movement of sink-based mobile sensors for line barrier coverage. - Wenjie Zou; Longkun Guo; Peihuang Huang; Geng Lin; Hengquan Mei (Concurr. Comput. Pract. Exp., 2022)

NNNPE: non-neighbourhood and neighbourhood preserving embedding. - Kaizhi Chen; Chengpei Le; Shangping Zhong; Longkun Guo; Ge Xu (Connect. Sci., 2022)

Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint. - Min Cui; Dachuan Xu; Longkun Guo; Dan Wu (J. Comb. Optim., 2022)

The seeding algorithm for spherical k-means clustering with penalties. - Sai Ji; Dachuan Xu; Longkun Guo; Min Li 028; Dongmei Zhang 002 (J. Comb. Optim., 2022)

Improved local search algorithms for Bregman k-means and its variants. - Xiaoyun Tian; Dachuan Xu; Longkun Guo; Dan Wu (J. Comb. Optim., 2022)

Exact algorithms for finding constrained minimum spanning trees. - Pei Yao; Longkun Guo (J. Comb. Optim., 2022)

Maximization problems of balancing submodular relevance and supermodular diversity. - Zhicheng Liu; Longkun Guo; Donglei Du; Dachuan Xu; Xiaoyan Zhang 001 (J. Glob. Optim., 2022)

Min-max movement of barrier coverage with sink-based mobile sensors for crowdsensing. - Hengquan Mei; Longkun Guo; Wenjie Zou; Peihuang Huang; Zhiyong Yu 001; Yongrui Qin (Pervasive Mob. Comput., 2022)

Mixed-Cell-Height Placement With Drain-to-Drain Abutment and Region Constraints. - Jianli Chen; Ziran Zhu; Longkun Guo; Yu-Wei Tseng; Yao-Wen Chang (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2022)

Iterative Message Passing Algorithm for Vertex-Disjoint Shortest Paths. - Guowei Dai; Longkun Guo; Gregory Z. Gutin; Xiaoyan Zhang 001; Zan-Bo Zhang (IEEE Trans. Inf. Theory, 2022)

Graph Contrastive Representation Learning with Input-Aware and Cluster-Aware Regularization. - Jin Li 032; Bingshi Li; Qirong Zhang; Xinlong Chen; Xinyang Huang; Longkun Guo; Yang-Geng Fu (ECML/PKDD (2), 2023)

One-pass streaming algorithm for monotone lattice submodular maximization subject to a cardinality constraint. - Zhenning Zhang; Longkun Guo; Linyang Wang; Juan Zou (Concurr. Comput. Pract. Exp., 2023)

Acceleration for Timing-Aware Gate-Level Logic Simulation with One-Pass GPU Parallelism. - Weijie Fang; Yanggeng Fu; Jiaquan Gao; Longkun Guo; Gregory Z. Gutin; Xiaoyan Zhang 001 (CoRR, 2023)

Submodular maximization over data streams with differential privacy noise. - Longkun Guo; Kewen Liao; Di Xiao 005; Pei Yao (Theor. Comput. Sci., 2023)

Approximation algorithm for MinSum linear barrier coverage with sink-based mobile sensors on the plane. - Wenjie Zou; Longkun Guo; Chunlin Hao; Lei Liu (Theor. Comput. Sci., 2023)

Disjunctive belief rule-based reasoning for decision making with incomplete information. - Yang-Geng Fu; Geng-Chao Fang; Yong-Yu Liu; Longkun Guo; Ying-Ming Wang 001 (Inf. Sci., 2023)

Optimal algorithm for min-max line barrier coverage with mobile sensors on 2-dimensional plane. - Pei Yao; Longkun Guo; Peng Li; Jiawei Lin (Comput. Networks, 2023)

Efficient Constrained K-center Clustering with Background Knowledge. - Longkun Guo; Chaoqi Jia; Kewen Liao; Zhigang Lu 001; Minhui Xue 001 (AAAI, 2024)

Curriculum-Enhanced Residual Soft An-Isotropic Normalization for Over-Smoothness in Deep GNNs. - Jin Li 032; Qirong Zhang; Shuling Xu; Xinlong Chen; Longkun Guo; Yang-Geng Fu (AAAI, 2024)

Efficient Approximation Algorithms for Parallel Batch Machine Scheduling of Malleable Jobs. - Fenghe Xia; Longkun Guo; Xiaoyan Zhang 001 (AAIM (1), 2024)

Fair Maximization of Monotone Submodular Functions in Data Streams. - Shuqian Zhu; Longkun Guo; Jiawei Lin (COCOA (1), 2024)

An Optimal Absolute Approximation Algorithm for Computing k Restricted Shortest Paths. - Yue Sun; Donglei Du; Longkun Guo; Dachuan Xu (COCOON (1), 2024)

Obstacle-Aware Length-Matching Routing for Any-Direction Traces in Printed Circuit Board. - Weijie Fang; Longkun Guo; Jiawei Lin; Silu Xiong; Huan He; Jiacen Xu; Jianli Chen (DAC, 2024)

Streaming Fair k-Center Clustering over Massive Dataset with Performance Guarantee. - Zeyu Lin; Longkun Guo; Chaoqi Jia (PAKDD (3), 2024)

Enhancing Policy Gradient for Traveling Salesman Problem with Data Augmented Behavior Cloning. - Yunchao Zhang; Kewen Liao; Zhibin Liao; Longkun Guo (PAKDD (2), 2024)

Fast Approximation for Scheduling Malleable Jobs on Parallel Batch Machines with Rejection. - Fenghe Xia; Longkun Guo; Xiaoyan Zhang 001 (PDCAT, 2024)

A Local Search Algorithm for Radius-Constrained k-Median. - Gaojie Chi; Longkun Guo (TAMC, 2024)

Algorithmics and Complexity of Cost-Driven Task Offloading with Submodular Optimization in Edge-Cloud Environments. - Longkun Guo; Jiawei Lin; Xuanming Xu; Peng Li (CoRR, 2024)

Convergence and correctness of belief propagation for weighted min-max flow. - Guowei Dai; Longkun Guo; Gregory Z. Gutin; Xiaoyan Zhang 001; Zan-Bo Zhang (Discret. Appl. Math., 2024)

GMP-Net: Graph based Missing Part Patching Network for Point Cloud Completion. - Min-Ming Huang; Yang-Geng Fu; Genggeng Liu; Longkun Guo; Wanling Liu (Eng. Appl. Artif. Intell., 2024)

Minimizing Response Delay in UAV-Assisted Mobile Edge Computing by Joint UAV Deployment and Computation Offloading. - Jianshan Zhang; Haibo Luo; Xing Chen 002; Hong Shen 001; Longkun Guo (IEEE Trans. Cloud Comput., 2024)

A Commentary on the Progress of Big Data in Combinatorial Optimization. - Eddie Cheng 001; Longkun Guo; Yaping Mao; Xiaoyan Zhang 001 (Parallel Process. Lett., 2024)

A Local Search Algorithm for the Radius-Constrained k-Median Problem. - Gaojie Chi; Longkun Guo; Chaoqi Jia (Theory Comput. Syst., 2025)

Acceleration of Timing-Aware Gate-Level Logic Simulation Through One-Pass GPU Parallelism. - Weijie Fang; Yanggeng Fu; Jiaquan Gao; Longkun Guo; Gregory Z. Gutin; Xiaoyan Zhang 001 (IEEE Trans. Computers, 2025)