Table of Contents

• NPA Hierarchy for Quantum Isomorphism and Homomorphism IndistinguishabilityPrem Nigam Kar, David E. Roberson, Tim Seppelt, Peter Zeman 0001. [doi]
• Holant* Dichotomy on Domain Size 3: A Geometric PerspectiveJin-yi Cai, Jin Soo Ihm. [doi]
• One-Way Communication Complexity of Minimum Vertex Cover in General GraphsMahsa Derakhshan, Andisheh Ghasemi, Rajmohan Rajaraman. [doi]
• The Long Arm of Nashian Allocation in Online p-Mean Welfare MaximizationZhiyi Huang 0002, Chui Shan Lee, Xinkai Shu, Zhaozi Wang. [doi]
• Mim-Width Is paraNP-CompleteBenjamin Bergougnoux, Édouard Bonnet, Julien Duron. [doi]
• Complexity of Approximate Conflict-Free, Linearly-Ordered, and Nonmonochromatic Hypergraph ColouringsTamio-Vesa Nakajima, Zephyr Verwimp, Marcin Wrochna, Stanislav Zivný. [doi]
• Online Disjoint Spanning Trees and Polymatroid BasesKarthekeyan Chandrasekaran, Chandra Chekuri, Weihao Zhu. [doi]
• Using Games and Universal Trees to Characterise the Nondeterministic Index of Tree LanguagesOlivier Idir, Karoliina Lehtinen. [doi]
• Nearly Optimal Circuit Size for Sparse Quantum State PreparationLvzhou Li, Jingquan Luo. [doi]
• Online and Feasible Presentability: From Trees to Modal AlgebrasNikolay Bazhenov 0001, Dariusz Kalocinski, Michal Wroclawski. [doi]
• Multiparty Communication Complexity of Collision-Finding and Cutting Planes Proofs of Concise Pigeonhole PrinciplesPaul Beame, Michael Whitmeyer. [doi]
• Robust-Sorting and Applications to Ulam-MedianRagesh Jaiswal, Amit Kumar 0001, Jatin Yadav. [doi]
• On the Degree Automatability of Sum-Of-Squares ProofsAlex Bortolotti, Monaldo Mastrolilli, Luis Felipe Vargas. [doi]
• Fourier Analysis of Iterative AlgorithmsChris Jones, Lucas Pesenti. [doi]
• Identifying Approximate Minimizers Under Stochastic UncertainityHessa Al-Thani, Viswanath Nagarajan. [doi]
• The Value Problem for Multiple-Environment MDPs with Parity ObjectiveKrishnendu Chatterjee, Laurent Doyen 0001, Jean-François Raskin, Ocan Sankur. [doi]
• One-Shot Learning for k-SATAndreas Galanis, Leslie Ann Goldberg, Xusheng Zhang. [doi]
• Approximation Algorithms for Optimal HopsetsMichael Dinitz, Ama Koranteng, Yasamin Nazari. [doi]
• Taming Infinity One Chunk at a Time: Concisely Represented Strategies in One-Counter MDPsMichal Ajdarów, James C. A. Main, Petr Novotný 0001, Mickael Randour. [doi]
• Fitting Tree Metrics and Ultrametrics in Data StreamsAmir Carmel, Debarati Das 0001, Evangelos Kipouridis, Evangelos Pipis. [doi]
• Minimum+1 Steiner Cut and Dual Edge Sensitivity Oracle: Bridging Gap between Global and (s, t)-cutKoustav Bhanja. [doi]
• Minimality and Computability of Languages of G-ShiftsDjamel Eddine Amir, Benjamin Hellouin de Menibus. [doi]
• Maximum Bipartite vs. Triangle-Free SubgraphTamio-Vesa Nakajima, Stanislav Zivný. [doi]
• Saturation Problems for Families of AutomataLeón Bohn, Yong Li 0031, Christof Löding, Sven Schewe. [doi]
• On the Complexity of Telephone Broadcasting from Cacti to Bounded Pathwidth GraphsAida Aminian, Shahin Kamali, Seyed Mohammad Seyed Javadi, Sumedha. [doi]
• Nonuniform Deterministic Finite Automata over Finite Algebraic StructuresPawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski. [doi]
• A New Impossibility Result for Online Bipartite Matching ProblemsFlavio Chierichetti, Mirko Giacchini, Alessandro Panconesi, Andrea Vattani. [doi]
• Decay of Correlation for Edge Colorings When q > 3ΔZejia Chen, Yulin Wang, Chihao Zhang 0001, Zihan Zhang. [doi]
• Light Spanners with Small Hop-DiameterSujoy Bhore, Lazar Milenkovic. [doi]
• Deterministic Complexity Analysis of Hermitian EigenproblemsAleksandros Sobczyk. [doi]
• Parameterised Holant ProblemsPanagiotis Aivasiliotis, Andreas Göbel 0001, Marc Roth, Johannes Schmitt 0002. [doi]
• Reducing Stochastic Games to Semidefinite ProgrammingManuel Bodirsky, Georg Loho, Mateusz Skomra. [doi]
• Light Edge Fault Tolerant Graph SpannersGreg Bodwin, Michael Dinitz, Ama Koranteng, Lily Wang. [doi]
• Unbalanced Random Matching Markets with Partial PreferencesAditya Potukuchi, Shikha Singh 0002. [doi]
• Boosting SNARKs and Rate-1 Barrier in Arguments of KnowledgeJiaqi Cheng, Rishab Goyal. [doi]
• Relative-Error Testing of Conjunctions and Decision ListsXi Chen 0001, William Pires, Toniann Pitassi, Rocco A. Servedio. [doi]
• Yet Another Simple Proof of the PCRP TheoremNaoto Ohsaka. [doi]
• Belief Propagation Guided Decimation on Random k-XORSATArnab Chatterjee, Amin Coja-Oghlan, Mihyun Kang, Lena Krieg, Maurice Rolvien, Gregory B. Sorkin. [doi]
• On the Complexity of Hazard-Free FormulasLeah London Arazi, Amir Shpilka. [doi]
• Universal Online Contention Resolution with Preselected OrderJunyao Zhao 0001. [doi]
• The Role of Regularity in (Hyper-)Clique Detection and Implications for Optimizing Boolean CSPsNick Fischer, Marvin Künnemann, Mirza Redzic, Julian Stieß. [doi]
• A Theory of Spectral CSP SparsificationSanjeev Khanna, Aaron Putterman, Madhu Sudan 0001. [doi]
• New and Improved Bounds for Markov PagingChirag Pabbaraju, Ali Vakilian. [doi]
• Bayesian Inference in Quantum ProgramsChristina Gehnen, Dominique Unruh, Joost-Pieter Katoen. [doi]
• Online Algorithm Design Beyond the Worst Case (Invited Talk)Anupam Gupta 0001. [doi]
• Containment for Guarded Monotone Strict NPAlexey Barsukov, Michael Pinsker, Jakub Rydval. [doi]
• Dynamic Algorithms for Submodular MatchingKiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh. [doi]
• Asymptotically Optimal Inapproximability of Maxmin k-Cut ReconfigurationShuichi Hirahara, Naoto Ohsaka. [doi]
• Quantum Speedup for Sampling Random Spanning TreesSimon Apers, Minbo Gao, Zhengfeng Ji, Chenghua Liu. [doi]
• Optimal Static Fully Indexable DictionariesJingxun Liang, Renfei Zhou. [doi]
• Near-Optimal Directed Low-Diameter DecompositionsKarl Bringmann, Nick Fischer, Bernhard Haeupler, Rustam Latypov. [doi]
• Faster Construction of a Planar Distance Oracle with Õ(1) Query TimeItai Boneh, Shay Golan 0001, Shay Mozes, Daniel Prigan, Oren Weimann. [doi]
• Branch-And-Bound Algorithms as Polynomial-Time Approximation SchemesKoppány István Encz, Monaldo Mastrolilli, Eleonora Vercesi. [doi]
• On Deleting Vertices to Reduce Density in Graphs and Supermodular FunctionsKarthekeyan Chandrasekaran, Chandra Chekuri, Shubhang Kulkarni. [doi]
• On the Instance Optimality of Detecting Collisions and SubgraphsOmri Ben-Eliezer, Tomer Grossman, Moni Naor. [doi]
• Faster Semi-Streaming Matchings via Alternating TreesSlobodan Mitrovic, Anish Mukherjee 0001, Piotr Sankowski, Wen-Horng Sheu. [doi]
• Nondeterministic Tree-Walking Automata Are Not Closed Under ComplementationOlga Martynova 0001, Alexander Okhotin. [doi]
• Algorithms for the Diverse-k-SAT Problem: The Geometry of Satisfying AssignmentsPer Austrin, Ioana O. Bercea, Mayank Goswami 0001, Nutan Limaye, Adarsh Srinivasan. [doi]
• Low-Temperature Sampling on Sparse Random GraphsAndreas Galanis, Leslie Ann Goldberg, Paulina Smolarova. [doi]
• Query Efficient Weighted Stochastic MatchingMahsa Derakhshan, Mohammad Saneian. [doi]
• Deterministic Independent Sets in the Semi-Streaming ModelDaniel Ye. [doi]
• Simultaneously Approximating All Norms for Massively Parallel Correlation ClusteringNairen Cao, Shi Li 0001, Jia Ye. [doi]
• An Optimal Error-Correcting Reduction for Matrix MultiplicationShuichi Hirahara, Nobutaka Shimizu. [doi]
• The Satisfiability and Validity Problems for Probabilistic Computational Tree Logic Are Highly UndecidableMiroslav Chodil, Antonín Kucera 0001. [doi]
• A Collapse of the Parity Index Hierarchy of Tree Automata, Based on Cantor-Bendixson RanksKaroliina Lehtinen, Nathan Lhote. [doi]
• Probabilistic and Causal Satisfiability: Constraining the ModelMarkus Bläser, Julian Dörfler, Maciej Liskiewicz, Benito van der Zander. [doi]
• Cost Preserving Dependent Rounding for Allocation ProblemsLars Rohwedder, Arman Rouhani, Leo Wennmann. [doi]
• Let's Try to Be More Tolerant: On Tolerant Property Testing and Distance Approximation (Invited Talk)Dana Ron. [doi]
• A Near-Optimal Polynomial Distance Lemma over Boolean SlicesPrashanth Amireddy, Amik Raj Behera, Srikanth Srinivasan 0001, Madhu Sudan 0001. [doi]
• Undirected 3-Fault Replacement Path in Nearly Cubic TimeShucheng Chi, Ran Duan, Benyu Wang, Tianle Xie. [doi]
• Weighted GKAT: Completeness and ComplexitySpencer Van Koevering, Wojciech Rozowski, Alexandra Silva 0001. [doi]
• Stable Hypergraph Matching in Unimodular HypergraphsPéter Biró 0001, Gergely Csáji, Ildikó Schlotter. [doi]
• q-Partitioning Valuations: Exploring the Space Between Subadditive and Fractionally Subadditive ValuationsKiril Bangachev, S. Matthew Weinberg. [doi]
• P-Time Algorithms for Typical #EO ProblemsBoning Meng, Juqiu Wang, Mingji Xia. [doi]
• Subgraph Counting in Subquadratic Time for Bounded Degeneracy GraphsDaniel Paul-Pena, C. Seshadhri 0001. [doi]
• Faster All-Pairs Optimal Electric Car RoutingDani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick. [doi]
• Testing C_k-Freeness in Bounded Admissibility GraphsChristine Awofeso, Patrick Greaves, Oded Lachish, Amit Levi, Felix Reidl. [doi]
• Submodular Hypergraph Partitioning: Metric Relaxations and Fast Algorithms via an Improved Cut-Matching GameAntares Chen, Lorenzo Orecchia, Erasmo Tani. [doi]
• Randomized Binary and Tree Search Under PressureAgustín Caracci, Christoph Dürr, José Verschae. [doi]
• Cut-Preserving Vertex Sparsifiers for Planar and Quasi-Bipartite GraphsYu Chen 0039, Zihan Tan. [doi]
• Incremental Approximate Single-Source Shortest Paths with PredictionsSamuel McCauley, Benjamin Moseley, Aidin Niaparast, Helia Niaparast, Shikha Singh 0002. [doi]
• Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized AlphabetsRoni Con, Zeyu Guo 0001, Ray Li, Zihan Zhang 0001. [doi]
• Towards the Proximity Conjecture on Group-Labeled MatroidsDániel Garamvölgyi, Ryuhei Mizutani, Taihei Oki, Tamás Schwarcz, Yutaro Yamaguchi 0001. [doi]
• Faster Fréchet Distance Under TransformationsKevin Buchin, Maike Buchin, Zijin Huang, André Nusser, Sampson Wong. [doi]
• Tiling Random Regular Graphs EfficientlySahar Diskin, Ilay Hoshen, Maksim Zhukovskii. [doi]
• Incremental Approximate Maximum Flow via Residual Graph SparsificationGramoz Goranci, Monika Henzinger, Harald Räcke, A. R. Sricharan. [doi]
• A Simple Dynamic Spanner via APSPRasmus Kyng, Simon Meierhans, Gernot Zöcklein. [doi]
• Reachability in 3-VASS Is ElementaryWojciech Czerwinski, Ismaël Jecker, Slawomir Lasota 0001, Lukasz Orlikowski. [doi]
• 1-ContractionSebastian Haslebacher. [doi]
• Decremental (1+ε)-Approximate Maximum Eigenvector: Dynamic Power MethodDeeksha Adil, Thatchaphol Saranurak. [doi]
• Tree Algebras and Bisimulation-Invariant MSO on Finite GraphsThomas Colcombet, Amina Doumane, Denis Kuperberg. [doi]
• Algebraic Language Theory with EffectsFabian Lenke, Stefan Milius, Henning Urbat, Thorsten Wißmann. [doi]
• Shared Randomness Helps with Local Distributed ProblemsAlkida Balliu, Mohsen Ghaffari 0001, Fabian Kuhn, Augusto Modanese, Dennis Olivetti, Mikaël Rabie, Jukka Suomela, Jara Uitto. [doi]
• New Results on a General Class of Minimum Norm Optimization ProblemsKuowen Chen, Jian Li 0015, Yuval Rabani, Yiran Zhang. [doi]
• Deciding Local Unitary Equivalence of Graph States in Quasi-Polynomial TimeNathan Claudet, Simon Perdrix. [doi]
• Streaming Maximal Matching with Bounded DeletionsSanjeev Khanna, Christian Konrad 0001, Jacques Dark. [doi]
• Counting Permutation Patterns with Multidimensional TreesGal Beniamini, Nir Lavee. [doi]
• Limitations of Affine Integer Relaxations for Solving Constraint Satisfaction ProblemsMoritz Lichter, Benedikt Pago. [doi]
• Approximate Problems for Finite TransducersEmmanuel Filiot, Ismaël Jecker, Khushraj Madnani, Saina Sunny. [doi]
• Weakly Approximating Knapsack in Subquadratic TimeLin Chen 0009, Jiayi Lian, Yuchen Mao 0001, Guochuan Zhang. [doi]
• Tight Bounds for Heavy-Hitters and Moment Estimation in the Sliding Window ModelShiyuan Feng, William Swartworth, David P. Woodruff. [doi]
• Parameterized Algorithms for Matching Integer Programs with Additional Rows and ColumnsAlexandra Lassota, Koen Ligthart. [doi]
• ∞-RegressionDeeksha Adil, Shunhua Jiang, Rasmus Kyng. [doi]
• Pushing the Frontiers of Subexponential FPT Time for Feedback Vertex SetGaétan Berthe, Marin Bougeret, Daniel Gonçalves 0001, Jean-Florent Raymond. [doi]
• A Pseudorandom Generator for Functions of Low-Degree Polynomial Threshold FunctionsPenghui Yao, Mingnan Zhao. [doi]
• An Upper Bound on the Weisfeiler-Leman DimensionThomas Schneider, Pascal Schweitzer. [doi]
• Induced Disjoint Paths Without an Induced MinorPierre Aboulker, Édouard Bonnet, Timothé Picavet, Nicolas Trotignon. [doi]
• The Converse of the Real Orthogonal Holant TheoremBen Young. [doi]
• Near-Optimal Algorithm for Directed Expander DecompositionsAurelio L. Sulser, Maximilian Probst Gutenberg. [doi]
• An Efficient Algorithm to Compute the Minimum Free Energy of Interacting Nucleic Acid StrandsAhmed Shalaby 0005, Damien Woods. [doi]
• Membership and Conjugacy in Inverse SemigroupsLukas Fleischer, Florian Stober, Alexander Thumm, Armin Weiß. [doi]
• Approximating Dasgupta Cost in Sublinear Time from a Few Random SeedsMichael Kapralov, Akash Kumar 0009, Silvio Lattanzi, Aida Mousavifar, Weronika Wrzos-Kaminska. [doi]
• Faster & Deterministic FPT Algorithm for Worst-Case Tensor DecompositionVishwas Bhargava, Devansh Shringi. [doi]
• New Bounds for the Ideal Proof System in Positive CharacteristicAmik Raj Behera, Nutan Limaye, Varun Ramanathan 0002, Srikanth Srinivasan 0001. [doi]
• Revisiting Directed Disjoint Paths on Tournaments (And Relatives)Guilherme de C. M. Gomes, Raul Lopes 0001, Ignasi Sau. [doi]
• A 0.51-Approximation of Maximum Matching in Sublinear n^{1.5} TimeSepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski. [doi]
• Deterministic k-Median Clustering in Near-Optimal TimeMartín Costa, Ermiya Farokhnejad. [doi]
• Restricted CSPs and F-Free Digraph AlgorithmicsSantiago Guzmán-Pro, Barnaby Martin. [doi]
• Positive and Monotone Fragments of FO and LTLSimon Iosti, Denis Kuperberg, Quentin Moreau. [doi]
• Deterministic Even-Cycle Detection in Broadcast CONGESTPierre Fraigniaud, Maël Luce, Frédéric Magniez, Ioan Todinca. [doi]
• Scarf's Algorithm on Arborescence HypergraphsKarthekeyan Chandrasekaran, Yuri Faenza, Chengyue He, Jay Sethuraman. [doi]
• Graph Exploration: The Impact of a Distance ConstraintStéphane Devismes, Yoann Dieudonné, Arnaud Labourel. [doi]
• How to Compute the Volume in Low Dimension?Arjan Cornelissen, Simon Apers, Sander Gribling. [doi]
• Coresets for Robust Clustering via Black-Box Reductions to Vanilla CaseShaofeng H.-C. Jiang, Jianing Lou. [doi]
• Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph ConnectivityIshan Bansal, Joe Cheriyan, Sanjeev Khanna, Miles Simmons. [doi]
• The Memory of ω-Regular and BC(Σ⁰₂) ObjectivesAntonio Casares, Pierre Ohlmann. [doi]
• Fully Dynamic Algorithms for Transitive ReductionGramoz Goranci, Adam Karczmarz, Ali Momeni, Nikos Parotsidis. [doi]
• k-Leaf Powers Cannot Be Characterized by a Finite Set of Forbidden Induced Subgraphs for k ≥ 5Max Dupré la Tour, Manuel Lafond, Ndiamé Ndiaye, Adrian Vetta. [doi]
• The Ultimate Signs of Second-Order Holonomic SequencesFugen Hagihara, Akitoshi Kawamura. [doi]
• Improved Streaming Edge ColoringShiri Chechik, Hongyi Chen, Tianyi Zhang 0008. [doi]
• Fully Scalable MPC Algorithms for Euclidean k-CenterArtur Czumaj, Guichen Gao, Mohsen Ghaffari 0001, Shaofeng H.-C. Jiang. [doi]
• Density of Rational Languages Under Shift Invariant MeasuresValérie Berthé, Herman Goulet-Ouellet, Dominique Perrin. [doi]
• ETH-Tight FPT Algorithm for Makespan Minimization on Uniform MachinesLars Rohwedder. [doi]
• Faster Dynamic (Δ+1)-Coloring Against Adaptive AdversariesMaxime Flin, Magnús M. Halldórsson. [doi]
• Repetition Aware Text Indexing for Matching Patterns with WildcardsDaniel Gibney, Jackson Huffstutler, Mano Prakash Parthasarathi, Sharma V. Thankachan. [doi]
• Even Faster Algorithm for the Chamfer DistanceYing Feng, Piotr Indyk. [doi]
• The Trichotomy of Regular Property TestingGabriel Bathie, Nathanaël Fijalkow, Corto Mascle. [doi]
• Faster, Deterministic and Space Efficient Subtrajectory ClusteringIvor van der Hoog, Thijs van der Horst, Tim Ophelders. [doi]
• An Optimal 3-Fault-Tolerant Connectivity OracleEvangelos Kosinas. [doi]
• Ultra-Resilient Superimposed Codes: Near-Optimal Construction and ApplicationsGianluca De Marco, Dariusz R. Kowalski. [doi]
• Improved Approximation Algorithms for Three-Dimensional Bin PackingDebajyoti Kar, Arindam Khan 0001, Malin Rau. [doi]
• Drainability and Fillability of Polyominoes in Diverse Models of Global ControlSándor P. Fekete, Peter Kramer 0001, Jan-Marc Reinhardt, Christian Rieck, Christian Scheffer. [doi]
• Computing Distances on Graph Associahedra Is Fixed-Parameter TractableLuís Felipe I. Cunha, Ignasi Sau, Uéverton S. Souza, Mario Valencia-Pabon. [doi]
• Faster Diameter Computation in Graphs of Bounded Euler GenusKacper Kluk, Marcin Pilipczuk, Michal Pilipczuk, Giannos Stamoulis. [doi]
• On the Quantum Time Complexity of Divide and ConquerJonathan Allcock, Jinge Bao, Aleksandrs Belovs, Troy Lee, Miklos Santha. [doi]
• Satisfiability of Commutative vs. Non-Commutative CSPsAndrei A. Bulatov, Stanislav Zivný. [doi]
• 3.415-Approximation for Coflow Scheduling via Iterated RoundingLars Rohwedder, Leander Schnaars. [doi]
• Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion ProblemsBaris Can Esmer, Ariel Kulik. [doi]
• Algorithmic Aspects of Semistability of Quiver RepresentationsYuni Iwamasa, Taihei Oki, Tasuku Soma. [doi]
• Optimal Inapproximability of Promise Equations over Finite GroupsSilvia Butti, Alberto Larrauri, Stanislav Zivný. [doi]
• Guessing Efficiently for Constrained Subspace ApproximationAditya Bhaskara, Sepideh Mahabadi, Madhusudhan Reddy Pittu, Ali Vakilian, David P. Woodruff. [doi]
• Verification of Linear Dynamical Systems via O-Minimality of the Real NumbersToghrul Karimov. [doi]
• A Tropical Approach to the Compositional Piecewise Complexity of Words and Compressed WordsPhilippe Schnoebelen, Julien Veron, Isa Vialard. [doi]
• Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSONikolas Mählmann. [doi]
• Minimum Cost Nowhere-Zero Flows and Cut-Balanced OrientationsKarthekeyan Chandrasekaran, Siyue Liu, R. Ravi 0001. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Treewidth Parameterized by Feedback Vertex NumberHendrik Molter, Meirav Zehavi, Amit Zivan. [doi]
• Separability Properties of Monadically Dependent Graph ClassesÉdouard Bonnet, Samuel Braunfeld, Ioannis Eleftheriadis, Colin Geniet, Nikolas Mählmann, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk. [doi]
• All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed GraphsAditya Anand 0001, Euiwoong Lee, Jason Li 0006, Thatchaphol Saranurak. [doi]
• (Almost-)Optimal FPT Algorithm and Kernel for T-Cycle on Planar GraphsHarmender Gahlawat, Abhishek Rathod, Meirav Zehavi. [doi]
• Minimizing Recourse in an Adaptive Balls and Bins GameAdi Fine, Haim Kaplan, Uri Stemmer. [doi]
• Optimal Oblivious Subspace Embeddings with Near-Optimal SparsityShabarish Chenakkod, Michal Derezinski, Xiaoyu Dong. [doi]
• Optimal Distance Labeling for Permutation GraphsPawel Gawrychowski, Wojciech Janczewski. [doi]
• On the Complexity of Client-Waiter and Waiter-Client GamesValentin Gledel, Nacim Oijid, Sébastien Tavenas, Stéphan Thomassé. [doi]
• IID Prophet Inequality with Random Horizon: Going Beyond Increasing Hazard RatesGiordano Giambartolomei, Frederik Mallmann-Trenn, Raimundo Saona. [doi]
• A Nearly Optimal Deterministic Algorithm for Online Transportation ProblemTsubasa Harada, Toshiya Itoh. [doi]
• Submonoid Membership in n-Dimensional Lamplighter Groups and S-Unit EquationsRuiwen Dong 0001. [doi]
• Near-Optimal Hypergraph Sparsification in Insertion-Only and Bounded-Deletion StreamsSanjeev Khanna, Aaron Putterman, Madhu Sudan 0001. [doi]
• Worst-Case and Average-Case Hardness of Hypercycle and Database ProblemsCheng-Hao Fu, Andrea Lincoln, Rene Reyes. [doi]
• On Incremental Approximate Shortest Paths in Directed GraphsAdam Górkiewicz, Adam Karczmarz. [doi]
• Robust Contraction Decomposition for Minor-Free Graphs and Its ApplicationsSayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Dániel Marx, Pranabendu Misra, Daniel Neuen, Saket Saurabh 0001, Prafullkumar Tale, Jie Xue 0003. [doi]
• First-Order Intuitionistic Linear Logic and Hypergraph LanguagesTikhon Pshenitsyn. [doi]
• Near-Optimal Trace Reconstruction for Mildly Separated StringsAnders Aamand, Allen Liu, Shyam Narayanan. [doi]