The following pages link to Ten-Hwang Lai (Q678865):
Displaying 25 items.
- (Q216255) (redirect page) (← links)
- Bipartite permutation graphs with application to the minimum buffer size problem (Q678867) (← links)
- On the complexity of a family of generalized matching problems (Q1068535) (← links)
- On distributed snapshots (Q1107971) (← links)
- A note on anomalies in parallel branch-and-bound algorithms with one-to- one bounding functions (Q1107978) (← links)
- Preemptive scheduling of independent jobs on a hypercube (Q1111373) (← links)
- Scheduling independent jobs on partitionable hypercubes (Q1177086) (← links)
- The edge Hamiltonian path problem is NP-complete for bipartite graphs (Q1210313) (← links)
- Triangulation on reconfigurable meshes: A natural decomposition approach (Q1900321) (← links)
- An optimal algorithm for the minimum disc cover problem (Q2471803) (← links)
- On the embedding of a class of regular graphs in a faulty hypercube (Q2563981) (← links)
- A Novel Coding Scheme for Secure Communications in Distributed RFID Systems (Q2985615) (← links)
- Nearly on-line scheduling of multiprocessor systems with memories (Q3314988) (← links)
- Preemptive Scheduling of a Multiprocessor System with Memories to Minimize Maximum Lateness (Q3340134) (← links)
- The complexity of congestion-1 embedding in a hypercube (Q3361890) (← links)
- Performance of parallel branch-and-bound algorithms (Q3686027) (← links)
- Anomalies in parallel branch-and-bound algorithms (Q3713596) (← links)
- (Q3731023) (← links)
- (Q3780411) (← links)
- (Q3787470) (← links)
- On the routability of a convex grid (Q3789066) (← links)
- Algorithms for Page Retrieval and Hamiltonian Paths on Forward-Convex Line Graphs (Q4327827) (← links)
- (Q4893480) (← links)
- Placement of the processors of a hypercube (Q5375402) (← links)
- Dynamic carrier allocation strategies for mobile cellular networks (Q5949543) (← links)
