Skip to main navigation
Skip to search
Skip to main content
Sort by
Keyphrases
Parameterized Complexity
100%
Parameterized Algorithms
85%
Polynomial Kernel
36%
Fixed-parameter Tractability
35%
Kernelization
26%
NP-hard
26%
Treewidth
25%
Polynomial Time
24%
FPT Algorithm
22%
Vertex Deletion
19%
Unit Disk Graph
19%
Time Algorithm
19%
Graph Classification
19%
Approximation Algorithms
17%
Parametric Analysis
17%
Fixed-parameter Algorithms
16%
Digraph
15%
Tight
14%
K-path
13%
Directed Feedback Vertex Set
13%
Subexponential
13%
Undirected Graph
13%
Vertex Cover
13%
K Parameter
12%
Directed Graph
12%
MaxCut
12%
Vertex Cover number
12%
Feedback Vertex Set
12%
Deterministic Algorithm
12%
Randomized Algorithms
12%
Tree Decomposition
11%
Hitting Set
10%
Disjoint Paths
10%
General Graphs
10%
Exponential Time Hypothesis
10%
NP-complete
10%
Positive Integer
9%
Clique
9%
Out-branching
9%
Exponential Time
9%
Disk Graphs
8%
Terrain Guarding
8%
Stable Marriage
8%
Cycle Packing
8%
Chordal Graph
8%
Polynomial-time Algorithm
8%
Computational Complexity
8%
Deletion Problems
8%
Planar Graph
8%
Packing Problem
8%
Mathematics
Polynomial
82%
Running Time
61%
Edge
59%
Polynomial Time
48%
Kernelization
38%
Exponential Time
35%
Unit Disk
23%
Integer
22%
Clique
21%
Planar Graph
19%
Matching Problem
18%
Open Problem
15%
Positive Integer
15%
Packing Problem
14%
Open Question
12%
Spanning Tree
12%
Multiset
11%
Constant Factor
11%
Approximates
11%
Hitting Set
11%
Transversals
11%
Interval Graph
11%
Path Problem
9%
Topology
9%
Triangle
9%
Dominating Set
9%
Max-Cut
9%
Nonnegative Integer
9%
Matroid
9%
Structural Parameter
9%
Intersection Graph
9%
Independent Set
9%
Fast Algorithm
8%
Stable Matching
7%
Main Result
7%
Probability
7%
Independence Number
7%
Partitioning Problem
7%
Weight Function
6%
Dynamic Programming
6%
Black Box
6%
Computational Problem
6%
Free Graph
6%
Structural Property
5%
Wide Variety
5%
Longest Path
5%
Directed Cycle
5%
Hamiltonian Cycle
5%
Connected Graph
5%
Art Galleries
5%