6 citations · 8 across the 12 of their papers we have counts for
14 papers
A linear time algorithm for linearizing quadratic and higher-order shortest path problems
Eranda Çela, Bettina Klinz, Stefan Lendl +2
An instance of the NP-hard Quadratic Shortest Path Problem (QSPP) is called linearizable iff it is equivalent to an instance of the classic Shortest Path Problem (SPP) on the same…
Recognising permuted Demidenko matrices
Eranda Çela, Vladimir Deineko, Gerhard J. Woeginger
We solve the recognition problem (RP) for the class of Demidenko matrices. Our result closes a remarkable gap in the recognition of specially structured matrices. Indeed, the recog…
Special Cases of the Minimum Spanning Tree Problem under Explorable Edge and Vertex Uncertainty
Corinna Mathwieser, Eranda Cela
This article studies the Minimum Spanning Tree Problem under Explorable Uncertainty as well as a related vertex uncertainty version of the problem. We particularly consider special…
Integrating multiple sources of ordinal information in portfolio optimization
Eranda Çela, Stephan Hafner, Roland Mestel +1
Active portfolio management tries to incorporate any source of meaningful information into the asset selection process. In this contribution we consider qualitative views specified…
Travelling salesman paths on Demidenko matrices
Eranda Cela, Vladimir G. Deineko, Gerhard J. Woeginger
In the path version of the Travelling Salesman Problem (Path-TSP), a salesman is looking for the shortest Hamiltonian path through a set of n cities. The salesman has to start his…
On -Bend and Monotonic -Bend Edge Intersection Graphs of Paths on a Grid
Eranda Çela, Elisabeth Gaar
If a graph can be represented by means of paths on a grid, such that each vertex of corresponds to one path on the grid and two vertices of are adjacent if and only if…