I am a first-year PhD student at the Network Science Institute, Northeastern University London, supervised by Prof István Kiss. My general research interests include optimization, graph theory, and algorithms, with a focus on their applications in network science.

Prior to starting my PhD, I worked on developing machine learning solutions for start-ups in medical technology and fraud detection. Previously, I was a student researcher at the Jozef Stefan Institute, where I was applying deep learning to robotics and evaluating machine learning algorithms.

I completed my master's thesis at the Institute for Algorithms and Complexity, TUHH, as part of my MSc in Industrial Mathematics at the University of Hamburg. Prior to that, I studied for an MSc in Applied Statistics and a BSc in Computer Science and Mathematics at the University of Ljubljana.

  • Exact Algorithms for MaxCut on Split Graphs, Marko Lalovic. arXiv:2405.20599 [ pdf, bib, code ]
  • latent2likert: Converting Latent Variables into Likert Scale Responses, Lalovic M. R package version 1.2.2 [ pdf, bib, site ]

This page is maintained by Marko Lalovic Theme is based on Midnight theme by Matt Graham