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

Search the dblp DataBase

Title:
Author:
Jimmy J. M. Tan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. W. T. Liou, Jimmy J. M. Tan, Richard C. T. Lee
    Minimum Partitioning Simple Rectilinear Polygons in o(n log log n) Time. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:344-353 [Conf]
  2. Ming-Chien Yang, Jimmy J. M. Tan, Lih-Hsing Hsu
    Cycles in Highly Faulty Hypercubes. [Citation Graph (0, 0)][DBLP]
    FCS, 2005, pp:101-110 [Conf]
  3. Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu
    Hamiltonian laceability on edge fault star graph. [Citation Graph (0, 0)][DBLP]
    ICPADS, 2002, pp:23-0 [Conf]
  4. Hong-Chun Hsu, Liang-Chih Chiang, Jimmy J. M. Tan, Lih-Hsing Hsu
    Ring Embedding in Faulty Augmented Cubes. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2004, pp:155-161 [Conf]
  5. Yuan-Hsiang Teng, Jimmy J. M. Tan, Tung-Yang Ho, Lih-Hsing Hsu
    On mutually independent hamiltonian paths. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2006, v:19, n:4, pp:345-350 [Journal]
  6. Jimmy J. M. Tan
    A Maximum Stable Matching for the Roommates Problem. [Citation Graph (0, 0)][DBLP]
    BIT, 1990, v:30, n:4, pp:631-640 [Journal]
  7. Wen-Tzeng Huang, Yen-Chu Chuang, Jimmy J. M. Tan, Lih-Hsing Hsu
    Fault-Free Hamiltonian Cycle in Faulty Möbius Cubes. [Citation Graph (0, 0)][DBLP]
    Computación y Sistemas, 2000, v:4, n:2, pp:106-114 [Journal]
  8. Jimmy J. M. Tan, Yuang-Cheh Hsueh
    A Generalization of the Stable Matching Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:59, n:1, pp:87-102 [Journal]
  9. Ming-Chien Yang, Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu
    Fault-Tolerant Pancyclicity of the Möbius Cubes. [Citation Graph (0, 0)][DBLP]
    IEICE Transactions, 2005, v:88, n:1, pp:346-352 [Journal]
  10. Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu, Ting-Yi Sung
    The shuffle-cubes and their generalization. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:77, n:1, pp:35-41 [Journal]
  11. Tseng-Kuei Li, Chang-Hsiung Tsai, Jimmy J. M. Tan, Lih-Hsing Hsu
    Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:2, pp:107-110 [Journal]
  12. Chang-Hsiung Tsai, Jimmy J. M. Tan, Lih-Hsing Hsu
    The super-connected property of recursive circulant graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:91, n:6, pp:293-298 [Journal]
  13. Chang-Hsiung Tsai, Jimmy J. M. Tan, Tyne Liang, Lih-Hsing Hsu
    Fault-tolerant hamiltonian laceability of hypercubes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:6, pp:301-306 [Journal]
  14. Ming-Chien Yang, Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu
    Fault-tolerant cycle-embedding of crossed cubes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:88, n:4, pp:149-154 [Journal]
  15. Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu
    Hyper hamiltonian laceability on edge fault star graph. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2004, v:165, n:1-2, pp:59-71 [Journal]
  16. Jyh-Jian Sheu, Jimmy J. M. Tan, Lih-Hsing Hsu
    Routing properties of supercubes. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2001, v:131, n:1-4, pp:107-128 [Journal]
  17. Ming-Chien Yang, Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu
    On embedding cycles into faulty twisted cubes. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2006, v:176, n:6, pp:676-690 [Journal]
  18. Jimmy J. M. Tan
    A Necessary and Sufficient Condition for the Existence of a Complete Stable Matching. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1991, v:12, n:1, pp:154-178 [Journal]
  19. Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu, Ting-Yi Sung
    Optimum Congested Routing Strategy on Twisted Cubes. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2000, v:1, n:2, pp:115-134 [Journal]
  20. Chang-Hsiung Tsai, Jimmy J. M. Tan, Yen-Chu Chuang, Lih-Hsing Hsu
    Hamiltonian Properties of Faulty Recursive Circulant Graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2002, v:3, n:3-4, pp:273-289 [Journal]
  21. Wen-Tzeng Huang, Jimmy J. M. Tan, Chun-Nan Hung, Lih-Hsing Hsu
    Fault-Tolerant Hamiltonicity of Twisted Cubes. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2002, v:62, n:4, pp:591-604 [Journal]
  22. Ming-Chien Yang, Jimmy J. M. Tan, Lih-Hsing Hsu
    Highly fault-tolerant cycle embeddings of hypercubes. [Citation Graph (0, 0)][DBLP]
    Journal of Systems Architecture, 2007, v:53, n:4, pp:227-232 [Journal]
  23. Hong-Chun Hsu, Yi-Lin Hsieh, Jimmy J. M. Tan, Lih-Hsing Hsu
    Fault Hamiltonicity and fault Hamiltonian connectivity of the (n, k)-star graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:42, n:4, pp:189-201 [Journal]
  24. Jeng-Jung Wang, Chun-Nan Hung, Jimmy J. M. Tan, Lih-Hsing Hsu, Ting-Yi Sung
    Construction schemes for fault-tolerant Hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:35, n:3, pp:233-245 [Journal]
  25. Hong-Chun Hsu, Liang-Chih Chiang, Jimmy J. M. Tan, Lih-Hsing Hsu
    Fault hamiltonicity of augmented cubes. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 2005, v:31, n:1, pp:131-145 [Journal]
  26. Yuan-Hsiang Teng, Jimmy J. M. Tan, Lih-Hsing Hsu
    Honeycomb rectangular disks. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 2005, v:31, n:3-4, pp:371-388 [Journal]
  27. Chien-Ping Chang, Pao-Lien Lai, Jimmy J. M. Tan, Lih-Hsing Hsu
    Diagnosability of t-Connected Networks and Product Networks under the Comparison Diagnosis Model. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2004, v:53, n:12, pp:1582-1590 [Journal]
  28. Hong-Chun Hsu, Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu
    Fault Hamiltonicity and Fault Hamiltonian Connectivity of the Arrangement Graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2004, v:53, n:1, pp:39-53 [Journal]
  29. Pao-Lien Lai, Jimmy J. M. Tan, Chien-Ping Chang, Lih-Hsing Hsu
    Conditional Diagnosability Measures for Large Multiprocessor Systems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2005, v:54, n:2, pp:165-175 [Journal]
  30. Pao-Lien Lai, Jimmy J. M. Tan, Chang-Hsiung Tsai, Lih-Hsing Hsu
    The Diagnosability of the Matching Composition Network under the Comparison Diagnosis Model. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2004, v:53, n:8, pp:1064-1069 [Journal]
  31. W. T. Liou, Jimmy J. M. Tan, Richard C. T. Lee
    Minimum rectangular partition problem for simple rectilinear polygons. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1990, v:9, n:7, pp:720-733 [Journal]
  32. Guo-Huang Hsu, Jimmy J. M. Tan
    A Local Diagnosability Measure for Multiprocessor Systems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2007, v:18, n:5, pp:598-607 [Journal]
  33. Y-Chuang Chen, Lih-Hsing Hsu, Jimmy J. M. Tan
    A recursively construction scheme for super fault-tolerant hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
    Applied Mathematics and Computation, 2006, v:177, n:2, pp:465-481 [Journal]
  34. Ming-Chien Yang, Jimmy J. M. Tan, Lih-Hsing Hsu
    Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2007, v:67, n:4, pp:362-368 [Journal]
  35. Cheng-Kuan Lin, Jimmy J. M. Tan, D. Frank Hsu, Lih-Hsing Hsu
    On the spanning connectivity and spanning laceability of hypercube-like networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:381, n:1-3, pp:218-229 [Journal]

  36. Maximally Local Connectivity on Augmented Cubes. [Citation Graph (, )][DBLP]


  37. On the Longest Fault-Free Paths in Hypercubes with More Faulty Nodes. [Citation Graph (, )][DBLP]


  38. Mutually Independent Hamiltonianicity of Pancake Graphs and Star Graphs. [Citation Graph (, )][DBLP]


  39. Fault-Tolerant Hamiltonicity of the WK-Recursive Networks. [Citation Graph (, )][DBLP]


  40. The Mutually Independent Bipanconnected Property for Hypercube. [Citation Graph (, )][DBLP]


  41. Fault-Tolerant Maximal Local-Connectivity on the Bubble-Sort Graphs. [Citation Graph (, )][DBLP]


  42. Comparison-Based Diagnosis on Incomplete Star Graphs. [Citation Graph (, )][DBLP]


  43. On the faulty sensor identification algorithm of wireless sensor networks under the PMC diagnosis model. [Citation Graph (, )][DBLP]


  44. Mutually orthogonal hamiltonian connected graphs. [Citation Graph (, )][DBLP]


  45. On the extremal number of edges in hamiltonian connected graphs. [Citation Graph (, )][DBLP]


  46. On the spanning fan-connectivity of graphs. [Citation Graph (, )][DBLP]


  47. On spanning connected graphs. [Citation Graph (, )][DBLP]


  48. Mutually independent hamiltonian cycles for the pancake graphs and the star graphs. [Citation Graph (, )][DBLP]


Search in 0.048secs, Finished in 0.050secs
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