Lets Explore,

Medical Exams
Manga
Award Winners
Featured Authors
Today's Deal

Vidya AI

Company

About Us
Career
Blog
YT Featured Video
Contact Us

Policies

Privacy Policies
Terms of Use
Secure Shopping
Copyright Policy

Help

Payment
Shipping
Return
FAQ

Misc

Affiliate
Sitemap

Download Our App

Copyright © 2026 | Bookswagon.com | All Rights Reserved

BW

Filters

Rs.500 - Rs.1000(6)

Rs.1000 - Rs.2000(3)

Above Rs.2000(3)

Jiazhen Cai

Books by Author

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

Jiazhen Cai

₹1347.0₹1320.0

Cover of More Efficient Bottom-up Multipattern Matching in Trees

More Efficient Bottom-up Multipattern Matching in Trees

Jiazhen Cai

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

Jiazhen Cai

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

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

Jiazhen Cai

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

Jiazhen Cai

₹1323.0₹992.0

Cover of More Efficient Bottom-Up Multipattern Matching in Trees

More Efficient Bottom-Up Multipattern Matching in Trees

Jiazhen Cai

₹1323.0₹992.0

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)

Jiazhen Cai

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

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

Jiazhen Cai

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

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

Jiazhen Cai

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

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

Jiazhen Cai

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)

Jiazhen Cai

Cover of More Efficient Bottom-up Multipattern Matching in Trees

More Efficient Bottom-up Multipattern Matching in Trees

Jiazhen Cai