Table of Contents

• Plane Strong Connectivity AugmentationStéphane Bessy, Daniel Gonçalves 0001, Amadeus Reinald, Dimitrios M. Thilikos. [doi]
• On the Complexity of the Matching Problem of Regular Expressions with BackreferencesSoh Kumabe, Yuya Uezato. [doi]
• A 9/4-Approximation for Directed Feedback Vertex Sets in Quasi-Transitive DigraphsEbrahim Ghorbani, Matthias Mnich. [doi]
• Approximating 1-In-3 SAT by Linearly Ordered Hypergraph 3-Colouring Is NP-HardAndrei A. Krokhin, Danny Vagnozzi. [doi]
• Touring a Sequence of Orthogonal PolygonsKatrin Casel, Sándor Kisfaludi-Bak, Linda Kleist, Jeroen S. K. Lamme, Eunjin Oh 0001, Yanheng Wang 0001. [doi]
• Recursion and Proof Theoretical Characterizations of Small Circuit Classes with Modulo Counting via Discrete Differential EquationsMelissa Antonelli, Arnaud Durand 0001, Rui Li. [doi]
• Revisiting Finiteness of Matrix MonoidsRida Ait El Manssour, Roland Guttenberg, Nathan Lhote, Mahsa Shirmohammadi, James B. Worrell. [doi]
• Automata on S-Adic WordsValérie Berthé, Toghrul Karimov, Mihir Vahanwala. [doi]
• Everybody Wants to Be a Seed: Arbitrary Single-Tile Seeds in the Abstract Tile Assembly ModelFlorent Becker, Marie de Sainte Marie. [doi]
• p-NormsSami Davies, Benjamin Moseley, Heather Newman. [doi]
• Faster Algorithms for (2k-1)-Stretch Distance OraclesAvi Kadria, Liam Roditty. [doi]
• Exploring VASS Parameterised by Geometric DimensionWojciech Czerwinski, Roland Guttenberg, Lukasz Orlikowski, Henry Sinclair-Banks, Yangluo Zheng. [doi]
• Near Linear Time Approximation Schemes for Clustering of Partially Doubling MetricsAnne Driemel, Jan Höckendorff, Ioannis Psarros, Christian Sohler, Di Yue. [doi]
• On Randomness Complexity of 1-Private ProtocolsSamuel Dittmer, Rafail Ostrovsky. [doi]
• On (In)approximability of MaxMin Independent Set ReconfigurationHung P. Hoang 0001, Naoto Ohsaka, Rin Saito, Yuma Tamura. [doi]
• Combinatorial Perpetual Scheduling: Existence and Computation of Low-Height SchedulesMirabel Mendoza-Cadena, Arturo Merino, Mads Anker Nielsen, Kevin Schewior. [doi]
• Submodular Maximization over a Matroid k-Intersection: Multiplicative Improvement over GreedyMoran Feldman, Justin Ward. [doi]
• Static to Dynamic Correlation ClusteringNairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li 0001, David Rasmussen Lolck, Alantha Newman, Mikkel Thorup, Lukas Vogl, Shuyi Yan, Hanwen Zhang 0003. [doi]
• Faster Weak Expander Decompositions and Approximate Max FlowHenry L. Fleischmann, George Z. Li, Jason Li 0006. [doi]
• A Diagrammatic Axiomatisation of Behavioural Distance of Nondeterministic ProcessesWojciech Rozowski, Robin Piedeleu, Alexandra Silva 0001, Fabio Zanasi. [doi]
• Loop Termination and Generalized Collatz SequencesMishel Carelli. [doi]
• The Stochastic Block Model Has the Overlap Graph Property for ModularityShankar Bhamidi, David Gamarnik, Remco van der Hofstad, Nelly Litvak, Pawel Pralat, Fiona Skerman, Yasmin Tousinejad. [doi]
• The Impossibility of Simultaneous Time and I/O Optimality for the Planar Maxima and Convex Hull ProblemsPeyman Afshani, Gerth Stølting Brodal, Nodari Sitchinava. [doi]
• Multiplicative Assignment with UpgradesAlexander Armbruster 0002, Lars Rohwedder, Stefan Weltge, Andreas Wiese, Ruilong Zhang 0001. [doi]
• The Complexity of Finding Coset-Generating Polymorphisms and the Promise MetaproblemManuel Bodirsky, Armin Weiß. [doi]
• On the Hardness of Recognizing Graphs of Small Mim-Width and Its VariantsMax Dupré la Tour, Manuel Lafond, Ndiamé Ndiaye. [doi]
• Preservation Theorems in Semiring SemanticsSophie Brinke, Anuj Dawar, Erich Grädel, Benedikt Pago. [doi]
• On Tight FPT Time Approximation Algorithms for k-Clustering ProblemsHan Dai, Shi Li 0001, Sijin Peng. [doi]
• Mind the Gap? Not for SVP Hardness Under ETH!Divesh Aggarwal, Rishav Gupta, Aditya Morolia, Chuanqi Zhang. [doi]
• Fully Dynamic Algorithms for Coloring Triangle-Free GraphsSepehr Assadi, Helia Yazdanyar. [doi]
• Quantum Multi-Level Estimation of Functionals of Discrete DistributionsKean Chen, Minbo Gao, Tongyang Li, Qisheng Wang, Xinzhao Wang. [doi]
• The Compressed Oracle Is A Worthy (Multiplicative) AdversaryStacey Jeffery, Sebastian Zur. [doi]
• Charting the Landscape of Diameter Computation on Geometric Intersection Graphs in the PlaneTimothy M. Chan, Hsien-Chih Chang, Jie Gao 0001, Sándor Kisfaludi-Bak, Hung Le 0001, Da-Wei Zheng. [doi]
• Online Preemptive Matching RevisitedPeter Kiss, Mohammad Sharifi. [doi]
• On the Pure Quantum Polynomial Hierarchy and Quantified Hamiltonian ComplexitySabee Grewal, Dorian Rudolph. [doi]
• Online Monotone Metric EmbeddingsChristian Coester, Yichen Huang 0001. [doi]
• Edit Distance of Finite-Valued TransducersPrince Mathew 0001, Saina Sunny. [doi]
• Computing Flows in Subquadratic SpaceJan van den Brand, Zhao Song 0002, Albert Weng. [doi]
• Witness-Sensitive Detection of Induced DiamondsKeren Censor Hillel, Tomer Even, Virginia Vassilevska Williams, Nathan Wallheimer. [doi]
• Inapproximability of Counting Permutation PatternsMichal Opler. [doi]
• The Complexity of Bisimilarity and Model Checking in Finitary DiagramsMarkus Bläser, Sagnik Dutta, Samuel Okyay. [doi]
• Determining the Outerthickness of Graphs Is NP-HardPin-Hsian Lee, Te-Cheng Liu, Meng-Tsung Tsai. [doi]
• Pseudo-Deterministic Quantum AlgorithmsHugo Aaronson, Tom Gur, Jiawei Li 0014. [doi]
• Kronecker Scaling of Tensors with Applications to Arithmetic Circuits and AlgorithmsAndreas Björklund, Petteri Kaski, Tomohiro Koana, Jesper Nederlof. [doi]
• Online Metric TSP: Beyond the √n BarrierYossi Azar, Debmalya Panigrahi, Or Vardi. [doi]
• Odd-Cycle-Packing-Treewidth: On the Maximum Independent Set Problem in Odd-Minor-Free Graph ClassesMujin Choi, Maximilian Gorsky, Gunwoo Kim, Caleb McFarland, Sebastian Wiederrecht. [doi]
• New Convex Programming Technique for Nash Social Welfare and SchedulingYuda Feng, Weijiang Hu, Shi Li 0001. [doi]
• Hardness and Approximation for Coloring DigraphsParinya Chalermsook, Harmender Gahlawat, Felix Klingelhöfer, Alantha Newman, Chaoliang Tang. [doi]
• On the Average-Case Performance of Greedy for Maximum CoverageEric Balkanski, Jason Chatzitheodorou, Flore Sentenac. [doi]
• Mutable Batch Arguments and ApplicationsRishab Goyal. [doi]
• Optimal Parallel Basis Finding in Graphic and Related MatroidsSanjeev Khanna, Aaron Putterman, Junkai Song. [doi]
• Tight Regret Bounds for Fixed-Price Bilateral TradeHoushuang Chen, Yaonan Jin, Pinyan Lu, Chihao Zhang 0001. [doi]
• Witnesses for Fixpoint Games on LatticesBarbara König 0001, Karla Messing. [doi]
• The Quantum Smooth Label Cover Problem Is UndecidableEric Culf, Kieran Mastel, Connor Paddock, Taro Spirig. [doi]
• From Sets to Points: Simplifying MSO Interpretations via ReparameterizationsAlexander Rabinovich. [doi]
• Infinite-State Games with Energy Objectives Beyond CountersIrmak Saglam, Georg Zetzsche. [doi]
• Unsplittable TransshipmentsSrinwanti Debgupta, Sarah Morell, Martin Skutella. [doi]
• A Constant-Factor Approximation for Continuous Dynamic Time Warping in 2DKevin Buchin, Maike Buchin, Jan Erik Swiadek, Sampson Wong. [doi]
• New Diameter Approximations via Distance Oracle TechniquesYael Kirkpatrick, Liam Roditty, Richard Qi, Virginia Vassilevska Williams. [doi]
• A Lifting Theorem for Hybrid Classical-Quantum Communication ComplexityXudong Wu, Guangxu Yang, Penghui Yao. [doi]
• Faster Triangulation Mixing via Transport FlowsVedat Levi Alev, Daniel Frishberg, Michail Sarantis, Prasad Tetali. [doi]
• Connectivity Oracle Under Vertex Failures by Shortcutting Unbreakable DecompositionXizhe Li, Yaowei Long, David Pidugu, Thatchaphol Saranurak, Benyu Wang. [doi]
• Going Beyond Twin-Width? CSPs with Unbounded Domain and Few VariablesPeter Jonsson, Victor Lagerkvist, Jorke M. de Vlas, Magnus Wahlström. [doi]
• White-Box Adversarial Streaming Lower Bounds Beyond Two-Party CommunicationKlim Efremenko, Gillat Kol, Raghuvansh R. Saxena, Zhijun Zhang 0007. [doi]
• Partially-Dynamic Maximum Flow in Dense GraphsEgor Kravchenko, Maximilian Probst Gutenberg. [doi]
• Thin Trees for near Minimum CutsNathan Klein, Neil Olver, Zi Song Yeoh. [doi]
• Expander Decomposition with Almost Optimal OverheadNikhil Bansal 0001, Arun Jambulapati, Thatchaphol Saranurak. [doi]
• Alternation Depth of Threshold Decision ListsVladimir Podolskii 0001, Morgan E. Prior. [doi]
• Out-Of-Order Membership in Regular LanguagesAntoine Amarilli, Sébastien Labbé 0003, Charles Paperman. [doi]
• Faster Algorithms for k-Orthogonal Vectors in Low DimensionAnita Dürr, Evangelos Kipouridis, Michael Lampis, Karol Wegrzycki. [doi]
• Coordinated Motion Planning Is FPT on Discretized Simple PolygonsArgyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj. [doi]
• From Worst-Case Hardness of NP to Quantum Cryptography via Quantum Indistinguishability ObfuscationTomoyuki Morimae, Yuki Shirakawa, Takashi Yamakawa. [doi]
• Tracing AG Codes: Toward Meeting the Gilbert-Varshamov BoundGil Cohen, Dean Doron, Noam Goldgraber, Tomer Manket. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Towards Tight Robust Coresets for k-Medians ClusteringLingxiao Huang, Zhenyu Jiang, Yi Li 0002, Xuan Wu 0002. [doi]
• Fast Shortest Path in Graphs with Sparse Signed Tree Models and ApplicationsÉdouard Bonnet, Colin Geniet, Eun Jung Kim 0002, Sungmin Moon. [doi]
• Persistent Amortised Analysis, OperationallyAnton Lorenzen. [doi]
• Multi-Environment MDPs with Prior and Universal SemanticsBenjamin Bordais, Jean-François Raskin. [doi]
• Set Automata and Limits of Decidability of Two-Variable Logic on Data WordsShibashis Guha, Amaldev Manuel, S. P. Rishal. [doi]
• When Does Sparsity Help for k-Independent Set in Hypergraphs and Other Boolean CSPs?Timo Fritsch, Marvin Künnemann, Mirza Redzic, Julian Stieß. [doi]
• Pinning on Tight Cuts: Improved Algorithm and Bounds for Unsplittable Multicommodity Flows in Outerplanar GraphsDavid Alemán Espinosa, Niklas Schlomberg. [doi]
• How Hard Is It to Verify a Classical Shadow?Georgios Karaiskos, Dorian Rudolph, Johannes Jakob Meyer, Jens Eisert, Sevag Gharibian. [doi]
• Decidability and Complexity Borders of Reachability Problems (Invited Talk)Georg Zetzsche. [doi]
• Optimally Controlling a Random PopulationHugo Gimbert, Corto Mascle, Patrick Totzke. [doi]
• Unique Decoding of Reed-Solomon and Related Codes for Semi-Adversarial ErrorsJoshua Brakensiek, Yeyuan Chen, Manik Dhar, Zihan Zhang 0001. [doi]
• Multiplicative Error Set System Sparsification: A Simpler Proof via Chain Length ContractionJoshua Brakensiek, Venkatesan Guruswami, Aaron Putterman. [doi]
• Algebraic Proof Systems: An Algebraic Approach to Analysing Proofs (Invited Talk)Nutan Limaye. [doi]
• The Role of Counting Quantifiers in Laminar Set SystemsRutger Campbell, Noleen Köhler. [doi]
• A Scalable and Unified Framework to Weighted Rank AggregationAmir Carmel, Debarati Das 0001, Tien Long Nguyen. [doi]
• Expregular FunctionsThomas Colcombet, Nathan Lhote, Pierre Ohlmann. [doi]
• Algorithms for Finite Group Epimorphism TestingJoshua A. Grochow, Pranjal Srivastava, Dhara Thakkar. [doi]
• Node-Weighted Triangles: Faster and SimplerShyan Akmal, Nick Fischer. [doi]
• Random Access in Grammar-Compressed Strings: Optimal Trade-Offs in Almost All Parameter RegimesAnouk Duyster, Tomasz Kociumaka. [doi]
• Canonical Labelling of Random Regular GraphsMikhail Isaev, Tamás Makai, Brendan D. McKay, Pawel Pralat, Jane Tan, Maksim Zhukovskii. [doi]
• Clustering Permutations Under the Ulam Metric: A Parameterized Complexity StudyTian Bai 0003, Fedor V. Fomin, Petr A. Golovach, Yash Hiren More, Simon Wietheger. [doi]
• The Expiration Streaming Model: Diameter, k-Center, Counting, Sampling, and FriendsLotte Blank, Sergio Cabello, Mohammad Taghi Hajiaghayi, Robert Krauthgamer, Sepideh Mahabadi, André Nusser, Jeff M. Phillips, Jonas Sauer. [doi]
• Simpler and Improved Replacement Path CoveringsDavide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Martin Schirneck. [doi]
• Average-Case Hardness of Binary-Encoded Clique in Proof and Communication ComplexitySusanna F. de Rezende, David Engström, Yassine Ghannane, Duri Andrea Janett, Artur Riazanov. [doi]
• A Faster Directed Single-Source Shortest Path AlgorithmRan Duan 0003, Xiao Mao, Xinkai Shu, Longhui Yin. [doi]
• Better Diameter Bounds for Efficient Shortcuts and a Structural Criterion for ConstructivenessBernhard Haeupler, Antti Roeyskoe, Zhijun Zhang 0007. [doi]
• Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving WidthDario Cavallaro, Ken-ichi Kawarabayashi, Stephan Kreutzer. [doi]
• Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic TimeLoukas Georgiadis, Evangelos Kipouridis, Evangelos Kosinas, Charis Papadopoulos, Nikos Parotsidis. [doi]
• Proving Algebraic Independence in Zero-KnowledgeMichael A. Forbes 0001, Andrei Staicu. [doi]
• Testing Sparse Functions over the RealsVipul Arora 0002, Arnab Bhattacharyya 0001, Philips George John, Sayantan Sen. [doi]
• Scoped MSO, Register Automata, and Expressions: Equivalence over Data WordsRadoslaw Piórkowski. [doi]
• Lower Bounds on Pure Dynamic Programming for Connectivity Problems on Graphs of Bounded Path-WidthKacper Kluk, Jesper Nederlof. [doi]
• Dynamic Rank, Basis, and MatchingJan van den Brand, Vishal Kumar, Daniel J. Zhang. [doi]
• Connected Dominating Sets in TriangulationsProsenjit Bose, Vida Dujmovic, Hussein Houdrouge, Pat Morin, Saeed Odak. [doi]
• Fully Dynamic Spectral and Cut Sparsifiers for Directed GraphsYibin Zhao 0003. [doi]
• The Network Satisfaction Problem for Relation Algebras with at Most 4 AtomsManuel Bodirsky, Moritz Jahn, Simon Knäuer, Matej Konecný, Paul Winkler. [doi]
• The Dirichlet Mechanism for Rounding with Strong Negative Correlation, with ApplicationsDavid G. Harris 0001, George Z. Li, Nitya Raju, Renata Valieva. [doi]
• Randomized k-Server in Polynomial TimeChristian Coester, Romain Cosson. [doi]
• Edge-Weighted Online Stochastic Matching Under Jaillet-Lu LPShuyi Yan. [doi]
• A Fine-Grained Dichotomy for the Center Problem on Gromov Hyperbolic GraphsGuillaume Ducoffe . [doi]
• 3/7) Round Parallel Algorithm for Matroid BasesSanjeev Khanna, Aaron Putterman, Junkai Song. [doi]
• Fast Decremental Tree Sums in ForestsBenjamin Aram Berendsohn, Marek Sokolowski 0001. [doi]
• Optimal k-Secretary with Logarithmic MemoryMingda Qiao, Wei Zhang. [doi]
• Online Steiner Forest with RecourseYaowei Long, Sepideh Mahabadi, Sherry Sarkar, Jakub Tarnawski. [doi]
• Transducers on Compressed StringsMikolaj Bojanczyk, Markus Lohrey. [doi]
• Recursive Jump Operators and Optimal Proof SystemsFabian Egidy. [doi]
• A Linear Bound for the Size of the Finite Terminal Assembly of a Directed Non-Cooperative Tile Assembly SystemSergiu Ivanov 0001, Damien Regnault. [doi]
• Parallel Reachability and Shortest Paths on Non-Sparse Digraphs: Near-Linear Work and Sub-Square-Root DepthVikrant Ashvinkumar, Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak. [doi]
• Transducing Linear Decompositions of TournamentsColin Geniet, Fatemeh Ghasemi, Mamadou Moustapha Kanté. [doi]
• Incremental (k, z)-Clustering on GraphsEmilio Cruciani, Sebastian Forster, Antonis Skarlatos. [doi]
• Strict Hierarchy for Quantum Channel Certification to UnitaryKean Chen, Qisheng Wang, Zhicheng Zhang 0010. [doi]
• Counting Perfect Matchings and Hamiltonian Cycles FasterBaitian Li. [doi]
• Permutation Patterns in StreamsBenjamin Aram Berendsohn. [doi]
• Back in the Saddle: Toward Parallel Approximate Minimum-Cost FlowRasmus Kyng, Aurelio L. Sulser. [doi]
• Improved Time-Space Tradeoffs for 3SUM-IndexingItai Dinur, Alexander Golovnev. [doi]
• Competitive Bundle TradingYossi Azar, Niv Buchbinder, Roie Levin, Or Vardi. [doi]
• Dynamic Set Cover with Worst-Case RecourseShay Solomon, Amitai Uzrad. [doi]
• Sampling Colorings with Fixed Color Class SizesAiya Kuchukova, Will Perkins 0001, Xavier Povill. [doi]
• VP, VNP and Algebraic Branching Programs over Min-Plus SemiringsBalagopal Komarath, Harshil Mittal, Jayalal Sarma. [doi]
• Deciding DFA-Primality Is NP-HardDaniel Alexander Spenner. [doi]
• Local Samplers for Product DistributionsJordan Horacsek, Chin Ho Lee, Igor Shinkar, Emanuele Viola, Renfei Zhou. [doi]
• Preprocessed 3SUM for Unknown Universes with Subquadratic SpaceYael Kirkpatrick, John Kuszmaul, Surya Mathialagan, Virginia Vassilevska Williams. [doi]
• Compressing Suffix Trees by Path DecompositionsRuben Becker, Davide Cenzato, Travis Gagie, Ragnar Groot Koerkamp, Sung-Hwan Kim, Giovanni Manzini, Nicola Prezza. [doi]
• Gray Codes with Constant Delay and Constant Auxiliary SpaceAntoine Amarilli, Claire David, Nadime Francis, Victor Marsault, Mikaël Monet, Yann Strozecki. [doi]
• Beyond Brooks: (Δ-1)-Coloring in Semi-StreamingMaxime Flin, Magnús M. Halldórsson. [doi]
• Optimal Inapproximability of Generalized Linear Equations over a Finite GroupAmey Bhangale, Yezhou Zhang. [doi]
• Near-Optimal Dynamic Data Structures for Maximum Depth and Klee's Measure of BoxesSujoy Bhore, Subhash Suri, Jie Xue 0003, Xiongxin Yang, Jiumu Zhu. [doi]
• Equivalence Between Coding and Complexity Lower BoundsJinqiao Hu, Zhenjian Lu, Igor C. Oliveira 0001. [doi]
• Asymptotic Hausdorff and Language SimilarityDana Fisman, Gal Meirom. [doi]
• Quantum Advantage in Proof Systems Without EntanglementKrishna Agaram, Nicholas Spooner, Yuxi Zheng. [doi]
• Fine-Grained Complexity of Computing Degree-Constrained Spanning TreesNarek Bojikian, Alexander Firbas, Robert Ganian, Hung P. Hoang 0001, Krisztina Szilágyi. [doi]
• Classification of Local Optimization Problems in Directed CyclesThomas Boudier, Fabian Kuhn, Augusto Modanese, Ronja Stimpert, Jukka Suomela. [doi]
• Hardness, Tractability and Density Thresholds of Finite Pinwheel Scheduling VariantsSotiris Kanellopoulos, Giorgos Mitropoulos, Christos Pergaminelis, Thanos Tolias. [doi]
• Improved Tree Sparsifiers in Near-Linear TimeDaniel Agassy, Dani Dorfman, Haim Kaplan. [doi]
• Shuffles of Context-Free Languages Along Regular TrajectoriesCorentin Barloy, Michaël Cadilhac, Kyle Ockerlund. [doi]
• Unambiguisability and Register Minimisation of Min-Plus ModelsShaull Almagor, Guy Arbel, Sarai Sheinvald. [doi]
• Chasing Small Sets Optimally Against Adaptive AdversariesChristian Coester, Alexa Tudose. [doi]
• Spiky Rank and Its Applications to Rigidity and CircuitsLianna Hambardzumyan, Konstantin Myasnikov, Artur Riazanov, Morgan Shirley, Adi Shraibman. [doi]
• An Algorithmic Proof of Kruskal's Tensor Decomposition TheoremVishwas Bhargava, Leonard J. Schulman, Shiri Sivan. [doi]
• Optimal Lower Bounds for Symmetric Modular CircuitsBenedikt Pago. [doi]
• k/2 ThresholdArpon Basu, Jun-Ting Hsieh, Andrew D. Lin, Peter Manohar. [doi]
• Quickly Excluding an Annotated Planar GraphMaximilian Gorsky, Evangelos Protopapas, Sebastian Wiederrecht. [doi]
• Visibility Queries in Simple PolygonsSujoy Bhore, Chih-Hung Liu 0001, Anurag Murty Naredla, Yakov Nekrich, Eunjin Oh 0001, André van Renssen, Frank Staals, Haitao Wang 0001, Jie Xue 0003. [doi]
• Stone Duality Proofs for Colorless Distributed Computability TheoremsCameron Calk, Emmanuel Godard. [doi]
• Faster Deterministic Streaming Vertex ColoringShiri Chechik, Hongyi Chen, Tianyi Zhang 0008. [doi]
• Relative-Error Unateness TestingXi Chen 0001, Diptaksho Palit, Kabir Peshawaria, William Pires, Rocco A. Servedio, Yiding Zhang. [doi]
• Geometric Optimization Parameterized by Piercing ComplexityAritra Banik, Rajiv Raman 0001, Saurabh Ray. [doi]
• Learning Multinomial Logits in O(n log n) TimeFlavio Chierichetti, Mirko Giacchini, Ravi Kumar 0001, Silvio Lattanzi, Alessandro Panconesi, Erasmo Tani, Andrew Tomkins. [doi]
• Online Matroid EmbeddingsAndrés Cristi, Paul Dütting, Robert Kleinberg, Renato Paes Leme, Neel Patel. [doi]
• Suffix Random Access via Function Inversion: A Key for Asymmetric Streaming String AlgorithmsPanagiotis Charalampopoulos, Taha El Ghazi, Jonas Ellert, Pawel Gawrychowski, Tatiana Starikovskaya. [doi]
• Constant Rate Isometric Embeddings of Hamming Metric into Edit MetricSudatta Bhattacharya, Sanjana Dey, Elazar Goldenberg, Mursalin Habib 0001, Bernhard Haeupler, Karthik C. S. 0001, Michal Koucký 0001. [doi]
• Faster and Simpler Greedy Algorithm for k-Median and k-MeansMax Dupré la Tour, David Saulpic. [doi]
• Tight Bounds for Feedback Vertex Set Parameterized by Clique-WidthNarek Bojikian, Stefan Kratsch. [doi]
• Tight Algorithm and Hardness for Submodular Linear OrderingEvan Abboud, Roy Schwartz 0002. [doi]
• Colorful MinorsEvangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht. [doi]
• Incremental k-Lowest Planes and Planar k-Nearest Neighbor with Optimal Query TimeJohn Iacono, Yakov Nekrich, Martin P. Seybold. [doi]
• Population Protocols over Ordered AgentsMichael Blondin, Michaël Cadilhac, Benjamin Courchesne, Lucie Guillou, Corto Mascle, Isa Vialard. [doi]
• Streaming Complexity Separations for Dense and Sparse GraphsYang P. Liu, Hoai An Nguyen, Noah G. Singer, David P. Woodruff. [doi]
• Color Fault-Tolerant Distance Preservers: Õptimal Size in Conditionally Õptimal TimeMerav Parter, Asaf Petruschka. [doi]
• A Tight Double-Exponential Lower Bound for High-Multiplicity Bin PackingKlaus Jansen, Felix Ohnesorge, Lis Pirotton. [doi]
• Quantum Algorithms on Edge Lists: Hiding, Shuffling, and Cycle FindingAmin Shiraz Gilani, Daochen Wang, Pei Wu, Xingyu Zhou. [doi]
• Learning-Augmented Online Algorithms for Nonclairvoyant Joint Replenishment Problem with DeadlinesMichael Dinitz, Jeremy T. Fineman, Seeun William Umboh. [doi]
• On the Constructive Dimension Spectrum of PolynomialsPrajval Koul, Satyadev Nandakumar. [doi]
• Partial Derivative Complexity of a Product of Linearly Independent QuadraticsNir Shalmon, Amir Shpilka. [doi]
• Undirected Replacement Paths: Dual Fault Reduces to Single SourceJakob Nogler, Virginia Vassilevska Williams. [doi]
• On the (Classical and Quantum) Fine-Grained Complexity of Approximate CVP and Max-CutJeremy Ahrens Huang, Young Kun-Ko, Chunhao Wang. [doi]
• Local Computation Algorithms for (Minimum) Spanning Trees on Expander GraphsPan Peng 0001, Yuyang Wang. [doi]
• Deterministic Monotone Min-Plus Product and ConvolutionCe Jin 0001, Jaewoo Park, Barna Saha, Yinzhan Xu. [doi]
• Optimal Sequential FlowsHugo Gimbert, Corto Mascle, Patrick Totzke. [doi]
• Sublinear-Query Relative-Error Testing of HalfspacesXi Chen 0001, Anindya De, Yizhi Huang 0001, Shivam Nadimpalli, Rocco A. Servedio, Tianqi Yang 0001. [doi]
• Persistence Meets Resistance: Doubling down on HardnessBenedikt Kolbe, Tim Mayr. [doi]
• A 4.509-Approximation Algorithm for Generalized Min Sum Set CoverAmey Bhangale, Yezhou Zhang. [doi]
• Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack ProblemsLin Chen 0009, Tingwei Hu, Yuchen Mao 0001, Yong Chen 0002, Lili Mei, An Zhang 0001, Guangting Chen, Guochuan Zhang. [doi]
• Sample-Optimal Quantum Estimators for Pure-State Trace Distance and Fidelity via SamplizerQisheng Wang, Zhicheng Zhang 0010. [doi]
• A Quantum Time-Space Tradeoff for Directed st-ConnectivityStacey Jeffery, Galina Pass. [doi]
• The Price of Homogeneity Is PolynomialMaximilian Gorsky, Michal T. Seweryn, Sebastian Wiederrecht. [doi]
• Tight Bounds for Sampling q-Colorings via Coupling from the PastTianxing Ding, Hongyang Liu, Yitong Yin, Can Zhou. [doi]
• Symmetric Parameterised Holants on Hypergraphs: Towards a Classification for Parameterised VCSPsPanagiotis Aivasiliotis, Andreas Göbel 0001, Marc Roth. [doi]
• Tight Bounds for Low-Error Frequency Moment Estimation and the Power of Multiple PassesNaomi Green-Maimon, Or Zamir. [doi]