Invited Talk

• Temporal Graphs: Algorithms and complexity

  Eleni Akrida

  Algorithms 

• Random triangles and random inscribed polytopes

  Herbert Edelsbrunner

  Algorithms 

• The Complexity of Computing a Fixed Point of a Monotone Function, and Some Applications

  Kousha Etessami

  Games Algorithms Probability 

• Proof Complexity

  Jan Krajíček

  Complexity Logic 

• Logic-based learning for Interpretable AI

  Alessandra Russo

  Logic Learning AI 

Regular Talk

• Logic and Learning in Network Cascades

  Galen Wilkerson

  Natural Computation Machine Learning Algorithms 

• A non-trivial polynomial time algorithm for a 3D Stable Roommates problem

  Michael McKay

  Combinatorial Optimization Algorithms NP-hardness 

• Relative Error Streaming Quantiles

  Pavel Vesely

  Data Analysis Algorithms Approximation 

• Monotone Circuit Lower Bounds from Robust Sunflowers

  Bruno Pasqualotto Cavalar

  Combinatorics Circuit Complexity Lower Bounds 

• The Complexity of Acyclic, Star and Injective Colouring for H-Free Graphs

  Siani A. Smith

  Graph Theory Complexity Algorithms 

• Propagator Networks for Unification and Proof Search

  Arved Friedemann

  Proof Search Logical Programming Language Theory 

• The Earth Movers Distance as a Metric for Inorganic Compositions

  Cameron Hargreaves

  Computational Chemistry Combinatorics Information Retrieval 

• Ranking Bracelets in Polynomial time

  Duncan Adamson

  Combinatorics Counting Algorithms 

• Forcing infinite memory for lim inf total payoff objectives in countable MDPs

  Eric Munday

  Decision Theory Algorithms Combinatorial Optimization 

• Fixed-Parameter Tractability of Pinwheel Scheduling

  Benjamin Smith

  Scheduling Parameterized Complexity Algorithms 

• Impartial selection, additive guarantees, and prior information

  Nicos Protopapas

  Mechanism Design Algorithms Combinatorial Optimization 

• Trustable Machine Learning Systems

  Jay Morgan

  Natural Computation Machine Learning Algorithms 

• A Unifying Class of Algorithms for Semi Streaming Bipartite Maximum Matching 

  Kheeran Naidu

  Graph Theory Streaming model Combinatorial Optimization 

• Resolving data flow dependencies of concurrent programs with a graded monad

  Finnbar Keating

  Functional Programming Semantics Language Theory 

• Partition Games, Compositionally: Structure & Power of Linear Algebraic Games

  Adam Ó Conghaile

  Logics Game Theory Language Theory 

• The Complexity of Gradient Descent: CLS = PPAD∩PLS

  Alexandros Hollender

  Search Problems Optimization Complexity 

• Quantum proofs of proximity

  Marcel Dall'Agnol

  Property Testing Proof Systems Complexity 

• Propositional Gossip Protocols

  Joe Livesey

  Distributed Computing Agent Communication Protocols 

• Random Graph Generation using Hyperedge Replacement Grammars

  Federico Vastarini

  Combinatorics Algorithms Language Theory 

• Spined Categories: generalising tree-width beyond graphs

  Benjamin Bumpus

  Graph Theory Tree-width Combinatorics 

• Dynamic Matchings

  Peter Kiss

  Graph Theory Approximation Algorithms Combinatorial Optimization 

• Controlling control: functional language design and implementation

  Andrei-Cristian Diaconu

  Functional Programming Semantics Language Theory 

• Tractability of Konig Edge Deletion Problems

  Diptapriyo Majumdar

  Graph Theory Parameterized Complexity Algorithms 

• Developments with manipulating Lyndon factorizations using evolutionary computation methods

  Lily Major

  Evolutionary Computation String Processing Algorithms 

• Fast recognition of some parametric graph families

  Nina Klobas

  Combinatorics Algorithms Structural Graph Theory 

• Solving the distance k-clique problem in 1-outerplanar graphs

  Alejandro Flores-Lamas

  Graph Theory Dynamic Programming Algorithms 

• Maximizing coverage while ensuring fairness: a tale of conflicting objectives

  Bhaskar DasGupta

  Combinatorial Optimization Search Problems Complexity