Jian-Liang Wu

Orcid: 0000-0002-4254-7261

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

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
The Generation and Regulation of Public Opinion on Multiplex Social Networks.
IEEE Trans. Comput. Soc. Syst., October, 2024

On list (p, 1)-total labellings of special planar graphs and 1-planar graphs.
J. Comb. Optim., April, 2024

H-sequences and 2-step coreness in graphs.
Discret. Appl. Math., January, 2024

The linear arboricity of graphs with low treewidth.
Discuss. Math. Graph Theory, 2024

Finding Traceability Attacks in the Bluetooth Low Energy Specification and Its Implementations.
Proceedings of the 33rd USENIX Security Symposium, 2024

SoK: The Long Journey of Exploiting and Defending the Legacy of King Harald Bluetooth.
Proceedings of the IEEE Symposium on Security and Privacy, 2024

MiniBLE: Exploring Insecure BLE API Usages in Mini-Programs.
Proceedings of the ACM Workshop on Secure and Trustworthy Superapps, SaTS 2024, 2024

2023
4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz.
Discret. Math., April, 2023

Are You Spying on Me? Large-Scale Analysis on IoT Data Exposure through Companion Apps.
Proceedings of the 32nd USENIX Security Symposium, 2023

2022
Toward Structural Controllability and Predictability in Directed Networks.
IEEE Trans. Syst. Man Cybern. Syst., 2022

The total coloring of K5-minor-free graphs.
Eur. J. Comb., 2022

On generalized neighbor sum distinguishing index of planar graphs.
Discret. Math. Algorithms Appl., 2022

The linear arboricity of K5-minor free graphs.
Discret. Appl. Math., 2022

ProFactory: Improving IoT Security via Formalized Protocol Customization.
Proceedings of the 31st USENIX Security Symposium, 2022

Formal Model-Driven Discovery of Bluetooth Protocol Design Vulnerabilities.
Proceedings of the 43rd IEEE Symposium on Security and Privacy, 2022

2021
Information spreading with relative attributes on signed networks.
Inf. Sci., 2021

List edge coloring of planar graphs without 6-cycles with two chords.
Discuss. Math. Graph Theory, 2021

The edge colorings of K5-minor free graphs.
Discret. Math., 2021

Toward Structural Controllability and Predictability in Directed Networks.
CoRR, 2021

LIGHTBLUE: Automatic Profile-Aware Debloating of Bluetooth Stacks.
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.
Discuss. Math. Graph Theory, 2020

List-coloring clique-hypergraphs of K5-minor-free graphs strongly.
Discret. Math., 2020

Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs.
Discret. Math., 2020

Transcendental behavior and disturbance behavior favor human development.
Appl. Math. Comput., 2020

BLESA: Spoofing Attacks against Reconnections in Bluetooth Low Energy.
Proceedings of the 14th USENIX Workshop on Offensive Technologies, 2020

BlueShield: Detecting Spoofing Attacks in Bluetooth Low Energy Networks.
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.
Discret. Math. Theor. Comput. Sci., 2019

On edge colorings of 1-planar graphs without 5-cycles with two chords.
Discuss. Math. Graph Theory, 2019

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

Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9.
Discret. Math., 2019

Graphs are (1, Δ+1)-choosable.
Discret. Math., 2019

2018
Edge coloring of planar graphs without adjacent 7-cycles.
Theor. Comput. Sci., 2018

List-edge-coloring of planar graphs without 6-cycles with three chords.
J. Comb. Optim., 2018

Minimum choosability of planar graphs.
J. Comb. Optim., 2018

Generalized acyclic edge colorings via entropy compression.
J. Comb. Optim., 2018

The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven.
J. Comb. Optim., 2018

Vertex arboricity of planar graphs without intersecting 5-cycles.
J. Comb. Optim., 2018

DPRank centrality: Finding important vertices based on random walks with a new defined transition matrix.
Future Gener. Comput. Syst., 2018

Multipolarization versus unification in community networks.
Future Gener. Comput. Syst., 2018

On splitting digraphs.
Eur. J. Comb., 2018

Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles.
Discuss. Math. Graph Theory, 2018

List r-hued chromatic number of graphs with bounded maximum average degrees.
Discret. Math., 2018

Planar graphs without chordal 6-cycles are 4-choosable.
Discret. Appl. Math., 2018

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

On the first reformulated Zagreb indices of graphs with a given clique number.
Ars Comb., 2018

