Accepted papers

  • Marten Maack and Klaus Jansen. Inapproximability Results for Scheduling with Interval and Resource Restrictions
  • Jan Philipp Wächter and Armin Weiß. An Automaton Group with PSPACE-Complete Word Problem
  • Wim Martens, Matthias Niewerth and Tina Trautner. A Trichotomy for Regular Trail Queries
  • Antonin Callard and Mathieu Hoyrup. Descriptive complexity on non-Polish spaces
  • Titus Dose and Christian Glasser. NP-Completeness, Proof Systems, and Disjoint NP-Pairs
  • Philip Bille, Inge Li Gørtz and Teresa Anna Steiner. String Indexing with Compressed Patterns
  • Yusuke Kobayashi. An FPT Algorithm for Minimum Additive Spanner Problem
  • Maximilian Janke and Susanne Albers. Nearly Tight Bounds for Randomized List Update in the Paid Exchange Model
  • Dan Bergren, Eduard Eiben, Robert Ganian and Iyad Kanj. On Covering Segments with Unit Intervals
  • Jarkko Kari and Etienne Moutot. Decidability and Periodicity of Low Complexity Tilings
  • Manuel Lafond, Binhai Zhu and Peng Zou. The Tandem Duplication Distance is NP-hard
  • Pawel Gawrychowski, Martin Lange, Narad Rampersad, Jeffrey Shallit and Marek Szykuła. Existential Length Universality
  • Hussak Walter and Amitabh Trehan. On The Termination of Flooding
  • Bartlomiej Dudek, Pawel Gawrychowski and Tatiana Starikovskaya. Generalised Pattern Matching Revisited
  • Gregory Gutin, Diptapriyo Majumdar, Sebastian Ordyniak and Magnus Wahlstrom. Parameterized Pre-coloring Extension and List Coloring Problems
  • Sevag Gharibian, Stephen Piddock and Justin Yirka. Oracle complexity classes and local measurements on physical Hamiltonians
  • Marius Zimand. Secret key agreement from correlated data, with no prior information
  • Michał Gańczorz. Using statistical encoding to achieve tree succinctness never seen before
  • Taisuke Izumi, Francois Le Gall and Frederic Magniez. Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model
  • Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann and Olivier Serre. Lower Bounds for Arithmetic Circuits via the Hankel Matrix
  • Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich and Maximilian Katzmann. Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs
  • Nathalie Aubrun, Julien Esnay and Mathieu Sablik. Domino Problem Under Horizontal Constraints
  • George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Viktor Zamaraev and Philipp Zschoche. Computing Maximum Matchings in Temporal Graphs
  • Brieuc Guinard and Amos Korman. Tight Bounds for the Cover Times of Random Walks with Heterogeneous Step Lengths
  • Falko Hegerfeld and Stefan Kratsch. Solving connectivity problems parameterized by treedepth in single-exponential time and polynomial space
  • Mitsuru Funakoshi and Julian Pape-Lange. Non-Rectangular Convolutions and (Sub-)Cadences with Three Elements
  • Bonnet Édouard, Sergio Cabello and Wolfgang Mulzer. Maximum Matchings in Geometric Intersection Graphs
  • Thomas Colcombet and Sylvain Lombardy. Unambiguous separators for tropical tree automata
  • Mirmahdi Rahgoshay and Mohammad Reza Salavatipour. Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment
  • Yi-Jun Chang, Martin Farach-Colton, Tsan-Sheng Hsu and Meng-Tsung Tsai. Streaming Complexity of Spanning Tree Computation
  • Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Muehlenthaler, Akira Suzuki and Kunihiro Wasa. Shortest Reconfiguration of Colorings under Kempe-changes
  • Eva-Maria Hols, Stefan Kratsch and Astrid Pieterse. Elimination Distances, Blocking Sets, and Kernels for Vertex Cover
  • S. Akshay, Nikhil Balaji, Aniket Murhekar, Rohith Varma and Nikhil Vyas. Near-optimal complexity bounds for fragments of the Skolem Problem
  • Stefan Kratsch and Florian Nelles. Efficient parameterized algorithms for computing all-pairs shortest paths
  • Michał Wrona. Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width
  • Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich and Stefan Jaax. Succinct Population Protocols for Presburger Arithmetic
  • Lech Duraj. A sub-quadratic algorithm for the longest common increasing subsequence problem
  • Andrés Cristi, Mathieu Mari and Andreas Wiese. Fixed-parameter algorithms for Unsplittable Flow Cover
  • Frank Fuhlbrück, Johannes Koebler and Oleg Verbitsky. Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm
  • Andrés Cristi and Andreas Wiese. Better approximations for general caching and UFP-cover under resource augmentation
  • Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucky, Nitin Saurabh and Ronald de Wolf. Improved bounds on Fourier entropy and Min-entropy
  • Bruno Bauwens. Information distance revisited
  • Suryajith Chillara. On Computing Multilinear Polynomials Using Multi-r-ic Depth Four Circuits
  • Dietmar Berwanger and Laurent Doyen. Observation and Distinction. Representing Information in Infinite Games
  • Julian D'Costa, Engel Lefaucheux, Joel Ouaknine and James Worrell. How Fast Can You Escape a Compact Polytope?
  • Sidhanth Mohanty, Ryan O'Donnell and Pedro Paredes. The SDP value for random two-eigenvalue CSPs
  • Xiang Huang, Jack H. Lutz, Elvira Mayordomo and Donald Stull. Asymptotic Divergences and Strong Dichotomy
  • S.M. Dhannya and N.S. Narayanaswamy. Perfect resolution for Conflict-Free Colouring of Interval Hypergraphs
  • Monika Henzinger and Pan Peng. Constant-Time Dynamic $(\Delta+1)$-Coloring
  • Marcelo Arenas, Juan L. Reutter, Etienne Toussaint, Martin Ugarte, Francisco José Vial Prado and Domagoj Vrgoc. Cryptocurrency Mining Games with Economic Discount and Decreasing Rewards
  • Andre Nies and Frank Stephan. Randomness and initial segment complexity for probability measures
  • Jakub Gajarský and Stephan Kreutzer. Computing shrub-depth decompositions
  • Hans L. Bodlaender, Lars Jaffke and Jan Arne Telle. Typical Sequences Revisited - Computing Width Parameters of Graphs
  • Pierre Aboulker, Édouard Bonnet, Eun Jung Kim and Florian Sikora. Grundy Coloring & friends, Half-Graphs, Bicliques
  • Nikhil Vyas and Ryan Williams. Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms
  • Jacobo Torán and Florian Wörz. Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space
Online user: 1