Shaohua Li

According to our database, Shaohua Li authored at least 16 papers between 2017 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Metric Dimension and Geodetic Set Parameterized by Vertex Cover.

Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

2024

Cluster Editing Parameterized above Modification-disjoint <i>P</i>₃-packings.

Shaohua Li, Marcin Pilipczuk, Manuel Sorge

ACM Trans. Algorithms, January, 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, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Hitting Meets Packing: How Hard Can It Be?

Jacob Focke, Fabian Frei, Shaohua Li, Dániel Marx, Philipp Schepper, Roohani Sharma, Karol Wegrzycki

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern.

Jacob Focke, Florian Hörsch, Shaohua Li, Dániel Marx

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs.

Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge

Algorithmica, May, 2023

Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations.

Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale

CoRR, 2023

2021

Cluster Editing Parameterized Above Modification-Disjoint P₃-Packings.

Shaohua Li, Marcin Pilipczuk, Manuel Sorge

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Hardness of Metric Dimension in Graphs of Constant Treewidth.

Shaohua Li, Marcin Pilipczuk

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

2020

The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs.

Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Many Visits TSP Revisited.

Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Cluster Editing parameterized above the size of a modification-disjoint P₃ packing is para-NP-hard.

Shaohua Li, Marcin Pilipczuk, Manuel Sorge

CoRR, 2019

2018

Parameterized algorithms for Edge Biclique and related problems.

Qilong Feng, Shaohua Li, Zeyang Zhou, Jianxin Wang

Theor. Comput. Sci., 2018

An Improved FPT Algorithm for Independent Feedback Vertex Set.

Shaohua Li, Marcin Pilipczuk

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

Multi-Budgeted Directed Cuts.

Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström

Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

2017

An Improved FPT Algorithm for the Flip Distance Problem.

Shaohua Li, Qilong Feng, Xiangzhong Meng, Jianxin Wang

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017