Keyphrases
Treewidth
74%
Parameterized Complexity
69%
Polynomial Time
45%
NP-complete
35%
H-free Graph
35%
Graph Classes
34%
Time Algorithm
31%
Tight
26%
Exponential Time Hypothesis
26%
Vertex Cover
24%
Path Length
24%
Planar Graph
22%
Exponential-time Algorithms
22%
Induced Disjoint Paths
20%
Steiner Tree
20%
Gonality
20%
Fixed-parameter Tractability
19%
Complexity Frameworks
19%
Forbidden Subgraph
19%
Subset Sum
19%
Scheduling Problem
18%
Number of Vertices
17%
Subcubic Graph
17%
Polynomial Space
16%
Induced Subgraph
16%
Graph Problems
15%
NP-hard
15%
Connected Subgraphs
15%
Feedback Vertex Set
15%
Tree Decomposition
15%
Treedepth
14%
Hamiltonian Cycle
14%
Bipartite Graph
14%
Disjoint
13%
Bounded Treewidth
13%
Parameterized Problems
13%
Dominating Set
12%
Maximum Degree
12%
Computational Complexity
12%
Graph Algorithms
12%
Multiway Cut
12%
Cutwidth
12%
Polynomial Kernel
11%
Exact Algorithm
11%
Randomized Algorithms
11%
Hereditary Graph Class
11%
Polynomial-time Algorithm
11%
Multigraph
11%
Exponential Time
11%
Logarithmic Space
11%
Dynamic Programming Algorithm
10%
Euclidean TSP
10%
Rainbow
10%
Fast Algorithm
10%
Parameterized Algorithms
10%
Additive Combinatorics
9%
Packing Problem
9%
Connected Graph
9%
Random Bits
9%
Local Search Algorithm
9%
Precedence Constraints
8%
Competitive Ratio
8%
Complexity Classes
8%
Complexity Results
8%
Separator
8%
Subexponential
8%
Induced Path
8%
Adjacent Vertices
8%
Number of Edges
8%
MaxCut
8%
Adjacency List
8%
Makespan
8%
O Stars
8%
Orthogonal Vectors
8%
Connection Problem
8%
Shunt
8%
Steiner Forest
8%
Efficient Parameterized Algorithms
8%
Rainbow Vertex Coloring
8%
Shrub-depth
8%
Bin Packing
8%
Odd Cycle Transversal
8%
Fixed-parameter Algorithms
7%
Maximum Independent Set
7%
Graph Isomorphism
7%
Specified Vertices
7%
Non-deterministic
7%
Claw-free Graph
7%
Strong Exponential Time Hypothesis
7%
Tree Structure
7%
Graph Decomposition
7%
Undirected Graph
7%
Guard
7%
Capacitated
7%
Complete Classification
7%
Deterministic Algorithm
7%
Graph Parameters
7%
Conflict-free
7%
Intersection Graph
6%
Streaming Model
6%
Mathematics
Free Graph
100%
Polynomial Time
96%
Edge
86%
Polynomial
65%
Exponential Time
57%
Integer
46%
Running Time
43%
Independent Set
36%
Induced Subgraph
30%
Planar Graph
25%
Upper Bound
25%
Hamiltonian Cycle
20%
Connected Graph
19%
Dominating Set
19%
Minimizes
18%
Subset Sum
17%
Maximum Degree
17%
Competitive Ratio
15%
Open Problem
14%
Complexity Space
13%
Linear Time
13%
Bipartite Graph
12%
Fast Algorithm
12%
Multigraph
12%
Maximum Independent Set
11%
Clique
11%
Adjacency
10%
Matrix Multiplication
10%
Transversals
10%
Clique-width
10%
Intersects
10%
Matrix
10%
Kernelization
10%
Interval Graph
9%
Max-Cut
9%
Unit Disk
9%
Combinatorics
9%
Permutation
9%
Linear Programming
9%
Omits
8%
Complete Classification
8%
Finite Set
8%
Intersection Graph
8%
Orthogonal Vector
8%
Computable Function
8%
Packing Problem
8%
Metric Space
7%
Conditionals
7%
Natural Generalization
7%
Path Problem
7%
Polygon
6%
Local Search
6%
Weighted Tree
6%
Partial Order
6%
Wide Variety
6%
Art Gallery Problem
6%
Graph Coloring
6%
Open Question
6%
Data Structure
5%
NP-hard Problem
5%
Worst Case
5%
Homomorphism
5%
Discrete Probability Distribution
5%
Strongly chordal graphs
5%
Solvability
5%
Sparse Subgraph
5%
Total Area
5%
Time Step
5%
Simulation Study
5%
Covering Problem
5%
Stochastics
5%
Derandomization
5%
Polynomials Method
5%
Exponential Polynomial
5%
Bayesian Inference
5%
Arithmetic Progression
5%
Connected Component
5%
Turing Machine
5%
Search Algorithm
5%
Linear Structure
5%
Total Weight
5%
Spanning Tree
5%
Computer Science
Polynomial Time
31%
Subgraphs
26%
Scheduling Problem
22%
Polynomial Space
19%
Independent Set
16%
Complexity Class
16%
Exact Algorithm
14%
Tree Decomposition
14%
Space Complexity
13%
Fast Algorithm
12%
Dynamic Programming
12%
Precedence Constraint
11%
Planar Graph
11%
steiner tree
11%
Time Complexity
10%
Adjacency List
10%
Randomized Algorithm
10%
Competitive Ratio
10%
Computational Complexity
9%
Directed Graphs
9%
polynomial-time algorithm
9%
Connected Graph
9%
Computable Function
9%
on-line algorithm
8%
Bipartite Graph
8%
Logarithmic Space
8%
Directed Acyclic Graph
8%
Partition Tree
8%
Spanning Tree
8%
Connectivity Problem
8%
Bin Packing Problem
8%
Hamiltonian Cycle
8%
Intersection Graph
8%
Integer-Linear Programming
6%
Efficient Algorithm
6%
Simulation Study
6%
Partial Order
6%
Network Design Problem
6%
NP-completeness
6%
Solution Method
5%
Partial Solution
5%
Approximation (Algorithm)
5%
Orthogonal Vector
5%
Computational Resource
5%
Parameter Value
5%
Crowds Simulation
5%
Satisfiability Problem
5%
Join Operation
5%
Metric Space
5%
Communication Graph
5%
Space Exponential
5%
Input-Stream
5%
Total Distance
5%
Deterministic Bound
5%
Virtual Environments
5%
Temporal Graph
5%
Adjacency List Model
5%
Constant Parameter
5%
Bayesian Networks
5%
digraph
5%
Scheduling Parameter
5%
Operations Research
5%
System Analysis
5%
Disruption Management
5%
Completion Time
5%
Simulated Annealing
5%
Local Search Algorithm
5%
Wireless Network
5%
Subgraph Isomorphism
5%
General Pattern
5%
Coloring Problem
5%
Dynamic Programming Algorithm
5%