Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Jiazhen Cai
An $O(m\log N)$-Time Algorithm for the Maximal Planar Subgraph Problem
SIAM Journal on Computing
Mathematics
Computer Science
Related publications
An $O(n^2 \Log N)$ Time Algorithm for the Minmax Angle Triangulation
SIAM Journal on Scientific and Statistical Computing
An O(N Log N) Algorithm for Shape Modeling.
Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
The Degree/Diameter Problem in Maximal Planar Bipartite Graphs
Electronic Journal of Combinatorics
Combinatorics
Applied Mathematics
Mathematics
Geometry
Discrete Mathematics
Computational Theory
Topology
Theoretical Computer Science
An O(log N) Dynamic Router-Table Design
IEEE Transactions on Computers
Hardware
Architecture
Mathematics
Computational Theory
Theoretical Computer Science
Software
A Near-Linear Algorithm for the Planar Segment-Center Problem
Discrete and Computational Geometry
Combinatorics
Mathematics
Geometry
Discrete Mathematics
Computational Theory
Topology
Theoretical Computer Science
An Optimized Divide-And-Conquer Algorithm for the Closest-Pair Problem in the Planar Case
Journal of Computer Science and Technology
Hardware
Computer Science Applications
Architecture
Mathematics
Computational Theory
Theoretical Computer Science
Software
An Ω(n2 Log N) Lower Bound to the Shortest Paths Problem
An Efficient Least Common Subgraph Algorithm for Video Indexing
Chromatic Number in Time O(2.4023^n) Using Maximal Independent Sets
BRICS Report Series
