![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 72 matches
- 2024
- Shenwei Huang, Yiao Ju, T. Karthick:
Coloring (P5, kite)-free graphs with small cliques. Discret. Appl. Math. 344: 129-139 (2024) - Shenwei Huang:
The optimal χ-bound for (P7,C4,C5)-free graphs. Discret. Math. 347(7): 114036 (2024) - Shenwei Huang, Hui Lei
, Yongtang Shi, Junxue Zhang:
The saturation number of K3,3. Discret. Math. 347(3): 113794 (2024) - Qingqiong Cai, Xingyue Guo, Shenwei Huang:
A self-supervised learning model for graph clustering optimization problems. Knowl. Based Syst. 290: 111549 (2024) - Yiao Ju, Shenwei Huang:
Near optimal colourability on hereditary graph families. Theor. Comput. Sci. 993: 114465 (2024) - 2023
- Qingqiong Cai, Jan Goedgebeur
, Shenwei Huang:
Some results on k-critical P5-free graphs. Discret. Appl. Math. 334: 91-100 (2023) - Shenwei Huang, Zeyu Li:
Vertex-critical (P5,chair)-free graphs. Discret. Appl. Math. 341: 9-15 (2023) - Shenwei Huang, Jiawei Li, Wen Xia:
Critical (P5, bull)-free graphs. Discret. Appl. Math. 334: 15-25 (2023) - Hong-Jie Li, Xing-Gang Luo
, Zhong-Liang Zhang, Wei Jiang, Shen-Wei Huang
:
Driving risk prevention in usage-based insurance services based on interpretable machine learning and telematics data. Decis. Support Syst. 172: 113985 (2023) - Tao Feng
, Shenwei Huang:
A Note on the Rank of Inclusion Matrices. Graphs Comb. 39(2): 35 (2023) - Maria Chudnovsky
, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl
, Mingxian Zhong:
Complexity of Ck-coloring in hereditary classes of graphs. Inf. Comput. 292: 105015 (2023) - 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) - Wen Xia, Jorik Jooken
, Jan Goedgebeur, Shenwei Huang:
Critical (P5,dart)-Free Graphs. COCOA (2) 2023: 390-402 - 2022
- 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) - 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) - 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
- Maria Chudnovsky
, Shenwei Huang, Sophie Spirkl
, Mingxian Zhong
:
List 3-Coloring Graphs with No Induced P6+rP3. Algorithmica 83(1): 216-251 (2021) - Maria Chudnovsky
, Shenwei Huang, T. Karthick, Jenny Kaufmann:
Square-Free Graphs with no Induced Fork. Electron. J. Comb. 28(2): 2 (2021) - Kathie Cameron
, Shenwei Huang
, Owen D. Merkel:
An optimal χ -bound for ( P 6 , diamond)-free graphs. J. Graph Theory 97(3): 451-465 (2021) - Shenwei Huang, T. Karthick
:
On graphs with no induced five-vertex path or paraglider. J. Graph Theory 97(2): 305-323 (2021) - 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) - Kathie Cameron, Jan Goedgebeur
, Shenwei Huang, Yongtang Shi:
k-Critical graphs in P5-free graphs. Theor. Comput. Sci. 864: 80-91 (2021) - Jan Goedgebeur
, Shenwei Huang, Yiao Ju, Owen D. Merkel:
Colouring Graphs with No Induced Six-Vertex Path or Diamond. COCOON 2021: 319-329 - Shenwei Yin, Muhammadeziz Tursunniyaz, Jingyi Huang
, Joseph Andrews:
Dual-Printed Soil Sensors for Nitrate and Moisture Monitoring. IEEE SENSORS 2021: 1-4 - Jan Goedgebeur, Shenwei Huang, Yiao Ju, Owen D. Merkel:
Colouring graphs with no induced six-vertex path or diamond. CoRR abs/2106.08602 (2021) - Qingqiong Cai, Jan Goedgebeur, Shenwei Huang:
Some Results on k-Critical P5-Free Graphs. CoRR abs/2108.05492 (2021) - 2020
- 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) - Kathie Cameron, Jan Goedgebeur
, Shenwei Huang, Yongtang Shi:
k-Critical Graphs in P5-Free Graphs. COCOON 2020: 411-422 - Maria Chudnovsky, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl, Mingxian Zhong:
Complexity of Ck-coloring in hereditary classes of graphs. CoRR abs/2005.01824 (2020) - 2019
- Shujuan Cao, Shenwei Huang:
Graphs without five-vertex path and four-vertex cycle. Appl. Math. Comput. 363 (2019)
skipping 42 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-06-22 02:24 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint