default search action
Eranda Çela
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j20]Eranda Çela
, Vladimir G. Deineko, Gerhard J. Woeginger
Travelling salesman paths on Demidenko matrices. Discret. Appl. Math. 354: 3-14 (2024) - [j19]Corinna Mathwieser
Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty. Networks 83(3): 587-604 (2024) - 2023
- [j18]Eranda Çela
On k-bend and monotonic ℓ-bend edge intersection graphs of paths on a grid. Discret. Appl. Math. 331: 88-103 (2023) - [j17]Eranda Çela
Recognising permuted Demidenko matrices. Oper. Res. Lett. 51(5): 494-500 (2023) - [c5]Eranda Çela
A Linear Time Algorithm for Linearizing Quadratic and Higher-Order Shortest Path Problems. IPCO 2023: 466-479 - [i9]Eranda Çela
Recognising permuted Demidenko matrices. CoRR abs/2302.05191 (2023) - [i8]Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf:
A linear time algorithm for linearizing quadratic and higher-order shortest path problems. CoRR abs/2303.00569 (2023) - 2022
- [j16]Eranda Çela
Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid. J. Graph Algorithms Appl. 26(1): 519-552 (2022) - [i7]Corinna Mathwieser, Eranda Çela:
Special Cases of the Minimum Spanning Tree Problem under Explorable Edge and Vertex Uncertainty. CoRR abs/2211.15611 (2022) - 2021
- [j15]Nikolaus Furian
A machine learning-based branch and price algorithm for a sampled vehicle routing problem. OR Spectr. 43(3): 693-732 (2021) - [c4]Eranda Çela
Linearizable Special Cases of the Quadratic Shortest Path Problem. WG 2021: 245-256 - 2020
- [i6]Eranda Çela, Elisabeth Gaar:
Relationship of k-Bend and Monotonic 𝓁-Bend Edge Intersection Graphs of Paths on a Grid. CoRR abs/2002.05998 (2020) - [i5]Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger:
Travelling salesman paths on Demidenko matrices. CoRR abs/2009.14746 (2020)
2010 – 2019
- 2019
- [i4]Eranda Çela, Elisabeth Gaar:
Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid. CoRR abs/1908.01981 (2019) - 2018
- [j14]Eranda Çela
New special cases of the Quadratic Assignment Problem with diagonally structured coefficient matrices. Eur. J. Oper. Res. 267(3): 818-834 (2018) - 2017
- [j13]Eranda Çela
The multi-stripe travelling salesman problem. Ann. Oper. Res. 259(1-2): 21-34 (2017) - 2016
- [j12]Eranda Çela
Linearizable special cases of the QAP. J. Comb. Optim. 31(3): 1269-1279 (2016) - [i3]Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger:
The multi-stripe travelling salesman problem. CoRR abs/1609.09796 (2016) - 2015
- [j11]Eranda Çela
Well-solvable cases of the QAP with block-structured matrices. Discret. Appl. Math. 186: 56-65 (2015) - [j10]Eranda Çela
Heuristics for the data arrangement problem on regular trees. J. Comb. Optim. 30(3): 768-802 (2015) - [c3]Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger:
A New Tractable Case of the QAP with a Robinson Matrix. COCOA 2015: 709-720 - 2014
- [i2]Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger:
Linearizable special cases of the QAP. CoRR abs/1409.6510 (2014) - 2013
- [i1]Eranda Çela, Rostislav Stanek:
Heuristics for the data arrangement problem on regular trees. CoRR abs/1304.5942 (2013) - 2012
- [j9]Eranda Çela
The x-and-y-axes travelling salesman problem. Eur. J. Oper. Res. 223(2): 333-345 (2012) - [j8]Eranda Çela
Another well-solvable case of the QAP: Maximizing the job completion time variance. Oper. Res. Lett. 40(5): 356-359 (2012) - 2011
- [j7]Eranda Çela
The Wiener maximum quadratic assignment problem. Discret. Optim. 8(3): 411-416 (2011)
2000 – 2009
- 2006
- [j6]Eranda Çela
Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem. J. Comb. Optim. 12(3): 187-215 (2006) - 2000
- [j5]Rainer E. Burkard, Eranda Çela, Helidon Dollani:
2-Medians in trees with pos/neg weights. Discret. Appl. Math. 105(1-3): 51-71 (2000)
1990 – 1999
- 1999
- [j4]Stefan E. Karisch, Eranda Çela, Jens Clausen, T. Espersen:
A Dual Framework for Lower Bounds of the Quadratic Assignment Problem Based on Linearization. Computing 63(4): 351-403 (1999) - [p1]Rainer E. Burkard, Eranda Çela:
Linear Assignment Problems and Extensions. Handbook of Combinatorial Optimization 1999: 75-149 - 1998
- [j3]Rainer E. Burkard, Eranda Çela, Günter Rote, Gerhard J. Woeginger:
The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases. Math. Program. 82: 125-158 (1998) - 1997
- [j2]Qi Fan Yang, Rainer E. Burkard, Eranda Çela, Gerhard J. Woeginger:
Hamiltonian cycles in circulant digraphs with two stripes. Discret. Math. 176(1-3): 233-254 (1997) - [j1]Eranda Çela, Hans Achatz:
Book reviews. Math. Methods Oper. Res. 45(3): 483-485 (1997) - 1996
- [c2]Rainer E. Burkard, Eranda Çela, Günter Rote, Gerhard J. Woeginger:
The Quadratic Assignment Problem with a Monotone Anti-Monge and a Symmetric Toeplitz Matrix: Easy and Hard Cases. IPCO 1996: 204-218 - 1993
- [c1]Rainer E. Burkard, Eranda Çela, Bettina Klinz:
On the Biquadratic Assignment Problem. Quadratic Assignment and Related Problems 1993: 117-146
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: