郭龙坤
 
基本信息
职称 副教授
职务 博士生导师
主讲课程 组合优化,计算机多核,可计算性理论,数字逻辑电路
研究方向 算法设计与分析,组合优化,数据科学与计算机网络
办公室 4号楼220
电子邮件
联系电话
个人简介

郭龙坤,博士生导师,福州大学“旗山学者”,计算机科学系主任,副教授.中国数学规化(数学优化)学会青年理事,福建省计算机学会理事.

主要研究领域为数据科学与计算机网络.致力于计算机网络、数据科学、数据挖掘与隐私保护、并行与分布式计算等领域的重要优化问题的基于组合优化方法/统计概率方法的算法设计与分析.

已发表SCI/EI/ISTP收录的国内外期刊与会议论文三十余篇(包括Algorithmica, IEEE transactions on mobile computing(TMC), IEEE transactions on computers(TC), IEEE transactions on parallel and distributed systems (TPDS) 等国际顶级期刊及IJCAI, ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)等国际顶级会议.现任PDCAT, PAAP与Cloud-asia等会议的委员会成员(PC Member).IEEE transactions on computers (TC),IEEE transactions on parallel and distributed systems (TPDS),Theoretical computer science等多个国际期刊审稿人.主持两项国家自然科学基金与多项省部级自然科学基金,作为主要成员参与多项国家与省部自然科学基金.2018年入选福州大学“旗山学者”.

教育经历
  1. 2001年9月-2005年7月,中国科学技术大学,计算机科学与技术系,学士
  2. 2005年7月-2011年6月,中国科学技术大学,计算机学院,博士
海外经历
  1. 2010年3月---2011年1月,澳大利亚阿德莱德大学,联合培养(国家建设高水平大学公派研究生项目);
  2. 2015年9月---2016年9月,澳大利亚阿德莱德大学,副研究员(依托项目“Privacy Preserving Internet Traffic Classification” DP150104871).
主要科研项目
  1. 国家自然科学基金面上项目,不相交QoS路径的理论与应用,批准号61772005,2018.01-2021.12(主持,在研)
  2. 福建省自然科学基金面上项目,基于线性规划的不相交QoS路径算法研究,批准号2017J01753,2017.04-2020.04(主持,在研)
  3. 福州大学"旗山学者"项目,不相交路径的算法与理论研究,批准号GXRC18034,2018.08-2021.07(主持,在研)
  4. 国家自然科学基金青年项目,不相交QoS路径与斯坦纳网络的近似算法研究,批准号61300025,2014.01-2016.12(主持,已结题)
  5. 福建省自然科学基金项目,云计算环境下高效视频传输的算法研究,批准号2012J05115,2012.01-2014.12(主持,已结题)
  6. 教育部博士点基金项目(新教师类),基于不相交路径技术的鲁棒视频流传输算法研究,批准号20123514120013,2012.01-2015.12(主持,已结题)
  7. 澳大利亚Discovery Project, 隐私保护的网络流量分类Privacy Preserving Internet Traffic Classification,批准号DP150104871(参与,在研)
  8. 国家自然科学基金面上项目,主动学习式群智感知任务分配方法研究,批准号61772136,2018.01-2021.12(参与,在研)
  9. 国家自然科学基金青年项目,保护数据隐私性及抗量子密码分析的可搜索加密研究,批准号61402112,2015.01-2017.12(参与,已结题)
近年荣誉与获奖情况
  1. 2014年,“On the Complexity of the edge-disjoint Min-Min problem in Planar Digraphs”, 第十一届福建省自然科学优秀论文二等奖.
近年发表论文(标记*为通迅作者)

指导学生发表论文:

  1. Yunyun Deng, Longkun Guo, Peihuang Huang: Exact Algorithms for Finding Partial Edge-Disjoint Paths. COCOON 2018: 14-25.
  2. PeiYao (Supervised master student) and Longkun Guo*, “Fast Approximation Algorithms for Computing Constrained Minimum Spanning Tree”, The 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA'17), Vol 1, 103-110, 2017.
  3. 姚培,郭龙坤*,“最小化移动传感器最大迁移距离的快速栅栏覆盖算法”, 小型微型计算机系统(接收).
  4. 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. (CCF A类会议,人工智能top-tier conference)

