Jianliang Wu

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 38

Top Topics

Top Venues

J. Comb. Optim.

Appl. Math. Comput.

USENIX Security Symposium

Publications

Jianliang Wu, Xingqin Qi, Zhulou Cao
H-sequences and 2-step coreness in graphs. Discret. Appl. Math. 343 (2024)
Lin Sun, Guanglong Yu, Jianliang Wu
On list (p, 1)-total labellings of special planar graphs and 1-planar graphs. J. Comb. Optim. 47 (3) (2024)
Jianliang Wu, Patrick Traynor, Dongyan Xu, Dave (Jing) Tian, Antonio Bianchi
Finding Traceability Attacks in the Bluetooth Low Energy Specification and Its Implementations. USENIX Security Symposium (2024)
Yuhong Nan, Xueqiang Wang, Luyi Xing, Xiaojing Liao, Ruoyu Wu, Jianliang Wu, Yifan Zhang, XiaoFeng Wang
Are You Spying on Me? Large-Scale Analysis on IoT Data Exposure through Companion Apps. USENIX Security Symposium (2023)
Fan Yang, Jianliang Wu
The total coloring of K5-minor-free graphs. Eur. J. Comb. 102 (2022)
Jianliang Wu, Ruoyu Wu, Dongyan Xu, Dave Jing Tian, Antonio Bianchi
Formal Model-Driven Discovery of Bluetooth Protocol Design Vulnerabilities. IEEE Symposium on Security and Privacy (2022)
Jieru Feng, Yue Wang, Jianliang Wu
On generalized neighbor sum distinguishing index of planar graphs. Discret. Math. Algorithms Appl. 14 (4) (2022)
Fei Wang, Jianliang Wu, Yuhong Nan, Yousra Aafer, Xiangyu Zhang, Dongyan Xu, Mathias Payer
ProFactory: Improving IoT Security via Formalized Protocol Customization. USENIX Security Symposium (2022)
Jianliang Wu, Ruoyu Wu, Daniele Antonioli, Mathias Payer, Nils Ole Tippenhauer, Dongyan Xu, Dave (Jing) Tian, Antonio Bianchi
LIGHTBLUE: Automatic Profile-Aware Debloating of Bluetooth Stacks. USENIX Security Symposium (2021)
Jieru Feng, Yuping Gao, Jianliang Wu
The edge colorings of K5-minor free graphs. Discret. Math. 344 (6) (2021)
Jianliang Wu, Yuhong Nan, Vireshwar Kumar, Mathias Payer, Dongyan Xu
BlueShield: Detecting Spoofing Attacks in Bluetooth Low Energy Networks. RAID (2020)
Zuosong Liang, Jianliang Wu, Erfang Shan
List-coloring clique-hypergraphs of K5-minor-free graphs strongly. Discret. Math. 343 (4) (2020)
Fanpeng Song, Jianliang Wu, Suohai Fan, Fei Jing
Transcendental behavior and disturbance behavior favor human development. Appl. Math. Comput. 378 (2020)
Jianliang Wu, Yuhong Nan, Vireshwar Kumar, Dave (Jing) Tian, Antonio Bianchi, Mathias Payer, Dongyan Xu
BLESA: Spoofing Attacks against Reconnections in Bluetooth Low Energy. WOOT @ USENIX Security Symposium (2020)
Xiaohan Cheng, Laihao Ding, Guanghui Wang, Jianliang Wu
Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs. Discret. Math. 343 (7) (2020)
Aijun Dong, Jianliang Wu
Equitable Coloring and Equitable Choosability of Planar Graphs without chordal 4- and 6-Cycles. Discret. Math. Theor. Comput. Sci. 21 (3) (2019)
Laihao Ding, Guan-Huei Duh, Guanghui Wang, Tsai-Lien Wong, Jianliang Wu, Xiaowei Yu, Xuding Zhu
Graphs are (1, Δ+1)-choosable. Discret. Math. 342 (1) (2019)
Yue Wang, Jianliang Wu, Donglei Yang
On the (3, 1)-choosability of planar graphs without adjacent cycles of length 5, 6, 7. Discret. Math. 342 (6) (2019)
Jie Hu, Guanghui Wang, Jianliang Wu, Donglei Yang, Xiaowei Yu
Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9. Discret. Math. 342 (5) (2019)
Shengjin Ji, Mengmeng Liu, Jianliang Wu
A lower bound of revised Szeged index of bicyclic graphs. Appl. Math. Comput. 316 (2018)
Min Liu, Zhen Xiong, Yue Ma, Peng Zhang, Jianliang Wu, Xingqin Qi
DPRank centrality: Finding important vertices based on random walks with a new defined transition matrix. Future Gener. Comput. Syst. 83 (2018)
Huimin Song, Hong-Jian Lai, Jianliang Wu
List r-hued chromatic number of graphs with bounded maximum average degrees. Discret. Math. 341 (5) (2018)
Jingcheng Fu, Jianwen Li, Yawei Niu, Guanghui Wang, Jianliang Wu
Multipolarization versus unification in community networks. Future Gener. Comput. Syst. 83 (2018)
Donglei Yang, Yandong Bai, Guanghui Wang, Jianliang Wu
On splitting digraphs. Eur. J. Comb. 71 (2018)
Huijuan Wang, Bin Liu, Ling Gai, Hongwei Du, Jianliang Wu
Minimum choosability of planar graphs. J. Comb. Optim. 36 (1) (2018)
Xiaohan Cheng, Jianliang Wu
The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven. J. Comb. Optim. 35 (1) (2018)
Laihao Ding, Guanghui Wang, Jianliang Wu
Generalized acyclic edge colorings via entropy compression. J. Comb. Optim. 35 (3) (2018)
Xiaowei Yu, Jie Hu, Donglei Yang, Jianliang Wu, Guanghui Wang
Local antimagic labeling of graphs. Appl. Math. Comput. 322 (2018)
Haiying Wang, Jianliang Wu
List-edge-coloring of planar graphs without 6-cycles with three chords. J. Comb. Optim. 35 (2) (2018)
Aijun Dong, Jianliang Wu
Equitable and List Equitable Colorings of Planar Graphs without 6-Cycles. Ars Comb. 139 (2018)
Shengjin Ji, Qiuju Bian, Jianfeng Wang, Jianliang Wu
On the first reformulated Zagreb indices of graphs with a given clique number. Ars Comb. 140 (2018)
Hua Cai, Jianliang Wu, Lin Sun
Vertex arboricity of planar graphs without intersecting 5-cycles. J. Comb. Optim. 35 (2) (2018)
Guantao Chen, Yuping Gao, Songling Shan, Guanghui Wang, Jianliang Wu
Equitable vertex arboricity of 5-degenerate graphs. J. Comb. Optim. 34 (2) (2017)
Laihao Ding, Guanghui Wang, Jianliang Wu, Jiguo Yu
Neighbor Sum (Set) Distinguishing Total Choosability Via the Combinatorial Nullstellensatz. Graphs Comb. 33 (4) (2017)
Donglei Yang, Lin Sun, Xiaowei Yu, Jianliang Wu, Shan Zhou
Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10. Appl. Math. Comput. 314 (2017)
Lin Sun, Xiaohan Cheng, Jianliang Wu
The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles. J. Comb. Optim. 33 (2) (2017)
Xiaohan Cheng, Guanghui Wang, Jianliang Wu
The adjacent vertex distinguishing total chromatic numbers of planar graphs Δ = 10. J. Comb. Optim. 34 (2) (2017)
Hua Cai, Jianliang Wu, Lin Sun
Total coloring of planar graphs without short cycles. J. Comb. Optim. 31 (4) (2016)
Huijuan Wang, Bin Liu, Jianliang Wu
Total Coloring of Planar Graphs Without Chordal Short Cycles. Graphs Comb. 31 (5) (2015)
Jianliang Wu, Tingting Cui, Tao Ban, Shanqing Guo, Lizhen Cui
PaddyFrog: systematically detecting confused deputy vulnerability in Android applications. Secur. Commun. Networks 8 (13) (2015)
Chaoshun Zuo, Jianliang Wu, Shanqing Guo
Automatically Detecting SSL Error-Handling Vulnerabilities in Hybrid Mobile Web Apps. AsiaCCS (2015)
Guangdong Bai, Jun Sun, Jianliang Wu, Quanqi Ye, Li Li, Jin Song Dong, Shanqing Guo
All Your Sessions Are Belong to Us: Investigating Authenticator Leakage through Backup Channels on Android. ICECCS (2015)
Huijuan Wang, Lidong Wu, Weili Wu, Jianliang Wu
Minimum number of disjoint linear forests covering a planar graph. J. Comb. Optim. 28 (1) (2014)
Guangdong Bai, Jianan Hao, Jianliang Wu, Yang Liu, Zhenkai Liang, Andrew P. Martin
TrustFound: Towards a Formal Foundation for Model Checking Trusted Computing Platforms. FM (2014)
Huijuan Wang, Bin Liu, Jianliang Wu, Guizhen Liu
Total coloring of embedded graphs with maximum degree at least seven. Theor. Comput. Sci. 518 (2014)
Huijuan Wang, Jianliang Wu, Bin Liu, Hongyu Chen
On the linear arboricity of graphs embeddable in surfaces. Inf. Process. Lett. 114 (9) (2014)
Jin Xu, Jianghua Zhang, Jianliang Wu
Quantity strategies in economic networks. Oper. Res. Lett. 42 (6-7) (2014)
Huijuan Wang, Lidong Wu, Jianliang Wu
Total coloring of planar graphs with maximum degree 8. Theor. Comput. Sci. 522 (2014)
Jingcheng Fu, Guanghui Wang, Jianliang Wu, Jin Xu
A note on Edge Weight choosability of graphs. Discret. Math. Algorithms Appl. 6 (1) (2014)
Lian-Cui Zuo, Bang-Jun Li, Jianliang Wu
The Vertex Linear Arboricity of a Special Class of Integer Distance Graphs. Ars Comb. 111 (2013)
Hongyu Chen, Xiang Tan, Jianliang Wu, Guojun Li
The Linear Arboricity of Planar Graphs without 5-, 6-Cycles with Chords. Graphs Comb. 29 (3) (2013)
Jianfeng Hou, Guizhen Liu, Jianliang Wu
Acyclic Edge Coloring of Planar Graphs Without Small Cycles. Graphs Comb. 28 (2) (2012)
Xin Zhang, Guizhen Liu, Jianliang Wu
1-s2.0-S0012365X11004973-si1-forested choosability of planar graphs and sparse graphs. Discret. Math. 312 (5) (2012)
Xin Zhang, Guizhen Liu, Jianliang Wu
Edge covering pseudo-outerplanar graphs with forests. Discret. Math. 312 (18) (2012)
Jianliang Wu, Xin Zhang, Hailun Li
Equitable vertex arboricity of graphs CoRR (2012)
Bing Wang, Jianliang Wu
Total colorings of planar graphs without intersecting 5-cycles. Discret. Appl. Math. 160 (12) (2012)
Xin Zhang, Jianliang Wu
A conjecture on equitable vertex arboricity of graphs CoRR (2012)
Xin Zhang, Jianliang Wu
On edge colorings of 1-planar graphs. Inf. Process. Lett. 111 (3) (2011)
Bing Wang, Jianliang Wu
Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles. Discret. Math. 311 (18-19) (2011)
Guanghui Wang, Shan Zhou, Guizhen Liu, Jianliang Wu
Circular vertex arboricity. Discret. Appl. Math. 159 (12) (2011)
Jianfeng Hou, Nicolas Roussel, Jianliang Wu
Acyclic chromatic index of planar graphs with triangles. Inf. Process. Lett. 111 (17) (2011)
Hao Fan, Hal A. Kierstead, Guizhen Liu, Theodore Molla, Jianliang Wu, Xin Zhang
A note on relaxed equitable coloring of graphs. Inf. Process. Lett. 111 (21-22) (2011)
Xin Zhang, Jianliang Wu, Guizhen Liu
New Upper Bounds for the Heights of Some Light Subgraphs in 1-Planar Graphs with High Minimum Degree. Discret. Math. Theor. Comput. Sci. 13 (3) (2011)
Xin Zhang, Jianliang Wu
On equitable and equitable list colorings of series-parallel graphs. Discret. Math. 311 (10-11) (2011)
Xin Zhang, Guizhen Liu, Jianliang Wu
Edge covering pseudo-outerplanar graphs with forests CoRR (2011)
Xin Zhang, Guizhen Liu, Jianliang Wu
k-forested choosability of graphs with bounded maximum average degree CoRR (2011)
Xin Zhang, Guizhen Liu, Jianliang Wu
(1,λ)-embedded graphs and the acyclic edge choosability CoRR (2011)
Jianfeng Hou, Bin Liu, Guizhen Liu, Jianliang Wu
Total coloring of planar graphs without 6-cycles. Discret. Appl. Math. 159 (2-3) (2011)
Bing Wang, Jianliang Wu
Total coloring of planar graphs with maximum degree 7. Inf. Process. Lett. 111 (20) (2011)
Xin Zhang, Jianliang Wu, Jin Yan
Degree conditions for the partition of a graph into triangles and quadrilaterals CoRR (2010)
Xin Zhang, Guizhen Liu, Jianliang Wu
Structural properties of 1-planar graphs and an application to acyclic edge coloring CoRR (2010)
Xin Zhang, Na Li, Jianliang Wu, Jin Yan
-free graphs with minimum degree at least t. Discret. Math. 310 (19) (2010)
Xin Zhang, Guizhen Liu, Jianliang Wu
Edge Coloring of Triangle-Free 1-Planar Graphs CoRR (2010)
Jianfeng Hou, Jianliang Wu, Guizhen Liu, Bin Liu
Acyclic edge chromatic number of outerplanar graphs. J. Graph Theory 64 (1) (2010)
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) (2009)
Xiang-Yong Sun, Jianliang Wu, Yu-Wen Wu, Jianfeng Hou
Total colorings of planar graphs without adjacent triangles. Discret. Math. 309 (1) (2009)
Jianfeng Hou, Guizhen Liu, Jianliang Wu
On 3-Degeneracy of Some C7-free Plane Graphs with Application to Choosability. Ars Comb. 91 (2009)
Lian-Cui Zuo, Qinglin Yu, Jianliang Wu
). Discret. Math. 309 (6) (2009)
Jianfeng Hou, Yan Zhu, Guizhen Liu, Jianliang Wu, Mei Lan
Total Colorings of Planar Graphs without Small Cycles. Graphs Comb. 24 (2) (2008)
Jianliang Wu, Ping Wang
Equitable coloring planar graphs with large girth. Discret. Math. 308 (5-6) (2008)
Jianliang Wu, Ping Wang
List-edge and list-total colorings of graphs embedded on hyperbolic surfaces. Discret. Math. 308 (24) (2008)
Jianliang Wu, Ping Wang
A Linear Algorithm for Edge-Face Coloring Series-Parallel Graphs. International Conference on Computational Science (3) (2007)
Jianliang Wu, Jianfeng Hou, Guizhen Liu
The linear arboricity of planar graphs with no short cycles. Theor. Comput. Sci. 381 (1-3) (2007)
Jianfeng Hou, Guizhen Liu, Jianliang Wu
Some Results on List Total Colorings of Planar Graphs. International Conference on Computational Science (3) (2007)
Huimin Song, Jianliang Wu, Guizhen Liu
The Equitable Edge-Coloring of Series-Parallel Graphs. International Conference on Computational Science (3) (2007)
Lian-Cui Zuo, Jianliang Wu, Jia-Zhuang Liu
The Vertex Linear Arboricity of an Integer Distance Graph with a Special Distance Set. Ars Comb. 79 (2006)
Lian-Cui Zuo, Qinglin Yu, Jianliang Wu
Tree coloring of distance graphs with a real interval set. Appl. Math. Lett. 19 (12) (2006)
Lian-Cui Zuo, Jianliang Wu, Jia-Zhuang Liu
The Fractional Vertex Linear Arboricity of Graphs. Ars Comb. 81 (2006)
Lian-Cui Zuo, Jianliang Wu, Jia-Zhuang Liu
The vertex linear arboricity of distance graphs. Discret. Math. 306 (2) (2006)
Jianliang Wu, Ping Wang, Anthony J. W. Hilton
Two sufficient conditions for a graph to be type 1. Ars Comb. 76 (2005)
Ping Wang, Jianliang Wu
A note on total colorings of planar graphs without 4-cycles. Discuss. Math. Graph Theory 24 (1) (2004)
Lianying Miao, Shiyou Pang, Jianliang Wu
An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree. Discret. Math. 271 (1-3) (2003)
Lianying Miao, Jianliang Wu
Edge-coloring critical graphs with high degree. Discret. Math. 257 (1) (2002)
Jianliang Wu
The Linear Arboricity of Series-Parallel Graphs. Graphs Comb. 16 (3) (2000)