ATCO, “Advanced techniques in combinatorial optimization and computational complexity”

  • CNCS IDEI Grant PN-III-P4-ID-PCE-2016-0842.
  • Principal investigator: Gabriel Istrate.
  • budget: 850.000 lei.
  • Starting date: July 12, 2017.
  • Duration: until December 31, 2019.

Research Team


  • Eva Kaslik
  • Mircea Marin.
  • Ioan Todincă (Orleans)
  • Janos Balogh (Szeged)



  1. On the heapability of partial orders (working title). Janos Balogh, Cosmin Bonchiș, Diana Diniș, Gabriel Istrate, Ioan Todincă. Preprint, 2017.
  2. The laugnage of Hammersley’s process. Cosmin Bonchiș, Gabriel Istrate. Preprint, 2017.
  3. The Ulam-Hammersley problem for heapable sequences. Cosmin Bonchiș, Diana Diniș, Gabriel Istrate. Manuscript in preparation, 2017.