Jian-Liang Wu

According to our database, Jian-Liang Wu authored at least 140 papers between 1999 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2024

On list (p, 1)-total labellings of special planar graphs and 1-planar graphs.

Lin Sun, Guanglong Yu, Jianliang Wu

J. Comb. Optim., April, 2024

H-sequences and 2-step coreness in graphs.

Jianliang Wu, Xingqin Qi, Zhulou Cao

Discret. Appl. Math., January, 2024

2023

4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz.

Fan Yang, Yue Wang, Jian-Liang Wu

Discret. Math., April, 2023

The generation and regulation of public opinion on multiplex social networks.

Zhong Zhang, Jian-Liang Wu, Cunquan Qu, Fei Jing

CoRR, 2023

Are You Spying on Me? Large-Scale Analysis on IoT Data Exposure through Companion Apps.

Yuhong Nan, Xueqiang Wang, Luyi Xing, Xiaojing Liao, Ruoyu Wu, Jianliang Wu, Yifan Zhang, XiaoFeng Wang

Proceedings of the 32nd USENIX Security Symposium, 2023

2022

Toward Structural Controllability and Predictability in Directed Networks.

Fei Jing, Chuang Liu, Jian-Liang Wu, Zi-Ke Zhang

IEEE Trans. Syst. Man Cybern. Syst., 2022

The total coloring of K5-minor-free graphs.

Fan Yang, Jianliang Wu

Eur. J. Comb., 2022

On generalized neighbor sum distinguishing index of planar graphs.

Jieru Feng, Yue Wang, Jianliang Wu

Discret. Math. Algorithms Appl., 2022

The linear arboricity of K5-minor free graphs.

Fan Yang, Jian-Liang Wu, Huimin Song

Discret. Appl. Math., 2022

ProFactory: Improving IoT Security via Formalized Protocol Customization.

Fei Wang, Jianliang Wu, Yuhong Nan, Yousra Aafer, Xiangyu Zhang, Dongyan Xu, Mathias Payer

Proceedings of the 31st USENIX Security Symposium, 2022

Formal Model-Driven Discovery of Bluetooth Protocol Design Vulnerabilities.

Jianliang Wu, Ruoyu Wu, Dongyan Xu, Dave Jing Tian, Antonio Bianchi

Proceedings of the 43rd IEEE Symposium on Security and Privacy, 2022

2021

Information spreading with relative attributes on signed networks.

Ya-Wei Niu, Cunquan Qu, Guanghui Wang, Jian-Liang Wu, Guiying Yan

Inf. Sci., 2021

List edge coloring of planar graphs without 6-cycles with two chords.

Linna Hu, Lei Sun, Jian-Liang Wu

Discuss. Math. Graph Theory, 2021

The edge colorings of K5-minor free graphs.

Jieru Feng, Yuping Gao, Jianliang Wu

Discret. Math., 2021

Toward Structural Controllability and Predictability in Directed Networks.

Fei Jing, Chuang Liu, Yi-Cheng Zhang, Jian-Liang Wu, Zi-Ke Zhang

CoRR, 2021

LIGHTBLUE: Automatic Profile-Aware Debloating of Bluetooth Stacks.

Jianliang Wu, Ruoyu Wu, Daniele Antonioli, Mathias Payer, Nils Ole Tippenhauer, Dongyan Xu, Dave (Jing) Tian, Antonio Bianchi

Proceedings of the 30th USENIX Security Symposium, 2021

2020

The list coloring and list total coloring of planar graphs with maximum degree at least 7.

Bin Liu, Lin Sun, Bing Wang, Jian-Liang Wu

Discuss. Math. Graph Theory, 2020

List-coloring clique-hypergraphs of K5-minor-free graphs strongly.

Zuosong Liang, Jianliang Wu, Erfang Shan

Discret. Math., 2020

Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs.

Xiaohan Cheng, Laihao Ding, Guanghui Wang, Jianliang Wu

Discret. Math., 2020

Transcendental behavior and disturbance behavior favor human development.

Fanpeng Song, Jianliang Wu, Suohai Fan, Fei Jing

