Publicaciones en las que colabora con CHRISTIAN BLUM (4)

2014

  1. Beam-ACO for the repetition-free longest common subsequence problem

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  2. Can frogs find large independent sets in a decentralized way? Yes they can!

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 8667, pp. 74-85