Shyan Akmal - RankMe

33 papers A* 8A 4B 1Journal 18Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection. SODA Amir Abboud, Shyan Akmal, Nick Fischer
2025	J	`jnl`	A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection. CoRR Amir Abboud, Shyan Akmal, Nick Fischer
2025	A	`conf`	Faster Edge Coloring by Partition Sieving. STACS Shyan Akmal, Tomohiro Koana
2025	J	`jnl`	Faster Edge Coloring by Partition Sieving. CoRR Shyan Akmal, Tomohiro Koana
2025	B	`conf`	Graph Coloring Below Guarantees via Co-Triangle Packing. ISAAC Shyan Akmal, Tomohiro Koana
2025	J	`jnl`	Graph Coloring Below Guarantees via Co-Triangle Packing. CoRR Shyan Akmal, Tomohiro Koana
2024	J	`jnl`	An Efficient Algorithm for All-Pairs Bounded Edge Connectivity. Algorithmica Shyan Akmal, Ce Jin
2024	—	`conf`	An Enumerative Perspective on Connectivity. SOSA Shyan Akmal
2024	J	`jnl`	An Enumerative Perspective on Connectivity. TheoretiCS Shyan Akmal
2024	A*	`conf`	Detecting Disjoint Shortest Paths in Linear Time and More. ICALP Shyan Akmal, Virginia Vassilevska Williams, Nicole Wein
2024	J	`jnl`	Detecting Disjoint Shortest Paths in Linear Time and More. CoRR Shyan Akmal, Virginia Vassilevska Williams, Nicole Wein
2024	—	`—`	Parameterized Relaxations for Circuits and Graphs Shyan Akmal
2023	A	`conf`	A Local-To-Global Theorem for Congested Shortest Paths. ESA Shyan Akmal, Nicole Wein
2023	A*	`conf`	An Efficient Algorithm for All-Pairs Bounded Edge Connectivity. ICALP Shyan Akmal, Ce Jin
2023	J	`jnl`	An Efficient Algorithm for All-Pairs Bounded Edge Connectivity. CoRR Shyan Akmal, Ce Jin
2023	J	`jnl`	An Enumerative Perspective on Connectivity. CoRR Shyan Akmal
2023	A	`conf`	Faster Detours in Undirected Graphs. ESA Shyan Akmal, Virginia Vassilevska Williams, Ryan Williams, Zixuan Xu
2023	J	`jnl`	Faster Detours in Undirected Graphs. CoRR Shyan Akmal, Virginia Vassilevska Williams, R. Ryan Williams, Zixuan Xu
2023	J	`jnl`	Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity. Algorithmica Shyan Akmal, Lijie Chen, Ce Jin, Malvika Raj, R. Ryan Williams
2023	J	`jnl`	Near-Optimal Quantum Algorithms for String Problems. Algorithmica Shyan Akmal, Ce Jin
2022	J	`jnl`	A Local-to-Global Theorem for Congested Shortest Paths. CoRR Shyan Akmal, Nicole Wein
2022	A	`conf`	Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity. ITCS Shyan Akmal, Lijie Chen, Ce Jin, Malvika Raj, Ryan Williams
2022	A*	`conf`	Near-Optimal Quantum Algorithms for String Problems. SODA Shyan Akmal, Ce Jin
2021	A*	`conf`	Faster Algorithms for Bounded Tree Edit Distance. ICALP Shyan Akmal, Ce Jin
2021	J	`jnl`	Faster Algorithms for Bounded Tree Edit Distance. CoRR Shyan Akmal, Ce Jin
2021	A*	`conf`	Improved Approximation for Longest Common Subsequence over Small Alphabets. ICALP Shyan Akmal, Virginia Vassilevska Williams
2021	J	`jnl`	Improved Approximation for Longest Common Subsequence over Small Alphabets. CoRR Shyan Akmal, Virginia Vassilevska Williams
2021	J	`jnl`	Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity. Electron. Colloquium Comput. Complex. Shyan Akmal, Lijie Chen, Ce Jin, Malvika Raj, Ryan Williams
2021	A*	`conf`	MAJORITY-3SAT (and Related Problems) in Polynomial Time. FOCS Shyan Akmal, Ryan Williams
2021	J	`jnl`	MAJORITY-3SAT (and Related Problems) in Polynomial Time. CoRR Shyan Akmal, R. Ryan Williams
2021	J	`jnl`	Near-Optimal Quantum Algorithms for String Problems. CoRR Shyan Akmal, Ce Jin
2020	J	`jnl`	Quantifying controllability in temporal networks with uncertainty. Artif. Intell. Shyan Akmal, Savana Ammons, Hemeng Li, Michael Gao, Lindsay Popowski, James C. Boerkoel Jr.
2019	A*	`conf`	Quantifying Degrees of Controllability in Temporal Networks with Uncertainty. ICAPS Shyan Akmal, Savana Ammons, Hemeng Li, James C. Boerkoel Jr.