Shyan Akmal

Orcid: 0000-0002-7266-2041

According to our database1, Shyan Akmal authored at least 12 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
An Enumerative Perspective on Connectivity.
Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

2023
Near-Optimal Quantum Algorithms for String Problems.
Algorithmica, August, 2023

Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity.
Algorithmica, August, 2023

An Efficient Algorithm for All-Pairs Bounded Edge Connectivity.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

A Local-To-Global Theorem for Congested Shortest Paths.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Faster Detours in Undirected Graphs.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2021
Improved Approximation for Longest Common Subsequence over Small Alphabets.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Faster Algorithms for Bounded Tree Edit Distance.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

MAJORITY-3SAT (and Related Problems) in Polynomial Time.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
Quantifying controllability in temporal networks with uncertainty.
Artif. Intell., 2020

2019
Quantifying Degrees of Controllability in Temporal Networks with Uncertainty.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

2015
On a convex set with nondifferentiable metric projection.
Optim. Lett., 2015


  Loading...