The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
J. F. Weng: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. S. H. Leung, Y. Xiong, J. F. Weng, C. F. So, W. H. Lau
    Performance analysis of nonlinear RLS in mixture noise. [Citation Graph (0, 0)][DBLP]
    ISCAS (5), 2002, pp:357-360 [Conf]
  2. R. S. Booth, J. F. Weng
    Steiner Minimal Trees for a Class of Zigzag Lines. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:7, n:2&3, pp:231-246 [Journal]
  3. Marcus Brazil, D. A. Thomas, J. F. Weng, Martin Zachariasen
    Canonical Forms and Algorithms for Steiner Trees in Uniform Orientation Metrics. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:44, n:4, pp:281-300 [Journal]
  4. J. F. Weng
    Expansion of Linear Steiner Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:19, n:3, pp:318-330 [Journal]
  5. J. F. Weng, J. MacGregor Smith
    Steiner Minimal Trees with One Polygonal Obstacle. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:29, n:4, pp:638-648 [Journal]
  6. Marcus Brazil, D. A. Thomas, J. F. Weng
    Locally minimal uniformly oriented shortest networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:18, pp:2545-2564 [Journal]
  7. Ding-Zhu Du, Frank K. Hwang, J. F. Weng
    Steiner Minimal Trees for Regular Polygons. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1987, v:2, n:, pp:65-84 [Journal]
  8. J. F. Weng, J. H. Rubinstein
    A note on the compression theorem for convex surfaces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:212, n:3, pp:257-260 [Journal]
  9. J. F. Weng
    Steiner Trees on Curved Surfaces. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:2, pp:353-363 [Journal]
  10. Frank K. Hwang, J. F. Weng
    The Shortest Network under a Given Topology. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1992, v:13, n:3, pp:468-488 [Journal]
  11. Marcus Brazil, D. A. Thomas, J. F. Weng
    On the Complexity of the Steiner Problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2000, v:4, n:2, pp:187-195 [Journal]
  12. J. H. Rubinstein, J. F. Weng
    Compression Theorems and Steiner Ratios on Spheres. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1997, v:1, n:1, pp:67-78 [Journal]
  13. Marcus Brazil, T. Cole, J. H. Rubinstein, D. A. Thomas, J. F. Weng, Nicholas C. Wormald
    Minimal Steiner Trees for 2k×2k Square Lattices. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:73, n:1, pp:91-110 [Journal]
  14. Marcus Brazil, J. H. Rubinstein, D. A. Thomas, J. F. Weng, Nicholas C. Wormald
    Minimal Steiner Trees for Rectangular Arrays of Lattice Points. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1997, v:79, n:2, pp:181-208 [Journal]
  15. Marcus Brazil, J. H. Rubinstein, D. A. Thomas, J. F. Weng, Nicholas C. Wormald
    Full Minimal Steiner Trees on Lattice Sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1997, v:78, n:1, pp:51-91 [Journal]
  16. Marcus Brazil, D. A. Thomas, J. F. Weng
    Forbidden subpaths for Steiner minimum networks in uniform orientation metrics. [Citation Graph (0, 0)][DBLP]
    Networks, 2002, v:39, n:4, pp:186-202 [Journal]
  17. Marcus Brazil, D. A. Thomas, J. F. Weng
    A polynomial time algorithm for rectilinear Steiner trees with terminals constrained to curves. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:33, n:2, pp:145-155 [Journal]
  18. Dan Trietsch, J. F. Weng
    Pseudo-Gilbert-Steiner trees. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:33, n:3, pp:175-178 [Journal]
  19. D. A. Thomas, J. F. Weng
    Minimum cost flow-dependent communication networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:48, n:1, pp:39-46 [Journal]
  20. Marcus Brazil, D. A. Thomas, J. F. Weng
    Minimum Networks in Uniform Orientation Metrics. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:5, pp:1579-1593 [Journal]
  21. Xian M. Chang, Frank K. Hwang, J. F. Weng
    Optimal Detection of Two Defectives with a Parity Check Device. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:1, pp:38-44 [Journal]
  22. J. F. Weng
    Linear Steiner Trees for Infinite Spirals. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:3, pp:388-398 [Journal]
  23. Frank K. Hwang, J. F. Weng
    Hexagonal coordinate systems and steiner minimal trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:62, n:1, pp:49-57 [Journal]
  24. J. F. Weng, R. S. Booth
    Steiner minimal trees on regular polygons with centre. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:259-274 [Journal]
  25. J. F. Weng
    Variational approach and Steiner minimal trees on four points. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:132, n:1-3, pp:349-362 [Journal]

Search in 0.007secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002