Appl. Math. Comput., 2020

BLESA: Spoofing Attacks against Reconnections in Bluetooth Low Energy.

Jianliang Wu, Yuhong Nan, Vireshwar Kumar, Dave (Jing) Tian, Antonio Bianchi, Mathias Payer, Dongyan Xu

Proceedings of the 14th USENIX Workshop on Offensive Technologies, 2020

BlueShield: Detecting Spoofing Attacks in Bluetooth Low Energy Networks.

Jianliang Wu, Yuhong Nan, Vireshwar Kumar, Mathias Payer, Dongyan Xu

Proceedings of the 23rd International Symposium on Research in Attacks, 2020

2019

Equitable Coloring and Equitable Choosability of Planar Graphs without chordal 4- and 6-Cycles.

Aijun Dong, Jianliang Wu

Discret. Math. Theor. Comput. Sci., 2019

On edge colorings of 1-planar graphs without 5-cycles with two chords.

Lin Sun, Jian-Liang Wu

Discuss. Math. Graph Theory, 2019

On the (3, 1)-choosability of planar graphs without adjacent cycles of length 5, 6, 7.

Yue Wang, Jianliang Wu, Donglei Yang

Discret. Math., 2019

Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9.

Jie Hu, Guanghui Wang, Jianliang Wu, Donglei Yang, Xiaowei Yu

Discret. Math., 2019

Graphs are (1, Δ+1)-choosable.

Laihao Ding, Guan-Huei Duh, Guanghui Wang, Tsai-Lien Wong, Jianliang Wu, Xiaowei Yu, Xuding Zhu

Discret. Math., 2019

2018

Edge coloring of planar graphs without adjacent 7-cycles.

Wenwen Zhang, Jian-Liang Wu

Theor. Comput. Sci., 2018

List-edge-coloring of planar graphs without 6-cycles with three chords.

Haiying Wang, Jianliang Wu

J. Comb. Optim., 2018

Minimum choosability of planar graphs.

Huijuan Wang, Bin Liu, Ling Gai, Hongwei Du, Jianliang Wu

J. Comb. Optim., 2018

Generalized acyclic edge colorings via entropy compression.

Laihao Ding, Guanghui Wang, Jianliang Wu

J. Comb. Optim., 2018

The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven.

Xiaohan Cheng, Jianliang Wu

J. Comb. Optim., 2018

Vertex arboricity of planar graphs without intersecting 5-cycles.

Hua Cai, Jianliang Wu, Lin Sun

J. Comb. Optim., 2018

DPRank centrality: Finding important vertices based on random walks with a new defined transition matrix.

Min Liu, Zhen Xiong, Yue Ma, Peng Zhang, Jianliang Wu, Xingqin Qi

Future Gener. Comput. Syst., 2018

Multipolarization versus unification in community networks.

Jingcheng Fu, Jianwen Li, Yawei Niu, Guanghui Wang, Jianliang Wu

Future Gener. Comput. Syst., 2018

On splitting digraphs.

Donglei Yang, Yandong Bai, Guanghui Wang, Jianliang Wu

Eur. J. Comb., 2018

Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles.

Lin Sun, Bing Wang, Jian-Liang Wu

Discuss. Math. Graph Theory, 2018

List r-hued chromatic number of graphs with bounded maximum average degrees.

Huimin Song, Hong-Jian Lai, Jianliang Wu

Discret. Math., 2018

Planar graphs without chordal 6-cycles are 4-choosable.

Daiqiang Hu, Danjun Huang, Weifan Wang, Jian-Liang Wu

Discret. Appl. Math., 2018

A note on the edge colorings of planar graphs without 7-cycles with three chords.

Wenwen Zhang, Jian-Liang Wu

Ars Comb., 2018

On the first reformulated Zagreb indices of graphs with a given clique number.

Shengjin Ji, Qiuju Bian, Jianfeng Wang, Jianliang Wu

Ars Comb., 2018

Equitable and List Equitable Colorings of Planar Graphs without 6-Cycles.

Aijun Dong, Jianliang Wu

Ars Comb., 2018

Local antimagic labeling of graphs.

Xiaowei Yu, Jie Hu, Donglei Yang, Jianliang Wu, Guanghui Wang

Appl. Math. Comput., 2018

A lower bound of revised Szeged index of bicyclic graphs.

Shengjin Ji, Mengmeng Liu, Jianliang Wu

Appl. Math. Comput., 2018

2017

On (p, 1)-total labelling of planar graphs.

Lin Sun, Jian-Liang Wu

J. Comb. Optim., 2017

The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles.

Lin Sun, Xiaohan Cheng, Jianliang Wu

J. Comb. Optim., 2017

The adjacent vertex distinguishing total chromatic numbers of planar graphs Δ = 10.

Xiaohan Cheng, Guanghui Wang, Jianliang Wu

J. Comb. Optim., 2017

Equitable vertex arboricity of 5-degenerate graphs.

Guantao Chen, Yuping Gao, Songling Shan, Guanghui Wang, Jianliang Wu

J. Comb. Optim., 2017

On the Equitable Edge-Coloring of 1-Planar Graphs and Planar Graphs.

Daiqiang Hu, Jian-Liang Wu, Donglei Yang, Xin Zhang

Graphs Comb., 2017

Neighbor Sum (Set) Distinguishing Total Choosability Via the Combinatorial Nullstellensatz.

Laihao Ding, Guanghui Wang, Jianliang Wu, Jiguo Yu

Graphs Comb., 2017

Planar graphs without intersecting 5-cycles are 4-choosable.

Daiqiang Hu, Jian-Liang Wu

Discret. Math., 2017

A sufficient condition for a planar graph to be 4-choosable.

Renyu Xu, Jian-Liang Wu

Discret. Appl. Math., 2017

Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10.

Donglei Yang, Lin Sun, Xiaowei Yu, Jianliang Wu, Shan Zhou

Appl. Math. Comput., 2017

2016

On the neighbor sum distinguishing total coloring of planar graphs.

Cunquan Qu, Guanghui Wang, Jian-Liang Wu, Xiaowei Yu

Theor. Comput. Sci., 2016

Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic.

Renyu Xu, Jian-Liang Wu, Jin Xu

J. Comb. Optim., 2016

Total coloring of planar graphs without short cycles.

Hua Cai, Jianliang Wu, Lin Sun

J. Comb. Optim., 2016

A Relaxed Case on 1-2-3 Conjecture.

Yuping Gao, Guanghui Wang, Jian-Liang Wu

Graphs Comb., 2016

List injective coloring of planar graphs with girth g≥6.

Hongyu Chen, Jian-Liang Wu

Discret. Math., 2016

On r-hued coloring of planar graphs with girth at least 6.

Huimin Song, Hong-Jian Lai, Jian-Liang Wu

Discret. Appl. Math., 2016

Entire Chromatic Number of 1-Tree.

Gui-Xiang Dong, Jian-Liang Wu

Ars Comb., 2016

2015

Some sufficient conditions for 1-planar graphs to be Class 1.

Wenwen Zhang, Jian-Liang Wu

Theor. Comput. Sci., 2015

PaddyFrog: systematically detecting confused deputy vulnerability in Android applications.

Jianliang Wu, Tingting Cui, Tao Ban, Shanqing Guo, Lizhen Cui

Secur. Commun. Networks, 2015

Total Coloring of Planar Graphs Without Chordal Short Cycles.

Huijuan Wang, Bin Liu, Jianliang Wu

Graphs Comb., 2015

Neighbor sum distinguishing total colorings of planar graphs with maximum degree Δ.

Xiaohan Cheng, Danjun Huang, Guanghui Wang, Jian-Liang Wu

Discret. Appl. Math., 2015

Acyclic Total Colorings of Planar Graphs.

Xiang-Yong Sun, Jian-Liang Wu

Ars Comb., 2015

All Your Sessions Are Belong to Us: Investigating Authenticator Leakage through Backup Channels on Android.

Guangdong Bai, Jun Sun, Jianliang Wu, Quanqi Ye, Li Li, Jin Song Dong, Shanqing Guo

