Discrete Mathematics

Research Frontiers in Parameterized Complexity and Fixed-Parameter Tractability

Study of algorithms with running time depending on parameters other than input size, including FPT algorithms and lower bounds via hardness reductions.

All Discrete Mathematics PhD categories