Two accepted Papers by Tim Seppelt


Congratulations to Tim Seppelt for the accepted papers "Limitations of Game Comonads via Homomorphism Indistinguishability" (together with Moritz Lichter and Benedikt Pago) and "Going Deep and Going Wide: Counting Logic and Homomorphism Indistinguishability over Graphs of Bounded Treedepth and Treewidth" (together with Eva Fluck and Gian Luca Spitzer) for the 32nd EACSL Annual Conference on Computer Science Logic 2024 (CSL’24).