Proceedings of the 20th International Conference on Engineering of Complex Computer Systems, 2015

Automatically Detecting SSL Error-Handling Vulnerabilities in Hybrid Mobile Web Apps.

Chaoshun Zuo, Jianliang Wu, Shanqing Guo

Proceedings of the 10th ACM Symposium on Information, 2015

2014

Total coloring of planar graphs with 7-cycles containing at most two chords.

Renyu Xu, Jian-Liang Wu

Theor. Comput. Sci., 2014

Edge colorings of planar graphs without 5-cycles with two chords.

Jian-Liang Wu, Ling Xue

Theor. Comput. Sci., 2014

Total coloring of planar graphs with maximum degree 8.

Huijuan Wang, Lidong Wu, Jianliang Wu

Theor. Comput. Sci., 2014

Total coloring of embedded graphs with maximum degree at least seven.

Huijuan Wang, Bin Liu, Jianliang Wu, Guizhen Liu

Theor. Comput. Sci., 2014

Edge coloring of planar graphs which any two short cycles are adjacent at most once.

Wei-Ping Ni, Jian-Liang Wu

Theor. Comput. Sci., 2014

Total colorings of planar graphs with sparse triangles.

Jian Chang, Jian-Liang Wu, Yong-Ga A

Theor. Comput. Sci., 2014

Quantity strategies in economic networks.

Jin Xu, Jianghua Zhang, Jianliang Wu

Oper. Res. Lett., 2014

Minimum total coloring of planar graph.

Huijuan Wang, Lidong Wu, Weili Wu, Panos M. Pardalos, Jian-Liang Wu

J. Glob. Optim., 2014

Minimum number of disjoint linear forests covering a planar graph.

Huijuan Wang, Lidong Wu, Weili Wu, Jianliang Wu

J. Comb. Optim., 2014

Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle.

Yiqiao Wang, Qiaojun Shu, Jian-Liang Wu, Wenwen Zhang

J. Comb. Optim., 2014

Zagreb Eccentricity Indices of the Generalized Hierarchical Product Graphs and Their Applications.

Zhaoyang Luo, Jian-Liang Wu

J. Appl. Math., 2014

On the linear arboricity of graphs embeddable in surfaces.

Huijuan Wang, Jianliang Wu, Bin Liu, Hongyu Chen

Inf. Process. Lett., 2014

A note on Edge Weight choosability of graphs.

Jingcheng Fu, Guanghui Wang, Jianliang Wu, Jin Xu

Discret. Math. Algorithms Appl., 2014

Total colorings of planar graphs without chordal 6-cycles.

Bing Wang, Jian-Liang Wu, Huijuan Wang

Discret. Appl. Math., 2014

Total Colorings of $F_5$-free Planar Graphs with Maximum Degree 8.

Jian Chang, Jian-Liang Wu, Huijuan Wang, Zhan-Hai Guo

Electron. J. Comb., 2014

TrustFound: Towards a Formal Foundation for Model Checking Trusted Computing Platforms.

Guangdong Bai, Jianan Hao, Jianliang Wu, Yang Liu, Zhenkai Liang, Andrew P. Martin

Proceedings of the FM 2014: Formal Methods, 2014

2013

Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords.

Jian Chang, Huijuan Wang, Jian-Liang Wu, Yong-Ga A

Theor. Comput. Sci., 2013

Erratum to "Acyclic Edge Chromatic Number of Outerplanar Graphs".

Jianfeng Hou, Jian-Liang Wu

J. Graph Theory, 2013

The Linear Arboricity of Planar Graphs without 5-, 6-Cycles with Chords.

Hongyu Chen, Xiang Tan, Jianliang Wu, Guojun Li

Graphs Comb., 2013

Equitable vertex arboricity of graphs.

Jian-Liang Wu, Xin Zhang, Hailuan Li

Discret. Math., 2013

The Vertex Linear Arboricity of a Special Class of Integer Distance Graphs.

Lian-Cui Zuo, Bang-Jun Li, Jianliang Wu

