default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJ. F. Weng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2002
[c3]Shu Hung Leung, Y. Xiong, J. F. Weng, Chi Fuk So, Wing Hong Lau:
Performance analysis of nonlinear RLS in mixture noise. ISCAS (5) 2002: 357-360- 2001
- [j15]J. F. Weng, J. MacGregor Smith:
Steiner Minimal Trees with One Polygonal Obstacle. Algorithmica 29(4): 638-648 (2001) - [j14]J. F. Weng:
Steiner Trees on Curved Surfaces. Graphs Comb. 17(2): 353-363 (2001)
1990 – 1999
- 1999
- [j13]Dan Trietsch, J. F. Weng:
Pseudo-Gilbert-Steiner trees. Networks 33(3): 175-178 (1999) - 1997
- [j12]J. F. Weng:
Expansion of Linear Steiner Trees. Algorithmica 19(3): 318-330 (1997) - [j11]J. F. Weng:
Linear Steiner Trees for Infinite Spirals. SIAM J. Discret. Math. 10(3): 388-398 (1997) - [c2]J. F. Weng:
A new model of generalized Steiner trees and 3-coordinate systems. Network Design: Connectivity and Facilities Location 1997: 415-424 - 1996
- [j10]R. S. Booth, J. F. Weng:
Steiner minimal trees on the union of two orthogonal rectangles. Australas. J Comb. 13: 109-118 (1996) - [c1]J. F. Weng, S. H. Leung, G. G. Bi:
A new neural network based sequence estimator in non-Gaussian noise environment. ICNN 1996: 1582-1587 - 1995
- [j9]J. F. Weng, R. S. Booth:
Steiner minimal trees on regular polygons with centre. Discret. Math. 141(1-3): 259-274 (1995) - 1994
- [j8]J. F. Weng:
Variational approach and Steiner minimal trees on four points. Discret. Math. 132(1-3): 349-362 (1994) - 1993
- [j7]J. F. Weng, Frank K. Hwang:
An optimal group testing algorithm on k disjoint sets. Oper. Res. Lett. 13(1): 43-44 (1993) - 1992
- [j6]R. S. Booth, J. F. Weng:
Steiner Minimal Trees for a Class of Zigzag Lines. Algorithmica 7(2&3): 231-246 (1992) - [j5]Frank K. Hwang, J. F. Weng:
The Shortest Network under a Given Topology. J. Algorithms 13(3): 468-488 (1992) - [j4]J. F. Weng:
Degenerate Gilbert - Steiner trees. Networks 22(4): 335-348 (1992)
1980 – 1989
- 1988
- [j3]Xian M. Chang, Frank K. Hwang, J. F. Weng:
Optimal Detection of Two Defectives with a Parity Check Device. SIAM J. Discret. Math. 1(1): 38-44 (1988) - 1987
- [j2]Ding-Zhu Du, Frank K. Hwang, J. F. Weng:
Steiner Minimal Trees for Regular Polygons. Discret. Comput. Geom. 2: 65-84 (1987) - 1986
- [j1]Frank K. Hwang, J. F. Weng:
Hexagonal coordinate systems and steiner minimal trees. Discret. Math. 62(1): 49-57 (1986)
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 2025-01-09 12:49 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:
