Shyan Akmal

According to our database, Shyan Akmal authored at least 17 papers between 2015 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2025

Graph Coloring Below Guarantees via Co-Triangle Packing.

Shyan Akmal, Tomohiro Koana

CoRR, September, 2025

A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection.

Amir Abboud, Shyan Akmal, Nick Fischer

CoRR, July, 2025

Faster Edge Coloring by Partition Sieving.

Shyan Akmal, Tomohiro Koana

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

2024

Parameterized Relaxations for Circuits and Graphs

Shyan Akmal

PhD thesis, 2024

An Enumerative Perspective on Connectivity.

Shyan Akmal

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

Detecting Disjoint Shortest Paths in Linear Time and More.

Shyan Akmal, Virginia Vassilevska Williams, Nicole Wein

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

An Efficient Algorithm for All-Pairs Bounded Edge Connectivity.

Shyan Akmal, Ce Jin

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

A Local-To-Global Theorem for Congested Shortest Paths.

Shyan Akmal, Nicole Wein

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Faster Detours in Undirected Graphs.

Shyan Akmal, Virginia Vassilevska Williams, Ryan Williams, Zixuan Xu

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Near-Optimal Quantum Algorithms for String Problems.

Shyan Akmal, Ce Jin

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity.

Shyan Akmal, Lijie Chen, Ce Jin, Malvika Raj, Ryan Williams

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021

Improved Approximation for Longest Common Subsequence over Small Alphabets.

Shyan Akmal, Virginia Vassilevska Williams

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Faster Algorithms for Bounded Tree Edit Distance.

Shyan Akmal, Ce Jin

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

MAJORITY-3SAT (and Related Problems) in Polynomial Time.

Shyan Akmal, Ryan Williams

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

Quantifying controllability in temporal networks with uncertainty.

Shyan Akmal, Savana Ammons, Hemeng Li, Michael Gao, Lindsay Popowski, James C. Boerkoel Jr.

Artif. Intell., 2020

2019

Quantifying Degrees of Controllability in Temporal Networks with Uncertainty.

Shyan Akmal, Savana Ammons, Hemeng Li, James C. Boerkoel Jr.

Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

2015

On a convex set with nondifferentiable metric projection.

Shyan S. Akmal, Nguyen Mau Nam, J. J. P. Veerman

Optim. Lett., 2015