| Publication | Date of Publication | Type |
|---|
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 |
Proper gap-labellings of unicyclic graphs
Matemática Contemporânea | 2024-04-25 | Paper |
Graphs without gap-vertex-labellings: families and bounds
Discrete Applied Mathematics | 2023-12-11 | Paper |
Smart energy pricing for demand‐side management in renewable energy smart grids
International Transactions in Operational Research | 2023-11-17 | Paper |
Tight bounds for the price of anarchy and stability in sequential transportation games
Journal of Combinatorial Optimization | 2023-09-27 | Paper |
On gap-labellings of some families of graphs
Discrete Applied Mathematics | 2023-09-14 | Paper |
| A Branch-and-Cut-and-Price Algorithm for Cutting Stock and Related Problems | 2023-08-07 | Paper |
Budget-balanced and strategy-proof auctions for ridesharing
Computers & Operations Research | 2023-07-04 | Paper |
| Mathematical Models and Exact Algorithms for the Colored Bin Packing Problem | 2023-05-24 | Paper |
Computing the largest bond of a graph
(available as arXiv preprint) | 2023-02-03 | Paper |
| A polynomial-time approximation scheme for the MAXSPACE advertisement problem | 2022-04-27 | Paper |
| On the complexity of gap-\([2\)-vertex-labellings of subcubic bipartite graphs] | 2022-04-27 | Paper |
Computing the largest bond and the maximum connected cut of a graph
Algorithmica | 2021-04-19 | Paper |
Approximation algorithms for the max-buying problem with limited supply
Algorithmica | 2019-01-11 | Paper |
Approximation algorithms for the bus evacuation problem
Journal of Combinatorial Optimization | 2018-07-26 | Paper |
The envy-free pricing problem, unit-demand markets and connections with the network pricing problem
Discrete Optimization | 2018-05-24 | 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 |
Polynomial-time approximation schemes for circle and other packing problems
Algorithmica | 2016-10-21 | Paper |
A bounded space algorithm for online circle packing
Information Processing Letters | 2016-03-01 | Paper |
The envy-free pricing problem and unit-demand markets
Lecture Notes in Computer Science | 2015-10-16 | Paper |
Polynomial-time approximation schemes for circle packing problems
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Second-price ad auctions with binary bids and markets with good competition
Theoretical Computer Science | 2014-06-06 | Paper |
Approximation algorithms for the max-buying problem with limited supply
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Second-price ad auctions with binary bids and markets with good competition
Lecture Notes in Computer Science | 2012-11-02 | Paper |
