Wenbo Zhao

Affiliations:
  • University of California, Department of Computer Science and Engineering, San Diego, CA, USA (PhD 2012)


According to our database1, Wenbo Zhao authored at least 19 papers between 2006 and 2014.

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

2014
Ranking and Sparsifying a Connection Graph.
Internet Math., 2014

2013
Routing and scheduling for energy and delay minimization in the powerdown model.
Networks, 2013

Complexity and Approximation Results for the Min-Sum and Min-Max Disjoint Paths Problems.
Comput. Informatics, 2013

2012
Ranking and sparsifying edges of a graph.
PhD thesis, 2012

Routing for Power Minimization in the Speed Scaling Model.
IEEE/ACM Trans. Netw., 2012

Braess's paradox in expanders.
Random Struct. Algorithms, 2012

Ranking and Sparsifying a Connection Graph.
Proceedings of the Algorithms and Models for the Web Graph - 9th International Workshop, 2012

Character design and stamp algorithms for Character Projection Electron-Beam Lithography.
Proceedings of the 17th Asia and South Pacific Design Automation Conference, 2012

2011
Approximation and hardness results for label cut and related problems.
J. Comb. Optim., 2011

2010
Clustering with feature order preferences.
Intell. Data Anal., 2010

A Sharp PageRank Algorithm with Applications to Edge Ranking and Graph Sparsification.
Proceedings of the Algorithms and Models for the Web-Graph - 7th International Workshop, 2010

Routing for Energy Minimization in the Speed Scaling Model.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

An adaptive parallel flow for power distribution network simulation using discrete Fourier transform.
Proceedings of the 15th Asia South Pacific Design Automation Conference, 2010

2009
On the bound of time-domain power supply noise based on frequency-domain target impedance.
Proceedings of the 11th International Workshop on System-Level Interconnect Prediction (SLIP 2009), 2009

2008
Analysis of greedy approximations with nonsubmodular potential functions.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007
Computational complexity of counting problems on 3-regular planar graphs.
Theor. Comput. Sci., 2007

Approximation to the Minimum Rooted Star Cover Problem.
Proceedings of the Theory and Applications of Models of Computation, 2007

On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems.
Proceedings of the Combinatorics, 2007

2006
A network flow approach to the Minimum Common Integer Partition Problem.
Theor. Comput. Sci., 2006


  Loading...