| 2025 | (Almost-)Optimal FPT Algorithm and Kernel for T-Cycle on Planar Graphs. Harmender Gahlawat, Abhishek Rathod, Meirav Zehavi |
| 2025 | 3.415-Approximation for Coflow Scheduling via Iterated Rounding. Lars Rohwedder, Leander Schnaars |
| 2025 | 52nd International Colloquium on Automata, Languages, and Programming, ICALP 2025, Aarhus, Denmark, July 8-11, 2025 Keren Censor-Hillel, Fabrizio Grandoni, Joël Ouaknine, Gabriele Puppis |
| 2025 | A 0.51-Approximation of Maximum Matching in Sublinear n^{1.5} Time. Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski |
| 2025 | A Collapse of the Parity Index Hierarchy of Tree Automata, Based on Cantor-Bendixson Ranks. Karoliina Lehtinen, Nathan Lhote |
| 2025 | A Near-Optimal Polynomial Distance Lemma over Boolean Slices. Prashanth Amireddy, Amik Raj Behera, Srikanth Srinivasan, Madhu Sudan |
| 2025 | A Nearly Optimal Deterministic Algorithm for Online Transportation Problem. Tsubasa Harada, Toshiya Itoh |
| 2025 | A New Impossibility Result for Online Bipartite Matching Problems. Flavio Chierichetti, Mirko Giacchini, Alessandro Panconesi, Andrea Vattani |
| 2025 | A Pseudorandom Generator for Functions of Low-Degree Polynomial Threshold Functions. Penghui Yao, Mingnan Zhao |
| 2025 | A Simple Dynamic Spanner via APSP. Rasmus Kyng, Simon Meierhans, Gernot Zöcklein |
| 2025 | A Theory of Spectral CSP Sparsification. Sanjeev Khanna, Aaron Putterman, Madhu Sudan |
| 2025 | A Tropical Approach to the Compositional Piecewise Complexity of Words and Compressed Words. Philippe Schnoebelen, Julien Veron, Isa Vialard |
| 2025 | ARRIVAL: Recursive Framework & ℓ Sebastian Haslebacher |
| 2025 | Acceleration Meets Inverse Maintenance: Faster ℓ Deeksha Adil, Shunhua Jiang, Rasmus Kyng |
| 2025 | Algebraic Language Theory with Effects. Fabian Lenke, Stefan Milius, Henning Urbat, Thorsten Wißmann |
| 2025 | Algorithmic Aspects of Semistability of Quiver Representations. Yuni Iwamasa, Taihei Oki, Tasuku Soma |
| 2025 | Algorithms for the Diverse-k-SAT Problem: The Geometry of Satisfying Assignments. Per Austrin, Ioana O. Bercea, Mayank Goswami, Nutan Limaye, Adarsh Srinivasan |
| 2025 | All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs. Aditya Anand, Euiwoong Lee, Jason Li, Thatchaphol Saranurak |
| 2025 | An Efficient Algorithm to Compute the Minimum Free Energy of Interacting Nucleic Acid Strands. Ahmed Shalaby, Damien Woods |
| 2025 | An Optimal 3-Fault-Tolerant Connectivity Oracle. Evangelos Kosinas |
| 2025 | An Optimal Error-Correcting Reduction for Matrix Multiplication. Shuichi Hirahara, Nobutaka Shimizu |
| 2025 | An Upper Bound on the Weisfeiler-Leman Dimension. Thomas Schneider, Pascal Schweitzer |
| 2025 | Approximate Problems for Finite Transducers. Emmanuel Filiot, Ismaël Jecker, Khushraj Madnani, Saina Sunny |
| 2025 | Approximating Dasgupta Cost in Sublinear Time from a Few Random Seeds. Michael Kapralov, Akash Kumar, Silvio Lattanzi, Aida Mousavifar, Weronika Wrzos-Kaminska |
| 2025 | Approximation Algorithms for Optimal Hopsets. Michael Dinitz, Ama Koranteng, Yasamin Nazari |
| 2025 | Asymptotically Optimal Inapproximability of Maxmin k-Cut Reconfiguration. Shuichi Hirahara, Naoto Ohsaka |
| 2025 | Bayesian Inference in Quantum Programs. Christina Gehnen, Dominique Unruh, Joost-Pieter Katoen |
| 2025 | Belief Propagation Guided Decimation on Random k-XORSAT. Arnab Chatterjee, Amin Coja-Oghlan, Mihyun Kang, Lena Krieg, Maurice Rolvien, Gregory B. Sorkin |
| 2025 | Boosting SNARKs and Rate-1 Barrier in Arguments of Knowledge. Jiaqi Cheng, Rishab Goyal |
| 2025 | Branch-And-Bound Algorithms as Polynomial-Time Approximation Schemes. Koppány István Encz, Monaldo Mastrolilli, Eleonora Vercesi |
| 2025 | Complexity of Approximate Conflict-Free, Linearly-Ordered, and Nonmonochromatic Hypergraph Colourings. Tamio-Vesa Nakajima, Zephyr Verwimp, Marcin Wrochna, Stanislav Zivný |
| 2025 | Computing Distances on Graph Associahedra Is Fixed-Parameter Tractable. Luís Felipe I. Cunha, Ignasi Sau, Uéverton S. Souza, Mario Valencia-Pabon |
| 2025 | Containment for Guarded Monotone Strict NP. Alexey Barsukov, Michael Pinsker, Jakub Rydval |
| 2025 | Coresets for Robust Clustering via Black-Box Reductions to Vanilla Case. Shaofeng H.-C. Jiang, Jianing Lou |
| 2025 | Cost Preserving Dependent Rounding for Allocation Problems. Lars Rohwedder, Arman Rouhani, Leo Wennmann |
| 2025 | Counting Permutation Patterns with Multidimensional Trees. Gal Beniamini, Nir Lavee |
| 2025 | Cut-Preserving Vertex Sparsifiers for Planar and Quasi-Bipartite Graphs. Yu Chen, Zihan Tan |
| 2025 | Decay of Correlation for Edge Colorings When q > 3Δ. Zejia Chen, Yulin Wang, Chihao Zhang, Zihan Zhang |
| 2025 | Deciding Local Unitary Equivalence of Graph States in Quasi-Polynomial Time. Nathan Claudet, Simon Perdrix |
| 2025 | Decremental (1+ε)-Approximate Maximum Eigenvector: Dynamic Power Method. Deeksha Adil, Thatchaphol Saranurak |
| 2025 | Density of Rational Languages Under Shift Invariant Measures. Valérie Berthé, Herman Goulet-Ouellet, Dominique Perrin |
| 2025 | Deterministic Complexity Analysis of Hermitian Eigenproblems. Aleksandros Sobczyk |
| 2025 | Deterministic Even-Cycle Detection in Broadcast CONGEST. Pierre Fraigniaud, Maël Luce, Frédéric Magniez, Ioan Todinca |
| 2025 | Deterministic Independent Sets in the Semi-Streaming Model. Daniel Ye |
| 2025 | Deterministic k-Median Clustering in Near-Optimal Time. Martín Costa, Ermiya Farokhnejad |
| 2025 | Drainability and Fillability of Polyominoes in Diverse Models of Global Control. Sándor P. Fekete, Peter Kramer, Jan-Marc Reinhardt, Christian Rieck, Christian Scheffer |
| 2025 | Dynamic Algorithms for Submodular Matching. Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh |
| 2025 | ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines. Lars Rohwedder |
| 2025 | Even Faster Algorithm for the Chamfer Distance. Ying Feng, Piotr Indyk |
| 2025 | Faster & Deterministic FPT Algorithm for Worst-Case Tensor Decomposition. Vishwas Bhargava, Devansh Shringi |
| 2025 | Faster All-Pairs Optimal Electric Car Routing. Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick |
| 2025 | Faster Construction of a Planar Distance Oracle with Õ(1) Query Time. Itai Boneh, Shay Golan, Shay Mozes, Daniel Prigan, Oren Weimann |
| 2025 | Faster Diameter Computation in Graphs of Bounded Euler Genus. Kacper Kluk, Marcin Pilipczuk, Michal Pilipczuk, Giannos Stamoulis |
| 2025 | Faster Dynamic (Δ+1)-Coloring Against Adaptive Adversaries. Maxime Flin, Magnús M. Halldórsson |
| 2025 | Faster Fréchet Distance Under Transformations. Kevin Buchin, Maike Buchin, Zijin Huang, André Nusser, Sampson Wong |
| 2025 | Faster Semi-Streaming Matchings via Alternating Trees. Slobodan Mitrovic, Anish Mukherjee, Piotr Sankowski, Wen-Horng Sheu |
| 2025 | Faster, Deterministic and Space Efficient Subtrajectory Clustering. Ivor van der Hoog, Thijs van der Horst, Tim Ophelders |
| 2025 | First-Order Intuitionistic Linear Logic and Hypergraph Languages. Tikhon Pshenitsyn |
| 2025 | Fitting Tree Metrics and Ultrametrics in Data Streams. Amir Carmel, Debarati Das, Evangelos Kipouridis, Evangelos Pipis |
| 2025 | Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSO. Nikolas Mählmann |
| 2025 | Fourier Analysis of Iterative Algorithms. Chris Jones, Lucas Pesenti |
| 2025 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2025 | Fully Dynamic Algorithms for Transitive Reduction. Gramoz Goranci, Adam Karczmarz, Ali Momeni, Nikos Parotsidis |
| 2025 | Fully Scalable MPC Algorithms for Euclidean k-Center. Artur Czumaj, Guichen Gao, Mohsen Ghaffari, Shaofeng H.-C. Jiang |
| 2025 | Graph Exploration: The Impact of a Distance Constraint. Stéphane Devismes, Yoann Dieudonné, Arnaud Labourel |
| 2025 | Guessing Efficiently for Constrained Subspace Approximation. Aditya Bhaskara, Sepideh Mahabadi, Madhusudhan Reddy Pittu, Ali Vakilian, David P. Woodruff |
| 2025 | Holant* Dichotomy on Domain Size 3: A Geometric Perspective. Jin-Yi Cai, Jin Soo Ihm |
| 2025 | How to Compute the Volume in Low Dimension? Arjan Cornelissen, Simon Apers, Sander Gribling |
| 2025 | IID Prophet Inequality with Random Horizon: Going Beyond Increasing Hazard Rates. Giordano Giambartolomei, Frederik Mallmann-Trenn, Raimundo Saona |
| 2025 | Identifying Approximate Minimizers Under Stochastic Uncertainity. Hessa Al-Thani, Viswanath Nagarajan |
| 2025 | Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity. Ishan Bansal, Joe Cheriyan, Sanjeev Khanna, Miles Simmons |
| 2025 | Improved Approximation Algorithms for Three-Dimensional Bin Packing. Debajyoti Kar, Arindam Khan, Malin Rau |
| 2025 | Improved Streaming Edge Coloring. Shiri Chechik, Hongyi Chen, Tianyi Zhang |
| 2025 | Incremental Approximate Maximum Flow via Residual Graph Sparsification. Gramoz Goranci, Monika Henzinger, Harald Räcke, A. R. Sricharan |
| 2025 | Incremental Approximate Single-Source Shortest Paths with Predictions. Samuel McCauley, Benjamin Moseley, Aidin Niaparast, Helia Niaparast, Shikha Singh |
| 2025 | Induced Disjoint Paths Without an Induced Minor. Pierre Aboulker, Édouard Bonnet, Timothé Picavet, Nicolas Trotignon |
| 2025 | Let's Try to Be More Tolerant: On Tolerant Property Testing and Distance Approximation (Invited Talk). Dana Ron |
| 2025 | Light Edge Fault Tolerant Graph Spanners. Greg Bodwin, Michael Dinitz, Ama Koranteng, Lily Wang |
| 2025 | Light Spanners with Small Hop-Diameter. Sujoy Bhore, Lazar Milenkovic |
| 2025 | Limitations of Affine Integer Relaxations for Solving Constraint Satisfaction Problems. Moritz Lichter, Benedikt Pago |
| 2025 | Low-Temperature Sampling on Sparse Random Graphs. Andreas Galanis, Leslie Ann Goldberg, Paulina Smolarova |
| 2025 | Maximum Bipartite vs. Triangle-Free Subgraph. Tamio-Vesa Nakajima, Stanislav Zivný |
| 2025 | Membership and Conjugacy in Inverse Semigroups. Lukas Fleischer, Florian Stober, Alexander Thumm, Armin Weiß |
| 2025 | Mim-Width Is paraNP-Complete. Benjamin Bergougnoux, Édouard Bonnet, Julien Duron |
| 2025 | Minimality and Computability of Languages of G-Shifts. Djamel Eddine Amir, Benjamin Hellouin de Menibus |
| 2025 | Minimizing Recourse in an Adaptive Balls and Bins Game. Adi Fine, Haim Kaplan, Uri Stemmer |
| 2025 | Minimum Cost Nowhere-Zero Flows and Cut-Balanced Orientations. Karthekeyan Chandrasekaran, Siyue Liu, R. Ravi |
| 2025 | Minimum+1 Steiner Cut and Dual Edge Sensitivity Oracle: Bridging Gap between Global and (s, t)-cut. Koustav Bhanja |
| 2025 | Multiparty Communication Complexity of Collision-Finding and Cutting Planes Proofs of Concise Pigeonhole Principles. Paul Beame, Michael Whitmeyer |
| 2025 | NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability. Prem Nigam Kar, David E. Roberson, Tim Seppelt, Peter Zeman |
| 2025 | Near-Optimal Algorithm for Directed Expander Decompositions. Aurelio L. Sulser, Maximilian Probst Gutenberg |
| 2025 | Near-Optimal Directed Low-Diameter Decompositions. Karl Bringmann, Nick Fischer, Bernhard Haeupler, Rustam Latypov |
| 2025 | Near-Optimal Hypergraph Sparsification in Insertion-Only and Bounded-Deletion Streams. Sanjeev Khanna, Aaron Putterman, Madhu Sudan |
| 2025 | Near-Optimal Trace Reconstruction for Mildly Separated Strings. Anders Aamand, Allen Liu, Shyam Narayanan |
| 2025 | Nearly Optimal Circuit Size for Sparse Quantum State Preparation. Lvzhou Li, Jingquan Luo |
| 2025 | New Bounds for the Ideal Proof System in Positive Characteristic. Amik Raj Behera, Nutan Limaye, Varun Ramanathan, Srikanth Srinivasan |
| 2025 | New Results on a General Class of Minimum Norm Optimization Problems. Kuowen Chen, Jian Li, Yuval Rabani, Yiran Zhang |
| 2025 | New and Improved Bounds for Markov Paging. Chirag Pabbaraju, Ali Vakilian |
| 2025 | Nondeterministic Tree-Walking Automata Are Not Closed Under Complementation. Olga Martynova, Alexander Okhotin |
| 2025 | Nonuniform Deterministic Finite Automata over Finite Algebraic Structures. Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski |
| 2025 | On Deleting Vertices to Reduce Density in Graphs and Supermodular Functions. Karthekeyan Chandrasekaran, Chandra Chekuri, Shubhang Kulkarni |
| 2025 | On Incremental Approximate Shortest Paths in Directed Graphs. Adam Górkiewicz, Adam Karczmarz |
| 2025 | On the Complexity of Client-Waiter and Waiter-Client Games. Valentin Gledel, Nacim Oijid, Sébastien Tavenas, Stéphan Thomassé |
| 2025 | On the Complexity of Hazard-Free Formulas. Leah London Arazi, Amir Shpilka |
| 2025 | On the Complexity of Telephone Broadcasting from Cacti to Bounded Pathwidth Graphs. Aida Aminian, Shahin Kamali, Seyed-Mohammad Seyed-Javadi, Sumedha |
| 2025 | On the Degree Automatability of Sum-Of-Squares Proofs. Alex Bortolotti, Monaldo Mastrolilli, Luis Felipe Vargas |
| 2025 | On the Instance Optimality of Detecting Collisions and Subgraphs. Omri Ben-Eliezer, Tomer Grossman, Moni Naor |
| 2025 | On the Quantum Time Complexity of Divide and Conquer. Jonathan Allcock, Jinge Bao, Aleksandrs Belovs, Troy Lee, Miklos Santha |
| 2025 | One-Shot Learning for k-SAT. Andreas Galanis, Leslie Ann Goldberg, Xusheng Zhang |
| 2025 | One-Way Communication Complexity of Minimum Vertex Cover in General Graphs. Mahsa Derakhshan, Andisheh Ghasemi, Rajmohan Rajaraman |
| 2025 | Online Algorithm Design Beyond the Worst Case (Invited Talk). Anupam Gupta |
| 2025 | Online Disjoint Spanning Trees and Polymatroid Bases. Karthekeyan Chandrasekaran, Chandra Chekuri, Weihao Zhu |
| 2025 | Online and Feasible Presentability: From Trees to Modal Algebras. Nikolay Bazhenov, Dariusz Kalocinski, Michal Wroclawski |
| 2025 | Optimal Distance Labeling for Permutation Graphs. Pawel Gawrychowski, Wojciech Janczewski |
| 2025 | Optimal Inapproximability of Promise Equations over Finite Groups. Silvia Butti, Alberto Larrauri, Stanislav Zivný |
| 2025 | Optimal Oblivious Subspace Embeddings with Near-Optimal Sparsity. Shabarish Chenakkod, Michal Derezinski, Xiaoyu Dong |
| 2025 | Optimal Static Fully Indexable Dictionaries. Jingxun Liang, Renfei Zhou |
| 2025 | P-Time Algorithms for Typical #EO Problems. Boning Meng, Juqiu Wang, Mingji Xia |
| 2025 | Parameterised Holant Problems. Panagiotis Aivasiliotis, Andreas Göbel, Marc Roth, Johannes Schmitt |
| 2025 | Parameterized Algorithms for Matching Integer Programs with Additional Rows and Columns. Alexandra Lassota, Koen Ligthart |
| 2025 | Positive and Monotone Fragments of FO and LTL. Simon Iosti, Denis Kuperberg, Quentin Moreau |
| 2025 | Probabilistic and Causal Satisfiability: Constraining the Model. Markus Bläser, Julian Dörfler, Maciej Liskiewicz, Benito van der Zander |
| 2025 | Pushing the Frontiers of Subexponential FPT Time for Feedback Vertex Set. Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond |
| 2025 | Quantum Speedup for Sampling Random Spanning Trees. Simon Apers, Minbo Gao, Zhengfeng Ji, Chenghua Liu |
| 2025 | Query Efficient Weighted Stochastic Matching. Mahsa Derakhshan, Mohammad Saneian |
| 2025 | Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets. Roni Con, Zeyu Guo, Ray Li, Zihan Zhang |
| 2025 | Randomized Binary and Tree Search Under Pressure. Agustín Caracci, Christoph Dürr, José Verschae |
| 2025 | Reachability in 3-VASS Is Elementary. Wojciech Czerwinski, Ismaël Jecker, Slawomir Lasota, Lukasz Orlikowski |
| 2025 | Reducing Stochastic Games to Semidefinite Programming. Manuel Bodirsky, Georg Loho, Mateusz Skomra |
| 2025 | Relative-Error Testing of Conjunctions and Decision Lists. Xi Chen, William Pires, Toniann Pitassi, Rocco A. Servedio |
| 2025 | Repetition Aware Text Indexing for Matching Patterns with Wildcards. Daniel Gibney, Jackson Huffstutler, Mano Prakash Parthasarathi, Sharma V. Thankachan |
| 2025 | Restricted CSPs and F-Free Digraph Algorithmics. Santiago Guzmán-Pro, Barnaby Martin |
| 2025 | Revisiting Directed Disjoint Paths on Tournaments (And Relatives). Guilherme de C. M. Gomes, Raul Lopes, Ignasi Sau |
| 2025 | Robust Contraction Decomposition for Minor-Free Graphs and Its Applications. Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Dániel Marx, Pranabendu Misra, Daniel Neuen, Saket Saurabh, Prafullkumar Tale, Jie Xue |
| 2025 | Robust-Sorting and Applications to Ulam-Median. Ragesh Jaiswal, Amit Kumar, Jatin Yadav |
| 2025 | Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems. Baris Can Esmer, Ariel Kulik |
| 2025 | Satisfiability of Commutative vs. Non-Commutative CSPs. Andrei A. Bulatov, Stanislav Zivný |
| 2025 | Saturation Problems for Families of Automata. León Bohn, Yong Li, Christof Löding, Sven Schewe |
| 2025 | Scarf's Algorithm on Arborescence Hypergraphs. Karthekeyan Chandrasekaran, Yuri Faenza, Chengyue He, Jay Sethuraman |
| 2025 | Separability Properties of Monadically Dependent Graph Classes. Édouard Bonnet, Samuel Braunfeld, Ioannis Eleftheriadis, Colin Geniet, Nikolas Mählmann, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk |
| 2025 | Shared Randomness Helps with Local Distributed Problems. Alkida Balliu, Mohsen Ghaffari, Fabian Kuhn, Augusto Modanese, Dennis Olivetti, Mikaël Rabie, Jukka Suomela, Jara Uitto |
| 2025 | Simultaneously Approximating All Norms for Massively Parallel Correlation Clustering. Nairen Cao, Shi Li, Jia Ye |
| 2025 | Stable Hypergraph Matching in Unimodular Hypergraphs. Péter Biró, Gergely Csáji, Ildikó Schlotter |
| 2025 | Streaming Maximal Matching with Bounded Deletions. Sanjeev Khanna, Christian Konrad, Jacques Dark |
| 2025 | Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs. Daniel Paul-Pena, C. Seshadhri |
| 2025 | Submodular Hypergraph Partitioning: Metric Relaxations and Fast Algorithms via an Improved Cut-Matching Game. Antares Chen, Lorenzo Orecchia, Erasmo Tani |
| 2025 | Submonoid Membership in n-Dimensional Lamplighter Groups and S-Unit Equations. Ruiwen Dong |
| 2025 | Taming Infinity One Chunk at a Time: Concisely Represented Strategies in One-Counter MDPs. Michal Ajdarów, James C. A. Main, Petr Novotný, Mickael Randour |
| 2025 | Testing C_k-Freeness in Bounded Admissibility Graphs. Christine Awofeso, Patrick Greaves, Oded Lachish, Amit Levi, Felix Reidl |
| 2025 | The Converse of the Real Orthogonal Holant Theorem. Ben Young |
| 2025 | The Long Arm of Nashian Allocation in Online p-Mean Welfare Maximization. Zhiyi Huang, Chui Shan Lee, Xinkai Shu, Zhaozi Wang |
| 2025 | The Memory of ω-Regular and BC(Σ⁰₂) Objectives. Antonio Casares, Pierre Ohlmann |
| 2025 | The Role of Regularity in (Hyper-)Clique Detection and Implications for Optimizing Boolean CSPs. Nick Fischer, Marvin Künnemann, Mirza Redzic, Julian Stieß |
| 2025 | The Satisfiability and Validity Problems for Probabilistic Computational Tree Logic Are Highly Undecidable. Miroslav Chodil, Antonín Kucera |
| 2025 | The Trichotomy of Regular Property Testing. Gabriel Bathie, Nathanaël Fijalkow, Corto Mascle |
| 2025 | The Ultimate Signs of Second-Order Holonomic Sequences. Fugen Hagihara, Akitoshi Kawamura |
| 2025 | The Value Problem for Multiple-Environment MDPs with Parity Objective. Krishnendu Chatterjee, Laurent Doyen, Jean-François Raskin, Ocan Sankur |
| 2025 | Tight Bounds for Heavy-Hitters and Moment Estimation in the Sliding Window Model. Shiyuan Feng, William Swartworth, David P. Woodruff |
| 2025 | Tiling Random Regular Graphs Efficiently. Sahar Diskin, Ilay Hoshen, Maksim Zhukovskii |
| 2025 | Towards the Proximity Conjecture on Group-Labeled Matroids. Dániel Garamvölgyi, Ryuhei Mizutani, Taihei Oki, Tamás Schwarcz, Yutaro Yamaguchi |
| 2025 | Tree Algebras and Bisimulation-Invariant MSO on Finite Graphs. Thomas Colcombet, Amina Doumane, Denis Kuperberg |
| 2025 | Treewidth Parameterized by Feedback Vertex Number. Hendrik Molter, Meirav Zehavi, Amit Zivan |
| 2025 | Ultra-Resilient Superimposed Codes: Near-Optimal Construction and Applications. Gianluca De Marco, Dariusz R. Kowalski |
| 2025 | Unbalanced Random Matching Markets with Partial Preferences. Aditya Potukuchi, Shikha Singh |
| 2025 | Undirected 3-Fault Replacement Path in Nearly Cubic Time. Shucheng Chi, Ran Duan, Benyu Wang, Tianle Xie |
| 2025 | Universal Online Contention Resolution with Preselected Order. Junyao Zhao |
| 2025 | Using Games and Universal Trees to Characterise the Nondeterministic Index of Tree Languages. Olivier Idir, Karoliina Lehtinen |
| 2025 | Verification of Linear Dynamical Systems via O-Minimality of the Real Numbers. Toghrul Karimov |
| 2025 | Weakly Approximating Knapsack in Subquadratic Time. Lin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang |
| 2025 | Weighted GKAT: Completeness and Complexity. Spencer Van Koevering, Wojciech Rozowski, Alexandra Silva |
| 2025 | Worst-Case and Average-Case Hardness of Hypercycle and Database Problems. Cheng-Hao Fu, Andrea Lincoln, Rene Reyes |
| 2025 | Yet Another Simple Proof of the PCRP Theorem. Naoto Ohsaka |
| 2025 | k-Leaf Powers Cannot Be Characterized by a Finite Set of Forbidden Induced Subgraphs for k ≥ 5. Max Dupré la Tour, Manuel Lafond, Ndiamé Ndiaye, Adrian Vetta |
| 2025 | q-Partitioning Valuations: Exploring the Space Between Subadditive and Fractionally Subadditive Valuations. Kiril Bangachev, S. Matthew Weinberg |