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:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
IEEE Trans. Comput. Soc. Syst., October, 2024
J. Comb. Optim., April, 2024
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
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
IEEE Trans. Syst. Man Cybern. Syst., 2022
Discret. Math. Algorithms Appl., 2022
Proceedings of the 31st USENIX Security Symposium, 2022
Proceedings of the 43rd IEEE Symposium on Security and Privacy, 2022
2021
Discuss. Math. Graph Theory, 2021
CoRR, 2021
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
Discret. Math., 2020
Discret. Math., 2020
Appl. Math. Comput., 2020
Proceedings of the 14th USENIX Workshop on Offensive Technologies, 2020
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
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
2018
J. Comb. Optim., 2018
The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven.
J. Comb. Optim., 2018
J. Comb. Optim., 2018
DPRank centrality: Finding important vertices based on random walks with a new defined transition matrix.
Future Gener. Comput. Syst., 2018
Future Gener. Comput. Syst., 2018
Discuss. Math. Graph Theory, 2018
Discret. 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
2017
The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles.
J. Comb. Optim., 2017
J. Comb. Optim., 2017
Graphs Comb., 2017
Neighbor Sum (Set) Distinguishing Total Choosability Via the Combinatorial Nullstellensatz.
Graphs Comb., 2017
Discret. Appl. Math., 2017
Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10.
Appl. Math. Comput., 2017
2016
Theor. Comput. Sci., 2016
Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic.
J. Comb. Optim., 2016
Discret. Appl. Math., 2016
Entire Chromatic Number of 1-Tree.
Ars Comb., 2016
2015
Theor. Comput. Sci., 2015
PaddyFrog: systematically detecting confused deputy vulnerability in Android applications.
Secur. Commun. Networks, 2015
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
Theor. Comput. Sci., 2014
Theor. Comput. Sci., 2014
Theor. Comput. Sci., 2014
Theor. Comput. Sci., 2014
J. Comb. Optim., 2014
J. Comb. Optim., 2014
Zagreb Eccentricity Indices of the Generalized Hierarchical Product Graphs and Their Applications.
J. Appl. Math., 2014
Discret. Appl. Math., 2014
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
J. Graph Theory, 2013
Graphs Comb., 2013
The Vertex Linear Arboricity of a Special Class of Integer Distance Graphs.
Ars Comb., 2013
2012
1-s2.0-S0012365X11004973-si1-forested choosability of planar graphs and sparse graphs.
Discret. Math., 2012
Discret. Math., 2012
Discret. Appl. Math., 2012
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
Discret. Math., 2011
Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles.
Discret. Math., 2011
Edge colorings of planar graphs with maximum degree five.
Ars Comb., 2011
2010
Vertex-disjoint triangles in K<sub>1, t</sub>-free graphs with minimum degree at least t.
Discret. Math., 2010
CoRR, 2010
CoRR, 2010
2009
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
SIAM J. Discret. Math., 2008
J. Graph Theory, 2008
Discret. Math., 2008
The Vertex Linear Arboricity of Claw-Free Graphs with Small Degree.
Ars Comb., 2008
2007
Theor. Comput. Sci., 2007
Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007
Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007
Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007
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
2005
Two sufficient conditions for a graph to be type 1.
Ars Comb., 2005
2004
Discuss. Math. Graph Theory, 2004
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
2000
1999