default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJianfeng Hou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j64]Guofen Zhang, Ping Li, Jianfeng Hou, Bo Bai:
The zero-error capacity of binary channels with 2-memories. Adv. Math. Commun. 18(1): 179-191 (2024)- [j63]Yixiao Zhang
, Jianfeng Hou, Heng Li:
A 2-Stable Family of Triple Systems. Electron. J. Comb. 31(2) (2024) - [j62]Jianfeng Hou, Heng Li, Qinghou Zeng:
Extremal Graphs for the Suspension of Edge-Critical Graphs. Electron. J. Comb. 31(4) (2024) - [j61]Jianfeng Hou, Caihong Yang, Qinghou Zeng:
Counting triangles in graphs without vertex disjoint odd cycles. Discret. Math. 347(7): 114015 (2024) - [j60]Jinghua Deng, Jianfeng Hou, Qinghou Zeng:
The Turán number of three disjoint paths. Discuss. Math. Graph Theory 44(4): 1513-1537 (2024) - [j59]Yinxu Tang, Jianfeng Hou, Xi Huang, Ziyu Shao, Yang Yang:
Green Edge Intelligence Scheme for Mobile Keyboard Emoji Prediction. IEEE Trans. Mob. Comput. 23(2): 1888-1901 (2024) - [i4]Jianfeng Hou, Xizhi Liu, Hongbin Zhao:
Faster coloring and embedding in dense hypergraphs via stability. CoRR abs/2401.17219 (2024) - 2023
- [j58]Shufei Wu, Jianfeng Hou:
Graph partitioning: an updated survey. AKCE Int. J. Graphs Comb. 20(1): 9-19 (2023) - [j57]Jianfeng Hou, Hongguo Zhu:
On (2,r)-choosability of planar graphs without short cycles. Appl. Math. Comput. 444: 127830 (2023) - [j56]Jianfeng Hou, Yindong Jin, Heng Li, Lianying Miao, Qian Zhao:
On L(p,q)-labelling of planar graphs without cycles of length four. Appl. Math. Comput. 446: 127884 (2023) - [j55]Gaoxing Sun, Jianfeng Hou, Qinghou Zeng:
Large induced subgraphs with three repeated degrees. Discret. Math. 346(5): 113344 (2023) - [j54]Jianfeng Hou, Yindong Jin, Lianying Miao, Qian Zhao:
Coloring Squares of Planar Graphs with Maximum Degree at Most Five. Graphs Comb. 39(2): 20 (2023) - [j53]Tianhao Wu, Ji Cheng, Chaorui Zhang, Jianfeng Hou, Gengjian Chen, Zhongyi Huang, Weixi Zhang, Wei Han, Bo Bai:
ClipSim: A GPU-friendly Parallel Framework for Single-Source SimRank with Accuracy Guarantee. Proc. ACM Manag. Data 1(1): 27:1-27:26 (2023) - 2022
- [j52]Mengjiao Rao, Jianfeng Hou, Qinghou Zeng:
Maximum bisections of graphs without cycles of length 4. Discret. Math. 345(8): 112914 (2022) - [j51]Shufei Wu, Jianfeng Hou:
On judicious bipartitions of directed graphs. Discret. Math. 345(10): 112988 (2022) - [j50]Mengjiao Rao, Jianfeng Hou, Qinghou Zeng:
Odd Induced Subgraphs in Planar Graphs with Large Girth. Graphs Comb. 38(4): 105 (2022) - 2021
- [j49]Gergely Ambrus, Bo Bai, Jianfeng Hou:
Uniform tight frames as optimal signals. Adv. Appl. Math. 129: 102219 (2021) - [j48]Jianfeng Hou, Shufei Wu:
On bisections of graphs without complete bipartite graphs. J. Graph Theory 98(4): 630-641 (2021) - [c11]Jianfeng Hou, Yinxu Tang, Xi Huang, Ziyu Shao, Yang Yang:
Green Edge Intelligence Scheme for Mobile Keyboard Emoji Prediction. ICC 2021: 1-6 - [c10]Jianfeng Hou, Wei Song, Wei Zeng, Huiying Yang:
Design and implementation of a bluetooth data communication middleware on smart phone. ISCID 2021: 398-402 - 2020
- [j47]Jianfeng Hou, Hongguo Zhu:
Choosability with union separation of planar graphs without cycles of length 4. Appl. Math. Comput. 386: 125477 (2020) - [j46]Jianfeng Hou, Juan Yan:
Max-Bisections of H-free graphs. Discret. Math. 343(1): 111590 (2020) - [j45]Jianfeng Hou, Hongguo Zhu:
Choosability with union separation of triangle-free planar graphs. Discret. Math. 343(12): 112137 (2020) - [j44]Jianfeng Hou, Zhe Li, Shufei Wu:
On bipartitions of directed graphs with small semidegree. Eur. J. Comb. 84 (2020) - [j43]Jianfeng Hou, Shufei Wu, Qinghou Zeng, Wenxing Zhu:
Erratum: The Bollobás-Scott Conjecture for 4-Uniform Hypergraphs. SIAM J. Discret. Math. 34(4): 2583-2584 (2020)
2010 – 2019
- 2019
- [c9]Bowen Du, Chris Xiaoxuan Lu, Xuan Kan, Kai Wu, Man Luo, Jianfeng Hou, Kai Li, Salil S. Kanhere, Yiran Shen, Hongkai Wen:
HydraDoctor: real-time liquids intake monitoring by collaborative sensing. ICDCN 2019: 213-217 - 2018
- [j42]Qinghou Zeng, Jianfeng Hou:
Maximum cuts of graphs with forbidden cycles. Ars Math. Contemp. 15(1): 147-160 (2018) - [j41]Genghua Fan, Jianfeng Hou, Xingxing Yu:
Bisections of Graphs Without Short Cycles. Comb. Probab. Comput. 27(1): 44-59 (2018) - [j40]Jianfeng Hou, Huawen Ma, Jiguo Yu, Xia Zhang:
On partitions of K2, 3-free graphs under degree constraints. Discret. Math. 341(12): 3288-3295 (2018) - [j39]Shufei Wu, Jianfeng Hou:
Partitioning dense uniform hypergraphs. J. Comb. Optim. 35(1): 48-63 (2018) - [j38]Jianfeng Hou, Shufei Wu:
Bipartitions of oriented graphs. J. Comb. Theory B 132: 107-133 (2018) - [j37]Jianfeng Hou, Shufei Wu, Qinghou Zeng, Wenxing Zhu:
The Bollobás-Scott Conjecture for 4-Uniform Hypergraphs. SIAM J. Discret. Math. 32(1): 505-521 (2018) - [c8]Xuefeng Wang, Ruopeng Yang, Yulong Feng, Dongsheng Li, Jianfeng Hou:
A Military Named Entity Relation Extraction Approach Based on Deep Learning. ACAI 2018: 51:1-51:6 - [c7]Xuefeng Wang, Xiaofei Zhou, Dongsheng Li, Jianfeng Hou:
Military Scenario Named Entity Recognition Method Based on Deep Neural Network. ICCAIS 2018: 137-140 - [c6]Jianfeng Hou, Ruicheng Yan, Ye He, Wangqi Miao, Xucfeng Wang, Dongsheng Li:
Operational Network Topology Reeonfiguration Based on Foeus of Guarantee. ICCAIS 2018: 194-199 - [c5]Jianfeng Hou, Ruicheng Yan:
Requirement Analysis of Operational Network Organization Based on PDOA. SKG 2018: 224-228 - 2017
- [j36]Jianfeng Hou, Qinghou Zeng:
Judicious Partitioning of Hypergraphs with Edges of Size at Most 2. Comb. Probab. Comput. 26(2): 267-284 (2017) - [j35]Xia Zhang, Jianfeng Hou, Guizhen Liu, Guiying Yan:
Graphs of f-class 1. Discret. Appl. Math. 222: 197-204 (2017) - [j34]Jianfeng Hou, Shufei Wu, Guiying Yan:
On bisections of directed graphs. Eur. J. Comb. 63: 44-58 (2017) - [j33]Jianfeng Hou, Qinghou Zeng:
On a Problem of Judicious k-Partitions of Graphs. J. Graph Theory 85(3): 619-643 (2017) - [j32]Genghua Fan, Jianfeng Hou:
Bounds for pairs in judicious partitioning of graphs. Random Struct. Algorithms 50(1): 59-70 (2017) - [c4]Jianfeng Hou, Wei Song, MengXuan Li:
The Application of Augmented Reality Based on Body Parts Recognition. CSA/CUTE 2017: 458-463 - 2016
- [j31]Lei Cheng, Jianfeng Hou, Yusheng Li, Qizhong Lin:
Monochromatic Solutions for Multi-Term Unknowns. Graphs Comb. 32(6): 2275-2293 (2016) - [j30]Jianfeng Hou, Shufei Wu, Guiying Yan:
On judicious partitions of uniform hypergraphs. J. Comb. Theory A 141: 16-32 (2016) - 2015
- [j29]Xin Zhang, Jianfeng Hou, Guizhen Liu:
On total colorings of 1-planar graphs. J. Comb. Optim. 30(1): 160-173 (2015) - 2014
- [j28]Genghua Fan, Jianfeng Hou, Qinghou Zeng:
A bound for judicious k-partitions of graphs. Discret. Appl. Math. 179: 86-99 (2014) - 2013
- [j27]Jianfeng Hou, Weitao Wang, Xiaoran Zhang:
Acyclic edge coloring of planar graphs with girth at least 5. Discret. Appl. Math. 161(18): 2958-2967 (2013) - [j26]Yue Guan, Jianfeng Hou, Yingyuan Yang:
An improved bound on acyclic chromatic index of planar graphs. Discret. Math. 313(10): 1098-1103 (2013) - [j25]Jianfeng Hou, Jian-Liang Wu:
Erratum to "Acyclic Edge Chromatic Number of Outerplanar Graphs". J. Graph Theory 72(3): 364-365 (2013) - [i3]Xin Zhang, Jianfeng Hou, Guizhen Liu:
On total colorings of 1-planar graphs. CoRR abs/1304.6263 (2013) - 2012
- [j24]Jianfeng Hou, Guizhen Liu:
A Bound on the bondage Number of toroidal Graphs. Discret. Math. Algorithms Appl. 4(3) (2012) - [j23]Jianfeng Hou, Guizhen Liu, Jianliang Wu:
Acyclic Edge Coloring of Planar Graphs Without Small Cycles. Graphs Comb. 28(2): 215-226 (2012) - [j22]Marek Cygan, Jianfeng Hou, Lukasz Kowalik, Borut Luzar, Jian-Liang Wu:
A Planar linear arboricity conjecture. J. Graph Theory 69(4): 403-425 (2012) - [i2]Jianfeng Hou:
Acyclic edge coloring of sparse graphs. CoRR abs/1202.6129 (2012) - [i1]Yue Guan, Jianfeng Hou, Yingyuan Yang:
An improved bound on acyclic chromatic index of planar graphs. CoRR abs/1203.5186 (2012) - 2011
- [j21]Jianfeng Hou, Bin Liu, Guizhen Liu, Jianliang Wu:
Total coloring of planar graphs without 6-cycles. Discret. Appl. Math. 159(2-3): 157-163 (2011) - [j20]Gerard Jennhwa Chang, Jianfeng Hou, Nicolas Roussel:
Local condition for planar graphs of maximum degree 7 to be 8-totally colorable. Discret. Appl. Math. 159(8): 760-768 (2011) - [j19]Jianfeng Hou, Guizhen Liu, Guanghui Wang:
Improved bounds for acyclic chromatic index of planar graphs. Discret. Appl. Math. 159(8): 876-881 (2011) - [j18]Jianfeng Hou, Nicolas Roussel, Jianliang Wu:
Acyclic chromatic index of planar graphs with triangles. Inf. Process. Lett. 111(17): 836-840 (2011) - 2010
- [j17]Jianfeng Hou, Bin Liu, Guizhen Liu, Jihui Wang:
Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles. Int. J. Comput. Math. 87(13): 2880-2886 (2010) - [j16]Gerard Jennhwa Chang, Jianfeng Hou, Nicolas Roussel:
On the total choosability of planar graphs and of sparse graphs. Inf. Process. Lett. 110(20): 849-853 (2010) - [j15]Jianfeng Hou, Jianliang Wu, Guizhen Liu, Bin Liu:
Acyclic edge chromatic number of outerplanar graphs. J. Graph Theory 64(1): 22-36 (2010) - [j14]Guizhen Liu, Jianfeng Hou:
The method of coloring in graphs and its application. J. Syst. Sci. Complex. 23(5): 951-960 (2010)
2000 – 2009
- 2009
- [j13]Jiansheng Cai, Guizhen Liu, Jianfeng Hou:
The stability number and connected [k, k+1]-factor in graphs. Appl. Math. Lett. 22(6): 927-931 (2009) - [j12]Jianfeng Hou, Guizhen Liu, Jianliang Wu:
On 3-Degeneracy of Some C7-free Plane Graphs with Application to Choosability. Ars Comb. 91 (2009) - [j11]Jianfeng Hou, Guizhen Liu, Jiansheng Cai:
Edge-choosability of planar graphs without adjacent triangles or without 7-cycles. Discret. Math. 309(1): 77-84 (2009) - [j10]Xiang-Yong Sun, Jianliang Wu, Yu-Wen Wu, Jianfeng Hou:
Total colorings of planar graphs without adjacent triangles. Discret. Math. 309(1): 202-206 (2009) - [j9]Bin Liu, Jianfeng Hou, Jianliang Wu, Guizhen Liu:
Total colorings and list total colorings of planar graphs without intersecting 4-cycles. Discret. Math. 309(20): 6035-6043 (2009) - [j8]Jiansheng Cai, Jianfeng Hou, Xia Zhang, Guizhen Liu:
Edge-choosability of planar graphs without non-induced 5-cycles. Inf. Process. Lett. 109(7): 343-346 (2009) - [j7]Dongxiao Yu, Jianfeng Hou, Guizhen Liu, Bin Liu, Lan Xu:
Acyclic edge coloring of planar graphs with large girth. Theor. Comput. Sci. 410(47-49): 5196-5200 (2009) - 2008
- [j6]Jianfeng Hou, Yan Zhu, Guizhen Liu, Jianliang Wu, Mei Lan:
Total Colorings of Planar Graphs without Small Cycles. Graphs Comb. 24(2): 91-100 (2008) - [j5]Jiansheng Cai, Guizhen Liu, Jianfeng Hou:
Binding number and Hamiltonian (g, f)-factors in graphs II. Int. J. Comput. Math. 85(9): 1325-1331 (2008) - [j4]Bin Liu, Jianfeng Hou, Guizhen Liu:
List edge and list total colorings of planar graphs without short cycles. Inf. Process. Lett. 108(6): 347-351 (2008) - 2007
- [j3]Guizhen Liu, Jianfeng Hou, Jiansheng Cai:
Some results about f-critical graphs. Networks 50(3): 197-202 (2007) - [j2]Jianliang Wu, Jianfeng Hou, Guizhen Liu:
The linear arboricity of planar graphs with no short cycles. Theor. Comput. Sci. 381(1-3): 230-233 (2007) - [c3]Jiansheng Cai, Guizhen Liu, Jianfeng Hou:
Binding Number and Connected ( g , f + 1)-Factors in Graphs. International Conference on Computational Science (3) 2007: 313-319 - [c2]Jianfeng Hou, Guizhen Liu, Jianliang Wu:
Some Results on List Total Colorings of Planar Graphs. International Conference on Computational Science (3) 2007: 320-328 - [c1]Jihui Wang, Sumei Zhang, Jianfeng Hou:
On f -Edge Cover-Coloring of Simple Graphs. International Conference on Computational Science (3) 2007: 448-452 - 2006
- [j1]Jianfeng Hou, Guizhen Liu, Jiansheng Cai:
List edge and list total colorings of planar graphs without 4-cycles. Theor. Comput. Sci. 369(1-3): 250-255 (2006)
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 2025-01-21 00:18 CET 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:
