default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJingru Zhang 0002
Person information
- affiliation: University of Texas, Department of Computer Science, TX, USA
- affiliation: Utah State University, Department of Computer Science, Logan, UT, USA
- affiliation: Marshall University, Department of Computer Science, Huntington, WV, USA
Other persons with the same name
- Jingru Zhang (aka: Jing-Ru Zhang) — disambiguation page
- Jingru Zhang 0001 — Cleveland State University, Department of Electrical Engineering and Computer Science, OH, USA
- Jingru Zhang 0004
![[0000-0002-2152-882X]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-2152-882X")
— Nanjing University of Aeronautics and Astronautics, College of Economics and Management, Institute for Grey System Studies, China - Jingru Zhang 0005 — Tsinghua University, Department of Computer Science and Technology, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j7]Haitao Wang, Jingru Zhang:
An O(nlog n)-Time Algorithm for the k-Center Problem in Trees. SIAM J. Comput. 50(2): 602-635 (2021)
2010 – 2019
- 2019
- [j6]Haitao Wang, Jingru Zhang:
Covering Uncertain Points in a Tree. Algorithmica 81(6): 2346-2376 (2019) - [c6]Shimin Li, Zhongjiang Yan, Jingru Zhang:
An Optimal Algorithm for Maintaining Connectivity of Wireless Network on a Line. CCCG 2019: 78-84 - 2018
- [j5]Haitao Wang, Jingru Zhang:
Computing the Rectilinear Center of Uncertain Points in the Plane. Int. J. Comput. Geom. Appl. 28(3): 271-288 (2018) - [c5]Haitao Wang, Jingru Zhang:
An O(n log n)-Time Algorithm for the k-Center Problem in Trees. SoCG 2018: 72:1-72:15 - 2017
- [j4]Haitao Wang, Jingru Zhang:
Computing the Center of Uncertain Points on Tree Networks. Algorithmica 78(1): 232-254 (2017) - [c4]Haitao Wang, Jingru Zhang:
Covering Uncertain Points in a Tree. WADS 2017: 557-568 - [i3]Haitao Wang, Jingru Zhang:
Covering Uncertain Points in a Tree. CoRR abs/1704.07497 (2017) - [i2]Haitao Wang, Jingru Zhang:
An O(n\log n)-Time Algorithm for the k-Center Problem in Trees. CoRR abs/1705.02752 (2017) - 2016
- [j3]Haitao Wang, Jingru Zhang:
Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane. Int. J. Comput. Geom. Appl. 26(3-4): 185-210 (2016) - [j2]Haitao Wang, Jingru Zhang:
A note on computing the center of uncertain data on the real line. Oper. Res. Lett. 44(3): 370-373 (2016) - 2015
- [j1]Haitao Wang, Jingru Zhang:
One-dimensional k-center on uncertain data. Theor. Comput. Sci. 602: 114-124 (2015) - [c3]Haitao Wang, Jingru Zhang:
Computing the Center of Uncertain Points on Tree Networks. WADS 2015: 606-618 - [i1]Haitao Wang, Jingru Zhang:
Computing the Rectilinear Center of Uncertain Points in the Plane. CoRR abs/1509.05377 (2015) - 2014
- [c2]Haitao Wang, Jingru Zhang:
One-Dimensional k-Center on Uncertain Data. COCOON 2014: 104-115 - [c1]Haitao Wang, Jingru Zhang:
Line-Constrained k -Median, k -Means, and k -Center Problems in the Plane. ISAAC 2014: 3-14
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 2025-03-11 21:05 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:
