Shyan Akmal

Publication Activity (10 Years)

Years Active: 2019-2024
Publications (10 Years): 26

Top Topics

Tractable Classes

Related Problems

Propositional Satisfiability

Top Venues

Publications

Shyan Akmal
An Enumerative Perspective on Connectivity. SOSA (2024)
Shyan Akmal, Virginia Vassilevska Williams, Nicole Wein
Detecting Disjoint Shortest Paths in Linear Time and More. CoRR (2024)
Shyan Akmal, Ce Jin
An Efficient Algorithm for All-Pairs Bounded Edge Connectivity. Algorithmica 86 (5) (2024)
Shyan Akmal, Virginia Vassilevska Williams, Nicole Wein
Detecting Disjoint Shortest Paths in Linear Time and More. ICALP (2024)
Shyan Akmal, Virginia Vassilevska Williams, Ryan Williams, Zixuan Xu
Faster Detours in Undirected Graphs. ESA (2023)
Shyan Akmal
An Enumerative Perspective on Connectivity. CoRR (2023)
Shyan Akmal, Ce Jin
An Efficient Algorithm for All-Pairs Bounded Edge Connectivity. CoRR (2023)
Shyan Akmal, Virginia Vassilevska Williams, R. Ryan Williams, Zixuan Xu
Faster Detours in Undirected Graphs. CoRR (2023)
Shyan Akmal, Ce Jin
Near-Optimal Quantum Algorithms for String Problems. Algorithmica 85 (8) (2023)
Shyan Akmal, Nicole Wein
A Local-To-Global Theorem for Congested Shortest Paths. ESA (2023)
Shyan Akmal, Lijie Chen, Ce Jin, Malvika Raj, R. Ryan Williams
Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity. Algorithmica 85 (8) (2023)
Shyan Akmal, Ce Jin
An Efficient Algorithm for All-Pairs Bounded Edge Connectivity. ICALP (2023)
Shyan Akmal, Ryan Williams
MAJORITY-3SAT (and Related Problems) in Polynomial Time. FOCS (2022)
Shyan Akmal, Lijie Chen, Ce Jin, Malvika Raj, Ryan Williams
Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity. ITCS (2022)
Shyan Akmal, Ce Jin
Near-Optimal Quantum Algorithms for String Problems. SODA (2022)
Shyan Akmal, Nicole Wein
A Local-to-Global Theorem for Congested Shortest Paths. CoRR (2022)
Shyan Akmal, Ce Jin
Faster Algorithms for Bounded Tree Edit Distance. CoRR (2021)
Shyan Akmal, Virginia Vassilevska Williams
Improved Approximation for Longest Common Subsequence over Small Alphabets. ICALP (2021)
Shyan Akmal, Virginia Vassilevska Williams
Improved Approximation for Longest Common Subsequence over Small Alphabets. CoRR (2021)
Shyan Akmal, R. Ryan Williams
MAJORITY-3SAT (and Related Problems) in Polynomial Time. CoRR (2021)
Shyan Akmal, Ryan Williams
MAJORITY-3SAT (and Related Problems) in Polynomial Time. FOCS (2021)
Shyan Akmal, Ce Jin
Near-Optimal Quantum Algorithms for String Problems. CoRR (2021)
Shyan Akmal, Lijie Chen, Ce Jin, Malvika Raj, Ryan Williams
Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity. Electron. Colloquium Comput. Complex. 28 (2021)
Shyan Akmal, Ce Jin
Faster Algorithms for Bounded Tree Edit Distance. ICALP (2021)
Shyan Akmal, Savana Ammons, Hemeng Li, Michael Gao, Lindsay Popowski, James C. Boerkoel Jr.
Quantifying controllability in temporal networks with uncertainty. Artif. Intell. 289 (2020)
Shyan Akmal, Savana Ammons, Hemeng Li, James C. Boerkoel Jr.
Quantifying Degrees of Controllability in Temporal Networks with Uncertainty. ICAPS (2019)