| Publication | Date of Publication | Type |
|---|
Positional knapsack problem: NP-hardness and approximation scheme (brief announcement)
Procedia Computer Science | 2025-12-11 | Paper |
Freeze-tag is NP-hard in 3D with \(L_1\) distance
Procedia Computer Science | 2025-12-11 | Paper |
An efficient parameterized approximation scheme for the star \(k\)-hub center
Procedia Computer Science | 2025-12-02 | Paper |
On the inapproximability of the cable-trench problem
Procedia Computer Science | 2025-12-02 | Paper |
Algorithms for the bin packing problem with scenarios
Journal of Combinatorial Optimization | 2024-12-03 | Paper |
| An asymptotically optimal approximation algorithm for the travelling car renter problem | 2024-08-22 | Paper |
Approximation algorithms for the MAXSPACE advertisement problem
Theory of Computing Systems | 2024-07-29 | Paper |
On the complexity of the cable-trench problem
Discrete Applied Mathematics | 2023-09-14 | Paper |
A parameterized approximation algorithm for the multiple allocation \(k\)-hub center
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
Computing the largest bond of a graph
(available as arXiv preprint) | 2023-02-03 | Paper |
A 2-approximation for the \(k\)-prize-collecting Steiner tree problem
Algorithmica | 2022-12-08 | Paper |
A 2-approximation for the \(k\)-prize-collecting Steiner tree problem
LATIN 2020: Theoretical Informatics | 2022-10-13 | Paper |
| Approximating routing and connectivity problems with multiple distances | 2022-10-13 | Paper |
| A polynomial-time approximation scheme for the MAXSPACE advertisement problem | 2022-04-27 | Paper |
Improved approximation for the capacitated inventory access point problem
Operations Research Letters | 2022-03-11 | Paper |
Computing the largest bond and the maximum connected cut of a graph
Algorithmica | 2021-04-19 | Paper |
Integrated Supply Chain Management via Randomized Rounding
INFORMS Journal on Computing | 2020-11-09 | Paper |
Approximation algorithms for median hub location problems
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
Approximation algorithms for the bus evacuation problem
Journal of Combinatorial Optimization | 2018-07-26 | Paper |
Improved approximation algorithms for capacitated fault-tolerant \(k\)-center
Algorithmica | 2018-04-11 | Paper |
Approximation algorithms for \(k\)-level stochastic facility location problems
Journal of Combinatorial Optimization | 2017-10-17 | Paper |
A PTAS for the geometric connected facility location problem
Theory of Computing Systems | 2017-10-12 | Paper |
Clustering through continuous facility location problems
Theoretical Computer Science | 2016-12-05 | Paper |
Polynomial-time approximation schemes for circle and other packing problems
Algorithmica | 2016-10-21 | Paper |
Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems
Mathematical Programming. Series A. Series B | 2015-10-19 | Paper |
Polynomial-time approximation schemes for circle packing problems
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Integrated supply chain management via randomized rounding
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
A systematic approach to bound factor revealing LPs and its application to the metric and squared metric facility location problems
Lecture Notes in Computer Science | 2012-11-02 | Paper |
