| cytoHubba: identifying hub objects and sub-networks from complex interactome. | 10 | 0.76 | 2014 |
| A hub-attachment based method to detect functional modules from confidence-scored protein interactions and expression profiles. | 17 | 0.54 | 2010 |
| Hubba: Hub Objects Analyzer - A Framework Of Interactome Hubs Identification For Network Biology | 31 | 1.27 | 2008 |
| Node-searching problem on block graphs | 7 | 0.45 | 2008 |
| Affordances of mobile technologies for experiential learning: the interplay of technology and pedagogical practices | 54 | 2.75 | 2007 |
| The Hamiltonian problem on distance-hereditary graphs | 11 | 0.58 | 2006 |
| EduBingo: a bingo-like game for mathematics skill building | 0 | 0.34 | 2005 |
| Improving experiential learning with mobile technologies | 3 | 0.66 | 2005 |
| Exploring major events and the accumulated user forecasting model to support building Web-based learning communities - preliminary analysis from the school for all | 0 | 0.34 | 2004 |
| Powers Of Asteroidal Triple-Free Graphs With Applications | 10 | 0.66 | 2003 |
| Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs | 6 | 0.49 | 2002 |
| A Web-Based Information-Learning-Passport System Using the ARCS Model | 1 | 0.37 | 2002 |
| Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs | 7 | 0.46 | 2002 |
| Longest fault-free paths in star graphs with edge faults | 49 | 2.01 | 2001 |
| Longest fault-free paths in star graphs with vertex faults | 38 | 1.37 | 2001 |
| Hamiltonian-laceability of star graphs | 16 | 2.41 | 2000 |
| Edge and node searching problems on trees | 13 | 0.63 | 2000 |
| A faster implementation of a parallel tree contraction scheme and its application on distance-hereditary graphics | 10 | 0.55 | 2000 |
| Graph Searching on Some Subclasses of Chordal Graphs | 18 | 0.85 | 2000 |
| LexBFS-Ordering in Asteroidal Triple-Free Graphs | 11 | 0.95 | 1999 |
| Efficient Parallel Algorithms on Distance Hereditary Graphs. | 0 | 0.34 | 1999 |
| Parallel Decomposition of Generalized Series-Parallel Graphs | 3 | 0.48 | 1999 |
| Wavelet-based off-line handwritten signature verification | 26 | 1.92 | 1999 |
| Solving the all-pairs-shortest-length problem on chordal bipartite graphs | 5 | 0.46 | 1999 |
| Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs | 76 | 5.21 | 1999 |
| Efficient Broadcasting in Wormhole-Routed Multicomputers: A Network-Partitioning Approach | 54 | 1.55 | 1999 |
| A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree | 1 | 0.36 | 1998 |
| Embed longest rings onto star graphs with vertex faults | 16 | 1.18 | 1998 |
| Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs | 3 | 0.41 | 1998 |
| A New Simple Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs | 2 | 0.40 | 1998 |
| The recognition of geodetically connected graphs | 5 | 0.65 | 1998 |
| An Optimal Parallel Algorithm for the Perfect Dominating Set Problem on Distance-Hereditary Graphs | 0 | 0.34 | 1998 |
| An efficient parallel strategy for computing K-terminal reliability and finding most vital edges in 2-trees and partial 2-trees | 1 | 0.38 | 1998 |
| Efficient Parallel Algorithms on Distance-Hereditary Graphs | 3 | 0.43 | 1997 |
| Fault-tolerant ring embedding in faulty arrangement graphs | 3 | 0.42 | 1997 |
| Graph Searching on Chordal Graphs | 9 | 0.69 | 1996 |
| Efficient single-node broadcast in wormhole-routed multicomputers: a network-partitioning approach. | 5 | 0.57 | 1996 |
| An extension of the bipartite weighted matching problem | 5 | 0.64 | 1995 |
| A Stroke-Based Handwritten Chinese Character Recognition System Using Greedy Matching Method | 1 | 0.37 | 1995 |
| An Efficient Parallel Strategy for Recognizing Series-Parallel Graphs | 0 | 0.34 | 1994 |
| Synthesizing the Parallelism of Nested Loops Using An Index Shift Method | 0 | 0.34 | 1991 |
| On the Parallelism of Nested For-Loops Using Index Shift Method | 25 | 2.05 | 1990 |
| Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs | 18 | 1.29 | 1988 |
