On the Biquadratic Assignment Problem. - Rainer E. Burkard; Eranda Çela; Bettina Klinz (Quadratic Assignment and Related Problems, 1993)

Hamiltonian cycles in circulant digraphs with two stripes. - Qi Fan Yang; Rainer E. Burkard; Eranda Çela; Gerhard J. Woeginger (Discret. Math., 1997)

Book reviews. - Eranda Çela; Hans Achatz (Math. Methods Oper. Res., 1997)

The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases. - Rainer E. Burkard; Eranda Çela; Günter Rote; Gerhard J. Woeginger (Math. Program., 1998)

Linear Assignment Problems and Extensions. - Rainer E. Burkard; Eranda Çela (Handbook of Combinatorial Optimization, 1999)

A Dual Framework for Lower Bounds of the Quadratic Assignment Problem Based on Linearization. - Stefan E. Karisch; Eranda Çela; Jens Clausen; T. Espersen (Computing, 1999)

2-Medians in trees with pos/neg weights. - Rainer E. Burkard; Eranda Çela; Helidon Dollani (Discret. Appl. Math., 2000)

Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem. - Eranda Çela; Bettina Klinz; Christophe Meyer (J. Comb. Optim., 2006)

The Wiener maximum quadratic assignment problem. - Eranda Çela; Nina S. Schmuck; Shmuel Wimer; Gerhard J. Woeginger (Discret. Optim., 2011)

The x-and-y-axes travelling salesman problem. - Eranda Çela; Vladimir G. Deineko; Gerhard J. Woeginger (Eur. J. Oper. Res., 2012)

Another well-solvable case of the QAP: Maximizing the job completion time variance. - Eranda Çela; Vladimir G. Deineko; Gerhard J. Woeginger (Oper. Res. Lett., 2012)

A New Tractable Case of the QAP with a Robinson Matrix. - Eranda Çela; Vladimir G. Deineko; Gerhard J. Woeginger (COCOA, 2015)

Well-solvable cases of the QAP with block-structured matrices. - Eranda Çela; Vladimir G. Deineko; Gerhard J. Woeginger (Discret. Appl. Math., 2015)

Heuristics for the data arrangement problem on regular trees. - Eranda Çela; Rostislav Stanek (J. Comb. Optim., 2015)

Linearizable special cases of the QAP. - Eranda Çela; Vladimir G. Deineko; Gerhard J. Woeginger (J. Comb. Optim., 2016)

The multi-stripe travelling salesman problem. - Eranda Çela; Vladimir G. Deineko; Gerhard J. Woeginger (Ann. Oper. Res., 2017)

New special cases of the Quadratic Assignment Problem with diagonally structured coefficient matrices. - Eranda Çela; Vladimir G. Deineko; Gerhard J. Woeginger (Eur. J. Oper. Res., 2018)

Relationship of k-Bend and Monotonic 𝓁-Bend Edge Intersection Graphs of Paths on a Grid. - Eranda Çela; Elisabeth Gaar (CoRR, 2020)

Linearizable Special Cases of the Quadratic Shortest Path Problem. - Eranda Çela; Bettina Klinz; Stefan Lendl; James B. Orlin; Gerhard J. Woeginger; Lasse Wulf (WG, 2021)

A machine learning-based branch and price algorithm for a sampled vehicle routing problem. - Nikolaus Furian; Michael J. O'Sullivan; Cameron G. Walker; Eranda Çela (OR Spectr., 2021)

Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid. - Eranda Çela; Elisabeth Gaar (J. Graph Algorithms Appl., 2022)

On k-bend and monotonic ℓ-bend edge intersection graphs of paths on a grid. - Eranda Çela; Elisabeth Gaar (Discret. Appl. Math., 2023)

Recognising permuted Demidenko matrices. - Eranda Çela; Vladimir G. Deineko; Gerhard J. Woeginger (Oper. Res. Lett., 2023)

Travelling salesman paths on Demidenko matrices. - Eranda Çela; Vladimir G. Deineko; Gerhard J. Woeginger (Discret. Appl. Math., 2024)

Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty. - Corinna Mathwieser; Eranda Çela (Networks, 2024)

Integrating multiple sources of ordinal information in portfolio optimization. - Eranda Çela; Stephan Hafner; Roland Mestel; Ulrich Pferschy (Ann. Oper. Res., 2025)

A linear time algorithm for linearizing quadratic and higher-order shortest path problems. - Eranda Çela; Bettina Klinz; Stefan Lendl; Gerhard J. Woeginger; Lasse Wulf (Math. Program., 2025)