Table of Contents

• An FPT Algorithm for Spanning Trees with Few Branch Vertices Parameterized by Modular-WidthLuisa Gargano, Adele A. Rescigno. [doi]
• Depth-3 Circuits for Inner ProductMika Göös, Ziyi Guan, Tiberiu Mosnoi. [doi]
• Set Semantics for Asynchronous TeamLTL: Expressivity and ComplexityJuha Kontinen, Max Sandström, Jonni Virtema. [doi]
• Parameterized Approximation Scheme for Feedback Vertex SetSatyabrata Jana, Daniel Lokshtanov, Soumen Mandal, Ashutosh Rai 0001, Saket Saurabh 0001. [doi]
• Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded RadiusFelicia Lucke, Daniël Paulusma, Bernard Ries. [doi]
• Distributed Merlin-Arthur Synthesis of Quantum States and Its ApplicationsFrançois Le Gall, Masayuki Miyamoto, Harumichi Nishimura. [doi]
• The Compositional Structure of Bayesian InferenceDylan Braithwaite, Jules Hedges, Toby St Clere Smithe. [doi]
• Realizing Finitely Presented Groups as Projective Fundamental Groups of SFTsLéo Paviet Salomon, Pascal Vanier. [doi]
• Exact and Approximation Algorithms for Routing a Convoy Through a GraphMartijn van Ee, Tim Oosterwijk, René Sitters, Andreas Wiese. [doi]
• On the Finite Variable-Occurrence Fragment of the Calculus of Relations with Bounded Dot-Dagger AlternationYoshiki Nakamura 0001. [doi]
• Lower Bounds for Choiceless Polynomial Time via Symmetric XOR-CircuitsBenedikt Pago. [doi]
• Spartan Bipartite Graphs Are Essentially ElementaryNeeldhara Misra, Saraswati Girish Nanoti. [doi]
• A Polynomial-Time Algorithm for MCS Partial Search Order on Chordal GraphsGuozhen Rong, Yongjie Yang 0001, Wenjun Li 0001. [doi]
• Parameterized Analysis of the Cops and Robber GameHarmender Gahlawat, Meirav Zehavi. [doi]
• Probabilistic Input-Driven Pushdown AutomataAlex Rose, Alexander Okhotin. [doi]
• The Covering Canadian Traveller Problem RevisitedNiklas Hahn, Michalis Xefteris. [doi]
• Logical Equivalences, Homomorphism Indistinguishability, and Forbidden MinorsTim Seppelt. [doi]
• Short Definitions in Constraint LanguagesJakub Bulín, Michael Kompatscher. [doi]
• Isometric Path Complexity of GraphsDibyayan Chakraborty, Jérémie Chalopin, Florent Foucaud, Yann Vaxès. [doi]
• Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical CharacterisationBenjamin Scheidt, Nicole Schweikardt. [doi]
• A Characterisation of Functions Computable in Polynomial Time and Space over the Reals with Discrete Ordinary Differential Equations: Simulation of Turing Machines with Analytic Discrete ODEsManon Blanc, Olivier Bournez. [doi]
• String Diagrammatic Trace TheoryMatthew Earnshaw, Pawel Sobocinski 0001. [doi]
• Dependent k-Set Packing on PolynomoidsMeng-Tsung Tsai, Shi-Chun Tsai, Tsung Ta Wu. [doi]
• Relaxed Core Stability for Hedonic Games with Size-Dependent UtilitiesTom Demeulemeester, Jannik Peters 0001. [doi]
• Fixed-Parameter Algorithms for Fair Hitting Set ProblemsTanmay Inamdar 0002, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh 0001. [doi]
• On Property Testing of the Binary RankNader H. Bshouty. [doi]
• Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two MatroidsYasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa. [doi]
• A Weyl Criterion for Finite-State Dimension and ApplicationsJack H. Lutz, Satyadev Nandakumar, Subin Pulari. [doi]
• On the Parameterized Complexity of Computing st-Orientations with Few Transitive EdgesCarla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli. [doi]
• Counting Computations with Formulae: Logical Characterisations of Counting Complexity ClassesAntonis Achilleos, Aggeliki Chalki. [doi]
• Decomposing Finite LanguagesDaniel Alexander Spenner. [doi]
• Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic GraphsMatthew Johnson 0002, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen. [doi]
• Dynamic Constant Time Parallel Graph Algorithms with Sub-Linear WorkJonas Schmidt 0001, Thomas Schwentick. [doi]
• Effective Continued Fraction Dimension Versus Effective Hausdorff Dimension of RealsSatyadev Nandakumar, Akhil S, Prateek Vishnoi. [doi]
• Entropic Risk for Turn-Based Stochastic GamesChristel Baier, Krishnendu Chatterjee, Tobias Meggendorfer, Jakob Piribauer. [doi]
• Approximating the Value of Energy-Parity Objectives in Simple Stochastic GamesMohan Dantam, Richard Mayr. [doi]
• A Super-Polynomial Separation Between Resolution and Cut-Free Sequent CalculusTheodoros Papamakarios. [doi]
• MaxCut Above GuaranteeIvan Bliznets, Vladislav Epifanov. [doi]
• Locality Theorems in Semiring SemanticsClotilde Bizière, Erich Grädel, Matthias Naaf. [doi]
• Finding a Highly Connected Steiner Subgraph and its ApplicationsEduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan 0001. [doi]
• Support Size Estimation: The Power of ConditioningDiptarka Chakraborty, Gunjan Kumar, Kuldeep S. Meel. [doi]
• Formalizing Hyperspaces for Extracting Efficient Exact Real ComputationMichal Konecný, Sewon Park 0001, Holger Thies. [doi]
• Descriptive Complexity for Distributed Computing with CircuitsVeeti Ahvonen, Damian Heiman, Lauri Hella, Antti Kuusisto. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• On the Expressive Power of Regular Expressions with BackreferencesTaisei Nogami, Tachio Terauchi. [doi]
• On the Complexity Dichotomy for the Satisfiability of Systems of Term Equations over Finite AlgebrasPeter Mayr. [doi]
• The Online Simple Knapsack Problem with Reservation and RemovabilityElisabet Burjons, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith. [doi]
• On the Work of Dynamic Constant-Time Parallel Algorithms for Regular Tree Languages and Context-Free LanguagesJonas Schmidt 0001, Thomas Schwentick, Jennifer Todtenhoefer. [doi]
• Sliding into the Future: Investigating Sliding Windows in Temporal Graphs (Invited Talk)Nina Klobas, George B. Mertzios, Paul G. Spirakis. [doi]
• Parameterized Complexity of Domination Problems Using Restricted Modular PartitionsManuel Lafond, Weidong Luo. [doi]
• Inductive Continuity via Brouwer TreesLiron Cohen 0001, Bruno da Rocha Paiva, Vincent Rahli, Ayberk Tosun. [doi]
• Roman Census: Enumerating and Counting Roman Dominating Functions on Graph ClassesFaisal N. Abu-Khzam, Henning Fernau, Kevin Mann. [doi]
• Competitive Search in the Line and the Star with PredictionsSpyros Angelopoulos 0001. [doi]
• Parikh One-Counter AutomataMichaël Cadilhac, Arka Ghosh, Guillermo A. Pérez 0001, Ritam Raha. [doi]
• OBDD(Join) Proofs Cannot Be BalancedSergei Ovcharov. [doi]
• Universality and Forall-Exactness of Cost Register Automata with Few RegistersLaure Daviaud, Andrew Ryzhikov. [doi]
• Exponential Lower Bounds for Threshold Circuits of Sub-Linear Depth and EnergyKei Uchizawa, Haruki Abe. [doi]
• Recontamination Helps a Lot to Hunt a RabbitThomas Dissaux, Foivos Fioravantes, Harmender Gahlawat, Nicolas Nisse. [doi]
• FPT Approximation and Subexponential Algorithms for Covering Few or Many EdgesFedor V. Fomin, Petr A. Golovach, Tanmay Inamdar 0002, Tomohiro Koana. [doi]
• On the Complexity of Computing Time Series Medians Under the Move-Split-Merge MetricJana Holznigenkemper, Christian Komusiewicz, Nils Morawietz, Bernhard Seeger. [doi]
• Solving Irreducible Stochastic Mean-Payoff Games and Entropy Games by Relative Krasnoselskii-Mann IterationMarianne Akian, Stéphane Gaubert, Ulysse Naepels, Basile Terver. [doi]
• Online Algorithms with Predictions (Invited Talk)Joan Boyar. [doi]
• Parallel Enumeration of Parse TreesMargarita Mikhelson, Alexander Okhotin. [doi]
• Checking Presence Reachability Properties on Parameterized Shared-Memory SystemsNicolas Waldburger. [doi]
• Modification Problems Toward Proper (Helly) Circular-Arc GraphsYixin Cao 0001, Hanchun Yuan, Jianxin Wang 0001. [doi]
• Positive Data LanguagesFlorian Frank, Stefan Milius, Henning Urbat. [doi]
• Graph Connectivity with Noisy QueriesDimitris Fotakis 0001, Evangelia Gergatsouli, Charilaos Pipis, Miltiadis Stouras, Christos Tzamos. [doi]
• Separating Automatic RelationsPablo Barceló, Diego Figueira, Rémi Morvan. [doi]
• Deterministic Constrained Multilinear DetectionCornelius Brand, Viktoriia Korchemna, Michael Skotnica. [doi]
• Query Complexity of Search ProblemsArkadev Chattopadhyay, Yogesh Dahiya, Meena Mahajan. [doi]
• Rényi-Ulam Games and Online Computation with Imperfect AdviceSpyros Angelopoulos 0001, Shahin Kamali. [doi]
• Upward Translation of Optimal and P-Optimal Proof Systems in the Boolean Hierarchy over NPFabian Egidy, Christian Glaßer, Martin Herold. [doi]
• Distributed CONGEST Algorithm for Finding Hamiltonian Paths in Dirac Graphs and GeneralizationsNoy Biton, Reut Levi, Moti Medina. [doi]
• An Iterative Approach for Counting Reduced Ordered Binary Decision DiagramsJulien Clément 0001, Antoine Genitrini. [doi]
• Recognizing H-Graphs - Beyond Circular-Arc GraphsDeniz Agaoglu Çagirici, Onur Çagirici, Jan Derbisz, Tim A. Hartmann, Petr Hlinený, Jan Kratochvíl, Tomasz Krawczyk, Peter Zeman 0003. [doi]
• Dynamic Planar Embedding Is in DynFOSamir Datta, Asif Khan, Anish Mukherjee 0001. [doi]
• Tight Algorithmic Applications of Clique-Width GeneralizationsVera Chekan, Stefan Kratsch. [doi]
• The Geometry of Reachability in Continuous Vector Addition Systems with StatesShaull Almagor, Arka Ghosh 0002, Tim Leys, Guillermo A. Pérez 0001. [doi]
• On Polynomial-Time Decidability of k-Negations Fragments of FO Theories (Extended Abstract)Christoph Haase, Alessio Mansutti, Amaury Pouly. [doi]
• Ordinal Measures of the Set of Finite MultisetsIsa Vialard. [doi]
• Multivariate to Bivariate Reduction for Noncommutative Polynomial FactorizationVikraman Arvind, Pushkar S. Joglekar. [doi]
• Rational Verification for Nash and Subgame-Perfect Equilibria in Graph GamesLéonard Brice, Jean-François Raskin, Marie van den Bogaard. [doi]
• Cryptanalysis of a Generalized Subset-Sum Pseudorandom GeneratorCharles Bouillaguet, Florette Martinez, Damien Vergnaud. [doi]
• Speed Me up If You Can: Conditional Lower Bounds on Opacity VerificationJirí Balun, Tomás Masopust, Petr Osicka. [doi]
• Deciding Predicate Logical Theories Of Real-Valued FunctionsStefan Ratschan. [doi]
• Parameterized Max Min Feedback Vertex SetMichael Lampis, Nikolaos Melissinos, Manolis Vasilakis. [doi]
• Modern Parallel Algorithms (Invited Talk)Artur Czumaj. [doi]
• Exploring the Space of Colourings with Kempe Changes (Invited Talk)Marthe Bonamy. [doi]
• Algebraic Reasoning for (Un)Solvable Loops (Invited Talk)Laura Kovács. [doi]