| Publication | Date of Publication | Type |
|---|
Quasilinear approximation scheme for Steiner multi cycle in the Euclidean plane
| 2022-04-27 | 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 |
Online circle and sphere packing
Theoretical Computer Science | 2019-05-29 | Paper |
Approximation algorithms and heuristics for task scheduling in data-intensive distributed systems
International Transactions in Operational Research | 2019-02-20 | Paper |
An exact algorithm for the blocks relocation problem with new lower bounds
Computers & Operations Research | 2018-08-08 | Paper |
Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks
Journal of Combinatorial Optimization | 2017-02-22 | Paper |
Heuristics for the strip packing problem with unloading constraints
Computers & Operations Research | 2016-11-14 | Paper |
Non-cooperative capacitated facility location games
Information Processing Letters | 2016-10-06 | Paper |
An Integer Programming Formulation for the Maximum k-Subset Intersection Problem
Lecture Notes in Computer Science | 2015-10-16 | Paper |
Scheduling with task replication on desktop grids: theoretical and experimental analysis
Journal of Combinatorial Optimization | 2015-09-28 | Paper |
Locality-preserving allocations problems and coloured bin packing
Theoretical Computer Science | 2015-07-24 | 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 |
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 |
Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
Computers & Operations Research | 2012-11-15 | Paper |
A note on a maximum \(k\)-subset intersection problem
Information Processing Letters | 2012-07-25 | Paper |
A note on dual approximation algorithms for class constrained bin packing problems
RAIRO - Theoretical Informatics and Applications | 2009-05-06 | 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 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 |
Approximation schemes for knapsack problems with shelf divisions
Theoretical Computer Science | 2006-03-24 | Paper |