Ars Comb., 2013

2012

A Planar linear arboricity conjecture.

Marek Cygan, Jianfeng Hou, Lukasz Kowalik, Borut Luzar, Jian-Liang Wu

J. Graph Theory, 2012

Acyclic Edge Coloring of Planar Graphs Without Small Cycles.

Jianfeng Hou, Guizhen Liu, Jianliang Wu

Graphs Comb., 2012

Edge covering pseudo-outerplanar graphs with forests.

Xin Zhang, Guizhen Liu, Jianliang Wu

Discret. Math., 2012

1-s2.0-S0012365X11004973-si1-forested choosability of planar graphs and sparse graphs.

Xin Zhang, Guizhen Liu, Jianliang Wu

Discret. Math., 2012

A note on the total coloring of planar graphs without adjacent 4-cycles.

Huijuan Wang, Jian-Liang Wu

Discret. Math., 2012

Total colorings of planar graphs without intersecting 5-cycles.

Bing Wang, Jianliang Wu

Discret. Appl. Math., 2012

A conjecture on equitable vertex arboricity of graphs

Xin Zhang, Jianliang Wu

CoRR, 2012

Equitable vertex arboricity of graphs

Jianliang Wu, Xin Zhang, Hailun Li

CoRR, 2012

2011

On edge colorings of 1-planar graphs.

Xin Zhang, Jianliang Wu

Inf. Process. Lett., 2011

Total coloring of planar graphs with maximum degree 7.

Bing Wang, Jianliang Wu

Inf. Process. Lett., 2011

Acyclic chromatic index of planar graphs with triangles.

Jianfeng Hou, Nicolas Roussel, Jianliang Wu

Inf. Process. Lett., 2011

A note on relaxed equitable coloring of graphs.

Hao Fan, Hal A. Kierstead, Guizhen Liu, Theodore Molla, Jianliang Wu, Xin Zhang

Inf. Process. Lett., 2011

New Upper Bounds for the Heights of Some Light Subgraphs in 1-Planar Graphs with High Minimum Degree.

Xin Zhang, Jianliang Wu, Guizhen Liu

Discret. Math. Theor. Comput. Sci., 2011

On equitable and equitable list colorings of series-parallel graphs.

Xin Zhang, Jianliang Wu

Discret. Math., 2011

Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles.

Bing Wang, Jianliang Wu

Discret. Math., 2011

Circular vertex arboricity.

Guanghui Wang, Shan Zhou, Guizhen Liu, Jianliang Wu

Discret. Appl. Math., 2011

Total coloring of planar graphs without 6-cycles.

Jianfeng Hou, Bin Liu, Guizhen Liu, Jianliang Wu

Discret. Appl. Math., 2011

(1,λ)-embedded graphs and the acyclic edge choosability

Xin Zhang, Guizhen Liu, Jianliang Wu

CoRR, 2011

k-forested choosability of graphs with bounded maximum average degree

Xin Zhang, Guizhen Liu, Jianliang Wu

CoRR, 2011

Edge colorings of planar graphs with maximum degree five.

Jian-Liang Wu, Yu-Wen Wu

Ars Comb., 2011

2010

Acyclic edge chromatic number of outerplanar graphs.

Jianfeng Hou, Jianliang Wu, Guizhen Liu, Bin Liu

J. Graph Theory, 2010

Vertex-disjoint triangles in K_{1, t}-free graphs with minimum degree at least t.

Xin Zhang, Na Li, Jianliang Wu, Jin Yan

Discret. Math., 2010

Edge Coloring of Triangle-Free 1-Planar Graphs

Xin Zhang, Guizhen Liu, Jianliang Wu

CoRR, 2010

Degree conditions for the partition of a graph into triangles and quadrilaterals

Xin Zhang, Jianliang Wu, Jin Yan

CoRR, 2010

Structural properties of 1-planar graphs and an application to acyclic edge coloring

Xin Zhang, Guizhen Liu, Jianliang Wu

CoRR, 2010

2009

Vertex arboricity of integer distance graph G(D_{m, k}).

