Abstract is missing.
- Guarded Kleene Algebra with Tests: Verification of Uninterpreted Programs in Nearly Linear Time (Invited Talk)Alexandra Silva 0001. [doi]
- A Sub-Exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete DigraphsJayakrishnan Madathil, Roohani Sharma, Meirav Zehavi. [doi]
- A Constant-Time Colored Choice Dictionary with Almost Robust IterationTorben Hagerup. [doi]
- Choiceless Logarithmic SpaceErich Grädel, Svenja Schalthöfer. [doi]
- On Synthesis of Resynchronizers for TransducersSougata Bose, Shankara Narayanan Krishna, Anca Muscholl, Vincent Penelle, Gabriele Puppis. [doi]
- Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic PropertiesAlberto Dennunzio, Enrico Formenti, Darij Grinberg, Luciano Margara. [doi]
- On the Strength of Uniqueness Quantification in Primitive Positive FormulasVictor Lagerkvist, Gustav Nordh. [doi]
- On the Stretch Factor of Polygonal ChainsKe Chen 0011, Adrian Dumitrescu, Wolfgang Mulzer, Csaba D. Tóth. [doi]
- Indexing Graph Search Trees and ApplicationsSankardeep Chakraborty, Kunihiko Sadakane. [doi]
- Domination Above r-Independence: Does Sparseness Help?Carl Einarson, Felix Reidl. [doi]
- Colouring H-Free Graphs of Bounded DiameterBarnaby Martin, Daniël Paulusma, Siani Smith. [doi]
- RLE Edit Distance in Near Optimal TimeRaphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin 0001, Przemyslaw Uznanski. [doi]
- New Pumping Technique for 2-Dimensional VASSWojciech Czerwinski, Slawomir Lasota, Christof Löding, Radoslaw Piórkowski. [doi]
- Query-Competitive Sorting with UncertaintyMagnús M. Halldórsson, Murilo Santos de Lima. [doi]
- Approximating the Orthogonality Dimension of Graphs and HypergraphsIshay Haviv. [doi]
- P-Optimal Proof Systems for Each NP-Set but no Complete Disjoint NP-Pairs Relative to an OracleTitus Dose. [doi]
- Finite Satisfiability of Unary Negation Fragment with TransitivityDaniel Danielski, Emanuel Kieronski. [doi]
- Petri Net Reachability Problem (Invited Talk)Jérôme Leroux. [doi]
- Distance Labeling Schemes for Cube-Free Median GraphsVictor Chepoi, Arnaud Labourel, Sébastien Ratel. [doi]
- Nash Equilibria in Games over Graphs Equipped with a Communication MechanismPatricia Bouyer, Nathan Thomasset. [doi]
- Spectral Aspects of Symmetric Matrix SigningsCharles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Naonori Kakimura, Alexandra Kolla. [doi]
- Trustworthy Graph Algorithms (Invited Talk)Mohammad Abdulaziz, Kurt Mehlhorn, Tobias Nipkow. [doi]
- Lower Bounds for Multilinear Order-Restricted ABPsC. Ramya, B. V. Raghavendra Rao. [doi]
- One-Dimensional Guarded FragmentsEmanuel Kieronski. [doi]
- Picking Random Vertices (Invited Talk)Daniel Lokshtanov. [doi]
- SZX-Calculus: Scalable Graphical Quantum ReasoningTitouan Carette, Dominic Horsman, Simon Perdrix. [doi]
- Cluster Deletion on Interval Graphs and Split Related GraphsAthanasios L. Konstantinidis, Charis Papadopoulos. [doi]
- Efficient Analysis of Unambiguous Automata Using Matrix Semigroup TechniquesStefan Kiefer, Cas Widdershoven. [doi]
- On the Symmetries of and Equivalence Test for Design PolynomialsNikhil Gupta, Chandan Saha 0001. [doi]
- Approximating Activation Edge-Cover and Facility Location ProblemsZeev Nutov, Guy Kortsarz, Eli Shalom. [doi]
- The Complexity of Homomorphism IndistinguishabilityJan Böker, Yijia Chen, Martin Grohe, Gaurav Rattan. [doi]
- Aperiodic Weighted Automata and Weighted First-Order LogicManfred Droste, Paul Gastin. [doi]
- Approximate Counting CSP Seen from the Other SideAndrei A. Bulatov, Stanislav Zivny. [doi]
- Counting of Teams in First-Order Team LogicsAnselm Haak, Juha Kontinen, Fabian Müller 0003, Heribert Vollmer, Fan Yang 0004. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Bounded-Depth Frege Complexity of Tseitin Formulas for All GraphsNicola Galesi, Dmitry Itsykson, Artur Riazanov, Anastasia Sofronova. [doi]
- The Power Word ProblemMarkus Lohrey, Armin Weiß. [doi]
- Packing Arc-Disjoint Cycles in TournamentsStéphane Bessy, Marin Bougeret, R. Krithika 0001, Abhishek Sahu, Saket Saurabh 0001, Jocelyn Thiebaut, Meirav Zehavi. [doi]
- Determinisation of Finitely-Ambiguous Copyless Cost Register AutomataThéodore Lopez, Benjamin Monmege, Jean-Marc Talbot. [doi]
- On the Expressivity of Linear Recursion SchemesPierre Clairambault, Andrzej S. Murawski. [doi]
- Computational Complexity of Synchronization under Regular ConstraintsHenning Fernau, Vladimir V. Gusev, Stefan Hoffmann 0001, Markus Holzer 0001, Mikhail V. Volkov, Petra Wolf 0002. [doi]
- Popular Matchings: Good, Bad, and Mixed (Invited Talk)Telikepalli Kavitha. [doi]
- Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet EfficientSurender Baswana, Shiv Kumar Gupta, Ayush Tulsyan. [doi]
- Random Subgroups of RationalsZiyuan Gao, Sanjay Jain 0001, Bakhadyr Khoussainov, Wei Li 0050, Alexander G. Melnikov, Karen Seidel 0001, Frank Stephan 0001. [doi]
- From Regular Expression Matching to ParsingPhilip Bille, Inge Li Gørtz. [doi]
- The Domino Problem is Undecidable on Surface GroupsNathalie Aubrun, Sebastián Barbieri, Etienne Moutot. [doi]
- Enumeration of Preferred Extensions in Almost Oriented DigraphsSerge Gaspers, Ray Li. [doi]
- Two variable fragment of Term Modal LogicAnantha Padmanabha, R. Ramanujam. [doi]
- Measuring what Matters: A Hybrid Approach to Dynamic Programming with TreewidthEduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon. [doi]
- Counting Homomorphisms Modulo a Prime NumberAmirhossein Kazeminia, Andrei A. Bulatov. [doi]
- Resolution Lower Bounds for Refutation StatementsMichal Garlík. [doi]
- Uniform Random Expressions Lack ExpressivityFlorent Koechlin, Cyril Nicaud, Pablo Rotondo. [doi]
- Upper Bounds on the Length of Minimal Solutions to Certain Quadratic Word EquationsJoel D. Day, Florin Manea, Dirk Nowotka. [doi]
- On the Coalgebra of Partial Differential EquationsMichele Boreale. [doi]
- Tangles and Single Linkage Hierarchical ClusteringEva Fluck. [doi]
- Acceptance Ambiguity for Quantum AutomataPaul C. Bell, Mika Hirvensalo. [doi]
- Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time ComputationsOlivier Bournez, Arnaud Durand 0001. [doi]
- Better Bounds for Online Line ChasingMarcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Christian Coester, Lukasz Jez, Elias Koutsoupias. [doi]
- Constrained Representations of Map Graphs and Half-SquaresHoàng-Oanh Le, Van Bang Le. [doi]
- Reducing the Domination Number of Graphs via Edge ContractionsEsther Galby, Paloma T. Lima, Bernard Ries. [doi]
- Multistage KnapsackEvripidis Bampis, Bruno Escoffier, Alexandre Teiller. [doi]
- Uniformisation Gives the Full Strength of Regular LanguagesNathan Lhote, Vincent Michielini, Michal Skrzypczak. [doi]
- Deleting Edges to Restrict the Size of an Epidemic in Temporal NetworksJessica Enright, Kitty Meeks, George B. Mertzios, Viktor Zamaraev. [doi]
- Reconfiguration of Minimum Steiner Trees via Vertex ExchangesHaruka Mizuta, Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou. [doi]
- Semicomputable Points in Euclidean SpacesMathieu Hoyrup, Donald M. Stull. [doi]
- Bidding Mechanisms in Graph GamesGuy Avni, Thomas A. Henzinger, Dorde Zikelic. [doi]
- Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardnessJulian Dörfler, Marc Roth, Johannes Schmitt, Philip Wellnitz. [doi]
- Parameterized Complexity of Fair Vertex Evaluation ProblemsDusan Knop, Tomás Masarík, Tomás Toufar. [doi]
- Finding Optimal Solutions With Neighborly HelpElisabet Burjons, Fabian Frei, Edith Hemaspaandra, Dennis Komm, David Wehner. [doi]
- The Power of the Weisfeiler-Leman Algorithm to Decompose GraphsSandra Kiefer, Daniel Neuen. [doi]
- The Perfect Matching Reconfiguration ProblemMarthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi 0001, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa. [doi]
- Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal GraphsChristian Konrad, Viktor Zamaraev. [doi]
- A Complexity Dichotomy for Critical Values of the b-Chromatic Number of GraphsLars Jaffke, Paloma T. Lima. [doi]
- The Quantifier Alternation Hierarchy of Synchronous RelationsDiego Figueira, Varun Ramanathan, Pascal Weil. [doi]
- The Fluted Fragment with TransitivityIan Pratt-Hartmann, Lidia Tendera. [doi]
- Parity Games: Zielonka's Algorithm in Quasi-Polynomial TimePawel Parys. [doi]
- An Improved Online Algorithm for the Traveling Repairperson Problem on a LineMarcin Bienkowski, Hsiang Hsuan Liu. [doi]
- Parameterized Complexity of Conflict-Free Matchings and PathsAkanksha Agrawal, Pallavi Jain 0001, Lawqueen Kanesh, Saket Saurabh 0001. [doi]
- Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in GraphsAlessio Conte, Roberto Grossi, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno, Kunihiro Wasa. [doi]
- On the Mortality Problem: From Multiplicative Matrix Equations to Linear Recurrence Sequences and BeyondPaul C. Bell, Igor Potapov, Pavel Semukhin. [doi]
- A Congruence-based Perspective on Automata Minimization AlgorithmsPierre Ganty, Elena Gutiérrez, Pedro Valero 0001. [doi]
- Constant Delay Enumeration with FPT-Preprocessing for Conjunctive Queries of Bounded Submodular WidthChristoph Berkholz, Nicole Schweikardt. [doi]
- Solving Systems of Equations in Supernilpotent AlgebrasErhard Aichinger. [doi]
- Faster FPT Algorithm for 5-Path Vertex CoverRadovan Cervený, Ondrej Suchý. [doi]