Richomme Gwenaël and Matthieu Rosenfeld. Guessing words using queries on subwords or factors
Benjamin Bergougnoux, Tuukka Korhonen and Jesper Nederlof. Tight Lower Bounds for Problems Parameterized by Rank-width
Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez and Stephan Thomasse. Twin-width V: linear minors, modular counting, and matrix multiplication
Dimitrios Los and Thomas Sauerwald. Tight Bounds for Repeated Balls-into-Bins
Zdenek Dvorak. Representation of short distances in structurally sparse graphs
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann and Daniel Stephan. Strongly Hyperbolic Unit Disk Graphs
Marek Chrobak, Samuel Haney, Mehraneh Liaee, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram and Neal Young. Online Paging with Heterogeneous Cache Slots
Ruiwen Dong. Semigroup intersection problems in the Heisenberg groups
Markus Bläser, Hendrik Mayer and Devansh Shringi. On the Multilinear Complexity of Associative Algebras
Ora Nova Fandina, Mikael Møller Høgsgaard and Kasper Green Larsen. Barriers for Faster Dimensionality Reduction
Christian Konrad, Kheeran K. Naidu and Arun Steward. Maximum Matching via Maximal Matching Queries
Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian Schmidt, Alexandru I. Tomescu and Elia Carlo Zirondelli. Cut paths and their remainder structure, with applications
Francois Le Gall, Masayuki Miyamoto and Harumichi Nishimura. Distributed Quantum Interactive Proofs
Charles Paperman, Sylvain Salvati and Claire Soyez-Martin. An algebraic approach to vectorial programs
Benjamin Lévêque, Moritz Mühlenthaler and Thomas Suzan. Reconfiguration of Digraph Homomorphisms
Lorenzo Clemente, Maria Donten-Bury, Filip Mazowiecki and Michał Pilipczuk. On Rational Recursive Sequences
Emmanuel Filiot, Ismaël Jecker, Christof Löding and Sarah Winter. A regular and complete notion of delay for streaming string transducers.
Dror Chawin and Ishay Haviv. Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank
Marc Dufay, Claire Mathieu and Hang Zhou. An Approximation Algorithm for Distance-Constrained Vehicle Routing on Trees
Florent Capelli and Yann Strozecki. Geometric Amortization of Enumeration Algorithms
Klaus Heeger, André Nichterlein and Rolf Niedermeier. Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions
Cezar Alexandru, Pavel Dvořák, Christian Konrad and Kheeran Naidu. Improved Weighted Matching in the Sliding Window Model
Shengyu Huang, Chih-Hung Liu and Daniel Rutschmann. Approximate Selection with Unreliable Comparisons in Optimal Expected Time
Ruiwen Dong. Solving homogeneous linear equations over polynomial semirings
Jessica Enright, Kitty Meeks and Hendrik Molter. Counting Temporal Paths
Maxim Akhmedov and Maxim Babenko. Packing Odd Walks and Trails in Multiterminal Networks
Leszek Gasieniec, Paul Spirakis and Grzegorz Stachowiak. New Clocks, Optimal Line Formation and Self-Replication Population Protocols
Arnaud Carayol, Philippe Duchon, Florent Koechlin and Cyril Nicaud. One Drop of Non-Determinism in a Random Deterministic Automaton
Augusto Modanese. Sublinear-Time Probabilistic Cellular Automata
Pierre Bergé, Édouard Bonnet, Hugues Déprés and Rémi Watrigant. Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width
Antoine Amarilli and Mikaël Monet. Enumerating Regular Languages in Constant Delay
Tomohiro Koana. Induced Matching below Guarantees: Average Paves the Way for Fixed-Parameter Tractability
Nacim Oijid and Valentin Gledel. Avoidance games are PSPACE-Complete
Vera Chekan, Narek Bojikian, Falko Hegerfeld and Stefan Kratsch. Tight Bounds for Connectivity Problems Parameterized by Cutwidth
James Watson, Johannes Bausch and Sevag Gharibian. The Complexity of Translationally Invariant Problems beyond Ground State Energies
Nicolas El Maalouly. Exact Matching: Algorithms and Related Problems
Pieter Kleer and Georgios Amanatidis. Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals
Konrad Majewski, Michał Pilipczuk and Marek Sokołowski. Maintaining CMSO_2 properties on dynamic structures with bounded feedback vertex number
Yaniv Sadeh and Haim Kaplan. Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm
Satyadev Nandakumar and Subin Pulari. Real numbers equally compressible in every base
Nader Bshouty. Non-Adaptive Proper Learning Polynomials
Haohong Li and Ge Xia. An $O(3.82^k)$ Time FPT Algorithm for Convex Flip Distance
Erhard Aichinger and Simon Grünbacher. The Complexity of Checking Quasi-Identities over Finite Algebras with a Mal'cev Term
Balagopal Komarath, Anant Kumar, Suchismita Mishra and Aditi Sethia. Finding and Counting Patterns in Sparse Graphs
Pascal Baumann, Roland Meyer and Georg Zetzsche. Regular Separability in Büchi Vector Addition Systems
Monika Henzinger, Stefan Neumann, Harald Räcke and Stefan Schmid. Dynamic Maintenance of Monotone Dynamic Programs and Applications
Suryajith Chillara, Coral Grichener and Amir Shpilka. On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts
Naoto Ohsaka. Gap Preserving Reductions between Reconfiguration Problems
Sravanthi Chede and Anil Shukla. Extending Merge Resolution to a Family of QBF-Proof Systems
Philipp Zschoche. Restless Temporal Path Parameterized Above Lower Bounds
Reijo Jaakkola, Antti Kuusisto and Miikka Vilander. Relating Description Complexity to Entropy
Jędrzej Olkowski, Michał Pilipczuk, Mateusz Rychlicki, Karol Węgrzycki and Anna Zych-Pawlewicz. Dynamic data structures for parameterized string problems
