百晓学者学者目录

陈琳

助理教授、讲师，深圳大学

精选作品

期刊论文

2024

FPT algorithms for a special block-structured integer program with applications in scheduling

Hua Chen, Lin Chen, Guochuan Zhang

Mathematical Programming

DOI

2022

道路容量不确定情形下可靠应急疏散路径规划问题

代文强，陈琳，章潇月

《系统工程理论与实践》，Vol. 42, No. 9

下载原文

2020

A general framework for handling commitment in online throughput maximization

Lin Chen, Franziska Eberle, Nicole Megow, Kevin Schewior, Cliff Stein

Mathematical Programming

DOI

2019

图的区间边着色的收缩图方法

陶艳亮，黄琼湘，陈琳

《运筹学学报(中英文)》

DOI

2018

$H_{\infty}$ consensus control of fractional-order multi-agent systems over the directed graph

Lin Chen, Wen-Sen Wang, Hao Wu, Yan Lei, Jiang-Wen Xiao

Cybersecurity and Cyberforensics Conference

DOI

2018

Robust consensus of fractional-order multi-agent systems with input saturation and external disturbances

Lin Chen, Yan-Wu Wang, Wu Yang, Jiang-Wen Xiao

Neurocomputing

DOI

2017

囚徒困境中基于非均匀连接的促合作控制设计

董瑞，王先甲，陈琳

《系统工程理论与实践》，Vol. 37, No. 10

下载原文

2014

四圈图的拉普拉斯谱宽度

陈琳，黄琼湘

《数学学报(中文版)》

2012

四圈图的Spread

陈琳

《数学学报(中文版)》

2011

给定顶点数和边数的连通图的Q-谱半径的界(英文)

陈琳，黄琼湘

《运筹学学报(中英文)》

预印本

2026

Generating cyclic pivot Gray codes for well-ordered $k$-degenerate graphs in constant amortized time

Lei Dong, Dennis Wong, Bowie Liu, Rui Bao, Lin Chen, Chan-Tong Lam, Sio-Kei Im

arXiv preprint

2026

Subset Sum and Integer Programming Feasibility Test in Near-Optimal Time

Lin Chen, Yuchen Mao, Guochuan Zhang

arXiv preprint

2026

Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems

Lin Chen, Tingwei Hu, Yuchen Mao, Yong Chen, Lili Mei, An Zhang, Guangting Chen, Guochuan Zhang

arXiv preprint

2026

Dense Subset Sum in Multi-Dimension

Lin Chen, Tingwei Hu, Yuchen Mao, Guochuan Zhang

arXiv preprint

2026

Generating 2-Gray codes for grand Motzkin paths and grand Dyck paths with air pockets in constant amortized time

Lei Dong, Bowie Liu, Dennis Wong, Lin Chen, Chan-Tong Lam, Sio-Kei Im

arXiv preprint

2025

Weakly Approximating Knapsack in Subquadratic Time

Lin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang

arXiv preprint

2025

Approximation algorithms for integer programming with resource augmentation

Hauke Brinkop, Hua Chen, Lin Chen, Klaus Jansen, Guochuan Zhang

arXiv preprint

2024

Approximating Partition in Near-Linear Time

Lin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang

arXiv preprint

2022

Improved Approximation Schemes for (Un-)Bounded Subset-Sum and Partition

Xiaoyu Wu, Lin Chen

arXiv preprint

2020

Sequential Resource Access: Theory and Algorithm

Lin Chen, Anastasios Giovanidis, Wei Wang, Lin Shan

arXiv preprint

2020

Block-structured Integer Programming: Can we Parameterize without the Largest Coefficient?

Lin Chen, Hua Chen, Guochuan Zhang

arXiv preprint

2019

Covering a tree with rooted subtrees

Lin Chen, Daniel Marx

arXiv preprint

2018

Anti-$k$-labeling of graphs

Xiaxia Guan, Shurong Zhang, Rong-hua Li, Lin Chen, Weihua Yang

arXiv preprint

2017

Scheduling Maintenance Jobs in Networks

Fidaa Abed, Lin Chen, Yann Disser, Martin Groß, Nicole Megow, Julie Meißner, Alexander T. Richter, Roman Rischke

arXiv preprint

2017

On the maximum and minimum multiplicative Zagreb indices of graphs with given number of cut edges

Shaohui Wang, Chunxiang Wang, Lin Chen

arXiv preprint

2016

The $k$-proper index of graphs

Lin Chen, Xueliang Li, Jinfeng Liu

arXiv preprint

2016

On extremal multiplicative Zagreb indices of trees with given number of vertices of maximum degree

Shaohui Wang, Chunxiang Wang, Lin Chen, Jia-Bao Liu

arXiv preprint

2016

The existence of the graphs that have exactly two main eigenvalues

Lin Chen, Qiongxiang Huang

arXiv preprint

2016

On various (strong) rainbow connection numbers of graphs

Lin Chen, Xueliang Li, Henry Liu, Jinfeng Liu

arXiv preprint

2014

Matching Energy of Unicyclic and Bicyclic Graphs with a Given Diameter

Lin Chen, Jinfeng Liu, Yongtang Shi

arXiv preprint

2014

The Maximal Matching Energy of Tricyclic Graphs

Lin Chen, Yongtang Shi

arXiv preprint

研究方向

图论与组合优化

此主页由公开资料整理，尚未经学者本人认领。