Academic homepage

Eranda
Dragoti-Çela

[Dr. Techn. / Assoc. Prof.]
Institute of Discrete Mathematics, Graz University of Technology

I am a mathematician working in combinatorial optimization, discrete mathematics and operations research. My research interests include classical combinatorial optimization problems, optimization problems on graphs, the computational complexity boundary between tractable and intractable variants of NP-hard problems, and portfolio optimisation problems.

Research interests

My research lies at the intersection of discrete mathematics, optimization, and algorithms. Current areas of interest include:

  • Fairness-over-time models in combinatorial optimisation
  • Fair resource allocation with graph constraints
  • Linearizable special cases of hard combinatorial optimisation problems
  • Container loading and optimisation problems in logistics

Selected and complete lists

  • Relationship of k-Bend and Monotonic l-Bend Edge Intersection Graphs of Paths on a Grid
  • with E. Gaar. Discrete Applied Mathematics 331, 2023, DOI , arXiv

  • A linear time algorithm for linearizing quadratic and higher-order shortest path problems
  • with B. Klinz, S. Lendl, G.J. Woeginger and L. Wulf. Mathematical Programming, 2024, DOI , arXiv.

  • Travelling salesman paths on Demidenko matrices

    with V.G. Deineko and G.J. Woeginger. Discrete Applied Mathematics 354, 2024, DOI, arXiv,

  • Integrating multiple sources of ordinal information in portfolio optimization

    with S. Hafner, R. Mestel and U. Pferschy. Annals of Operations Research 346, 2025, DOI, arXiv

Complete publication list

Current courses and selected websites

Current course information is available in TU Graz Online.

Teaching archive

Bachelor’s and master’s theses

Students interested in writing a bachelor’s or master’s thesis in [research fields] are welcome to contact me. Possible topics usually concern [brief description of typical thesis topics].

Theses supervised since October 2007