Equitable and List Equitable Colorings of Planar Graphs without 6-Cycles.
Ars Comb., 2018

Local antimagic labeling of graphs.
Appl. Math. Comput., 2018

A lower bound of revised Szeged index of bicyclic graphs.
Appl. Math. Comput., 2018

2017
On (p, 1)-total labelling of planar graphs.
J. Comb. Optim., 2017

The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles.
J. Comb. Optim., 2017

The adjacent vertex distinguishing total chromatic numbers of planar graphs Δ = 10.
J. Comb. Optim., 2017

Equitable vertex arboricity of 5-degenerate graphs.
J. Comb. Optim., 2017

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

Neighbor Sum (Set) Distinguishing Total Choosability Via the Combinatorial Nullstellensatz.
Graphs Comb., 2017

Planar graphs without intersecting 5-cycles are 4-choosable.
Discret. Math., 2017

A sufficient condition for a planar graph to be 4-choosable.
Discret. Appl. Math., 2017

Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10.
Appl. Math. Comput., 2017

2016
On the neighbor sum distinguishing total coloring of planar graphs.
Theor. Comput. Sci., 2016

Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic.
J. Comb. Optim., 2016

Total coloring of planar graphs without short cycles.
J. Comb. Optim., 2016

A Relaxed Case on 1-2-3 Conjecture.
Graphs Comb., 2016

List injective coloring of planar graphs with girth g≥6.
Discret. Math., 2016

On r-hued coloring of planar graphs with girth at least 6.
Discret. Appl. Math., 2016

Entire Chromatic Number of 1-Tree.
Ars Comb., 2016

2015
Some sufficient conditions for 1-planar graphs to be Class 1.
Theor. Comput. Sci., 2015

PaddyFrog: systematically detecting confused deputy vulnerability in Android applications.
Secur. Commun. Networks, 2015

Total Coloring of Planar Graphs Without Chordal Short Cycles.
Graphs Comb., 2015

Neighbor sum distinguishing total colorings of planar graphs with maximum degree Δ.
Discret. Appl. Math., 2015

Acyclic Total Colorings of Planar Graphs.
Ars Comb., 2015

All Your Sessions Are Belong to Us: Investigating Authenticator Leakage through Backup Channels on Android.
Proceedings of the 20th International Conference on Engineering of Complex Computer Systems, 2015

Automatically Detecting SSL Error-Handling Vulnerabilities in Hybrid Mobile Web Apps.
Proceedings of the 10th ACM Symposium on Information, 2015

2014
Total coloring of planar graphs with 7-cycles containing at most two chords.
Theor. Comput. Sci., 2014

Edge colorings of planar graphs without 5-cycles with two chords.
Theor. Comput. Sci., 2014

Total coloring of planar graphs with maximum degree 8.
Theor. Comput. Sci., 2014

Total coloring of embedded graphs with maximum degree at least seven.
Theor. Comput. Sci., 2014

Edge coloring of planar graphs which any two short cycles are adjacent at most once.
Theor. Comput. Sci., 2014

Total colorings of planar graphs with sparse triangles.
Theor. Comput. Sci., 2014

Quantity strategies in economic networks.
Oper. Res. Lett., 2014

Minimum total coloring of planar graph.
J. Glob. Optim., 2014

Minimum number of disjoint linear forests covering a planar graph.
J. Comb. Optim., 2014

Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle.
J. Comb. Optim., 2014

Zagreb Eccentricity Indices of the Generalized Hierarchical Product Graphs and Their Applications.
J. Appl. Math., 2014

On the linear arboricity of graphs embeddable in surfaces.
Inf. Process. Lett., 2014

A note on Edge Weight choosability of graphs.
Discret. Math. Algorithms Appl., 2014

Total colorings of planar graphs without chordal 6-cycles.
Discret. Appl. Math., 2014

Total Colorings of $F_5$-free Planar Graphs with Maximum Degree 8.
Electron. J. Comb., 2014

TrustFound: Towards a Formal Foundation for Model Checking Trusted Computing Platforms.
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.
Theor. Comput. Sci., 2013

Erratum to "Acyclic Edge Chromatic Number of Outerplanar Graphs".
J. Graph Theory, 2013

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

Equitable vertex arboricity of graphs.
Discret. Math., 2013

The Vertex Linear Arboricity of a Special Class of Integer Distance Graphs.
Ars Comb., 2013