Referred Journal Papers:

  1. Longkun Guo, Hong Shen and Wenxing Zhu, “Efficient Approximation Algorithms for Multi-Antennae Largest Weight Data Retrieval”, IEEE Transactions on Mobile Computing, 16(12): 3320-3333 (2017). ERA A* & CCF A journal
  2. Longkun Guo and Hong Shen, “Improved Approximation Algorithms for Bounded Flexible Scheduling in Clouds”, IEEE Transactions on Parallel and Distributed Systems, 28(12): 3511-3520 (2017). ERA A* & CCF A journal
  3. Longkun Guo and Hong Shen, “On finding Min-Min disjoint paths”, Algorithmica, Vol. 66:641–653, 2013. ERA A* & CCF B journal
  4. Hong Shen and Longkun Guo, “An 8-Approximation Algorithm for Computing Rooted 3-Vertex Connected Minimum Steiner Networks”, IEEE Transactions on Computers 62(9): 1684-1693, 2013. ERA A* & CCF A journal
  5. Longkun Guo and Hong Shen, “On the Complexity of the edge-disjoint Min-Min problem in Planar Digraphs”, Theoretical computer science, vol. 432: 58-63, 2012. ERA A & CCF B journal
  6. Hong Shen and Longkun Guo, “Efficient 2-Approximation Algorithms for Computing 2-Connected Steiner Minimal Networks”, IEEE Transactions on Computers, 61(7): 954-968, 2012. ERA A* & CCF A journal
  7. Longkun Guo, Hong Shen and Kewen Liao, “Improved approximation algorithms for computing disjoint paths subject to two constraints”, Journal of Combinatorial Optimization, 29(1): 153-164, 2015. (An extended abstract has appeared in COCOON 2013).
  8. Longkun Guo, “Improved LP-rounding Approximations for the k-Disjoint Restricted Shortest Paths Problem”. Journal of combinatorial optimization, 32(1): 144-158, 2016. 
  9. Kewen Liao, Hong Shen and Longkun Guo, “Improved approximation algorithms for constrained fault-tolerant resource allocation”, Theoretical computer science, vol. 590: 118-128, 2015. 
  10. Kaizhi Chen, Chenjun Lin, Shangping Zhong and Longkun Guo*, “A Parallel SRM Feature Extraction Algorithm for Steganalysis Based on GPU Architecture”, Computer Science and Information Systems, 12(4): 1345-1359, 2015.
  11. Ping He, Hong Shen, Longkun Guo and Yidong Li, “Efficient Data Retrieval Algorithms for Multiple Requests in MIMO Wireless Networks”, International Journal of Communication Systems, 30:e2917, 2017.
  12. Longkun Guo and Hong Shen, “Hardness of the Edge-Disjoint Min-Min Problem in Undirected Graphs”, Journal of the Graduate School of the Chinese Academy of Sciences, Vol. 29 (4): 549-554, 2012.
  13. 郭龙坤,沈鸿,“关于Steiner网络设计问题的近似算法综述”,小型微型计算机系统, 第33卷, 第9期: 1992-1996, 2012.
Referred Conference Papers:
  1. Longkun Guo, Min Li and Dachuan Xu, “Approximation Algorithms for Maximum Coverage with Group Budget Constraints”, The 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA'17), Vol 2, 362-376, 2017.
  2. Longkun Guo and Peng Li, “On the Complexity of Detecting k-Length Negative Cost Cycles”, The 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA'17), Vol 1, 240-250, 2017.
  3. Longkun Guo and Hong Shen, “Privacy Preserving Internet Traffic Publication”, IEEE TrustCom 2016: 884-891.
  4. Longkun Guo, Kewen Liao, Hong Shen and Peng Li, “Brief Announcement: Efficient Approximation Algorithms for Computing k Disjoint QoS Paths”, 27th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2015): 62-64, 2015.
  5. Nianchen Zou (Supervised student), Longkun Guo (corresponding author), Improved Approximating Algorithms for Computing Energy Constrained Minimum Cost Steiner Trees. The 15th Int. Conference on Algorithms and Architectures for Parallel Processing (ICA3PP 2015): 567-577.
  6. Longkun Guo, Hong Shen and Kewen Liao, On The Shallow-Light Steiner Tree Problem. The 15th International Conference on Parallel and Distributed Computing: Applications and Technologies (PDCAT 2014), 56-60.
  7. Longkun Guo, Improved LP-rounding Approximations for the k-Disjoint Restricted Shortest Paths Problem. Frontier Algorithmic Workshop 2014, Lecture Notes in Computer Science 8497, pp 94-104, 2014.
  8. Longkun Guo, NianChen Zuo, Yidong Li, Approximating the Shallow-Light Steiner Tree Problem When Cost and Delay are Linearly Dependent. The 6th International Symposium on Parallel Architectures, Algorithms and Programming (PAAP 2014), pp 99-103, 2014.
  9. Kaizhi Chen, Chenjun Lin, Shangping Zhong and Longkun Guo, “A Parallel SRM Feature Extraction Algorithm for Steganalysis Based on GPU Architecture”. Proceedings of PAAP 2014, pp 178-182.
  10. Longkun Guo, Hong Shen and Kewen Liao, Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints. The 19th International Computing and Combinatorics Conference (COCOON2013), Lecture notes on computer science Vol. 7936, pp.325-336, 2013.
  11. Kewen Liao, Hong Shen and Longkun Guo, "Improved approximation algorithms for constrained fault-tolerant resource allocation (Extended abstract) ". The 19th International Symposium on Fundamentals of Computation Theory (FCT 2013), Lecture Notes in Computer Science, Vol. 8070, pp. 236-247, 2013.
  12. Longkun Guo and Hong Shen, Efficient approximation algorithms for computing k disjoint minimum cost paths with delay constraint. The 13th International Conference on Parallel and Distributed Computing: Applications and Technologies (PDCAT2012), pp 627-631.
  13. Longkun Guo and Hong Shen, “A Polynomial Algorithm for the Vertex Disjoint Min-Min Problem in Planar Graphs”. The Fourth International Symposium on Parallel Architectures, Algorithms and Programming (PAAP 2011), 2011, pp 47-51.
  14. Longkun Guo and Hong Shen, “On the Complexity of the Edge-Disjoint Min-Min Problem in Undirected Graphs,”Proceedings of the 3rd International Conference on Computer Research and Development, 2(2011), pp 150-154.