• Distributed graph coloring in wireless ad hoc networks: a light-weight algorithm based on Japanese tree frogs' calling behaviour 

      Hernández Pibernat, Hugo; Blum, Christian (IEEE, 2011)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      Graph coloring concerns the problem of assigning colors to the nodes of a graph such that adjacent nodes do not share the same color. In this paper we deal with the problem of finding valid colorings of graphs in a distributed ...
    • Proof complexity meets algebra 

      Atserias, Albert; Ochremiak, Joanna (2018-12-01)
      Article
      Accés obert
      We analyze how the standard reductions between constraint satisfaction problems affect their proof complexity. We show that, for the most studied propositional, algebraic, and semialgebraic proof systems, the classical ...
    • Proper colouring Painter–Builder game 

      Bednarska-Bzdega, Malgorzata; Krivelevich, Michael; Mészáros, Viola; Requile, Clement (2018-03)
      Article
      Accés obert
      We consider the following two-player game, parametrised by positive integers and . The game is played between Painter and Builder, alternately taking turns, with Painter moving first. The game starts with the empty graph ...