Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShaohua Li 0005
Person information
- affiliation: CISPA Helmholtz Center for Information Security, Saarbrücken, Germany
- affiliation (former): University of Warsaw, Institute of Informatics, Warsaw, Poland
- affiliation (former): Central South University, School of Information Science and Engineering, Changsha, China
- not to be confused with: Shaohua Li 0006
Other persons with the same name
- Shaohua Li — disambiguation page
- Shaohua Li 0001 — Nokia Siemens Networks, Beijing, China (and 1 more)
- Shaohua Li 0002
![[0000-0001-7556-3615]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-7556-3615")
— ETH Zurich, Switzerland (and 1 more) - Shaohua Li 0003 — Agency for Science, Technology and Research (A*STAR), Singapore
- Shaohua Li 0004 — Shanghai University, Shanghai, China
- Shaohua Li 0006 — Central South University, School of Information Science and Engineering, Changsha, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Shaohua Li, Marcin Pilipczuk, Manuel Sorge:
Cluster Editing Parameterized above Modification-disjoint P3-packings. ACM Trans. Algorithms 20(1): 3:1-3:43 (2024)- [i10]Jacob Focke, Fabian Frei, Shaohua Li, Dániel Marx, Philipp Schepper, Roohani Sharma, Karol Wegrzycki:
Hitting Meets Packing: How Hard Can it Be? CoRR abs/2402.14927 (2024) - 2023
- [j7]Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge:
The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs. Algorithmica 85(5): 1202-1250 (2023) - [i9]Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale:
Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations. CoRR abs/2307.08149 (2023) - [i8]Jacob Focke, Florian Hörsch, Shaohua Li, Dániel Marx:
Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern. CoRR abs/2312.11086 (2023) - 2022
- [j6]Shaohua Li, Marcin Pilipczuk:
Hardness of Metric Dimension in Graphs of Constant Treewidth. Algorithmica 84(11): 3110-3155 (2022) - [j5]Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström:
Many-visits TSP revisited. J. Comput. Syst. Sci. 124: 112-128 (2022) - 2021
- [j4]Qilong Feng, Shaohua Li, Xiangzhong Meng, Jianxin Wang:
An improved FPT algorithm for the flip distance problem. Inf. Comput. 281: 104708 (2021) - [c7]Shaohua Li, Marcin Pilipczuk:
Hardness of Metric Dimension in Graphs of Constant Treewidth. IPEC 2021: 24:1-24:13 - [c6]Shaohua Li, Marcin Pilipczuk, Manuel Sorge:
Cluster Editing Parameterized Above Modification-Disjoint P₃-Packings. STACS 2021: 49:1-49:16 - [i7]Shaohua Li, Marcin Pilipczuk:
Hardness of Metric Dimension in Graphs of Constant Treewidth. CoRR abs/2102.09791 (2021) - 2020
- [j3]Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström:
Multi-budgeted Directed Cuts. Algorithmica 82(8): 2135-2155 (2020) - [j2]Shaohua Li, Marcin Pilipczuk:
An Improved FPT Algorithm for Independent Feedback Vertex Set. Theory Comput. Syst. 64(8): 1317-1330 (2020) - [c5]Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström:
Many Visits TSP Revisited. ESA 2020: 66:1-66:22 - [c4]Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge:
The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs. ISAAC 2020: 59:1-59:15 - [i6]Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström:
Many visits TSP revisited. CoRR abs/2005.02329 (2020) - [i5]Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge:
The Complexity of Connectivity Problems in Forbidden-Transition Graphs and Edge-Colored Graphs. CoRR abs/2009.12892 (2020)
2010 – 2019
- 2019
- [i4]Qilong Feng, Shaohua Li, Xiangzhong Meng, Jianxin Wang:
An Improved FPT Algorithm for the Flip Distance Problem. CoRR abs/1910.06185 (2019) - [i3]Shaohua Li, Marcin Pilipczuk, Manuel Sorge:
Cluster Editing parameterized above the size of a modification-disjoint P3 packing is para-NP-hard. CoRR abs/1910.08517 (2019) - 2018
- [j1]Qilong Feng, Shaohua Li, Zeyang Zhou, Jianxin Wang:
Parameterized algorithms for Edge Biclique and related problems. Theor. Comput. Sci. 734: 105-118 (2018) - [c3]Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström:
Multi-Budgeted Directed Cuts. IPEC 2018: 18:1-18:14 - [c2]Shaohua Li, Marcin Pilipczuk:
An Improved FPT Algorithm for Independent Feedback Vertex Set. WG 2018: 344-355 - [i2]Shaohua Li, Marcin Pilipczuk:
An improved FPT algorithm for Independent Feedback Vertex Set. CoRR abs/1803.00937 (2018) - [i1]Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström:
Multi-budgeted directed cuts. CoRR abs/1810.06848 (2018) - 2017
- [c1]Shaohua Li, Qilong Feng, Xiangzhong Meng, Jianxin Wang:
An Improved FPT Algorithm for the Flip Distance Problem. MFCS 2017: 65:1-65:13
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 23:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
