default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWenbo Zhao 0001
Person information
- affiliation (PhD 2012): University of California, Department of Computer Science and Engineering, San Diego, CA, USA
Other persons with the same name
- Wenbo Zhao (aka: Wen-bo Zhao, Wen-Bo Zhao) — disambiguation page
- Wenbo Zhao 0002
![[0000-0002-3019-2328]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0002-3019-2328")
(aka: Wen-Bo Zhao 0002) — Nanyang Technological University, School of Computer Engineering, Singapore (and 1 more) - Wenbo Zhao 0003 — Chinese Academy of Sciences, Key Laboratory of Digital Earth Science, Aerospace Information Research Institute, Beijing, China (and 1 more)
- Wenbo Zhao 0004 — Peng Cheng Laboratory, Shenzhen, China (and 1 more)
- Wenbo Zhao 0005 — Shanghai Jiao Tong University, China (and 1 more)
- Wenbo Zhao 0006 — Amazon Alexa AI, CA, uSA (and 1 more)
- Wenbo Zhao 0007 — Soochow University, School of Mechanical and Electrical Engineering, Suzhou, China
- Wenbo Zhao 0008 — Lanzhou Jiaotong University, School of Traffic and Transportation, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2012
[b1]Wenbo Zhao:
Ranking and sparsifying edges of a graph. University of California, San Diego, USA, 2012
Journal Articles
- 2014
- [j9]Fan Chung Graham, Wenbo Zhao, Mark Kempton:
Ranking and Sparsifying a Connection Graph. Internet Math. 10(1-2): 87-115 (2014) - 2013
- [j8]Peng Zhang, Wenbo Zhao, Daming Zhu:
Complexity and Approximation Results for the Min-Sum and Min-Max Disjoint Paths Problems. Comput. Informatics 32(1): 23-45 (2013) - [j7]Matthew Andrews, Antonio Fernández Anta, Lisa Zhang, Wenbo Zhao:
Routing and scheduling for energy and delay minimization in the powerdown model. Networks 61(3): 226-237 (2013) - 2012
- [j6]Fan Chung Graham, Stephen J. Young, Wenbo Zhao:
Braess's paradox in expanders. Random Struct. Algorithms 41(4): 451-468 (2012) - [j5]Matthew Andrews, Antonio Fernández Anta, Lisa Zhang, Wenbo Zhao:
Routing for Power Minimization in the Speed Scaling Model. IEEE/ACM Trans. Netw. 20(1): 285-294 (2012) - 2011
- [j4]Peng Zhang, Jin-yi Cai, Linqing Tang, Wenbo Zhao:
Approximation and hardness results for label cut and related problems. J. Comb. Optim. 21(2): 192-208 (2011) - 2010
- [j3]Jun Sun, Wenbo Zhao, Jiangwei Xue, Zhiyong Shen, Yi-Dong Shen:
Clustering with feature order preferences. Intell. Data Anal. 14(4): 479-495 (2010) - 2007
- [j2]Mingji Xia, Peng Zhang, Wenbo Zhao:
Computational complexity of counting problems on 3-regular planar graphs. Theor. Comput. Sci. 384(1): 111-125 (2007) - 2006
- [j1]Wenbo Zhao, Peng Zhang, Tao Jiang:
A network flow approach to the Minimum Common Integer Partition Problem. Theor. Comput. Sci. 369(1-3): 456-462 (2006)
Conference and Workshop Papers
- 2012
- [c12]Peng Du, Wenbo Zhao, Shih-Hung Weng, Chung-Kuan Cheng, Ronald L. Graham:
Character design and stamp algorithms for Character Projection Electron-Beam Lithography. ASP-DAC 2012: 725-730 - [c11]Fan Chung Graham, Wenbo Zhao:
Ranking and Sparsifying a Connection Graph. WAW 2012: 66-77 - 2010
- [c10]Xiang Hu, Wenbo Zhao, Peng Du, Amirali Shayan Arani, Chung-Kuan Cheng:
An adaptive parallel flow for power distribution network simulation using discrete Fourier transform. ASP-DAC 2010: 125-130 - [c9]Matthew Andrews, Antonio Fernández, Lisa Zhang, Wenbo Zhao:
Routing and Scheduling for Energy and Delay Minimization in the Powerdown Model. INFOCOM 2010: 21-25 - [c8]Matthew Andrews, Antonio Fernández, Lisa Zhang, Wenbo Zhao:
Routing for Energy Minimization in the Speed Scaling Model. INFOCOM 2010: 2435-2443 - [c7]Fan Chung Graham, Wenbo Zhao:
A Sharp PageRank Algorithm with Applications to Edge Ranking and Graph Sparsification. WAW 2010: 2-14 - 2009
- [c6]Xiang Hu, Wenbo Zhao, Peng Du, Yulei Zhang, Amirali Shayan Arani, Christopher Pan, A. Ege Engin, Chung-Kuan Cheng:
On the bound of time-domain power supply noise based on frequency-domain target impedance. SLIP 2009: 69-76 - [c5]Peng Zhang, Jin-yi Cai, Linqing Tang, Wenbo Zhao:
Approximation and Hardness Results for Label Cut and Related Problems. TAMC 2009: 460-469 - 2008
- [c4]Jun Sun, Wenbo Zhao, Jiangwei Xue, Zhiyong Shen, Yi-Dong Shen:
Clustering with Feature Order Preferences. PRICAI 2008: 382-393 - [c3]Ding-Zhu Du, Ronald L. Graham, Panos M. Pardalos, Peng-Jun Wan, Weili Wu, Wenbo Zhao:
Analysis of greedy approximations with nonsubmodular potential functions. SODA 2008: 167-175 - 2007
- [c2]Peng Zhang, Wenbo Zhao:
On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems. ESCAPE 2007: 70-81 - [c1]Wenbo Zhao, Peng Zhang:
Approximation to the Minimum Rooted Star Cover Problem. TAMC 2007: 670-679
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
