| Publication | Date of Publication | Type |
|---|
Algorithms for the bin packing problem with scenarios
Journal of Combinatorial Optimization | 2024-12-03 | Paper |
Polynomial algorithms for sparse spanners on subcubic graphs
Journal of Combinatorial Optimization | 2024-10-21 | Paper |
| Approximation schemes under resource augmentation for knapsack and packing problems of hyperspheres and other shapes | 2024-07-19 | Paper |
Smart energy pricing for demand‐side management in renewable energy smart grids
International Transactions in Operational Research | 2023-11-17 | Paper |
The container loading problem with cargo stability: a study on support factors, mechanical equilibrium and grids
Engineering Optimization | 2023-10-10 | Paper |
Tight bounds for the price of anarchy and stability in sequential transportation games
Journal of Combinatorial Optimization | 2023-09-27 | Paper |
Tree 3-spanners on generalized prisms of graphs
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
| Mathematical Models and Exact Algorithms for the Colored Bin Packing Problem | 2023-05-24 | Paper |
Exact solution of network flow models with strong relaxations
Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
Improved NP-hardness results for the minimum \(t\)-spanner problem on bounded-degree graphs
Theoretical Computer Science | 2023-02-01 | Paper |
An extension of Queiroz and Miyazawa's method for vertical stability in two-dimensional packing problems to deal with horizontal stability
Engineering Optimization | 2022-12-23 | Paper |
Techniques and results on approximation algorithms for packing circles
São Paulo Journal of Mathematical Sciences | 2022-09-30 | Paper |
The arc-item-load and related formulations for the cumulative vehicle routing problem
Discrete Optimization | 2022-09-15 | Paper |
| Minimum \(t\)-spanners on subcubic graphs | 2022-07-13 | Paper |
| Quasilinear approximation scheme for Steiner multi cycle in the Euclidean plane | 2022-04-27 | Paper |
A tight lower bound for the online bounded space hypercube bin packing problem
Discrete Mathematics & Theoretical Computer Science | 2022-01-27 | Paper |
A tight lower bound for the online bounded space hypercube bin packing problem
Discrete Mathematics & Theoretical Computer Science | 2022-01-27 | Paper |
| New exact techniques applied to a class of network flow formulations | 2021-12-21 | Paper |
Partitioning a graph into balanced connected classes: formulations, separation and experiments
European Journal of Operational Research | 2021-06-07 | Paper |
Exact solution techniques for two-dimensional cutting and packing
European Journal of Operational Research | 2021-06-03 | Paper |
Exact solution of network flow models with strong relaxations
(available as arXiv preprint) | 2021-05-31 | Paper |
| Cut and flow formulations for the balanced connected \(k\)-partition problem | 2021-02-04 | Paper |
Randomized approximation scheme for Steiner multi cycle in the Euclidean plane
Theoretical Computer Science | 2020-08-17 | Paper |
| Two-dimensional knapsack for circles | 2020-02-12 | Paper |
A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game
(available as arXiv preprint) | 2020-02-12 | Paper |
Prices of anarchy of selfish 2D bin packing games
International Journal of Foundations of Computer Science | 2019-06-21 | Paper |
Online circle and sphere packing
Theoretical Computer Science | 2019-05-29 | 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 |
Heuristics for the strip packing problem with unloading constraints
Computers & Operations Research | 2016-11-14 | Paper |
Polynomial-time approximation schemes for circle and other packing problems
Algorithmica | 2016-10-21 | Paper |
| Distributed load balancing algorithms for heterogeneous players in asynchronous networks | 2016-07-08 | Paper |
A bounded space algorithm for online circle packing
Information Processing Letters | 2016-03-01 | 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 |
On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
4OR | 2015-06-23 | Paper |
Order and static stability into the strip packing problem
Annals of Operations Research | 2015-02-27 | Paper |
Polynomial-time approximation schemes for circle packing problems
Algorithms - ESA 2014 | 2014-10-08 | Paper |
A PTAS for the disk cover problem of geometric objects
Operations Research Letters | 2014-05-15 | Paper |
Two-dimensional strip packing with unloading constraints
Discrete Applied Mathematics | 2014-05-05 | Paper |
A note on a two dimensional knapsack problem with unloading constraints
RAIRO - Theoretical Informatics and Applications | 2014-02-24 | Paper |
A cube-covering problem.
Ars Combinatoria | 2013-09-09 | Paper |
Selfish square packing
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
Two dimensional strip packing with unloading constraints
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
Two dimensional knapsack with unloading constraints
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
Convergence time to Nash equilibrium in selfish bin packing
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
Semidefinite programming based algorithms for the sparsest cut problem
RAIRO - Operations Research | 2013-04-29 | Paper |
Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
Computers & Operations Research | 2012-11-15 | 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 |
Bounds on the convergence time of distributed selfish bin packing
International Journal of Foundations of Computer Science | 2011-05-10 | Paper |
Three-dimensional packings with rotations
Computers & Operations Research | 2009-05-19 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
A note on dual approximation algorithms for class constrained bin packing problems
RAIRO - Theoretical Informatics and Applications | 2009-05-06 | Paper |
A note on dual approximation algorithms for class constrained bin packing problems
RAIRO - Theoretical Informatics and Applications | 2009-05-06 | Paper |
Self-adjustment of resource allocation for grid applications
Computer Networks | 2008-06-25 | Paper |
Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
European Journal of Operational Research | 2008-06-24 | Paper |
A greedy approximation algorithm for the uniform metric labeling problem analyzed by a primal-dual technique
ACM Journal of Experimental Algorithmics | 2008-06-20 | Paper |
A one-dimensional bin packing problem with shelf divisions
Discrete Applied Mathematics | 2008-04-16 | Paper |
The class constrained bin packing problem with applications to video-on-demand
Theoretical Computer Science | 2008-04-15 | Paper |
The Class Constrained Bin Packing Problem with Applications to Video-on-Demand
Lecture Notes in Computer Science | 2007-09-10 | Paper |
A note on the approximability of cutting stock problems
European Journal of Operational Research | 2007-08-27 | Paper |
| scientific article; zbMATH DE number 5158520 (Why is no real title available?) | 2007-05-29 | Paper |
| scientific article; zbMATH DE number 5158518 (Why is no real title available?) | 2007-05-29 | Paper |
Two- and three-dimensional parametric packing
Computers & Operations Research | 2007-04-13 | Paper |
Approximation schemes for knapsack problems with shelf divisions
Theoretical Computer Science | 2006-03-24 | Paper |
Multidimensional cube packing
Algorithmica | 2005-02-11 | Paper |
Parametric on-line algorithms for packing rectangles and boxes.
European Journal of Operational Research | 2003-08-25 | Paper |
Cube packing.
Theoretical Computer Science | 2003-08-17 | Paper |
A brief introduction to approximation algorithms. 23rd Brazilian mathematics colloquium, Rio de Janeiro, Brazil, July 23--27, 2001.
Publicações Matemáticas do IMPA | 2001-11-04 | Paper |
| Multidimensional cube packing | 2001-10-24 | Paper |
| scientific article; zbMATH DE number 1512676 (Why is no real title available?) | 2000-10-03 | Paper |
Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem
SIAM Journal on Computing | 2000-03-19 | Paper |
An algorithm for the three-dimensional packing problem with asymptotic performance analysis
Algorithmica | 1997-04-22 | Paper |
