| Approximation algorithms for generalized MST and TSP in grid clusters B Bhattacharya, A Ćustić, A Rafiey, A Rafiey, V Sokol Combinatorial Optimization and Applications: 9th International Conference …, 2015 | 28 | 2015 |
| Geometric versions of the three-dimensional assignment problem under general norms A Ćustić, B Klinz, GJ Woeginger Discrete Optimization 18, 38-55, 2015 | 22 | 2015 |
| A characterization of linearizable instances of the quadratic minimum spanning tree problem A Ćustić, AP Punnen Journal of Combinatorial Optimization 35, 436-453, 2018 | 20 | 2018 |
| The bilinear assignment problem: complexity and polynomially solvable special cases A Ćustić, V Sokol, AP Punnen, B Bhattacharya Mathematical programming 166, 185-205, 2017 | 20 | 2017 |
| Combinatorial optimization with interaction costs: Complexity and solvable cases S Lendl, A Ćustić, AP Punnen Discrete optimization 33, 101-117, 2019 | 16 | 2019 |
| The quadratic minimum spanning tree problem and its variations A Ćustić, R Zhang, AP Punnen Discrete Optimization 27, 73-87, 2018 | 14 | 2018 |
| Tiling groups with difference sets A Ćustić, V Krčadinac, Y Zhou The Electronic journal of combinatorics, P2. 56-P2. 56, 2015 | 11 | 2015 |
| Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis A Ćustić, AP Punnen Operations Research Letters 45 (3), 232-237, 2017 | 6 | 2017 |
| The constant objective value property for multidimensional assignment problems A Ćustić, B Klinz Discrete optimization 19, 23-35, 2016 | 5 | 2016 |
| On conjectures and problems of Ruzsa concerning difference graphs of S-units A Ćustić, L Hajdu, D Kreso, R Tijdeman Acta Mathematica Hungarica 146 (2), 391-404, 2015 | 4 | 2015 |
| The Steiner cycle and path cover problem on interval graphs A Ćustić, S Lendl Journal of combinatorial optimization 43 (1), 226-234, 2022 | 3 | 2022 |
| Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms V Sokol, A Ćustić, AP Punnen, B Bhattacharya INFORMS Journal on Computing 32 (3), 730-746, 2020 | 2 | 2020 |
| On streaming algorithms for the Steiner cycle and path cover problem on interval graphs and falling platforms in video games A Ćustić, S Lendl arXiv preprint arXiv:1802.08577, 2018 | 2 | 2018 |
| Planar 3-dimensional assignment problems with Monge-like cost arrays A Ćustić, B Klinz, GJ Woeginger arXiv preprint arXiv:1405.5210, 2014 | 2 | 2014 |
| The constant objective value property for combinatorial optimization problems A Ćustić, B Klinz arXiv preprint arXiv:1405.6096, 2014 | 2 | 2014 |
| Analysis of 2-opt heuristic for the winner determination problem under the chamberlin-courant system A Ćustić, E Iranmanesh, R Krishnamurti Algorithms and Discrete Applied Mathematics: Third International Conference …, 2017 | 1 | 2017 |
| Geometric p-Center Problems with Centers Constrained to Two Lines B Bhattacharya, A Ćustić, S Das, Y Higashikawa, T Kameda, N Katoh Japanese Conference on Discrete and Computational Geometry and Graphs, 24-36, 2015 | | 2015 |
Abraham P. PunnenProfessor of Operations Research, Simon Fraser UniversityVerified email at sfu.ca
