Igor Malinović

PhD student

EPFL SB MATHAA DISOPT MA C1 573 (Bâtiment MA) Station 8 CH-1015 Lausanne Phone: +41 21 693 25 68 Email: [email protected]

 Curriculum vitae

Research interests

• Polyhedral combinatorics,
• Approximation algorithms,
• Combinatorial optimization.

Education

PhD in Mathematics, 2014 – present
EPFL, Lausanne, Switzerland
Supervisors: Friedrich Eisenbrand, Yuri Faenza (Columbia University)
Topic: Aproximate formulations for knapsack sets

Master in Computer Science (Minor in Mathematics), 2014
EPFL, Lausanne, Switzerland
Supervisors: Friedrich Eisenbrand, Andrey Rybalchenko (Microsoft Research)
Thesis: Mathematical programming for SMT

Bachelor in Computer Science, 2011
University of Novi Sad, Novi Sad, Serbia
Program: Theoretical Computer Science

Publications

• Y. Faenza, I. Malinović, M. Mastrolilli, and O. Svensson
  On bounded pitch inequalities for the min-knapsack polytope
  In Proc. of ISCO ’18, pp. 170-182, 2018
• Y. Faenza, I. Malinović
  A PTAS for the time-invariant incremental knapsack problem
  In Proc. of ISCO ’18, pp. 157-169, 2018
• R. Fulek, J. Kynčl, I. I. Malinović and D. Pálvölgyi
  Clustered planarity testing revisited
  The Electronic Journal of Combinatorics, vol. 22, num. 4, p. P4.24, 2015