| 2026 | ICALP | Node-Weighted Triangles: Faster and Simpler. | Shyan Akmal, Nick Fischer |
| 2026 | SODA | A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection. | Amir Abboud, Shyan Akmal, Nick Fischer |
| 2025 | ISAAC | Graph Coloring Below Guarantees via Co-Triangle Packing. | Shyan Akmal, Tomohiro Koana |
| 2025 | STACS | Faster Edge Coloring by Partition Sieving. | Shyan Akmal, Tomohiro Koana |
| 2024 | ICALP | Detecting Disjoint Shortest Paths in Linear Time and More. | Shyan Akmal, Virginia Vassilevska Williams, Nicole Wein |
| 2023 | ESA | Faster Detours in Undirected Graphs. | Shyan Akmal, Virginia Vassilevska Williams, Ryan Williams, Zixuan Xu |
| 2023 | ESA | A Local-To-Global Theorem for Congested Shortest Paths. | Shyan Akmal, Nicole Wein |
| 2023 | ICALP | An Efficient Algorithm for All-Pairs Bounded Edge Connectivity. | Shyan Akmal, Ce Jin |
| 2022 | SODA | Near-Optimal Quantum Algorithms for String Problems. | Shyan Akmal, Ce Jin |
| 2021 | FOCS | MAJORITY-3SAT (and Related Problems) in Polynomial Time. | Shyan Akmal, Ryan Williams |
| 2021 | ICALP | Faster Algorithms for Bounded Tree Edit Distance. | Shyan Akmal, Ce Jin |
| 2021 | ICALP | Improved Approximation for Longest Common Subsequence over Small Alphabets. | Shyan Akmal, Virginia Vassilevska Williams |