Lian-Cui Zuo, Qinglin Yu, Jianliang Wu

Discret. Math., 2009

Total colorings of planar graphs without adjacent triangles.

Xiang-Yong Sun, Jianliang Wu, Yu-Wen Wu, Jianfeng Hou

Discret. Math., 2009

Planar graphs without 5-cycles or without 6-cycles.

Qin Ma, Jian-Liang Wu, Xiao Yu

Discret. Math., 2009

Total colorings and list total colorings of planar graphs without intersecting 4-cycles.

Bin Liu, Jianfeng Hou, Jianliang Wu, Guizhen Liu

Discret. Math., 2009

On 3-Degeneracy of Some C7-free Plane Graphs with Application to Choosability.

Jianfeng Hou, Guizhen Liu, Jianliang Wu

Ars Comb., 2009

2008

The Linear Arboricity of Graphs on Surfaces of Negative Euler Characteristic.

Jian-Liang Wu

SIAM J. Discret. Math., 2008

The linear arboricity of planar graphs of maximum degree seven is four.

Jian-Liang Wu, Yu-Wen Wu

J. Graph Theory, 2008

Total Colorings of Planar Graphs without Small Cycles.

Jianfeng Hou, Yan Zhu, Guizhen Liu, Jianliang Wu, Mei Lan

Graphs Comb., 2008

List-edge and list-total colorings of graphs embedded on hyperbolic surfaces.

Jianliang Wu, Ping Wang

Discret. Math., 2008

Equitable coloring planar graphs with large girth.

Jianliang Wu, Ping Wang

Discret. Math., 2008

The Vertex Linear Arboricity of Claw-Free Graphs with Small Degree.

Jian-Liang Wu, Yu-Liang Wu

Ars Comb., 2008

2007

The linear arboricity of planar graphs with no short cycles.

Jianliang Wu, Jianfeng Hou, Guizhen Liu

Theor. Comput. Sci., 2007

A Linear Algorithm for Edge-Face Coloring Series-Parallel Graphs.

Jianliang Wu, Ping Wang

Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

The Equitable Edge-Coloring of Series-Parallel Graphs.

Huimin Song, Jianliang Wu, Guizhen Liu

Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

Some Results on List Total Colorings of Planar Graphs.

Jianfeng Hou, Guizhen Liu, Jianliang Wu

Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

2006

The vertex linear arboricity of distance graphs.

Lian-Cui Zuo, Jianliang Wu, Jia-Zhuang Liu

Discret. Math., 2006

The Fractional Vertex Linear Arboricity of Graphs.

Lian-Cui Zuo, Jianliang Wu, Jia-Zhuang Liu

Ars Comb., 2006

The Vertex Linear Arboricity of an Integer Distance Graph with a Special Distance Set.

Lian-Cui Zuo, Jianliang Wu, Jia-Zhuang Liu

Ars Comb., 2006

Tree coloring of distance graphs with a real interval set.

Lian-Cui Zuo, Qinglin Yu, Jianliang Wu

Appl. Math. Lett., 2006

2005

Two sufficient conditions for a graph to be type 1.

Jianliang Wu, Ping Wang, Anthony J. W. Hilton

Ars Comb., 2005

2004

A note on total colorings of planar graphs without 4-cycles.

Ping Wang, Jianliang Wu

Discuss. Math. Graph Theory, 2004

Minimum average distance of strong orientations of graphs.

Peter Dankelmann, Ortrud Oellermann, Jian-Liang Wu

Discret. Appl. Math., 2004

Total Coloring of Series-Parallel Graphs.

Jian-Liang Wu, Daiqiang Hu

Ars Comb., 2004

2003

An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree.

Lianying Miao, Shiyou Pang, Jianliang Wu

Discret. Math., 2003

2002

Edge-coloring critical graphs with high degree.

Lianying Miao, Jianliang Wu

Discret. Math., 2002

2000

The Linear Arboricity of Series-Parallel Graphs.

Jianliang Wu

Graphs Comb., 2000

1999

On the linear arboricity of planar graphs.

Jian-Liang Wu

J. Graph Theory, 1999