SIAM Symposium on Simplicity in Algorithms - 期刊 | AMiner

年发文量

研究主题

论文（251）

排序

时间引用

1Tree Violation Distance under Constraints.

Debarati Das, Evangelos Kipouridis, Joachim Spoerhase

2026引用：1

引用

2No SDP Needed for Efficiently Recovering Planted Regular Bipartite Graphs.

Anand Louis, Rameesh Paul

2026

引用

3The Sparsification Lemma Via Measure and Conquer.

Daniel Lokshtanov,Saket Saurabh,Jie Xue

2026

引用

4Yet Another Proof That BPP ⊆ PH.

Ilya Volkovich

2026

引用

5A Novel Reduction from #SAT to #2SAT Based on Symmetry: Simply Drop the Large Clauses .

Max Bannach,Erik D. Demaine, Timothy Gomez,Markus Hecher

2026引用：1

引用

立即登录，查看全部 251 篇论文

高被引作者

作者	引用	发文
Christopher Musco	183	5
Cameron Musco	164	1
Raphael Arkady Meyer	164	1
David P. Woodruff	164	1
Sepehr Assadi	122	6
Patrick Rall	118	1
Scott Aaronson	118	1
Timothy M. Chan	94	5
Talya Eden	90	3
Kent Quanrud	86	2

高产作者

作者	引用	发文
Sepehr Assadi	122	6
Timothy M. Chan	94	5
Robert E. Tarjan	60	5
Bernhard Haeupler	7	5
Christopher Musco	183	5
Jakub Tětek	8	4
Chandra Chekuri	80	4
Paweł Gawrychowski	28	4
Michał Pilipczuk	44	4
Rico Zenklusen	21	4

相关期刊

ACM Transactions on Algorithms

Embedded Systems and Applications

European Symposium on Algorithms

Innovations in Theoretical Computer Science

Approximation Algorithms for Combinatorial Optimization

arXiv: Data Structures and Algorithms

arXiv: Computational Complexity

ACM-SIAM Symposium on Discrete Algorithms

Foundations of Computer Science

International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques