Publications 2025

Here are our publications 2025.

  1. L. Aceto, A. Achilleos, D. P. Attard, L. Exibard, A. Francalanza, A. Ingólfsdóttir, K. Lehtinen. Monitorability for the modal μ-calculus over systems with data: from practice to theory.
    In P. Bouyer, J. van de Pol., eds., 35th Int. Conf. on Concurrency Theory, CONCUR 2025 (Aarhus, Aug. 2025), v. 348 of Leibniz Int. Proc. in Inform., pp. 4:1-4:21. Dagstuhl Publishing, 2025.
    doi:10.4230/lipics.concur.2025.4
  2. L. Aceto, A. Achilleos, A. Chalki, A. Ingólfsdóttir. The complexity of deciding characteristic formulae in van Glabbeek's branching-time spectrum.
    In J. Endrullis, S. Schmitz, eds., 33rd EACSL Ann. Conf. on Computer Science Logic, CSL 2025 (Amsterdam, Feb. 2025), v. 326 of Leibniz Int. Proc. in Inform., pp. 26:1-26:28. Dagstuhl Publishing, 2025.
    doi:10.4230/lipics.csl.2025.26
  3. L. Aceto, A. Achilleos, A. Chalki, A. Ingólfsdóttir. The complexity of deciding characteristic formulae modulo nested bisimulation.
    In G. Bacci, A. Francalanza, eds., Proc. of 16th Int. Symp. on Games, Automata, Logics, and Formal Verification, GandALF 2025 (Valletta, Sept. 2025), Electron. Proc. in Theor. Comput. Sci., Open Publishing Assoc., to appear.
  4. L. Aceto, V. Castiglioni, A. Ingólfsdóttir, B. Luttik. Axiomatising weak bisimulation congruences over CCS with left merge and communication merge.
    Theor. Comput. Sci., v.1047, art. 115325, 30 pp., 2025.
    doi:10.1016/j.tcs.2025.115325
  5. L. Aceto, V. Castiglioni, A. Ingólfsdóttir, B. Luttik. Non-finite axiomatisability of weak bisimulation based congruences.
    Theor. Comput. Sci., v. 1054, art. 115453, 33 pp., 2025.
    doi:10.1016/j.tcs.2025.115453
  6. A. Achilleos, A. Francalanza, J. Xuereb. If at first you don't succeed: extended monitorability through multiple executions.
    In Proc. of 40th Ann. ACM/IEEE Symp. on Computer Science Logic, LICS '25 (Singapore, June 2025), IEEE, to appear.
  7. R. Acton, T. K. Petersen, B. Shirman, B. E. Tenner. The clairvoyant maître d'.
    Electron. J. Comb., v. 32, n. 1, art. P1.15, 22 p., 2025.
    doi:10.37236/12788
  8. M. H. Albert, C. Bean, A. Claesson, É. Nadeau, J. Pantone, H. Úlfarsson. Combinatorial Exploration: an algorithmic framework for enumeration.
    Memoirs Amer. Math. Soc., to appear.
  9. N. Arkor, D. McDermott. The nerve theorem for relative monads.
    Theor. Appl. Categ., v. 43, n. 13, pp. 403-454, 2025.
    article at publisher
  10. R. Boppana, M. M. Halldórsson. Approximating independent sets in constant distributed rounds.
    In U. Schmid, R. Kuznets, ed., Structural Information and Communication Complexity: 32nd Int. Coll., SIROCCO 2025 (Delphi, June 2025), Proc., v. 15671 of Lect. Notes in Comput. Sci., pp. 144-158. Springer, 2025.
    doi:10.1007/978-3-031-91736-3_9
  11. V. Castiglioni, O. Dardha, C. A. Mezzina, guest eds.,
    Inf. Comput., virtual special issue Selected Papers from EXPRESS/SOS 2021 and 2022, 2024-2025.
    issue at publisher
  12. K. Censor-Hillel, T. Even, M. Flin, M. M. Halldórsson. When MIS and maximal matching are easy in the congested clique.
    In U. Schmid, R. Kuznets, ed., Structural Information and Communication Complexity: 32nd Int. Coll., SIROCCO 2025 (Delphi, June 2025), Proc., v. 15671 of Lect. Notes in Comput. Sci., pp. 194-210. Springer, 2025.
    doi:10.1007/978-3-031-91736-3_12
  13. M. De Pascalis, T. Uustalu, N. Veltri. Monoid structures on indexed containers.
    In H. Barbosa, C. Ringeissen, eds., Proc. of 20th Int. Symp. on Logical and Semantic Frameworks, with Applications, LSFA 2025 (Brasília, Oct. 2025), Electron. Proc. in Theor. Comput. Sci., Open Publishing Assoc., to appear.
  14. M. Flin, M. M. Halldórsson. Faster dynamic (Δ+1)-coloring against adaptive adversaries.
    In K. Censor-Hillel, F. Grandoni, J. Ouaknine, G. Puppis, eds., 52nd Int. Coll. on Automata, Languages and Programming, ICALP 2025 (Aarhus, July 2025), v. 334 of Leibniz Int. Proc. in Inform., pp. 79:1-79:21. Dagstuhl Publishing, 2025.
    doi:10.4230/lipics.icalp.2025.79
  15. M. Flin, M. M. Halldórsson, A. Nolin. Decentralized distributed graph coloring: cluster graphs.
    In PODC '25: Proc. of 2025 ACM Symp. on Principles of Distributed Computing (Santa María Huatulco, June 2025), pp. 394-405. ACM, 2025.
    doi:10.1145/3732772.3733549
  16. M. Flin, P. Mittal. (Δ + 1) vertex coloring in O(n) communication.
    Distrib. Comput., v. 38, n. 1, pp. 19-29, 2025.
    doi:10.1007/s00446-024-00475-3
  17. M. Halldórsson, N. Matsakis, P. Veselý. Streaming diameter of high-dimensional points.
    In 33rd Ann. European Symp. on Algorithms, ESA 2025, Leibniz Int. Proc. in Inform., Dagstuhl Publishing, to appear.
  18. M. M. Halldórsson, D. Rawitz. Distributed fractional local ratio and independent set approximation.
    Inf. Comput., v. 303, art. 105238, 14 pp., 2025.
    doi:10.1016/j.ic.2024.105238
  19. Y. Meng, Sz. Horvát, C. D. Modes, P. A. Haas. Impossible ecologies: interaction networks and stability of coexistence in ecological communities.
    Cell Syst., v. 16, art. 101297, 19 pp., 2025.
    doi:10.1016/j.cels.2025.101297
  20. G. L. Pozzato, T. Uustalu, eds.,
    Automated Reasoning with Analytic Tableaux and Related Methods: 34th Int. Conf., TABLEAUX 2025 (Reykjavik, Sept. 2025), Proc., v. 15980 of Lect. Notes in Comput. Sci., Springer, to appear.
    volume in SpringerLink
  21. J. Tooby-Smith. HepLean: digitalising high energy physics.
    Comput. Phys. Commun., v. 308, art. 109457, 14 pp., 2025.
    doi:10.1016/j.cpc.2024.109457

Publications 2024

Publications 2023

Publications 2022

Publications 2021

Publications 2020

Publications 2019

Publications 2018

Publications 2017

Last update 29 August 2025