Table of Contents

• Communication Complexity of the Secret Key Agreement in Algorithmic Information TheoryEmirhan Gürpinar, Andrei E. Romashchenko. [doi]
• The Mergegram of a Dendrogram and Its StabilityYury Elkin, Vitaliy Kurlin. [doi]
• A Polynomial Kernel for 3-Leaf Power DeletionJungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum. [doi]
• PBS-Calculus: A Graphical Language for Coherent Control of Quantum ComputationsAlexandre Clément, Simon Perdrix. [doi]
• A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric HelpsRaul Lopes 0001, Ignasi Sau. [doi]
• Some Remarks on Deciding Equivalence for Graph-To-Graph TransducersMikolaj Bojanczyk, Janusz Schmude. [doi]
• Linear High-Order Deterministic Tree Transducers with Regular Look-AheadPaul Gallot, Aurélien Lemay, Sylvain Salvati. [doi]
• Hitting Forbidden Induced Subgraphs on Bounded Treewidth GraphsIgnasi Sau, Uéverton dos Santos Souza. [doi]
• Span Programs and Quantum Time ComplexityArjan Cornelissen, Stacey Jeffery, Maris Ozols, Alvaro Piedrafita. [doi]
• Topological Influence and Locality in Swap Schelling GamesDavide Bilò, Vittorio Bilò, Pascal Lenzner, Louise Molitor. [doi]
• Solving Packing Problems with Few Small Items Using Rainbow MatchingsMax Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, Malte Skambath. [doi]
• U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem RevisitedJan Kratochvíl, Tomás Masarík, Jana Novotná. [doi]
• Unary Prime LanguagesIsmaël Jecker, Orna Kupferman, Nicolas Mazzocchi. [doi]
• On Affine Reachability ProblemsStefan Jaax, Stefan Kiefer. [doi]
• A Special Case of Rational Identity Testing and the Brešar-Klep TheoremVikraman Arvind, Abhranil Chatterjee 0001, Rajit Datta, Partha Mukhopadhyay. [doi]
• Knapsack and the Power Word Problem in Solvable Baumslag-Solitar GroupsMarkus Lohrey, Georg Zetzsche. [doi]
• Analysing Spatial Properties on Neighbourhood SpacesSven Linker, Fabio Papacchini, Michele Sevegnani. [doi]
• Even Faster Algorithms for CSAT Over supernilpotent AlgebrasPiotr Kawalek, Jacek Krzaczkowski. [doi]
• Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding ApproachLars Jaffke, Mateus de Oliveira Oliveira, Hans Raj Tiwary. [doi]
• Sensitivity Lower Bounds from Linear DependenciesSophie Laplante, Reza Naserasr, Anupa Sunny. [doi]
• Classically Simulating Quantum Circuits with Local Depolarizing NoiseYasuhiro Takahashi, Yuki Takeuchi, Seiichiro Tani. [doi]
• Structural Parameterizations of Clique ColoringLars Jaffke, Paloma T. Lima, Geevarghese Philip. [doi]
• Layered Fan-Planar Graph DrawingsTherese C. Biedl, Steven Chaplick, Michael Kaufmann 0001, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou. [doi]
• Simplified Game of Life: Algorithms and ComplexityKrishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismaël Jecker, Jakub Svoboda. [doi]
• Best Fit Bin Packing with Random Order RevisitedSusanne Albers, Arindam Khan 0001, Leon Ladewig. [doi]
• On LTL Model Checking for Low-Dimensional Discrete Linear Dynamical SystemsToghrul Karimov, Joël Ouaknine, James Worrell 0001. [doi]
• Complexity of Computing the Anti-Ramsey Numbers for PathsSaeed Akhoondian Amiri, Alexandru Popa 0001, Mohammad Roghani, Golnoosh Shahkarami, Reza Soltani, Hossein Vahidi 0001. [doi]
• Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite GraphsChetan Gupta 0002, Vimal Raj Sharma, Raghunath Tewari. [doi]
• Dynamic Time Warping-Based Proximity ProblemsBoris Aronov, Matthew J. Katz, Elad Sulami. [doi]
• Minimum 0-Extension Problems on Directed MetricsHiroshi Hirai 0001, Ryuhei Mizutani. [doi]
• List Homomorphism Problems for Signed GraphsJan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková. [doi]
• Extending Nearly Complete 1-Planar Drawings in Polynomial TimeEduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg. [doi]
• Hierarchical Clusterings of Unweighted GraphsSvein Høgemo, Christophe Paul, Jan Arne Telle. [doi]
• The Complexity of Approximating the Complex-Valued Potts ModelAndreas Galanis, Leslie Ann Goldberg, Andrés Herrera-Poyatos. [doi]
• Concurrent Games with Arbitrarily Many Players (Invited Talk)Nathalie Bertrand 0001. [doi]
• Synchronizing Deterministic Push-Down Automata Can Be Really HardHenning Fernau, Petra Wolf 0002, Tomoyuki Yamakami. [doi]
• On a Temporal Logic of Prefixes and InfixesLaura Bozzelli, Angelo Montanari, Adriano Peron, Pietro Sala. [doi]
• Algorithms for the Rainbow Vertex Coloring Problem on Graph ClassesPaloma T. Lima, Erik Jan van Leeuwen, Marieke van der Wegen. [doi]
• Value Iteration Using Universal Graphs and the Complexity of Mean Payoff GamesNathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann. [doi]
• Palindromic k-Factorization in Pure Linear TimeMikhail Rubinchik, Arseny M. Shur. [doi]
• All Growth Rates of Abelian Exponents Are Attained by Infinite Binary WordsJarkko Peltomäki, Markus A. Whiteland. [doi]
• Factoring Polynomials over Finite Fields with Linear Galois Groups: An Additive Combinatorics ApproachZeyu Guo. [doi]
• Reducing Graph Transversals via Edge ContractionsPaloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza. [doi]
• Graph Clustering in All Parameter RegimesJunhao Gan, David F. Gleich, Nate Veldt, Anthony Wirth, Xin Zhang. [doi]
• Quantum-Inspired Sublinear Algorithm for Solving Low-Rank Semidefinite ProgrammingNai-Hui Chia, Tongyang Li, Han-Hsuan Lin, Chunhao Wang. [doi]
• Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal GraphsAlessio Conte, Pierluigi Crescenzi, Andrea Marino, Giulia Punzi. [doi]
• Elimination Distance to Bounded Degree on Planar GraphsAlexander Lindermayr, Sebastian Siebertz, Alexandre Vigny. [doi]
• Quantum Lower and Upper Bounds for 2D-Grid and Dyck LanguageAndris Ambainis, Kaspars Balodis, Janis Iraids, Kamil Khadiev, Vladislavs Klevickis, Krisjanis Prusis, Yixin Shen, Juris Smotrovs, Jevgenijs Vihrovs. [doi]
• Regular Choice Functions and Uniformisations For countable DomainsVincent Michielini, Michal Skrzypczak. [doi]
• A Timecop's Work Is Harder Than You ThinkNils Morawietz, Carolin Rehs, Mathias Weller. [doi]
• Ambiguity Hierarchy of Regular Infinite Tree LanguagesAlexander Rabinovich, Doron Tiferet. [doi]
• Randomized Polynomial-Time Equivalence Between Determinant and Trace-IMM Equivalence TestsJanaky Murthy, Vineet Nair, Chandan Saha 0001. [doi]
• List-Decodability of Structured Ensembles of Codes (Invited Talk)Mary Wootters. [doi]
• Randomization in Non-Uniform Finite AutomataPavol Duris, Rastislav Královic, Richard Královic, Dana Pardubská, Martin Pasen, Peter Rossmanith. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting CodesPalash Dey, Jaikumar Radhakrishnan, Santhoshini Velusamy. [doi]
• Quantum-Inspired Classical Algorithms for Singular Value TransformationDhawal Jethwani, François Le Gall, Sanjay K. Singh. [doi]
• Optimally Resilient Strategies in Pushdown Safety GamesDaniel Neider, Patrick Totzke, Martin Zimmermann 0002. [doi]
• Some Open Problems in Computational Geometry (Invited Talk)Sergio Cabello. [doi]
• Fast Algorithms for General Spin Systems on Bipartite ExpandersAndreas Galanis, Leslie Ann Goldberg, James Stewart. [doi]
• Approximation in (Poly-) Logarithmic SpaceArindam Biswas 0001, Venkatesh Raman 0001, Saket Saurabh 0001. [doi]
• Building Large k-Cores from Sparse GraphsFedor V. Fomin, Danil Sagunov, Kirill Simonov. [doi]
• Continuous and Monotone MachinesMichal Konecný, Florian Steinberg, Holger Thies. [doi]
• On the Parameterized Complexity of Deletion to ℋ-Free Strong ComponentsRian Neogi, M. S. Ramanujan, Saket Saurabh 0001, Roohani Sharma. [doi]
• Efficient Enumerations for Minimal Multicuts and Multiway CutsKazuhiro Kurita, Yasuaki Kobayashi. [doi]
• VC Density of Set Systems Definable in Tree-Like GraphsAdam Paszke, Michal Pilipczuk. [doi]
• An Improved Approximation Algorithm for Scheduling Under Arborescence Precedence ConstraintsNguyen Kim Thang. [doi]
• The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite DomainsCaterina Viola, Stanislav Zivný. [doi]
• Randomness and Effective Dimension of Continued FractionsSatyadev Nandakumar, Prateek Vishnoi. [doi]
• Preservation of Equations by Monoidal MonadsLouis Parlant, Jurriaan Rot, Alexandra Silva 0001, Bas Westerbaan. [doi]
• Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR FunctionsMitsunori Ogihara, Kei Uchizawa. [doi]
• Isomorphism Problem for S_d-GraphsDeniz Agaoglu, Petr Hlinený. [doi]
• ∃ℝ-Completeness of Stationary Nash Equilibria in Perfect Information Stochastic GamesKristoffer Arnsfelt Hansen, Steffan Christ Sølvsten. [doi]
• A Quasiorder-Based Perspective on Residual AutomataPierre Ganty, Elena Gutiérrez, Pedro Valero 0001. [doi]
• A Complexity Dichotomy for Permutation Pattern Matching on Grid ClassesVít Jelínek, Michal Opler, Jakub Pekárek. [doi]
• On Repetition LanguagesOrna Kupferman, Ofer Leshkowitz. [doi]
• Exact and Approximate Algorithms for Computing a Second Hamiltonian CycleArgyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev. [doi]
• Ideal Membership Problem and a Majority Polymorphism over the Ternary DomainArpitha P. Bharathi, Monaldo Mastrolilli. [doi]
• Decidability in Group Shifts and Group Cellular AutomataPierre Béaur, Jarkko Kari. [doi]
• Register Transducers Are Marble TransducersGaëtan Douéneau-Tabot, Emmanuel Filiot, Paul Gastin. [doi]
• Fractional Covers of Hypergraphs with Bounded Multi-IntersectionGeorg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon. [doi]
• Slice Rank of Block Tensors and Irreversibility of Structure Tensors of AlgebrasMarkus Bläser, Vladimir Lysikov. [doi]
• Regular Resynchronizability of Origin Transducers Is UndecidableDenis Kuperberg, Jan Martens. [doi]
• Quick Separation in Chordal and Split GraphsPranabendu Misra, Fahad Panolan, Ashutosh Rai 0001, Saket Saurabh 0001, Roohani Sharma. [doi]
• Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like MetricsMartin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon. [doi]
• Complexity of Counting First-Order Logic for the Subword OrderDietrich Kuske, Christian Schwarz. [doi]