On a convex set with nondifferentiable metric projection. - Shyan S. Akmal; Nguyen Mau Nam; J. J. P. Veerman (Optim. Lett., 2015)

Quantifying Degrees of Controllability in Temporal Networks with Uncertainty. - Shyan Akmal; Savana Ammons; Hemeng Li; James C. Boerkoel Jr. (ICAPS, 2019)

Quantifying controllability in temporal networks with uncertainty. - Shyan Akmal; Savana Ammons; Hemeng Li; Michael Gao; Lindsay Popowski; James C. Boerkoel Jr. (Artif. Intell., 2020)

MAJORITY-3SAT (and Related Problems) in Polynomial Time. - Shyan Akmal; Ryan Williams 001 (FOCS, 2021)

Faster Algorithms for Bounded Tree Edit Distance. - Shyan Akmal; Ce Jin 001 (ICALP, 2021)

Improved Approximation for Longest Common Subsequence over Small Alphabets. - Shyan Akmal; Virginia Vassilevska Williams (ICALP, 2021)

Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity. - Shyan Akmal; Lijie Chen 001; Ce Jin 001; Malvika Raj; Ryan Williams 001 (Electron. Colloquium Comput. Complex., 2021)

Faster Detours in Undirected Graphs. - Shyan Akmal; Virginia Vassilevska Williams; Ryan Williams 001; Zixuan Xu (ESA, 2023)

A Local-To-Global Theorem for Congested Shortest Paths. - Shyan Akmal; Nicole Wein (ESA, 2023)

Near-Optimal Quantum Algorithms for String Problems. - Shyan Akmal; Ce Jin 001 (Algorithmica, 2023)

Detecting Disjoint Shortest Paths in Linear Time and More. - Shyan Akmal; Virginia Vassilevska Williams; Nicole Wein (ICALP, 2024)

An Enumerative Perspective on Connectivity. - Shyan Akmal (TheoretiCS, 2024)

Parameterized Relaxations for Circuits and Graphs - Shyan Akmal (2024)

An Efficient Algorithm for All-Pairs Bounded Edge Connectivity. - Shyan Akmal; Ce Jin 001 (Algorithmica, 2024)

Faster Edge Coloring by Partition Sieving. - Shyan Akmal; Tomohiro Koana (STACS, 2025)

A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection. - Amir Abboud; Shyan Akmal; Nick Fischer (CoRR, 2025)