Algorithm Design Complexity

Research Frontiers in Complexity of Shortest Paths in Special Graphs

Studies fine-grained complexity and algorithms for shortest path problems in planar graphs, DAGs, and other restricted graph classes.

All Algorithm Design & Complexity PhD categories