default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShenwei Huang
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j38]Shenwei Huang, Yiao Ju, T. Karthick:
Coloring (P5, kite)-free graphs with small cliques. Discret. Appl. Math. 344: 129-139 (2024)- [j37]Shenwei Huang, Hui Lei
, Yongtang Shi, Junxue Zhang:
The saturation number of K3,3. Discret. Math. 347(3): 113794 (2024) - [j36]Shenwei Huang:
The optimal χ-bound for (P7,C4,C5)-free graphs. Discret. Math. 347(7): 114036 (2024) - [j35]Qingqiong Cai, Xingyue Guo, Shenwei Huang:
A self-supervised learning model for graph clustering optimization problems. Knowl. Based Syst. 290: 111549 (2024) - [j34]Yiao Ju, Shenwei Huang:
Near optimal colourability on hereditary graph families. Theor. Comput. Sci. 993: 114465 (2024) - 2023
- [j33]Shenwei Huang, Jiawei Li, Wen Xia:
Critical (P5, bull)-free graphs. Discret. Appl. Math. 334: 15-25 (2023) - [j32]Qingqiong Cai, Jan Goedgebeur, Shenwei Huang:
Some results on k-critical P5-free graphs. Discret. Appl. Math. 334: 91-100 (2023) - [j31]Shenwei Huang, Zeyu Li:
Vertex-critical (P5,chair)-free graphs. Discret. Appl. Math. 341: 9-15 (2023) - [j30]Tao Feng, Shenwei Huang:
A Note on the Rank of Inclusion Matrices. Graphs Comb. 39(2): 35 (2023) - [j29]Maria Chudnovsky, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl, Mingxian Zhong:
Complexity of Ck-coloring in hereditary classes of graphs. Inf. Comput. 292: 105015 (2023) - [j28]Jan Goedgebeur, Shenwei Huang, Yiao Ju, Owen D. Merkel:
Colouring graphs with no induced six-vertex path or diamond. Theor. Comput. Sci. 941: 278-299 (2023) - [c14]Wen Xia, Jorik Jooken, Jan Goedgebeur, Shenwei Huang:
Critical (P5,dart)-Free Graphs. COCOA (2) 2023: 390-402 - 2022
- [j27]Chuanze Kang, Han Zhang, Zhuo Liu, Shenwei Huang, Yanbin Yin:
LR-GNN: a graph neural network based on link representation for predicting molecular associations. Briefings Bioinform. 23(1) (2022) - [j26]Xiao Wang, Jia Wang, Han Zhang, Shenwei Huang, Yanbin Yin:
HDMC: a novel deep learning-based framework for removing batch effects in single-cell RNA-seq data. Bioinform. 38(5): 1295-1303 (2022) - [j25]Shenwei Huang, Lei Wang:
An Exploration Study on the Consequence of the COVID-19 Pandemic on Online Q&A Communities. J. Glob. Inf. Manag. 30(1): 1-22 (2022) - 2021
- [j24]Maria Chudnovsky, Shenwei Huang, Sophie Spirkl, Mingxian Zhong:
List 3-Coloring Graphs with No Induced P6+rP3. Algorithmica 83(1): 216-251 (2021) - [j23]Maria Chudnovsky, Shenwei Huang, T. Karthick, Jenny Kaufmann:
Square-Free Graphs with no Induced Fork. Electron. J. Comb. 28(2): 2 (2021) - [j22]Shenwei Huang, T. Karthick:
On graphs with no induced five-vertex path or paraglider. J. Graph Theory 97(2): 305-323 (2021) - [j21]Kathie Cameron, Shenwei Huang, Owen D. Merkel:
An optimal χ -bound for ( P 6 , diamond)-free graphs. J. Graph Theory 97(3): 451-465 (2021) - [j20]Xueshuo Xie, Zhi Wang, Xuhang Xiao, Ye Lu, Shenwei Huang, Tao Li:
A Confidence-Guided Evaluation for Log Parsers Inner Quality. Mob. Networks Appl. 26(4): 1638-1649 (2021) - [j19]Kathie Cameron, Jan Goedgebeur, Shenwei Huang, Yongtang Shi:
k-Critical graphs in P5-free graphs. Theor. Comput. Sci. 864: 80-91 (2021) - [c13]Jan Goedgebeur, Shenwei Huang, Yiao Ju, Owen D. Merkel:
Colouring Graphs with No Induced Six-Vertex Path or Diamond. COCOON 2021: 319-329 - [i18]Jan Goedgebeur, Shenwei Huang, Yiao Ju, Owen D. Merkel:
Colouring graphs with no induced six-vertex path or diamond. CoRR abs/2106.08602 (2021) - [i17]Qingqiong Cai, Jan Goedgebeur, Shenwei Huang:
Some Results on k-Critical P5-Free Graphs. CoRR abs/2108.05492 (2021) - 2020
- [j18]Kathie Cameron, Shenwei Huang, Irena Penev, Vaidy Sivaraman:
The class of ( P 7 , C 4 , C 5 ) -free graphs: Decomposition, algorithms, and χ -boundedness. J. Graph Theory 93(4): 503-552 (2020) - [c12]Kathie Cameron, Jan Goedgebeur, Shenwei Huang, Yongtang Shi:
k-Critical Graphs in P5-Free Graphs. COCOON 2020: 411-422 - [i16]Maria Chudnovsky, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl, Mingxian Zhong:
Complexity of Ck-coloring in hereditary classes of graphs. CoRR abs/2005.01824 (2020)
2010 – 2019
- 2019
- [j17]Shujuan Cao, Shenwei Huang:
Graphs without five-vertex path and four-vertex cycle. Appl. Math. Comput. 363 (2019) - [j16]Shenwei Huang, Tao Li, Yongtang Shi:
Critical (P6, banner)-free graphs. Discret. Appl. Math. 258: 143-151 (2019) - [j15]Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding clique-width via perfect graphs. J. Comput. Syst. Sci. 104: 202-215 (2019) - [j14]Serge Gaspers, Shenwei Huang, Daniël Paulusma:
Colouring square-free graphs without long induced paths. J. Comput. Syst. Sci. 106: 60-79 (2019) - [j13]Serge Gaspers, Shenwei Huang:
Linearly χ-bounding (P6, C4)-free graphs. J. Graph Theory 92(3): 322-342 (2019) - [j12]Serge Gaspers, Shenwei Huang:
(2P2, K4)-Free Graphs are 4-Colorable. SIAM J. Discret. Math. 33(2): 1095-1120 (2019) - [c11]Xueshuo Xie, Zongming Jin, Qingqi Han, Shenwei Huang, Tao Li:
A Confidence-Guided Anomaly Detection Approach Jointly Using Multiple Machine Learning Algorithms. CSS (2) 2019: 93-100 - [c10]Maria Chudnovsky, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl, Mingxian Zhong:
Complexity of Ck-Coloring in Hereditary Classes of Graphs. ESA 2019: 31:1-31:15 - [c9]Qingqiong Cai, Shenwei Huang, Tao Li, Yongtang Shi:
Vertex-Critical ( P_5 P 5 , banner)-Free Graphs. FAW 2019: 111-120 - [i15]Shenwei Huang, T. Karthick:
On graphs with no induced five-vertex path or paraglider. CoRR abs/1903.11268 (2019) - [i14]Xueshuo Xie, Zhi Wang, Xuhang Xiao, Lei Yang, Shenwei Huang, Tao Li:
A Pvalue-guided Anomaly Detection Approach Combining Multiple Heterogeneous Log Parser Algorithms on IIoT Systems. CoRR abs/1907.02765 (2019) - 2018
- [j11]Kathie Cameron, Murilo V. G. da Silva, Shenwei Huang, Kristina Vuskovic:
Structure and algorithms for (cap, even hole)-free graphs. Discret. Math. 341(2): 463-473 (2018) - [c8]Haris Aziz, Edith Elkind, Shenwei Huang, Martin Lackner, Luis Sánchez Fernández, Piotr Skowron:
On the Complexity of Extended and Proportional Justified Representation. AAAI 2018: 902-909 - [c7]Serge Gaspers, Shenwei Huang, Daniël Paulusma:
Colouring Square-Free Graphs without Long Induced Paths. STACS 2018: 35:1-35:15 - [i13]Serge Gaspers, Shenwei Huang, Daniël Paulusma:
Colouring Square-Free Graphs without Long Induced Paths. CoRR abs/1805.08270 (2018) - [i12]Kathie Cameron, Shenwei Huang, Owen D. Merkel:
An Optimal χ-Bound for (P6, diamond)-Free Graphs. CoRR abs/1809.00739 (2018) - 2017
- [j10]Pavol Hell, Shenwei Huang:
Complexity of coloring graphs without paths and cycles. Discret. Appl. Math. 216: 211-232 (2017) - [j9]Andreas Brandstädt, Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding the Clique-Width of H-Free Chordal Graphs. J. Graph Theory 86(1): 42-77 (2017) - [c6]Serge Gaspers, Shenwei Huang:
Linearly \chi χ -Bounding (P_6, C_4) ( P 6 , C 4 ) -Free Graphs. WG 2017: 263-274 - [i11]Haris Aziz, Shenwei Huang:
A Polynomial-time Algorithm to Achieve Extended Justified Representation. CoRR abs/1703.10415 (2017) - [i10]Serge Gaspers, Shenwei Huang:
Linearly $χ$-Bounding $(P_6, C_4)$-Free Graphs. CoRR abs/1709.09750 (2017) - 2016
- [j8]Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding the clique-width of H-free split graphs. Discret. Appl. Math. 211: 30-39 (2016) - [j7]Shenwei Huang:
Improved complexity results on k-coloring Pt-free graphs. Eur. J. Comb. 51: 336-346 (2016) - [i9]Kathie Cameron, Murilo Vicente Gonçalves da Silva, Shenwei Huang, Kristina Vuskovic:
Structure and algorithms for (cap, even hole)-free graphs. CoRR abs/1611.08066 (2016) - [i8]Haris Aziz, Shenwei Huang:
Computational Complexity of Testing Proportional Justified Representation. CoRR abs/1612.06476 (2016) - 2015
- [j6]Lei Wang, Jiehui Zheng, Shenwei Huang, Haoye Sun:
P300 and Decision Making under Risk and Ambiguity. Comput. Intell. Neurosci. 2015: 108417:1-108417:7 (2015) - [j5]Shenwei Huang, Matthew Johnson, Daniël Paulusma:
Narrowing the Complexity Gap for Colouring (Cs, Pt)-Free Graphs. Comput. J. 58(11): 3074-3088 (2015) - [j4]Andreas Brandstädt, Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding the Clique-Width of H-free Split Graphs. Electron. Notes Discret. Math. 49: 497-503 (2015) - [c5]Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding Clique-Width via Perfect Graphs. LATA 2015: 676-688 - [c4]Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding the Clique-Width of H-free Chordal Graphs. MFCS (2) 2015: 139-150 - [i7]Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding the Clique-Width of H-free Chordal Graphs. CoRR abs/1502.06948 (2015) - [i6]Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding the Clique-Width of $H$-free Split Graphs. CoRR abs/1509.04273 (2015) - [i5]Shenwei Huang, Murilo V. G. da Silva:
A note on coloring (even-hole, cap)-free graphs. CoRR abs/1510.09192 (2015) - 2014
- [c3]Shenwei Huang, Matthew Johnson, Daniël Paulusma:
Narrowing the Complexity Gap for Colouring (C s , P t )-Free Graphs. AAIM 2014: 162-173 - [c2]Pavol Hell, Shenwei Huang:
Complexity of Coloring Graphs without Paths and Cycles. LATIN 2014: 538-549 - [i4]Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding Clique-Width via Perfect Graphs. CoRR abs/1406.6298 (2014) - [i3]Shenwei Huang, Matthew Johnson, Daniël Paulusma:
Narrowing the Complexity Gap for Colouring ($C_s$, $P_t$)-Free Graphs. CoRR abs/1407.1480 (2014) - 2013
- [j3]Shenwei Huang, Liying Kang, Erfang Shan:
Paired-Domination in Claw-Free Graphs. Graphs Comb. 29(6): 1777-1794 (2013) - [c1]Shenwei Huang:
Improved Complexity Results on k-Coloring P t -Free Graphs. MFCS 2013: 551-558 - [i2]Shenwei Huang:
Improved Complexity Results on $k$-Coloring $P_t$-Free Graphs. CoRR abs/1304.5808 (2013) - [i1]Pavol Hell, Shenwei Huang:
Complexity of Coloring Graphs without Paths and Cycles. CoRR abs/1310.0340 (2013) - 2012
- [j2]Shenwei Huang, Erfang Shan, Liying Kang:
Perfect matchings in paired domination vertex critical graphs. J. Comb. Optim. 23(4): 507-518 (2012) - 2011
- [j1]Shenwei Huang, Erfang Shan:
A note on the upper bound for the paired-domination number of a graph with minimum degree at least two. Networks 57(2): 115-116 (2011)
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-28 21:35 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:
