Computer Science
Data Structure
100%
Subgraphs
53%
Approximation (Algorithm)
32%
Planar Graph
30%
Dynamic Memory Allocation
15%
Constant Factor
15%
Deterministic Case
15%
Intersection Graph
15%
Algorithmic Complexity
15%
Partial Order
15%
Theoretical Computer Science
15%
Dynamic Time Warping
15%
Maximal Matching
11%
Geodesics
10%
Hierarchical Decomposition
7%
Vertex Connectivity
7%
Benchmarking Dataset
7%
Answering Query
7%
Edge Orientation
7%
Dimensional Data
7%
Multiple Region
7%
Connected Component
7%
Source Property
7%
Directed Graphs
7%
Update Operation
7%
Distributed Algorithm
7%
Hausdorff Distance
5%
Distance Measure
5%
Realism
5%
Linear Dependence
5%
Metric Space
5%
Mathematics
Data Structure
38%
Main Result
20%
Subproblem
15%
Arboricity
15%
Constant Time
15%
Frchet-Distance
15%
Worst Case
15%
Constant Factor
15%
Polygon
15%
Order Interval
15%
Partial Order
15%
Local Density
15%
Dynamic Algorithms
12%
Edge
10%
Total Order
10%
One Dimension
10%
Line Segment
7%
Optimal Time
5%
Set Point
5%
Algorithmic Complexity
5%
Map Matching
5%
Lower and upper bounds
5%
Similarity Measure
5%
Outlier
5%
Clique
5%
Keyphrases
Upward Planar Graphs
15%
Upward Planar
15%
Order Information
15%
Interval Order
15%
Nearly-linear Time
15%
Dynamic Time Warping
15%
Dynamic Time Warping Distance
15%
Distributed Approximation
15%
Directed Edges
10%
Imprecise Points
10%
Partial Oracles
10%
Dynamic Convex Hull
9%
Query Response Time
9%
Update Time
9%
Walks on Graphs
7%
Near-shortest Path
7%
Approximate Distance Oracles
7%
Path Metric
7%
2-vertex Connectivity
7%
Combinatorial Embeddings
7%
Snake Game
7%
Maximal Matching
6%
Van Leeuwen
6%
Curve Length
6%
Dynamic Algorithms
6%
Polygon Decomposition
5%
Visibility Polygon
5%
Upward Planarity
5%
Order of a Set
5%
