Parameterized algorithms for Edge Biclique and related problems. - Qilong Feng; Shaohua Li 005; Zeyang Zhou; Jianxin Wang 001 (Theor. Comput. Sci., 2018)

Cluster Editing parameterized above the size of a modification-disjoint P3 packing is para-NP-hard. - Shaohua Li 005; Marcin Pilipczuk; Manuel Sorge (CoRR, 2019)

The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs. - Thomas Bellitto; Shaohua Li 005; Karolina Okrasa; Marcin Pilipczuk; Manuel Sorge (ISAAC, 2020)

Multi-budgeted Directed Cuts. - Stefan Kratsch; Shaohua Li 005; Dániel Marx; Marcin Pilipczuk; Magnus Wahlström (Algorithmica, 2020)

An Improved FPT Algorithm for Independent Feedback Vertex Set. - Shaohua Li 005; Marcin Pilipczuk (Theory Comput. Syst., 2020)

Cluster Editing Parameterized Above Modification-Disjoint P₃-Packings. - Shaohua Li 005; Marcin Pilipczuk; Manuel Sorge (STACS, 2021)

An improved FPT algorithm for the flip distance problem. - Qilong Feng; Shaohua Li 005; Xiangzhong Meng; Jianxin Wang 001 (Inf. Comput., 2021)

Hardness of Metric Dimension in Graphs of Constant Treewidth. - Shaohua Li 005; Marcin Pilipczuk (Algorithmica, 2022)

Many-visits TSP revisited. - Lukasz Kowalik; Shaohua Li 005; Wojciech Nadara; Marcin Smulewicz; Magnus Wahlström (J. Comput. Syst. Sci., 2022)

Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations. - Florent Foucaud; Esther Galby; Liana Khazaliya; Shaohua Li 005; Fionn Mc Inerney; Roohani Sharma; Prafullkumar Tale (CoRR, 2023)

The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs. - Thomas Bellitto; Shaohua Li 005; Karolina Okrasa; Marcin Pilipczuk; Manuel Sorge (Algorithmica, 2023)

Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern. - Jacob Focke; Florian Hörsch; Shaohua Li 005; Dániel Marx (SoCG, 2024)

Hitting Meets Packing: How Hard Can It Be? - Jacob Focke; Fabian Frei; Shaohua Li 005; Dániel Marx; Philipp Schepper; Roohani Sharma; Karol Wegrzycki (ESA, 2024)

Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover. - Florent Foucaud; Esther Galby; Liana Khazaliya; Shaohua Li 005; Fionn Mc Inerney; Roohani Sharma; Prafullkumar Tale (ICALP, 2024)

Cluster Editing Parameterized above Modification-disjoint P3-packings. - Shaohua Li 005; Marcin Pilipczuk; Manuel Sorge (ACM Trans. Algorithms, 2024)

Metric Dimension and Geodetic Set Parameterized by Vertex Cover. - Florent Foucaud; Esther Galby; Liana Khazaliya; Shaohua Li 005; Fionn Mc Inerney; Roohani Sharma; Prafullkumar Tale (STACS, 2025)