default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHuimin Song
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j12]Fan Yang
, Jian-Liang Wu, Huimin Song:
The linear arboricity of K5-minor free graphs. Discret. Appl. Math. 322: 49-60 (2022)- [c4]Haonan Ji, Huimin Song, Shibo Lu, Zhou Jin, Guangming Tan, Weifeng Liu:
TileSpMSpV: A Tiled Algorithm for Sparse Matrix-Sparse Vector Multiplication on GPUs. ICPP 2022: 9:1-9:11 - 2020
- [j11]Ye Chen, Suohai Fan, Hong-Jian Lai, Huimin Song, Murong Xu:
Decomposition and r-hued Coloring of K4(7)-minor free graphs. Appl. Math. Comput. 384: 125206 (2020)
2010 – 2019
- 2019
- [j10]Enmin Song, Yuejing Qian, Hong Liu, Meng Yan, Huimin Song, Chih-Cheng Hung:
A target-oriented segmentation method for specific tissues in MRI images of the brain. Multim. Tools Appl. 78(7): 9083-9099 (2019) - 2018
- [j9]Huimin Song, Hong-Jian Lai:
Upper bounds of r-hued colorings of planar graphs. Discret. Appl. Math. 243: 262-269 (2018) - [j8]Huimin Song, Hong-Jian Lai, Jianliang Wu:
List r-hued chromatic number of graphs with bounded maximum average degrees. Discret. Math. 341(5): 1244-1252 (2018) - [j7]Huimin Song, Lianying Miao, Zhengke Miao, Hong-Jian Lai:
Sensitivity of r-hued colouring of graphs. Int. J. Comput. Math. Comput. Syst. Theory 3(4): 262-273 (2018) - [j6]Enmin Song, Ning Cheng, Hong Liu, Huimin Song:
Approach to weak signal detection via over-sampling and bidirectional saw-tooth shaped function in wearable devices. Multim. Tools Appl. 77(17): 21923-21933 (2018) - 2016
- [j5]Gang Liu, Runnan Zhang, Huimin Song, Can Wang, Jinhui Liu, Aijun Liu:
Ts-RBAC: A RBAC model with transformation. Comput. Secur. 60: 52-61 (2016) - [j4]Huimin Song, Hong-Jian Lai, Jian-Liang Wu:
On r-hued coloring of planar graphs with girth at least 6. Discret. Appl. Math. 198: 251-263 (2016) - [c3]Chunlong Fan, Yan Song, Huimin Song, Guohui Ding:
An Improved Community Detection Method in Bipartite Networks. WAIM Workshops 2016: 259-268 - [c2]Guohui Ding, Huimin Song, Chunlong Fan, Yan Song:
Community Detection Algorithm of the Large-Scale Complex Networks Based on Random Walk. WAIM Workshops 2016: 269-282 - 2014
- [j3]Huimin Song, Suohai Fan, Ye Chen, Lei Sun, Hong-Jian Lai:
On r-hued coloring of K4-minor free graphs. Discret. Math. 315-316: 47-52 (2014) - 2013
- [j2]Linyu Xu, Zhaoxue Li, Huimin Song, Hao Yin:
Land-Use Planning for Urban Sprawl Based on the CLUE-S Model: A Case Study of Guangzhou, China. Entropy 15(9): 3490-3506 (2013) - 2012
- [j1]Ye Chen, Suohai Fan, Hong-Jian Lai, Huimin Song, Lei Sun:
On dynamic coloring for planar graphs and graphs of higher genus. Discret. Appl. Math. 160(7-8): 1064-1071 (2012)
2000 – 2009
- 2007
- [c1]Huimin Song, Jianliang Wu, Guizhen Liu:
The Equitable Edge-Coloring of Series-Parallel Graphs. International Conference on Computational Science (3) 2007: 457-460
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-08-05 21:21 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:
