长垣产业园区科技文献服务平台

会议文集


会议名34th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023)
中译名《第三十四届ACM-SIAM年度离散算法研讨会,卷4》
机构Society for Industrial and Applied Mathematics (SIAM); Association for Computing Machinery (ACM)
会议日期22-25 January 2023
会议地点Florence, Italy
出版年2023
馆藏号348050


题名作者出版年
Approximate Graph Colouring and CrystalsLorenzo Ciardo; Stanislav Zivny2023
Weisfeiler-Leman and Graph SpectraGaurav Rattan; Tim Seppelt2023
Fast algorithms for solving the Hamilton Cycle problem with high probabilityMichael Anastos2023
A simple and sharper proof of the hypergraph Moore boundJun-Ting Hsieh; Pravesh K. Kothari; Sidhanth Mohanty2023
Small subgraphs with large average degreeOliver Janzer; Benny Sudakov; Istvan Tomon2023
Exact Flow Sparsification Requires Unbounded SizeRobert Krauthgamer; Ron Mosenzon2023
Improved Approximation for Two-Edge-ConnectivityMohit Garg; Fabrizio Grandoni; Afrouz Jabal Ameli2023
Timeliness Through Telephones: Approximating Information Freshness in Vector Clock ModelsDa Qi Chen; Lin An; Aidin Niaparast; R. Ravi; Oleksandr Rudenko2023
Approximation Algorithms for Steiner Tree Augmentation ProblemsR. Ravi; Weizhong Zhang; Michael Zlatin2023
Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum FlowsRuoxu Cen; William He; Jason Li; Debmalya Panigrahi2023
Faster Computation of 3-Edge-Connected Components in DigraphsLoukas Georgiadis; Evangelos Kipouridis; Charis Papadopoulos; Nikos Parotsidis2023
Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via DerandomizationMohsen Ghaffari; Christoph Grunau; Bernhard Haeupler; Saeed Ilchi; Vaclav Rozhon2023
Fast Distributed Brooks' TheoremManuela Fischer; Magnus M. Halldorsson; Yannic Maus2023
Optimal Deterministic Massively Parallel Connectivity on ForestsAlkida Balliu; Rustam Latypov; Yannic Maus; Dennis Olivetti; Jara Uitto2023
Distributed Maximal Matching and Maximal Independent Set on HypergraphsAlkida Balliu; Sebastian Brandt; Fabian Kuhn; Dennis Olivetti2023
Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious AdversariesMohammadHossein Bateni; Monika Henzinger; Hossein Esfandiari; Rajesh Jayaram; Hendrik Fichtenberger; Vahab Mirrokni; Andreas Wiese2023
A New Approach to Estimating Effective Resistances and Counting Spanning Trees in Expander GraphsLawrence Li; Sushant Sachdeva2023
The complete classification for quantified equality constraintsDmitriy Zhuk; Barnaby Martin; Michal Wrona2023
Approaching the Soundness Barrier: A Near Optimal Analysis of the Cube versus Cube TestDor Minzer; Kai Zheng2023
Weak Bisimulation Finiteness of Pushdown Systems With Deterministic ε-Transitions Is 2-ExpTime-CompleteStefan Goller; Pawel Parys2023
12