会议文集


会议名36th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2025)
中译名《第三十六届ACM-SIAM年度离散算法研讨会，卷6》
机构Society for Industrial and Applied Mathematics (SIAM); Association for Computing Machinery (ACM)
会议日期12-15 January 2025
会议地点New Orleans, Louisiana, USA
出版年2025
馆藏号355120


题名作者出版年
Near-Optimal Relative Error Streaming Quantile Estimation via Elastic CompactorsElena Gribelyuk; Pachara Sawettamalya; Hongxun Wu; Huacheng Yu2025
A Fast Algorithm for Computing Zigzag RepresentativesTamal K. Dey; Tao Hou; Dmitriy Morozov2025
Minimum Convex Hull and Maximum Overlap of Two Convex PolytopesMook Kwon Jung; Seokyun Kang; Hee-Kap Ahn2025
Partitioning a Polygon Into Small PiecesMikkel Abrahamsen; Nichlas Langhoff Rasmussen2025
Computing the second and third systoles of a combinatorial surfaceMatthijs Ebbens; Francis Lazarus2025
An Efficient Regularity Lemma for Semi-Algebraic HypergraphsNatan Rubin2025
From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small SubgraphsSimon Doring; Daniel Marx; Philip Wellnitz2025
Counting Small Induced Subgraphs: Hardness via Fourier AnalysisRadu Curticapean; Daniel Neuen2025
Maximum Span Hypothesis: A Potentially Weaker Assumption than Gap-ETH for Parameterized ComplexityKarthik C. S.; Subhash Khot2025
Parameterizing the quantification of CMSO: model checking on minor-closed graph classesIgnasi Sau; Giannos Stamoulis; Dimitrios M. Thilikos2025
Losing Treewidth In The Presence Of WeightsMichal Wlodarczyk2025
Finding irrelevant vertices in linear time on bounded-genus graphsPetr A. Golovach; Stavros G. Kolliopoulos; Giannos Stamoulis; Dimitrios M. Thilikos2025
Competitive strategies to use "warm start" algorithms with predictionsAvrim Blum; Vaidehi Srinivas2025
Online Scheduling via Gradient Descent for Weighted Flow Time MinimizationQingyun Chen; Sungjin Im; Aditya Petety2025
Stronger adversaries grow cheaper forests: online node-weighted Steiner problemsSander Borst; Marek Elias; Moritz Venzin2025
Putting Off the Catching Up: Online Joint Replenishment Problem with Holding and Backlog CostsBenjamin Moseley; Aidin Niaparast; R. Ravi2025
Unweighted Layered Graph Traversal: Passing a Crown via Entropy MaximizationXingjian Bai; Christian Coester; Romain Cosson2025
The Power of Proportional Fairness for Non-Clairvoyant Scheduling under Polyhedral ConstraintsSven Jager; Alexander Lindermayr; Nicole Megow2025
Efficient d-ary Cuckoo Hashing at High Load Factors by Bubbling UpWilliam Kuszmaul; Michael Mitzenmacher2025
Fast and Simple Sorting Using Partial InformationBernhard Haeupler; Richard Hladik; John Iacono; Vaclav Rozhon; Robert E. Tarjan; Jakub Tetek2025
12



国家科技图书文献中心  全球文献资源网  京ICP备05055788号-26  京公网安备11010202008970号  机械工业信息研究院 2018-2024