Jiazhen Cai

5 books

Sep 10, 2018
Cover of More Efficient Bottom-Up Multipattern Matching in Trees (Classic Reprint)

More Efficient Bottom-Up Multipattern Matching in Trees (Classic Reprint)

Jul 31, 2018
Cover of Counting Embeddings of Planar Graphs Using Dfs Trees (Classic Reprint)

Counting Embeddings of Planar Graphs Using Dfs Trees (Classic Reprint)

May 3, 2018
Cover of An O(m Log N) Time Algorithm for the Maximal Planar Subgraph Problem (Classic Reprint)

An O(m Log N) Time Algorithm for the Maximal Planar Subgraph Problem (Classic Reprint)

Sep 8, 2011
Cover of An O(n Log N) Algorithm for the Maximal Planar Subgraph Problem

An O(n Log N) Algorithm for the Maximal Planar Subgraph Problem

Sep 3, 2011
Cover of More Efficient Bottom-Up Multipattern Matching in Trees

More Efficient Bottom-Up Multipattern Matching in Trees