The following pages link to Chang Wu Yu (Q209324):
Displaying 11 items.
- (Q672467) (redirect page) (← links)
- Efficient parallel algorithms for doubly convex-bipartite graphs (Q672468) (← links)
- The weighted maximum independent set problem in permutation graphs (Q1195927) (← links)
- On the complexity of the k-chain subgraph cover problem (Q1275070) (← links)
- Parallel algorithms for permutation graphs (Q1314630) (← links)
- A theorem on permutation graphs with applications (Q1328502) (← links)
- On the Complexity of the Max-Edge-Coloring Problem with Its Variants (Q3611926) (← links)
- Quantitative Analysis of Multi-hop Wireless Networks Using a Novel Paradigm (Q3611927) (← links)
- Generate all maximal independent sets in permutation graphs (Q4323409) (← links)
- Formal Techniques for Networked and Distributed Systems - FORTE 2005 (Q5479175) (← links)
- On the complexity of the maximum biplanar subgraph problem (Q5946290) (← links)
