Accepted papers

  • Petr Gregor, Torsten Mütze and Arturo Merino. Star transposition Gray codes for multiset permutations
  • Takeshi Tokuyama and Ryo Yoshimura. High-Quality Consistent Digital Rays via Vector Field Rounding
  • Hanlin Ren and Rahul Santhanam. A Relativization Perspective on Meta-Complexity
  • Jesper Nederlof, Michał Pilipczuk, Céline Swennenhuis and Karol Węgrzycki. Isolation schemes for problems on decomposable graphs
  • Michael Lampis. Determining a Slater Winner is Complete for Parallel Access to NP
  • Fedor Fomin, Petr Golovach, William Lochet, Danil Sagunov, Saket Saurabh and Kirill Simonov. Detours in Directed Graphs
  • Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Guido Proietti and Mirko Rossi. Single-source shortest p-disjoint paths: fast computation and sparse preservers
  • Mamadou M. Kanté, Eun Jung Kim, O-Joung Kwon and Sang-il Oum. Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k
  • Quanquan C. Liu, Manish Purohit, Zoya Svitkina, Erik Vee and Joshua R. Wang. Scheduling with Communication Delay in Near-Linear Time
  • Mrinal Kumar, C. Ramya, Ramprasad Saptharishi and Anamay Tengse. If VNP is hard, then so are equations for it
  • András Z. Salamon and Michael Wehar. Superlinear Lower Bounds Based on ETH
  • Jeremiah Blocki, Mike Cinkoske, Seunghoon Lee and Jin Young Son. On Explicit Constructions of Extremely Depth Robust Graphs
  • Jianer Chen, Qin Huang, Iyad Kanj and Ge Xia. Near-Optimal Algorithms for Point-Line Covering Problems
  • Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki and Kunihiro Wasa. Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint
  • Antonin Callard and Benjamin Hellouin de Menibus. The aperiodic Domino problem in higher dimension
  • Nader Bshouty and Catherine Haddad-Zaknoon. On Testing Decision Tree
  • Lars Jaffke, O-Joung Kwon and Jan Arne Telle. Classes of intersection digraphs with good algorithmic properties
  • Yung-Chung Chiu and Hsueh-I Lu. Blazing a Trail via Matrix Multiplications: A Faster Algorithm for Non-shortest Induced Paths
  • Hiromichi Goko, Kazuhisa Makino, Shuichi Miyazaki and Yu Yokoi. Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties
  • Jack H. Lutz, Neil Lutz and Elvira Mayordomo. Extending the Reach of the Point-to-Set Principle
  • Michael Elkin and Ofer Neiman. Centralized, Parallel, and Distributed Multi-Source Shortest Paths via Hopsets and Rectangular Matrix Multiplication
  • Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack and Lars Rohwedder. Cardinality Constrained Scheduling in Online Models
  • Daria Pchelina, Nicolas Schabanel, Shinnosuke Seki and Guillaume Theyssier. Oritatami systems assemble shapes no less complex than tile assembly model (aTAM)
  • Yacine Al Najjar, Walid Ben-Ameur and Jérémie Leguay. Approximability of Robust Network Design: the Directed Case
  • Patricia Bouyer, Mickael Randour and Pierre Vandenhove. Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphs
  • Stefan Dantchev, Nicola Galesi, Abdul Ghani and Barnaby Martin. Depth lower bounds in Stabbing Planes for combinatorial principles
  • Sander Gribling and Harold Nieuwboer. Improved quantum lower and upper bounds for matrix scaling
  • Eric Goubault, Jérémy Ledent and Sergio Rajsbaum. A Simplicial Model for KB4: Epistemic Logic with Agents that May Die
  • Laurent Bienvenu, Valentino Delle Rose and Tomasz Steifer. Probabilistic vs deterministic gamblers
  • Eugen Füchsle, Hendrik Molter, Rolf Niedermeier and Malte Renken. Delay-Robust Routes in Temporal Graphs
  • Alexander Kozachinskiy. One-to-Two-Player Lifting for Mildly Growing Memory
  • Sławomir Lasota. Improved Ackermannian lower bound for the Petri nets reachability problem
  • C Ramya and Anamay Tengse. On finer separations between subclasses of Read-once Oblivious ABPs
  • Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer, Nikhil Mande, Manaswi Paraashar and Ronald de Wolf. Symmetry and Quantum Query-to-Communication Simulation
  • Pascal Baumann, Moses Ganardi, Ramanathan Thinniyam Srinivasan and Georg Zetzsche. Existential definability over the subword ordering
  • Nikolay Bazhenov, Dariusz Kalociński and Michał Wrocławski. Intrinsic complexity of recursive functions on natural numbers with standard order
  • Ahmad Biniaz, Majid Daliri and Amir Hossein Moradpour. A 10-Approximation of the π/2-MST
  • Pierre Bergé, Guillaume Ducoffe and Michel Habib. Subquadratic-time algorithm for the diameter and all eccentricities on median graphs
  • Hiromichi Goko, Akitoshi Kawamura, Yasushi Kawase, Kazuhisa Makino and Hanna Sumita. Online Scheduling on Identical Machines with a Metric State Space
  • Bireswar Das, Anant Kumar, Shivdutt Sharma and Dhara Thakkar. Linear Space Data Structures for Finite Groups with Constant Query-time
  • Carla Groenland, Isja Mannens, Jesper Nederlof and Krisztina Szilágyi. Tight bounds for counting colorings and connected edge sets parameterized by cutwidth
  • Leroy Chew and Friedrich Slivovsky. Towards Uniform Certification in QBF
  • Nikhil Mande, Swagato Sanyal and Suhail Sherif. One-Way Communication Complexity and Non-Adaptive Decision Trees
  • Martin Skoviera and Peter Varsa. NP-completeness of perfect matching index of cubic graphs
  • Michał Pilipczuk, Marek Sokołowski and Anna Zych-Pawlewicz. Compact representation for matrices of bounded twin-width
  • Tomohiro Koana, Christian Komusiewicz, André Nichterlein and Frank Sommer. Covering Many (or Few) Edges with k Vertices in Sparse Graphs
  • Pawel Idziak, Piotr Kawałek and Jacek Krzaczkowski. Satisfiability of circuits and equations over finite Malcev algebras
  • S. Akshay, Hugo Bazille, Blaise Genest and Mihir Vahanwala. On Robustness for the Skolem and positivity problems
  • Donald Stull. Optimal Oracles for Point-to-Set Principles
  • Ramtin Afshar, Michael T. Goodrich, Pedro Matias and Martha C. Osegueda. Mapping Networks via Parallel kth-Hop Traceroute Queries
  • Xinyu Wu. Analyzing XOR-Forrelation through stochastic calculus
  • Heiko Dietrich, Murray Elder, Adam Piggott, Youming Qiao and Armin Weiss. The isomorphism problem for plain groups is in $\Sigma_3^{\mathsf{P}}$
  • Andrei Bulatov and Akbar Rafiey. The Ideal Membership Problem and Abelian Groups
  • Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu and Saket Saurabh. Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems
  • Christopher Williamson. Sharp indistinguishability bounds from non-uniform approximations
  • Telikepalli Kavitha. Fairly Popular Matchings and Optimality
  • Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh and Gopinath Mishra. Faster Counting and Sampling Algorithms using Colorful Decision Oracle
Online user: 2