Table of Contents

• Front Matter [doi]
• Dynamic Algorithms for Graph ColoringSayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger, Danupon Nanongkai. 1-20 [doi]
• Incremental Topological Sort and Cycle Detection in Expected Total TimeAaron Bernstein, Shiri Chechik. 21-34 [doi]
• n) Amortized TimeJacob Holm, Eva Rotenberg, Mikkel Thorup. 35-52 [doi]
• Incremental DFS algorithms: a theoretical and experimental studySurender Baswana, Ayush Goel, Shahbaz Khan 0004. 53-72 [doi]
• Decrementai Transitive Closure and Shortest Paths for Planar Digraphs and BeyondAdam Karczmarz. 73-92 [doi]
• Polycubes with Small Perimeter DefectAndrei Asinowski, Gill Barequet, Yufei Zheng. 93-100 [doi]
• A Grid-Based Approximation Algorithm for the Minimum Weight Triangulation ProblemSharath Raghvendra, Mariëtte C. Wessels. 101-120 [doi]
• Tightening Curves on Surfaces via Local MovesHsien-Chih Chang, Jeff Erickson 0001, David Letscher, Arnaud de Mesmay, Saul Schleimer, Eric Sedgwick, Dylan Thurston, Stephan Tillmann. 121-135 [doi]
• A Near-Quadratic Lower Bound for the Size of Quantum Circuits of Constant TreewidthMateus de Oliveira Oliveira. 136-145 [doi]
• The Classical Complexity of Boson SamplingPeter Clifford, Raphaël Clifford. 146-155 [doi]
• Race Detection and Reachability in Nearly Series-Parallel DAGsKunal Agrawal, Joseph Devietti, Jeremy T. Fineman, I-Ting Angelina Lee, Robert Utterback, Changming Xu. 156-171 [doi]
• Planar Graphs as L-intersection or L-contact graphsDaniel Gonçalves, Lucas Isenmann, Claire Pennarun. 172-184 [doi]
• The complexity of independent set reconfiguration on bipartite graphsDaniel Lokshtanov, Amer E. Mouawad. 185-195 [doi]
• Metric Violation Distance: Hardness and ApproximationChenglin Fan, Benjamin Raichel, Gregory Van Buskirk. 196-209 [doi]
• A submodular measure and approximate Gomory-Hu theorem for packing odd trailsRoss Churchley, Bojan Mohar. 210-218 [doi]
• Minor-matching hypertree widthNikola Yolov. 219-233 [doi]
• A Polynomial Excluded-Minor Approximation of TreedepthKen-ichi Kawarabayashi, Benjamin Rossman. 234-246 [doi]
• Beating Brute Force for (Quantified) Satisfiability of Circuits of Bounded TreewidthDaniel Lokshtanov, Ivan Mikhailin, Ramamohan Paturi, Pavel Pudlák. 247-261 [doi]
• Cliquewidth III: The Odd Case of Graph Coloring Parameterized by CliquewidthPetr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi. 262-273 [doi]
• Recognizing Weak Embeddings of GraphsHugo A. Akitaya, Radoslav Fulek, Csaba D. Tóth. 274-292 [doi]
• Stochastic Packing Integer Programs with Few QueriesYutaro Yamaguchi, Takanori Maehara. 293-310 [doi]
• Algorithms to Approximate Column-Sparse Packing ProblemsBrian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu. 311-330 [doi]
• Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing ProblemsTien-Nam Le, Daniel Lokshtanov, Saket Saurabh 0001, Stéphan Thomassé, Meirav Zehavi. 331-342 [doi]
• Near Optimal Jointly Private Packing Algorithms via Dual Multiplicative Weight UpdateZhiyi Huang, Xue Zhu. 343-357 [doi]
• Randomized MWU for Positive LPsChandra Chekuri, Kent Quanrud. 358-377 [doi]
• Hierarchical Clustering: Objective Functions and AlgorithmsVincent Cohen-Addad, Varun Kanade, Frederik Mallmann-Trenn, Claire Mathieu. 378-397 [doi]
• Approximation Schemes for Clustering with OutliersZachary Friggstad, Kamyar Khodamoradi, Mohsen Rezapour, Mohammad R. Salavatipour. 398-414 [doi]
• Adaptive Hierarchical Clustering Using Ordinal QueriesEhsan Emamjomeh-Zadeh, David Kempe 0001. 415-429 [doi]
• k-MeansVincent Cohen-Addad. 430-440 [doi]
• The Bane of Low-Dimensionality ClusteringVincent Cohen-Addad, Arnaud de Mesmay, Eva Rotenberg, Alan Roytman. 441-456 [doi]
• A Faster Algorithm for Minimum-Cost Bipartite Perfect Matching in Planar GraphsMudabir Kabir Asathulla, Sanjeev Khanna, Nathaniel Lahn, Sharath Raghvendra. 457-476 [doi]
• n) TimeShay Mozes, Kirill Nikolaev, Yahav Nussbaum, Oren Weimann. 477-494 [doi]
• 5/3) TimePawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann. 495-514 [doi]
• Better Tradeoffs for Exact Distance Oracles in Planar GraphsPawel Gawrychowski, Shay Mozes, Oren Weimann, Christian Wulff-Nilsen. 515-529 [doi]
• Near-Optimal Compression for the Planar Graph MetricAmir Abboud, Pawel Gawrychowski, Shay Mozes, Oren Weimann. 530-549 [doi]
• Time and Space Efficient Representations of Distributive LatticesJ. Ian Munro, Corwin Sinnamon. 550-567 [doi]
• A Hamilton Path for the Sigma-Tau ProblemJoe Sawada, Aaron Williams. 568-575 [doi]
• Discrete Choice, Permutations, and ReconstructionFlavio Chierichetti, Ravi Kumar 0001, Andrew Tomkins. 576-586 [doi]
• Consistent Hashing with Bounded LoadsVahab S. Mirrokni, Mikkel Thorup, Morteza Zadimoghaddam. 587-604 [doi]
• Nearly Tight Bounds for Sandpile Transience on the GridDavid Durfee, Matthew Fahrbach, Yu Gao, Tao Xiao. 605-624 [doi]
• Coding against deletions in oblivious and online modelsVenkatesan Guruswami, Ray Li. 625-643 [doi]
• Average-radius list-recoverability of random linear codesAtri Rudra, Mary Wootters. 644-662 [doi]
• Approximate Local Decoding of Cubic Reed-Muller Codes Beyond the List Decoding RadiusPooya Hatami, Madhur Tulsiani. 663-679 [doi]
• Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fieldsSwastik Kopparty, Aditya Potukuchi. 680-691 [doi]
• The Gotsman-Linial Conjecture is FalseBrynmor Chapman. 692-699 [doi]
• Prophet Secretary for Combinatorial Auctions and MatroidsSoheil Ehsani, MohammadTaghi Hajiaghayi, Thomas Kesselheim, Sahil Singla. 700-714 [doi]
• Strong Algorithms for the Ordinal Matroid Secretary ProblemJosé A. Soto, Abner Turkieltaub, Victor Verdugo. 715-734 [doi]
• A Framework for the Secretary Problem on the Intersection of MatroidsMoran Feldman, Ola Svensson, Rico Zenklusen. 735-752 [doi]
• Truthful Multi-Parameter Auctions with Online Supply: an Impossible CombinationNikhil R. Devanur, Balasubramanian Sivan, Vasilis Syrgkanis. 753-769 [doi]
• Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision ProcessesAaron Sidford, Mengdi Wang, Xian Wu, Yinyu Ye. 770-787 [doi]
• Lifting Linear Extension Complexity Bounds to the Mixed-Integer SettingAlfonso Cevallos, Stefan Weltge, Rico Zenklusen. 788-807 [doi]
• Proximity results and faster algorithms for Integer Programming using the Steinitz LemmaFriedrich Eisenbrand, Robert Weismantel. 808-816 [doi]
• Approximating Weighted Tree Augmentation via Chvátal-Gomory CutsSamuel Fiorini, Martin Groß 0001, Jochen Könemann, Laura Sanità. 817-831 [doi]
• Geometric Rescaling Algorithms for Submodular Function MinimizationDaniel Dadush, László A. Végh, Giacomo Zambelli. 832-848 [doi]
• Submodular Minimization Under Congruency ConstraintsMartin Nägele, Benny Sudakov, Rico Zenklusen. 849-866 [doi]
• The Entropy of Backwards AnalysisMathias Bæk Tejs Knudsen, Mikkel Thorup. 867-880 [doi]
• More Logarithmic-Factor Speedups for 3SUM, (median, +)-Convolution, and Some Geometric 3SUM-Hard ProblemsTimothy M. Chan. 881-897 [doi]
• On the complexity of range searching among curvesPeyman Afshani, Anne Driemel. 898-917 [doi]
• On Separating Points by LinesSariel Har-Peled, Mitchell Jones. 918-932 [doi]
• Voronoi tessellations in the CRT and continuum random maps of finite excessLouigi Addario-Berry, Omer Angel, Guillaume Chapuy, Éric Fusy, Christina Goldschmidt. 933-946 [doi]
• Online Bipartite Matching with Amortized ReplacementsAaron Bernstein, Jacob Holm, Eva Rotenberg. 947-959 [doi]
• Randomized Online Matching in Regular GraphsIlan Reuven Cohen, David Wajc. 960-979 [doi]
• Randomized Algorithms for Online Vector Load BalancingYossi Azar, Ilan Reuven Cohen, Debmalya Panigrahi. 980-991 [doi]
• k-Server in Uniform MetricsNikhil Bansal, Marek Eliás 0001, Grigorios Koumoutsos, Jesper Nederlof. 992-1001 [doi]
• t-Bounded AdversaryHarry Lang. 1002-1014 [doi]
• Approximating the Largest Root and Applications to Interlacing FamiliesNima Anari, Shayan Oveis Gharan, Amin Saberi, Nikhil Srivastava. 1015-1028 [doi]
• Improved Rectangular Matrix Multiplication using Powers of the Coppersmith-Winograd TensorFrancois Le Gall, Florent Urrutia. 1029-1046 [doi]
• A fast generalized DFT for finite groups of Lie typeChloe Ching-Yun Hsu, Chris Umans. 1047-1059 [doi]
• A Two-pronged Progress in Structured Dense Matrix Vector MultiplicationChristopher De Sa, Albert Gu, Rohan Puttagunta, Christopher Ré, Atri Rudra. 1060-1079 [doi]
• A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix RankRadu Curticapean, Nathan Lindzey, Jesper Nederlof. 1080-1099 [doi]
• Fréchet-Stable Signatures Using Persistence HomologyDonald R. Sheehy. 1100-1108 [doi]
• On the Decidability of the Fréchet Distance between SurfacesAmir Nayyeri, Hanzhong Xu. 1109-1120 [doi]
• On the complexity of optimal homotopiesErin Wolf Chambers, Arnaud de Mesmay, Tim Ophelders. 1121-1134 [doi]
• Computing Simplicial Representatives of Homotopy Group ElementsMarek Filakovský, Peter Franek, Uli Wanger, Stephan Zhechev. 1135-1151 [doi]
• Persistent Path Homology of Directed NetworksSamir Chowdhury, Facundo Mémoli. 1152-1169 [doi]
• Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduceMahdi Boroujeni, Soheil Ehsani, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Saeed Seddighin. 1170-1189 [doi]
• Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can)Karl Bringmann, Pawel Gawrychowski, Shay Mozes, Oren Weimann. 1190-1206 [doi]
• On the Difference Between Closest, Furthest, and Orthogonal Pairs: Nearly-Linear vs Barely-Subquadratic ComplexityRyan Williams. 1207-1215 [doi]
• Multivariate Fine-Grained Complexity of Longest Common SubsequenceKarl Bringmann, Marvin Künnemann. 1216-1235 [doi]
• Tight Hardness for Shortest Cycles and Paths in Sparse GraphsAndrea Lincoln, Virginia Vassilevska Williams, R. Ryan Williams. 1236-1252 [doi]
• Nested Convex Bodies are ChaseableNikhil Bansal, Martin Böhm, Marek Eliás 0001, Grigorios Koumoutsos, Seeun William Umboh. 1253-1260 [doi]
• Scheduling When You Don't Know the Number of MachinesClifford Stein, Mingxian Zhong. 1261-1273 [doi]
• Stochastic Load Balancing on Unrelated MachinesAnupam Gupta, Amit Kumar 0001, Viswanath Nagarajan, Xiangkun Shen. 1274-1285 [doi]
• Boolean function analysis meets stochastic optimization: An approximation scheme for stochastic knapsackAnindya De. 1286-1305 [doi]
• An Alon-Boppana Type Bound for Weighted Graphs and Lowerbounds for Spectral SparsificationNikhil Srivastava, Luca Trevisan. 1306-1315 [doi]
• 3 is NP-hardArnaud de Mesmay, Yo'av Rieck, Eric Sedgwick, Martin Tancer. 1316-1329 [doi]
• Fast, Deterministic and Sparse Dimensionality ReductionDaniel Dadush, Cristóbal Guzmán, Neil Olver. 1330-1344 [doi]
• Impossibility of dimension reduction in the nuclear normAssaf Naor, Gilles Pisier, Gideon Schechtman. 1345-1352 [doi]
• Steiner Point Removal - Distant Terminals Don't (Really) BotherYun Kuen Cheung. 1353-1360 [doi]
• k)Arnold Filtser. 1361-1373 [doi]
• Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip SpannersJakub Pachocki, Liam Roditty, Aaron Sidford, Roei Tov, Virginia Vassilevska Williams. 1374-1392 [doi]
• A tight -approximation for Linear 3-CutKristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan. 1393-1406 [doi]
• Near-optimal approximation algorithm for simultaneous Max-CutAmey Bhangale, Subhash Khot, Swastik Kopparty, Sushant Sachdeva, Devanathan Thiruvenkatachari. 1407-1425 [doi]
• k-Cut in Randomized Polynomial TimeKarthekeyan Chandrasekaran, Chao Xu, Xilin Yu. 1426-1438 [doi]
• A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs with a Fixed Number of TerminalsVincent Cohen-Addad, Éric Colin de Verdière, Arnaud de Mesmay. 1439-1458 [doi]
• Optimal-Time Text Indexing in BWT-runs Bounded SpaceTravis Gagie, Gonzalo Navarro, Nicola Prezza. 1459-1477 [doi]
• Lempel-Ziv: a "one-bit catastrophe" but not a tragedyGuillaume Lagarde, Sylvain Perifel. 1478-1495 [doi]
• In-Place Sparse Suffix SortingNicola Prezza. 1496-1508 [doi]
• Optimal Dynamic StringsPawel Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Lacki, Piotr Sankowski. 1509-1528 [doi]
• Improved bounds for testing Dyck languagesEldar Fischer, Frédéric Magniez, Tatiana A. Starikovskaya. 1529-1544 [doi]
• Probabilistic Existence of Large Sets of DesignsShachar Lovett, Sankeerth Rao, Alexander Vardy. 1545-1556 [doi]
• Computing the Independence Polynomial: from the Tree Threshold down to the RootsNicholas J. A. Harvey, Piyush Srivastava, Jan Vondrák. 1557-1576 [doi]
• Localization of Electrical FlowsAaron Schild, Satish Rao, Nikhil Srivastava. 1577-1584 [doi]
• Lower Bounds for Approximating the Matching PolytopeMakrand Sinha. 1585-1604 [doi]
• Stability of the Lanczos Method for Matrix Function ApproximationCameron Musco, Christopher Musco, Aaron Sidford. 1605-1624 [doi]
• Quasi-regular sequences and optimal schedules for security gamesDavid Kempe 0001, Leonard J. Schulman, Omer Tamuz. 1625-1644 [doi]
• A Hamiltonian Cycle in the Square of a 2-connected Graph in Linear TimeStephen Alstrup, Agelos Georgakopoulos, Eva Rotenberg, Carsten Thomassen. 1645-1649 [doi]
• Ramsey Spanning Trees and their ApplicationsIttai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman. 1650-1664 [doi]
• Erdős-Pósa property of chordless cycles and its applicationsEun Jung Kim, O.-joung Kwon. 1665-1684 [doi]
• Thin graph classes and polynomial-time approximation schemesZdenek Dvorák. 1685-1701 [doi]
• Estimating graph parameters via random walks with restartsAnna Ben-Hamou, Roberto I. Oliveira, Yuval Peres. 1702-1714 [doi]
• Tight Bounds for Coalescing-Branching Random Walks on Regular GraphsPetra Berenbrink, George Giakkoupis, Peter Kling. 1715-1733 [doi]
• Comparing mixing times on sparse random graphsAnna Ben-Hamou, Eyal Lubetzky, Yuval Peres. 1734-1740 [doi]
• Uniform generation of random graphs with power-law degree sequencesPu Gao, Nicholas C. Wormald. 1741-1758 [doi]
• Sampling Random Colorings of Sparse Random GraphsCharilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda. 1759-1771 [doi]
• The Complexity of Counting Surjective Homomorphisms and CompactionsJacob Focke, Leslie Ann Goldberg, Stanislav Zivny. 1772-1781 [doi]
• Promise Constraint Satisfaction: Structure Theory and a Symmetric Boolean DichotomyJoshua Brakensiek, Venkatesan Guruswami. 1782-1801 [doi]
• c ProblemsJin-yi Cai, Pinyan Lu, Mingji Xia. 1802-1821 [doi]
• The Robust Sensitivity of Boolean FunctionsShachar Lovett, Avishay Tal, Jiapeng Zhang. 1822-1833 [doi]
• Resource-Efficient Common Randomness and Secret-Key SchemesBadih Ghazi, T. S. Jayram. 1834-1853 [doi]
• t-path TSPVera Traub, Jens Vygen. 1854-1864 [doi]
• Reachability Preservers: New Extremal Bounds and Approximation AlgorithmsAmir Abboud, Greg Bodwin. 1865-1883 [doi]
• Optimal Vertex Fault Tolerant Spanners (for fixed stretch)Greg Bodwin, Michael Dinitz, Merav Parter, Virginia Vassilevska Williams. 1884-1900 [doi]
• Approximate Single Source Fault Tolerant Shortest PathSurender Baswana, Keerti Choudhary, Moazzam Hussain, Liam Roditty. 1901-1915 [doi]
• When Recursion is Better than Iteration: A Linear-Time Algorithm for Acyclicity with Few Error VerticesDaniel Lokshtanov, M. S. Ramanujan, Saket Saurabh 0001. 1916-1933 [doi]
• The Diameter of Dense Random Regular GraphsNobutaka Shimizu. 1934-1944 [doi]
• Consensus of Interacting Particle Systems on Erdös-Rényi GraphsGrant Schoenebeck, Fang-Yi Yu. 1945-1964 [doi]
• Spatial Mixing and Non-local Markov chainsAntonio Blanca, Pietro Caputo, Alistair Sinclair, Eric Vigoda. 1965-1980 [doi]
• Exponentially slow mixing in the mean-field Swendsen-Wang dynamicsReza Gheissari, Eyal Lubetzky, Yuval Peres. 1981-1988 [doi]
• Testing Ising ModelsConstantinos Daskalakis, Nishanth Dikkala, Gautam Kamath. 1989-2007 [doi]
• On the Competition Complexity of Dynamic Mechanism DesignSiqi Liu, Christos-Alexandros Psomas. 2008-2025 [doi]
• The menu complexity of "one-and-a-half-dimensional" mechanism designRaghuvansh R. Saxena, Ariel Schvartzman, S. Matthew Weinberg. 2026-2035 [doi]
• On the Complexity of Simple and Optimal Deterministic Mechanisms for an Additive BuyerXi Chen, George Matikas, Dimitris Paparas, Mihalis Yannakakis. 2036-2049 [doi]
• Revenue Maximization with an Uncertainty-Averse BuyerShuchi Chawla 0001, Kira Goldner, J. Benjamin Miller, Emmanouil Pountourakis. 2050-2068 [doi]
• Separation in Correlation-Robust Monopolist Problem with BudgetNick Gravin, Pinyan Lu. 2069-2080 [doi]
• Testing bounded arboricityTalya Eden, Reut Levi, Dana Ron. 2081-2092 [doi]
• Improved Bounds for Testing Forbidden Order PatternsOmri Ben-Eliezer, Clément L. Canonne. 2093-2112 [doi]
• Tolerant Junta Testing and the Connection to Submodular Optimization and Function IsomorphismEric Blais, Clément L. Canonne, Talya Eden, Amit Levi, Dana Ron. 2113-2132 [doi]
• dHadley Black, Deeparnab Chakrabarty, C. Seshadhri. 2133-2151 [doi]
• Tight Analysis of Parallel Randomized Greedy MISManuela Fischer, Andreas Noever. 2152-2160 [doi]
• Derandomized concentration bounds for polynomials, and hypergraph maximal independent setDavid G. Harris. 2161-2180 [doi]
• Community Detection on Euclidean Random GraphsAbishek Sankararaman, François Baccelli. 2181-2200 [doi]
• Cache-Oblivious and Data-Oblivious Sorting and ApplicationsT.-H. Hubert Chan, Yue Guo, Wei-Kai Lin, Elaine Shi. 2201-2220 [doi]
• Space-Optimal Majority in Population ProtocolsDan Alistarh, James Aspnes, Rati Gelashvili. 2221-2239 [doi]
• Approximate Positive Correlated Distributions and Approximation Algorithms for D-optimal DesignMohit Singh, Weijun Xie. 2240-2255 [doi]
• On Simultaneous Two-player Combinatorial AuctionsMark Braverman, Jieming Mao, S. Matthew Weinberg. 2256-2273 [doi]
• Nash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave UtilitiesNima Anari, Tung Mai, Shayan Oveis Gharan, Vijay V. Vazirani. 2274-2290 [doi]
• From Battlefields to Elections: Winning Strategies of Blotto and Auditing GamesSoheil Behnezhad, Avrim Blum, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Christos H. Papadimitriou, Ronald L. Rivest, Saeed Seddighin, Philip B. Stark. 2291-2310 [doi]
• A New Class of Combinatorial Markets with Covering Constraints: Algorithms and ApplicationsNikhil R. Devanur, Jugal Garg, Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod. 2311-2325 [doi]
• Approximating the Nash Social Welfare with Budget-Additive ValuationsJugal Garg, Martin Hoefer, Kurt Mehlhorn. 2326-2340 [doi]
• Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and DiameterKrishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer. 2341-2356 [doi]
• Algorithms based on *-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testingGábor Ivanyos, Youming Qiao. 2357-2376 [doi]
• Kirchhoff Index as a Measure of Edge Centrality in Weighted Networks: Nearly Linear Time AlgorithmsHuan Li, Zhongzhi Zhang. 2377-2396 [doi]
• Conflict-Free Coloring of Intersection Graphs of Geometric ObjectsChaya Keller, Shakhar Smorodinsky. 2397-2411 [doi]
• Tight Bounds on the Round Complexity of the Distributed Maximum Coverage ProblemSepehr Assadi, Sanjeev Khanna. 2412-2431 [doi]
• Optimal streaming and tracking distinct elements with high probabilityJaroslaw Blasiok. 2432-2448 [doi]
• Estimating Graph Parameters from Random Order StreamsPan Peng, Christian Sohler. 2449-2466 [doi]
• Set Cover in Sub-linear TimePiotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee. 2467-2486 [doi]
• ∊) Spectral Sketches for the Laplacian and its PseudoinverseArun Jambulapati, Aaron Sidford. 2487-2503 [doi]
• k Ranking under the Multinomial Logit ModelXi Chen, Yuanzhi Li, Jieming Mao. 2504-2522 [doi]
• The Price of Information in Combinatorial OptimizationSahil Singla. 2523-2532 [doi]
• The Value of Information ConcealmentHu Fu, Christopher Liaw, Pinyan Lu, Zhihao Gavin Tang. 2533-2544 [doi]
• Targeting and Signaling in Ad AuctionsAshwinkumar Badanidiyuru, Kshipra Bhawalkar, Haifeng Xu. 2545-2563 [doi]
• Envy-free Chore Division for An Arbitrary Number of AgentsSina Dehghani, Alireza Farhadi, Mohammad Taghi Hajiaghayi, Hadi Yami. 2564-2583 [doi]
• Almost Envy-Freeness with General ValuationsBenjamin Plaut, Tim Roughgarden. 2584-2603 [doi]
• Labeling Schemes for Nearest Common Ancestors through Minor-Universal TreesPawel Gawrychowski, Fabian Kuhn, Jakub Lopuszanski, Konstantinos Panagiotou, Pascal Su. 2604-2619 [doi]
• O(1) Rounds of Congested CliqueTomasz Jurdzinski, Krzysztof Nowicki 0002. 2620-2632 [doi]
• The Complexity of Distributed Edge Coloring with Small PalettesYi-Jun Chang, Qizheng He, Wenzheng Li, Seth Pettie, Jara Uitto. 2633-2652 [doi]
• Fast Space Optimal Leader Election in Population ProtocolsLeszek Gasieniec, Grzegorz Stachowiak. 2653-2667 [doi]
• Ergodic Effects in Token CirculationAdrian Kosowski, Przemyslaw Uznanski. 2668-2682 [doi]
• Robustly Learning a Gaussian: Getting Optimal Error, EfficientlyIlias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Li 0001, Ankur Moitra, Alistair Stewart. 2683-2702 [doi]
• Cycles in Adversarial Regularized LearningPanayotis Mertikopoulos, Christos Papadimitriou, Georgios Piliouras. 2703-2717 [doi]
• Improved Coresets for Kernel Density EstimatesJeff M. Phillips, Wai Ming Tai. 2718-2727 [doi]
• Non interactive simulation of correlated distributions is decidableAnindya De, Elchanan Mossel, Joe Neeman. 2728-2746 [doi]
• Which Distribution Distances are Sublinearly Testable?Constantinos Daskalakis, Gautam Kamath, John Wright. 2747-2764 [doi]
• Fully polynomial FPT algorithms for some classes of bounded clique-width graphsDavid Coudert, Guillaume Ducoffe , Alexandru Popa. 2765-2784 [doi]
• Covering Small Independent Sets and Separators with Applications to Parameterized AlgorithmsDaniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi. 2785-2800 [doi]
• Covering a tree with rooted subtrees - parameterized and approximation algorithmsLin Chen 0009, Dániel Marx. 2801-2820 [doi]
• k-CutAnupam Gupta, Euiwoong Lee, Jason Li. 2821-2837 [doi]
• Parameterized Algorithms for Survivable Network Design with Uniform DemandsJørgen Bang-Jensen, Manu Basavaraju, Kristine Vitting Klinkby, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh 0001, Meirav Zehavi. 2838-2850 [doi]