Shaohua Li
Orcid: 0000-0001-8079-6405Affiliations:
- CISPA Helmholtz Center for Information Security, Saarbrücken, Germany
- University of Warsaw, Institute of Informatics, Warsaw, Poland (former)
- Central South University, School of Information Science and Engineering, Changsha, China (former)
According to our database1,
Shaohua Li
authored at least 14 papers
between 2018 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Cluster Editing Parameterized above Modification-disjoint <i>P</i><sub>3</sub>-packings.
ACM Trans. Algorithms, January, 2024
2023
The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs.
Algorithmica, May, 2023
Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern.
CoRR, 2023
Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations.
CoRR, 2023
2022
2021
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021
2020
Theory Comput. Syst., 2020
The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020
2019
Cluster Editing parameterized above the size of a modification-disjoint P<sub>3</sub> packing is para-NP-hard.
CoRR, 2019
2018
Theor. Comput. Sci., 2018