| Publication | Date of Publication | Type |
|---|
Variants and objectives for ordinal scheduling
CEJOR. Central European Journal of Operations Research | 2026-09-07 | Paper |
| An efficient polynomial time approximation scheme for minimizing the total weighted completion time on uniformly related machines | 2026-08-11 | Paper |
| Lower bounds for several standard bin packing algorithms in the random order model | 2026-08-11 | Paper |
Lower bounds on the performance of online algorithms for relaxed packing problems
Discrete Optimization | 2026-08-06 | Paper |
| An EPTAS for minimizing the total weighted completion time of jobs with release dates on uniformly related machines | 2026-08-05 | Paper |
| Efficient approximation schemes for scheduling on a stochastic number of machines | 2026-06-24 | Paper |
An EPTAS for minimizing the total weighted completion time of jobs with release dates on uniformly related machines
Information and Computation | 2026-06-23 | Paper |
Makespan minimization for ordinal cardinality constrained scheduling
Discrete Applied Mathematics | 2026-04-30 | Paper |
Semi-online models for cardinality constrained bin packing
Journal of Scheduling | 2026-04-21 | Paper |
More on online cardinality constrained bin packing with small cardinality bounds
Theoretical Computer Science | 2026-03-05 | Paper |
More on online weighted edge coloring
Discrete Optimization | 2025-07-16 | Paper |
Semi-online scheduling with non-increasing job sizes and a buffer
Journal of Combinatorial Optimization | 2025-05-31 | Paper |
Tighter bounds for the harmonic bin packing algorithm
European Journal of Operational Research | 2024-08-13 | Paper |
Online cardinality constrained scheduling
Operations Research Letters | 2024-06-17 | Paper |
| Cardinality constrained scheduling in online models | 2024-04-23 | Paper |
scientific article; zbMATH DE number 7768353 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-20 | Paper |
Bin stretching with migration on two hierarchical machines
Mathematical Methods of Operations Research | 2023-09-06 | Paper |
Parallel solutions for ordinal scheduling with a small number of machines
Journal of Combinatorial Optimization | 2023-08-22 | Paper |
Parallel solutions for preemptive makespan scheduling on two identical machines
Journal of Scheduling | 2023-06-23 | Paper |
Online bin packing of squares and cubes
Algorithmica | 2023-04-28 | Paper |
Online bin covering with limited migration
Journal of Computer and System Sciences | 2023-03-10 | Paper |
Several methods of analysis for cardinality constrained bin packing
Theoretical Computer Science | 2022-12-21 | Paper |
On two dimensional packing
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
Online scheduling with migration on two hierarchical machines
Journal of Combinatorial Optimization | 2022-10-31 | Paper |
Several methods of analysis for cardinality constrained bin packing
Approximation and Online Algorithms | 2022-10-19 | Paper |
Open-end bin packing: new and old analysis approaches
Discrete Applied Mathematics | 2022-09-15 | Paper |
Lower bounds on the performance of online algorithms for relaxed packing problems
(available as arXiv preprint) | 2022-08-30 | Paper |
Online Bin Covering with Limited Migration
(available as arXiv preprint) | 2022-05-11 | Paper |
Lower bounds for batched bin packing
Journal of Combinatorial Optimization | 2022-04-13 | Paper |
Online bin packing of squares and cubes
Lecture Notes in Computer Science | 2022-03-25 | Paper |
Lower bounds on the performance of online algorithms for relaxed packing problems
(available as arXiv preprint) | 2022-01-16 | Paper |
More on ordered open end bin packing
Journal of Scheduling | 2022-01-14 | Paper |
On-line machine covering
Algorithms — ESA '97 | 2021-12-20 | Paper |
Starting time minimization for the maximum job variant
Discrete Applied Mathematics | 2021-12-07 | Paper |
On bin packing with clustering and bin packing with delays
Discrete Optimization | 2021-10-19 | Paper |
Selfish vector packing
Algorithmica | 2021-09-02 | Paper |
A new and improved algorithm for online bin packing
(available as arXiv preprint) | 2021-08-04 | Paper |
A new lower bound for classic online bin packing
Algorithmica | 2021-06-30 | Paper |
A note on a variant of the online open end bin packing problem
Operations Research Letters | 2021-04-07 | Paper |
Quality of equilibria for selfish bin packing with cost sharing variants
Discrete Optimization | 2021-01-15 | Paper |
A new lower bound for classic online bin packing
Approximation and Online Algorithms | 2020-08-24 | Paper |
Online bin packing with cardinality constraints resolved
Journal of Computer and System Sciences | 2020-06-09 | Paper |
Online bin packing with cardinality constraints resolved
Journal of Computer and System Sciences | 2020-06-09 | Paper |
| Online bin packing with cardinality constraints resolved | 2020-05-27 | Paper |
An optimal online algorithm for scheduling with general machine cost functions
Journal of Scheduling | 2020-04-22 | Paper |
Quality of strong equilibria for selfish bin packing with uniform cost sharing
Journal of Scheduling | 2020-03-06 | Paper |
Lower bounds for online bin covering-type problems
Journal of Scheduling | 2020-03-06 | Paper |
Lower bounds for several online variants of bin packing
Theory of Computing Systems | 2019-12-19 | Paper |
Robust algorithms for total completion time
Discrete Optimization | 2019-11-28 | Paper |
A lower bound for online rectangle packing
Journal of Combinatorial Optimization | 2019-10-29 | Paper |
A new lower bound on the price of anarchy of selfish bin packing
Information Processing Letters | 2019-09-20 | Paper |
Pareto optimal equilibria for selfish bin packing with uniform cost sharing
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
The benefit of preemption with respect to the \(\ell_p\) norm
Operations Research Letters | 2019-06-11 | Paper |
A unified approach to truthful scheduling on related machines
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
The benefit of preemption for single machine scheduling so as to minimize total weighted completion time
Operations Research Letters | 2019-01-15 | Paper |
Batch coloring of graphs
Algorithmica | 2019-01-11 | Paper |
On the performance guarantee of first fit for sum coloring
Journal of Computer and System Sciences | 2018-12-10 | Paper |
Online-bounded analysis
Journal of Scheduling | 2018-11-07 | Paper |
A survey on makespan minimization in semi-online environments
Journal of Scheduling | 2018-11-07 | Paper |
More on batched bin packing
Operations Research Letters | 2018-10-01 | Paper |
The metric dimension of two-dimensional extended meshes
Acta Cybernetica | 2018-09-03 | Paper |
The convergence time for selfish bin packing
Acta Cybernetica | 2018-09-03 | Paper |
Min-sum bin packing
Journal of Combinatorial Optimization | 2018-07-20 | Paper |
Lower bounds for several online variants of bin packing
Lecture Notes in Computer Science | 2018-06-22 | Paper |
The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints
Journal of Computer and System Sciences | 2018-06-06 | Paper |
The weighted 2-metric dimension of trees in the non-landmarks model
Discrete Optimization | 2018-05-24 | Paper |
Improved bounds for randomized preemptive online matching
Information and Computation | 2018-03-21 | Paper |
Colored bin packing: online algorithms and lower bounds
Algorithmica | 2018-02-28 | Paper |
The \(k\)-metric dimension
Journal of Combinatorial Optimization | 2017-10-17 | Paper |
Scheduling selfish jobs on multidimensional parallel machines
Theoretical Computer Science | 2017-09-12 | Paper |
Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times
Journal of Scheduling | 2017-08-18 | Paper |
A new and improved algorithm for online bin packing
(available as arXiv preprint) | 2017-07-06 | Paper |
Batch Coloring of Graphs
Approximation and Online Algorithms | 2017-04-04 | Paper |
Batch Coloring of Graphs
Approximation and Online Algorithms | 2017-04-04 | Paper |
Improved bounds for online preemptive matching
(available as arXiv preprint) | 2017-01-30 | Paper |
Power of preemption for minimizing total completion time on uniform parallel machines
SIAM Journal on Discrete Mathematics | 2017-01-27 | Paper |
Packing resizable items with application to video delivery over wireless networks
Algorithms for Sensor Systems | 2016-12-19 | Paper |
An AFPTAS for variable sized bin packing with general activation costs
Journal of Computer and System Sciences | 2016-11-14 | Paper |
Online bounded analysis
Computer Science – Theory and Applications | 2016-07-25 | Paper |
Bounds for online bin packing with cardinality constraints
Information and Computation | 2016-07-07 | Paper |
A unified approach to truthful scheduling on related machines
Mathematics of Operations Research | 2016-04-15 | Paper |
Vertex cover meets scheduling
Algorithmica | 2016-04-06 | Paper |
Online scheduling of jobs with fixed start times on related machines
Algorithmica | 2016-03-23 | Paper |
Parametric packing of selfish items and the subset sum algorithm
Algorithmica | 2016-03-23 | Paper |
| An algorithm for the weighted metric dimension of two-dimensional grids | 2016-02-18 | Paper |
Online scheduling of unit jobs on three machines with rejection: a tight result
Information Processing Letters | 2016-01-05 | Paper |
Selfish vector packing
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Online scheduling of splittable tasks
ACM Transactions on Algorithms | 2015-09-02 | Paper |
This side up!
ACM Transactions on Algorithms | 2015-09-02 | Paper |
The (weighted) metric dimension of graphs: hard and easy cases
Algorithmica | 2015-09-02 | Paper |
| Optimal online bounded space multidimensional packing | 2015-08-03 | Paper |
Offline black and white bin packing
Theoretical Computer Science | 2015-07-24 | Paper |
Rent or buy problems with a fixed time horizon
Theory of Computing Systems | 2015-05-29 | Paper |
Online file caching with rejection penalties
Algorithmica | 2015-05-26 | Paper |
Online results for black and white bin packing
Theory of Computing Systems | 2015-05-12 | Paper |
Transactional contention management as a non-clairvoyant scheduling problem
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Online scheduling with rejection and reordering: exact algorithms for unit size jobs
Journal of Combinatorial Optimization | 2015-01-21 | Paper |
The Convergence Time for Selfish Bin Packing
Algorithmic Game Theory | 2015-01-14 | Paper |
Robust algorithms for preemptive scheduling
Algorithmica | 2014-11-19 | Paper |
An efficient polynomial time approximation scheme for load balancing on uniformly related machines
Mathematical Programming. Series A. Series B | 2014-10-17 | Paper |
Packing resizable items with application to video delivery over wireless networks
Theoretical Computer Science | 2014-09-18 | Paper |
On the online unit clustering problem
ACM Transactions on Algorithms | 2014-09-09 | Paper |
