ASCEND
BY NTHRYS

NTHRYS › PhD Assistance › Theoretical Computer Science

Theoretical Computer Science

Field
▾
Category
▾

Theoretical Computer Science

Select a category to explore research frontiers

Loading categories...

Research Frontiers in Parameterized Complexity and Fixed-Parameter Tractability

Analyzes computational complexity with respect to multiple parameters beyond input size to identify tractable problem instances.

Kernelization Beyond Polynomial Bounds
Parameterized Approximation in NP-Hard Landscapes
Structural Graph Parameters and Lower Bounds
Fine-Grained Complexity of Parameterized Problems
Treewidth and Beyond: Decomposition Frontiers
Distributed FPT Algorithms on Large Networks
Parameterized Complexity of Dynamic Problems
Integer Programming and Bounded Search Trees
Combining Parameters: Multivariate Tractability Regimes
Hardness of Approximation in Parameterized Settings

All Theoretical Computer Science PhD categories