The following pages link to Xiao-Jun Shen (Q912392):
Displaying 18 items.
- (Q170443) (redirect page) (← links)
- An efficient parallel algorithm for building the separating tree (Q666141) (← links)
- Covering convex sets with non-overlapping polygons (Q912393) (← links)
- A tight lower bound on the size of visibility graphs (Q1098639) (← links)
- Finding the k most vital edges in the minimum spanning tree problem (Q1127438) (← links)
- Scheduling on a hypercube (Q1183498) (← links)
- The 4-star graph is not a subgraph of any hypercube (Q1209989) (← links)
- Rearrangeable graphs (Q1606959) (← links)
- A note on minimal visibility graphs (Q1802067) (← links)
- Generalized Latin squares. II (Q1897439) (← links)
- Parallel algorithms for the edge-coloring and edge-coloring update problems (Q1911806) (← links)
- Partitionability of \(k\)-extra-stage omega networks and an optimal task migration algorithm (Q1974678) (← links)
- Deadline guaranteed packet scheduling for overloaded traffic in input-queued switches (Q2378529) (← links)
- A study on the weak barrier coverage problem in wireless sensor networks (Q2431451) (← links)
- A Nearly Optimal Packet Scheduling Algorithm for Input Queued Switches with Deadline Guarantees (Q2982231) (← links)
- More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case (Q3204043) (← links)
- More Nearly Optimal Algorithms for Unbounded Searching, II:The Transfinite Case (Q3204044) (← links)
- Conservative algorithms for parallel and sequential integer sorting (Q6085719) (← links)
