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

Collaborators

  • Vlad Rochian (B.Sc. student, UVT)
  • Ioan Todinca (Orleans)
  • János Balogh (Szeged)
  • Flavius Turcu (Bordeaux)
  • Elena Grigorescu, Shubhang Kulkarni, Young-San Lin, Minshen Zhou (Purdue Univ., Lafayette Indiana)
  • Karthik Chandrasekaran (Univ. Illlinois at Urbana Champaign)
  • Eva Kaslik, Mircea Marin (UVT).

Documents

Published papers

  1. Cosmin Bonchiș, Gabriel Istrate, Vlad Rochian. The language (and series) of Hammersley-type processes.  Proceedings of the 8th Conference on Machines, Computations and Universality (MCU’2018), June 28-30, 2018, Fontainebleau, France, Lecture Notes in Computer Science, vol 10881, pp. 69-87, Springer Verlag, 2018. [preprint]
  2. Gabriel Istrate. Stochastic Stability in Schelling’s Segregation model with Markovian asynchronous update. Proceedings of ACRI 2018, workshop on Asynchronous Cellular Automata. September 17-21, Como, Italy. Lecture Notes in Computer Science, vol. 11115, pp. 416-427, Springer. [preprint].
  3. Flavius Turcu, Cosmin Bonchiș, Mohamed Najim. Vector partitions, multi-dimensional Faà di Bruno formulae and generating algorithms. Discrete Applied Mathematics, vol 272(2020), pp. 90-99, Elsevier. [preprint]
  4. Gabriel Istrate, Cosmin Bonchiș, Alin Brândușescu. Attacking Power Indices by Manipulating Player Reliability. Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2019), Pages 538-546 . ACM Press  [free version from IFAAMAS]
  5. Georgiana Șurlea, Adrian Crăciun Gröbner bases with Reduction Machines, Proceedings of the Third Workshop on Working Formal Methods (FROM 2019), Electronic Proceedings in Theoretical Computer Science 303, pp. 61-75, 2019.
  6. Gabriel Istrate, Cosmin Bonchiș, Claudiu Gatina. It’s not whom you know, it’s what you (or your friends) can do: Coalitional Frameworks for Network Centralities. Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS’2020. pp. 566-574, 2020 [free version from IFAAMAS]
  7.  Janos Balogh, Cosmin Bonchiș, Diana Diniș, Gabriel Istrate, Ioan Todinca, On the heapability of finite partial orders.   Discrete Mathematics and Theoretical Computer Science,  vol 22:1, paper #17,  2020.
  8. V. Bogdan, Cosmin Bonchiș, C. Orhei. Custom Defined Edge Detection Filters. Proceedings of the 28th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2020 (WSCG 2020).
  9. Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubang Kulkarni, Young-San Lin, Minshen Zhou. The Maximum Binary Tree Problem. In Proceedings of the 28th European Symposium on Algorithms (ESA’20) , Leibniz Institute Proceedings in Computer Science (LIPICS), volume 173.
  10. Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubang Kulkarni, Young-San Lin, Minshen Zhou. Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree. In Proceedings of the 15 International Symposium on Parameterized and Exact Computation (IPEC’20), Leibniz Institute Proceedings in Computer Science (LIPICS), vol 180, paper #7.

    Manuscripts:

  1. Gabriel Istrate, Cosmin Bonchiș, Mircea Marin. Interactive Particle Systems, Drift Analysis and the WalkSAT algorithm.
  2. Teodora Selea, Marian Neagul, Gabriel Iuhasz. A study of deep learning model performance for SpaceNet 3D image segmentation
  3. Cosmin Bonchiș, Diana Diniș, Gabriel Istrate. The Ulam-Hammersley problem for heapable sequences.
  4. Cosmin Bonchiș, Gabriel Istrate, Claudiu Gatina. With a little help from my friends: A game-theoretic measure of helping Centrality based on the Banzhaf value.
  5. Gabriel Istrate, Cosmin Bonchiș. Diffusion Mechanism design with threshold contagion.
  6. Adrian Crăciun, Gabriel Istrate. Proof complexity of combinatorial principles: the role of kernelization.

Software

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

Slides, posters, videos and other dissemination artifacts.

  1. Presentation at SWORDS 2017. Slides
  2. Presentation at MCU 2018 : Slides.
  3. Poster and volume of abstracts at Building Bridges II.
  4. Presentation at ACRI 2018. Slides.
  5. Presentation at AAMAS 2019. Slides and Poster.
  6. Presentation at HALG 2019. Slides and Poster.
  7. Presentation at FROM 2019. Slides.
  8. Presentation at Highlights 2019. Slides and Poster.
  9. Presentation at MATCOS 2019. Slides.
  10. Presentation at ARS 2019. Slides.
  11. Presentation at KOLKOM 2019. Slides.
  12. Video, presentation at AAMAS’2020.