金恺

教师简介（含主要经历）

  本人于2020年7月加入中山大学智能工程学院，作为学校百人计划的一员。在这之前，本人在香港大学和香港科技大学分别进行了两年的博士后科研工作（2016-2020）。本人热衷于解决理论计算机领域中富有挑战的开放性问题，尤其是定义简单明了的问题。

个人主页：cscjjk.github.io

教育背景

本科, 计算机科学实验班 (姚班), 清华大学 (2008）

博士, 理论计算机科学方向, 清华大学 (2016)  
导师：姚期智教授。博士论文如下。

研究方向

- Algorithm Design 算法设计
- Game Theory 博弈论
- Combinatorial Optimization 组合优化
- Computational Geometry 计算几何
- Discrete and Convex Geometry 离散和凸几何
1. I am looking for more applications of my technique for solving the polygon inclusion problems.
2. I am attracted to some open problems in game theory and will study them recently.
  Particularly, I am interested in cooperation and competition between multiple players.
3. I am trying to extend the results given in my PhD. dissertation to the 3d case.

科研资助

• 中山大学“百人计划”科研启动资金
• 国自然青年项目[基于Rotate-and-Kill技术的寻找凸区域内外极值图形的最优算法的设计]（已结题）（2021-2024）
• 深圳市科创委稳定支持项目 [工程提速等优化问题的高效算法的设计]，主持（2022-2025）。
• 省重点人才项目-青年拔尖人才（2022-2025）
• 深圳市海外高层次人才C类（2021年认定)

论著专利

期刊论文

• Sum-of-Max Partition under a Knapsack Constraint
  Computers and Electrical Engineering (Jan 2023)
  K. Jin*, D. Zhang, C. Zhang
• Latin Matchings and Ordered Designs OD(n-1, n, 2n-1)
  Mathematics (Dec 2022)
  K. Jin*, T. Zhu, Z. Gu, X. Sun
• A Generalization of Self-Improving Algorithms
  ACM Transactions on Algorithms (July 2022)
  K. Jin*, S. Cheng, M. Chiu, M.T. Wong
• Dynamic Task Allocation in Multi-Robot System Based on a Team Competition Model
  Frontiers in Neurorobotics (May 2021)
  K. Jin*, P. Tang, S. Chen, J. Peng
• On 1-factorizations of Bipartite Kneser Graphs
  Theoretical Computer Science (2020 June)
  K. Jin*
• Extensions of Self-Improving Sorters
  Algorithmica (2020)
  S. Cheng*, K. Jin, L. Yan
• Near-Linear Time Approximation Schemes for Geometric Maximum Coverage
  Theoretical Computer Science (May 2018)
  K.Jin, J. Li *, H. Wang, B. Zhang, N. Zhang
• Ascending Sequences with Neighboring Elements add up to Perfect Square Numbers
  Notes on Number Theory and Discrete Mathematics (2017)
  K Jin*

会议论文

• Sum-of-Max Chain Partition of a Tree
  31st International Computing and Combinatorics Conference (COCOON’25)
  R. Luo, T. Zhu, K. Jin*
• Discrete Effort Distribution via Regret-Enabled Greedy Algorithm
  31st International Computing and Combinatorics Conference (COCOON’25)
  S. Cao, T. Zhu, K. Jin*
• Simple k-crashing Plan with a Good Approximation Ratio
  23rd Conference in Autonomous Agents and Multiagent Systems (AAMAS’24)
  R. Luo, K.Jin*, Z. Ye
• Scheduling two types of jobs with minimum makespan
  International Joint Conference on Theoretical Computer Science – Frontier of Algorithmic Wisdom (IJTCS-FAW 2024)
  S. Cao, K. Jin*
• String Rearrangement Inequalities and a Total Order Between Primitive Words
  16th Conference on Frontiers of Algorithmic Wisdom (FAW’2022)
  R. Luo, T. Zhu, K. Jin*
• A Generalization of Self-Improving Algorithms
  36th Symposium on Computational Geometry (SoCG’2020)
  S. Cheng, M. Chiu, K. Jin*, M.T. Wong
• Cooperation via Codes in Restricted Hat Guessing Games
  18th Conference in Autonomous Agents and Multiagent Systems (AAMAS’19)
  K. Jin*, Zhaoquan Gu, Ce Jin
• On 1-factorizations of Bipartite Kneser Graphs
  25th International Computing and Combinatorics Conference (COCOON’19)
  K. Jin*
• Optimal Partitioning Which Maximizes the Weighted Sum of Products
  11th International Frontiers of Algorithmics Workshop (FAW’17)
  K. Jin*
• Fluctuated Fitting under the $\ell_1$-metric
  11th International Frontiers of Algorithmics Workshop (FAW’17)
  K. Jin*
• On the Power of Dominated Players in Team Competitions
  15th Conference in Autonomous Agents and Multiagent Systems (AAMAS’16)
  K. Jin*, P. Tang, S. Chen
• Computing the Pattern Waiting Time: A Revisit of the Intuitive Approach
  27th International Symposium on Algorithms and Computation (ISAAC’16)
  K. Jin*
• Finding the Maximum Area Parallelogram in a Convex Polygon
  23rd Canadian Conference on Computational Geometry (CCCG’11)
  K. Jin*, K. Matulef

在投文献

• A Geometric Structure Associated with the Convex Polygon
  Comment: A small world is created here. It is my representative work!
• A Technique for Solving the Polygon Inclusion Problems
  Comment: A general technique for solving many polygon inclusion problems

荣誉获奖情况

2002  Gold medal in the China National Olympiad in Informatics

2003  Gold medal in the China National Olympiad in Informatics

2005  Champion of the ACM/ICPC regional contest, Chengdu (as the team leader)  

2006 19th place in the ACM/ICPC world finals (as the team leader)

社会服务

曾经给下述期刊/会议担任审稿人。

• “Journal of Computational Geometry”,
• “Algorithmica”,
• “Information Process Letter”,
• “Discrete Applied Mathematics”,
• “European Symposium of Algorithms”,
• “International Symposium on Algorithms and Computation”,
• “International Conference on Computing and Combinatorics”,
• “International Journal of Foundations of Computer Science”.

其他经历

担任中国信息学奥林匹克竞赛国家集训队学生教练。 (2006-2017)
I design creative problems for many Olympic competitions in information, e.g.,

• Ingenious Latin, Fragments, Dead4gon (ACM-HK-regional 2018)
• Cipher (CTSC 2017)
• Daydayup (CTSC 2016)
• Transitivity (CCPC 2016)
• Parallelogram (CCPC 2016)
• Dice (SCOI 2009)
• Polya’s Pocket (NOI2006)
• Shooting Game (CTSC2006)
• Comb, etc. (HNTSC 2005)

联系方式

电子邮箱：jink8@mail.sysu.edu.cn