Keyphrases
Planar Graph
96%
Time Algorithm
48%
Query Response Time
33%
Log-log
24%
Distance Oracles
24%
Randomized Algorithms
22%
Edit Distance
21%
Oracle
20%
Voronoi Diagram
19%
Distance Labeling
18%
Minimum Cut
18%
Top Trees
18%
Substring
17%
Shortest Path
16%
Subcubic
15%
Almost Optimal
15%
Tree Compression
14%
Compression System
14%
Approximation Algorithms
13%
Minimum Spanning Tree
13%
Optimal Distance
13%
Submatrices
13%
Fast Matrix multiplication
13%
Monge Matrix
13%
Replacement Paths
13%
Maximum Query
13%
Tree Edit Distance
13%
Near-linear Time
13%
Stackelberg
13%
Deterministic Algorithm
13%
Compressed String
13%
Grammar
12%
Vertex Labeling
11%
Edge Length
11%
Linear Space
11%
Fault-tolerant
10%
Cartesian Tree
10%
Binary String
10%
Near-optimal
9%
Spanning Tree
9%
Update Time
9%
Distance Computation
9%
Path Problems
9%
Matching Problem
9%
Parikh Vectors
9%
Range Minimum Query
9%
Predecessor Search
9%
All-pairs Shortest Paths
9%
Fine-grained Complexity
9%
Bounded Treewidth Graphs
9%
Computer Science
Data Structure
65%
Planar Graph
53%
Compression Scheme
26%
Randomized Algorithm
25%
Fast Algorithm
20%
Directed Graph
13%
Matrix Multiplication
13%
Dynamic Program
13%
Local Coordinate System
13%
Structure Alignment
13%
Run Length Encoding
13%
Dynamic Programming
12%
Preprocessing Time
11%
Spanning Tree
11%
Random Access
9%
Labeling Scheme
9%
Scoring Function
9%
False Positive
9%
Positive Integer
9%
Longest Path
9%
Tree Graph
9%
Deep Understanding
9%
Minimum Spanning Tree
9%
False Negative
9%
Pair Shortest Path Problem
9%
String Selection
9%
Competitive Ratio
9%
Binary Sequence
9%
Solution Space
9%
Local Alignment
9%
Biological Sequence
9%
Weighted Graph
8%
Approximation Algorithm
8%
Pair Shortest Path
7%
Time Complexity
7%
Quadratic Time
7%
Pattern Matching
7%
Polynomial Time
6%
Viterbi Algorithm
6%
Comparative Analysis
6%
Sequence Alignment
6%
String Comparisons
6%
Structural Feature
6%
on-line algorithm
6%
Speed-up
6%
Knapsack
5%
Approximate String Matching
5%
Mathematics
Planar Graph
100%
Edge
50%
Linear Time
24%
Binary String
20%
Minimum Spanning Tree
18%
Running Time
16%
Data Structure
14%
Lower and upper bounds
13%
Decomposition Algorithms
13%
Polynomial Time
13%
Worst Case
12%
Upper Bound
12%
Matrix (Mathematics)
12%
Linear Space
11%
Subproblem
10%
Tree-Like
10%
Elementary Operation
9%
Permutation
9%
Matrix Multiplication
9%
Fast Algorithm
9%
Divide and Conquer
9%
Submatrix
9%
Optimality
9%
Labeled Trees
9%
Outlier
9%
Approximates
9%
Fine-Grained Complexity
9%
Straight Line
9%
Total Length
9%
Line Program
9%
Local Coordinate System
9%
Integer
7%
Spanning Tree
7%
Arc Length
7%
Conditionals
6%
Subsequence
5%
Polynomial
5%
Convolution
5%
