Yezhou Wu

Orcid: 0000-0001-9608-6942

According to our database1, Yezhou Wu authored at least 25 papers between 2007 and 2022.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
On 3-flow-critical graphs.
Eur. J. Comb., 2022

2021
Packet-Level Slot Scheduling MAC Protocol in Underwater Acoustic Sensor Networks.
IEEE Internet Things J., 2021

2020
Minimum T-Joins and Signed-Circuit Covering.
SIAM J. Discret. Math., 2020

Circular flows via extended Tutte orientations.
J. Comb. Theory, Ser. B, 2020

Contractible graphs for flow index less than three.
Discret. Math., 2020

2019
Vehicle Classification Based on Seismic Signatures Using Convolutional Neural Network.
IEEE Geosci. Remote. Sens. Lett., 2019

Delay and Queue Aware Adaptive Scheduling- Based MAC Protocol for Underwater Acoustic Sensor Networks.
IEEE Access, 2019

2018
Circuit covers of cubic signed graphs.
J. Graph Theory, 2018

Counterexamples to Jaeger's Circular Flow Conjecture.
J. Comb. Theory, Ser. B, 2018

Circuit Decompositions and Shortest Circuit Coverings of Hypergraphs.
Graphs Comb., 2018

The flow index and strongly connected orientations.
Eur. J. Comb., 2018

An Enhanced Clustering-Based Method for Determining Time-of-Day Breakpoints Through Process Optimization.
IEEE Access, 2018

Time-based adaptive collision-avoidance real-time MAC protocol for underwater acoustic sensor networks.
Proceedings of the Thirteenth ACM International Conference on Underwater Networks & Systems, 2018

2017
Vertex-coloring 3-edge-weighting of some graphs.
Discret. Math., 2017

2016
The 3-flow conjecture, factors modulo k, and the 1-2-3-conjecture.
J. Comb. Theory, Ser. B, 2016

Uniquely forced perfect matching and unique 3-edge-coloring.
Discret. Appl. Math., 2016

2014
Nowhere-Zero 3-Flows in Signed Graphs.
SIAM J. Discret. Math., 2014

Optimal local community detection in social networks based on density drop of subgraphs.
Pattern Recognit. Lett., 2014

A note on an extremal problem for group-connectivity.
Eur. J. Comb., 2014

2013
Nowhere-zero 3-flows and modulo k-orientations.
J. Comb. Theory, Ser. B, 2013

2012
Laplacian centrality: A new centrality measure for weighted networks.
Inf. Sci., 2012

Optimal Clustering Selection on Hierarchical System Network.
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2012

2010
Feedback numbers of de Bruijn digraphs.
Comput. Math. Appl., 2010

2009
A Characterization of Almost CIS Graphs.
SIAM J. Discret. Math., 2009

2007
Feedback numbers of Kautz digraphs.
Discret. Math., 2007


  Loading...