Sponsors and partners:




Accepted Papers
Martin Bullinger. Boundaries to SingleAgent Stability in Additively Separable Hedonic Games Mingyang Gong, Jing Fan, Guohui Lin and Eiji Miyano. Approximation algorithms for covering vertices by long paths Ruiwen Dong. On the Identity Problem for Unitriangular Matrices of Dimension Four Gaëtan DouéneauTabot and Olivier Carton. Continuous rational functions are deterministic regular Ishay Haviv and Michal Parnas. On the Binary and Boolean Rank of Regular Matrices Ilario Bonacina, Nicola Galesi and Massimo Lauria. On vanishing sums of roots of unity in polynomial calculus and sumofsquares Niclas Boehmer, Klaus Heeger and Rolf Niedermeier. Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems Gal Beniamini. Algebraic Representations of Unique Bipartite Perfect Matching Haitao Wang and Yiming Zhao. Computing the Minimum Bottleneck Moving Spanning Tree Yijia Chen, Jörg Flum, Mingjun Liu and Zhiyang Xun. On Algorithms Based on Finitely Many Homomorphism Counts Alexander Kulikov, Danila Pechenev and Nikita Slezkin. SATbased Circuit Local Improvement Aleksander Bjørn Grodt Christiansen Christiansen, Jacob Holm, Eva Rotenberg and Carsten Thomassen. On Dynamic α + 1 Arboricity Decomposition and OutOrientation David Auger, Pierre Coucheney and Loric Duhaze. Polynomial Time Algorithm for ARRIVAL on Treelike Multigraphs Dominik Peteler and Karin Quaas. Deciding Emptiness for Constraint Automata on Strings with the Prefix and Suffix Order Anton Ehrmanntraut, Fabian Egidy and Christian Glaßer. Oracle with P = NP ∩ coNP, but no ManyOne Completeness in UP, DisjNP, and DisjCoNP Arthur Jaquard and Thomas Colcombet. A Complexity Approach to Tree Algebras: the Polynomial Case Seiichiro Tani. SpaceBounded Unitary Quantum Computation with Postselection Dominik Bojko, Karol Gotfryd, Dariusz Kowalski and Dominik Pajak. Tree exploration in dualmemory model Michel Rigo, Manon Stipulanti and Markus Whiteland. On extended boundary sequences of morphic and Sturmian words Titouan Carette and Robert Booth. Complete ZXcalculi for the stabiliser fragment in odd prime dimensions Panagiotis Kanellopoulos, Maria Kyropoulou and Alexandros Voudouris. Not all Strangers are the Same: The Impact of Tolerance in Schelling Games Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann and Maximilian Pfister. RAC Drawings of Graphs with Low Degree Jingyang Zhao, Mingyu Xiao and Chao Xu. Improved Approximation Algorithms for The Traveling Tournament Problem Samson Abramsky and Dan Marsden. Comonadic semantics for hybrid logic Alexandre Fernandez, Luidnel Maignan and Antoine Spicher. NonDeterminism in Lindenmayer Systems and Global Transformations Aleks Kissinger and Will Simmons. Higherorder causal theories are models of BVlogic Guido Brückner, Ignaz Rutter and Peter Stumpf. Extending Partial Representations of Circle Graphs in NearLinear Time Matthew Earnshaw and Paweł Sobociński. Regular Monoidal Languages Mingyang Deng, Virginia Vassilevska Williams and Ziqian Zhong. New Lower Bounds and Upper Bounds for Listing Avoidable Vertices Dariusz Dereniowski and Izajasz Wrosz. Constantfactor approximation algorithm for binary search in trees with monotonic query times Lane A. Hemaspaandra, Mandar Juvekar, Arian Nadjimzadah and Patrick A. Phillips. Gaps, Ambiguity, and Establishing ComplexityClass Containments via Iterative ConstantSetting Timo Gervens and Martin Grohe. Graph Similarity Based on Matrix Norms Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi and Kunihiro Wasa. Independent set reconfiguration on directed graphs Severine Fratani, Guillaume Maurras and PierreAlain Reynier. A robust class of languages of 2nested words Nicolas El Maalouly and Raphael Steiner. Exact Matching in Graphs of Bounded Independence Number Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi and Saket Saurabh. Parameterized Complexity of NonSeparating and NonDisconnecting Paths and Sets Balagopal Komarath, Anurag Pandey and Nitin Saurabh. Rabbits approximate, cows compute exactly! Tim A. Hartmann and Stefan Lendl. Dispersing Obnoxious Facilities on Graphs by Rounding Distances Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma and Prafullkumar Tale. Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters Christian Komusiewicz and Nils Morawietz. Finding 3SwapOptimal Independent Sets and Dominating Sets is Hard HoangOanh Le and Van Bang Le. Complexity of the Cluster Vertex Deletion problem on Hfree graphs Adam Ó Conghaile. Cohomology in Constraint Satisfaction and Structure Isomorphism JinYi Cai and Daniel Szabo. Bounded Degree Nonnegative Counting CSP Radovan Červený, Pratibha Choudhary and Ondřej Suchý. On Kernels for dPath Vertex Cover M. S. Ramanujan, Abhishek Sahu, Saket Saurabh and Shaily Verma. An exact algorithm for Knotfree Vertex Deletion
