Algorithm Design Complexity

Research Frontiers in Fine-Grained Complexity of Graph Problems

Conditional lower bounds for graph problems including matching, coloring, and diameter computation based on hardness conjectures.

All Algorithm Design & Complexity PhD categories