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)
  • János Balogh (Szeged)
  • Flavius Turcu (Bordaux)



  1. On the heapability of partial orders. Janos Balogh, Cosmin Bonchiș, Diana Diniș, Gabriel Istrate, Ioan Todincă. Preprint, 2017.
  2. The language and series of Hammersley’s process. Cosmin Bonchiș, Gabriel Istrate. Preprint, 2017.
  3. Vector partitions, multi-dimensional Faà di Bruno formulae and generating algorithms. Flavius Turcu, Cosmin Bonchiș, Mohamed Najim. Manuscript, submitted for publication.
  4. The Ulam-Hammersley problem for heapable sequences. Cosmin Bonchiș, Diana Diniș, Gabriel Istrate. Manuscript in preparation, 2017.


1. Program for simulating the interval Hammersley process (paper 1).

Slides and videos of talks

  1. Presentation at SWORDS 2017. Slides and video (recorded later) based on these slides.