Keyphrases
Treewidth
66%
Parameterized Complexity
62%
Polynomial Time
43%
Time Algorithm
36%
H-free Graph
33%
NP-complete
31%
Vertex Cover
26%
Planar Graph
26%
Graph Classes
26%
Path Length
26%
Gonality
23%
Exponential-time Algorithms
23%
Exponential Time Hypothesis
22%
Tight
22%
Steiner Tree
21%
Graph Problems
18%
Induced Disjoint Paths
17%
Scheduling Problem
17%
Tree Decomposition
16%
Fixed-parameter Tractability
16%
Induced Subgraph
16%
Treedepth
15%
Subcubic Graph
15%
Complexity Frameworks
15%
Forbidden Subgraph
15%
Subset Sum
15%
NP-hard
15%
Polynomial Space
15%
Number of Vertices
14%
Multiway Cut
14%
Polynomial-time Algorithm
13%
Parameterized Algorithms
13%
Polynomial Kernel
12%
Connected Subgraphs
12%
Feedback Vertex Set
12%
Computational Complexity
12%
Bounded Treewidth
12%
Cutwidth
12%
Hamiltonian Cycle
11%
Parameterized Problems
11%
Dominating Set
11%
Disjoint
11%
Fast Algorithm
11%
Bipartite Graph
11%
Exact Algorithm
10%
Dynamic Programming Algorithm
10%
Graph Decomposition
10%
Maximum Degree
10%
Graph Algorithms
10%
Problem Recognition
10%
Randomized Algorithms
9%
Precedence Constraints
9%
Multigraph
9%
Exponential Time
9%
Logarithmic Space
9%
Improved Algorithm
9%
Hereditary Graph Class
8%
Euclidean TSP
8%
Adjacency List
8%
Connection Problem
8%
Rainbow
8%
Odd Cycle Transversal
8%
Packing Problem
8%
Complexity Classes
8%
Meta-classification
8%
Finite Sets
8%
Complexity Results
8%
Connected Graph
8%
Approximation Algorithms
8%
Additive Combinatorics
8%
Intersection Graph
7%
Makespan
7%
Tree Partitioning
7%
Tight Bounds
7%
Sparse Graphs
7%
Linear Time
7%
Random Bits
7%
Local Search Algorithm
7%
Number of Edges
7%
Competitive Ratio
7%
Separator
7%
NP-completeness
7%
Subexponential
7%
Induced Path
7%
Adjacent Vertices
7%
Strong Exponential Time Hypothesis
7%
MaxCut
6%
O Stars
6%
Orthogonal Vectors
6%
Streaming Model
6%
Steiner Forest
6%
Shrub-depth
6%
Shunt
6%
Efficient Parameterized Algorithms
6%
Rainbow Vertex Coloring
6%
Bin Packing
6%
Capacitated
6%
Fixed-parameter Algorithms
6%
Graph Isomorphism
6%
Specified Vertices
6%
Mathematics
Polynomial Time
100%
Free Graph
91%
Edge
83%
Polynomial
61%
Integer
49%
Exponential Time
49%
Running Time
40%
Planar Graph
30%
Independent Set
30%
Induced Subgraph
27%
Minimizes
24%
Upper Bound
20%
Open Problem
18%
Connected Graph
18%
Dominating Set
18%
Hamiltonian Cycle
16%
Linear Time
15%
Maximum Degree
15%
Subset Sum
14%
Complexity Space
13%
Competitive Ratio
12%
Fast Algorithm
12%
Clique
11%
Adjacency
11%
Linear Programming
11%
Transversals
11%
Intersects
10%
Bipartite Graph
10%
Multigraph
10%
Unit Disk
9%
Matrix
9%
Kernelization
9%
Finite Set
9%
Intersection Graph
9%
Maximum Independent Set
9%
Matrix Multiplication
8%
Time Step
8%
Packing Problem
8%
Solvability
8%
Open Question
8%
Interval Graph
7%
Max-Cut
7%
Natural Generalization
7%
Combinatorics
7%
Permutation
7%
Omits
7%
Complete Classification
7%
Conditionals
6%
Orthogonal Vector
6%
Computable Function
6%
Connected Component
6%
Clique-width
6%
Existential Theory
6%
Metric Space
6%
Subproblem
5%
Path Problem
5%
Polygon
5%
Sparse Graphs
5%
Local Search
5%
Art Gallery Problem
5%
Weighted Tree
5%
Tree Problem
5%
Partial Order
5%
Wide Variety
5%
Partition Tree
5%
NP-hard Problem
5%
Graph Coloring
5%
Computer Science
Polynomial Time
34%
Subgraphs
29%
Polynomial Space
18%
Scheduling Problem
17%
Planar Graph
16%
Complexity Class
16%
Space Complexity
14%
Independent Set
13%
Fast Algorithm
13%
Exact Algorithm
12%
Computational Complexity
12%
Precedence Constraint
12%
Tree Decomposition
11%
Adjacency List
11%
steiner tree
10%
Dynamic Programming
10%
on-line algorithm
9%
Bipartite Graph
9%
Time Complexity
8%
Connectivity Problem
8%
Intersection Graph
8%
Partition Tree
8%
Randomized Algorithm
8%
Competitive Ratio
8%
Directed Graphs
8%
polynomial-time algorithm
7%
Connected Graph
7%
Computable Function
7%
Recognition Problem
7%
Logarithmic Space
6%
Directed Acyclic Graph
6%
Hamiltonian Cycle
6%
Bin Packing Problem
6%
Adjacency List Model
6%
Constant Parameter
6%
Parameter Value
6%
Spanning Tree
6%
System Analysis
6%
Operations Research
6%
Approximation (Algorithm)
6%
Efficient Algorithm
5%
NP-completeness
5%
Network Design Problem
5%
Integer-Linear Programming
5%
Coloring Problem
5%
Simulation Study
5%
Partial Order
5%
Dynamic Programming Algorithm
5%
Polynomial Equation
5%
Positive Integer
5%
Space Exponential
5%