2012
A Planar linear arboricity conjecture.
J. Graph Theory, 2012

Acyclic Edge Coloring of Planar Graphs Without Small Cycles.
Graphs Comb., 2012

Edge covering pseudo-outerplanar graphs with forests.
Discret. Math., 2012

1-s2.0-S0012365X11004973-si1-forested choosability of planar graphs and sparse graphs.
Discret. Math., 2012

A note on the total coloring of planar graphs without adjacent 4-cycles.
Discret. Math., 2012

Total colorings of planar graphs without intersecting 5-cycles.
Discret. Appl. Math., 2012

A conjecture on equitable vertex arboricity of graphs
CoRR, 2012

Equitable vertex arboricity of graphs
CoRR, 2012

2011
On edge colorings of 1-planar graphs.
Inf. Process. Lett., 2011

Total coloring of planar graphs with maximum degree 7.
Inf. Process. Lett., 2011

Acyclic chromatic index of planar graphs with triangles.
Inf. Process. Lett., 2011

A note on relaxed equitable coloring of graphs.
Inf. Process. Lett., 2011

New Upper Bounds for the Heights of Some Light Subgraphs in 1-Planar Graphs with High Minimum Degree.
Discret. Math. Theor. Comput. Sci., 2011

On equitable and equitable list colorings of series-parallel graphs.
Discret. Math., 2011

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

Circular vertex arboricity.
Discret. Appl. Math., 2011

Total coloring of planar graphs without 6-cycles.
Discret. Appl. Math., 2011

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

k-forested choosability of graphs with bounded maximum average degree
CoRR, 2011

Edge colorings of planar graphs with maximum degree five.
Ars Comb., 2011

2010
Acyclic edge chromatic number of outerplanar graphs.
J. Graph Theory, 2010

Vertex-disjoint triangles in K<sub>1, t</sub>-free graphs with minimum degree at least t.
Discret. Math., 2010

Edge Coloring of Triangle-Free 1-Planar Graphs
CoRR, 2010

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

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

2009
Vertex arboricity of integer distance graph G(D<sub>m, k</sub>).
Discret. Math., 2009

Total colorings of planar graphs without adjacent triangles.
Discret. Math., 2009

Planar graphs without 5-cycles or without 6-cycles.
Discret. Math., 2009

Total colorings and list total colorings of planar graphs without intersecting 4-cycles.
Discret. Math., 2009

On 3-Degeneracy of Some C7-free Plane Graphs with Application to Choosability.
Ars Comb., 2009

2008
The Linear Arboricity of Graphs on Surfaces of Negative Euler Characteristic.
SIAM J. Discret. Math., 2008

The linear arboricity of planar graphs of maximum degree seven is four.
J. Graph Theory, 2008

Total Colorings of Planar Graphs without Small Cycles.
Graphs Comb., 2008

List-edge and list-total colorings of graphs embedded on hyperbolic surfaces.
Discret. Math., 2008

Equitable coloring planar graphs with large girth.
Discret. Math., 2008

The Vertex Linear Arboricity of Claw-Free Graphs with Small Degree.
Ars Comb., 2008

2007
The linear arboricity of planar graphs with no short cycles.
Theor. Comput. Sci., 2007

A Linear Algorithm for Edge-Face Coloring Series-Parallel Graphs.
Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

The Equitable Edge-Coloring of Series-Parallel Graphs.
Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

Some Results on List Total Colorings of Planar Graphs.
Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

2006
The vertex linear arboricity of distance graphs.
Discret. Math., 2006

The Fractional Vertex Linear Arboricity of Graphs.
Ars Comb., 2006

The Vertex Linear Arboricity of an Integer Distance Graph with a Special Distance Set.
Ars Comb., 2006

Tree coloring of distance graphs with a real interval set.
Appl. Math. Lett., 2006

2005
Two sufficient conditions for a graph to be type 1.
Ars Comb., 2005

2004
A note on total colorings of planar graphs without 4-cycles.
Discuss. Math. Graph Theory, 2004

Minimum average distance of strong orientations of graphs.
Discret. Appl. Math., 2004

Total Coloring of Series-Parallel Graphs.
Ars Comb., 2004

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

2002
Edge-coloring critical graphs with high degree.
Discret. Math., 2002

2000
The Linear Arboricity of Series-Parallel Graphs.
Graphs Comb., 2000

1999
On the linear arboricity of planar graphs.
J. Graph Theory, 1999


  Loading...