| Publication | Date of Publication | Type |
|---|
| Lower bounds for several standard bin packing algorithms in the random order model | 2026-08-11 | Paper |
Better and simpler reducibility bounds over the integers
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 |
Tight lower bounds for block-structured integer programs
Mathematical Programming. Series A. Series B | 2026-05-08 | 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 |
| (Near)-optimal algorithms for sparse separable convex integer programs | 2025-12-22 | Paper |
APTAs for bin packing with general cost structures
Theoretical Computer Science | 2025-11-01 | Paper |
Sparse integer programming is fixed-parameter tractable
Mathematics of Operations Research | 2025-09-30 | Paper |
| Tight lower bounds for block-structured integer programs | 2025-02-07 | Paper |
Scheduling with cardinality dependent unavailability periods
European Journal of Operational Research | 2024-07-02 | Paper |
Online cardinality constrained scheduling
Operations Research Letters | 2024-06-17 | Paper |
Reducibility bounds of objective functions over the integers
Operations Research Letters | 2024-06-17 | Paper |
| Cardinality constrained scheduling in online models | 2024-04-23 | Paper |
Selecting intervals to optimize the design of observational studies subject to fine balance constraints
Journal of Combinatorial Optimization | 2024-04-10 | Paper |
Algorithms and Complexities of Matching Variants in Covariate Balancing
Operations Research | 2024-03-12 | Paper |
EPTAS for parallel identical machine scheduling with time restrictions
Journal of Combinatorial Optimization | 2024-03-04 | Paper |
scientific article; zbMATH DE number 7768353 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-20 | Paper |
EPTAS for the dual of splittable bin packing with cardinality constraint
Theoretical Computer Science | 2023-10-26 | Paper |
Online minimization of the maximum starting time: migration helps
Algorithmica | 2023-08-17 | Paper |
EPTAS for load balancing problem on parallel machines with a non-renewable resource
Discrete Optimization | 2023-06-30 | Paper |
High-multiplicity \(N\)-fold IP via configuration LP
Mathematical Programming. Series A. Series B | 2023-05-25 | Paper |
Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times
Acta Informatica | 2023-05-16 | Paper |
Online bin covering with limited migration
Journal of Computer and System Sciences | 2023-03-10 | Paper |
Comparing the costs of any fit algorithms for bin packing
Operations Research Letters | 2022-12-12 | Paper |
EPTAS for load balancing problem on parallel machines with a non-renewable resource
(available as arXiv preprint) | 2022-10-19 | Paper |
Approximate separable multichoice optimization over monotone systems
Discrete Optimization | 2022-06-09 | 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 |
Approximation schemes for the generalized extensible bin packing problem
Algorithmica | 2022-03-25 | Paper |
Parameterized complexity of configuration integer programs
Operations Research Letters | 2022-03-11 | Paper |
| The near exact bin covering problem | 2022-02-22 | Paper |
More on ordered open end bin packing
Journal of Scheduling | 2022-01-14 | Paper |
Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes
Information Processing Letters | 2021-12-14 | Paper |
Complexity, algorithms and applications of the integer network flow with fractional supplies problem
Operations Research Letters | 2021-12-13 | Paper |
Starting time minimization for the maximum job variant
Discrete Applied Mathematics | 2021-12-07 | Paper |
A new and improved algorithm for online bin packing
(available as arXiv preprint) | 2021-08-04 | Paper |
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
(available as arXiv preprint) | 2021-07-28 | 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 |
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 |
Lower bounds for online bin covering-type problems
Journal of Scheduling | 2020-03-06 | Paper |
Hypergraphic degree sequences are hard
(available as arXiv preprint) | 2020-01-13 | Paper |
| Hypergraphic degree sequences are hard | 2020-01-13 | 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 |
The benefit of preemption with respect to the \(\ell_p\) norm
Operations Research Letters | 2019-06-11 | Paper |
A unified framework for designing EPTAS for load balancing on parallel machines
Algorithmica | 2019-05-21 | Paper |
Deadline TSP
Theoretical Computer Science | 2019-05-17 | 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 unified framework for designing EPTAS's for load balancing on parallel machines
(available as arXiv preprint) | 2018-09-06 | Paper |
Optimization over degree sequences
SIAM Journal on Discrete Mathematics | 2018-08-10 | Paper |
Min-sum bin packing
Journal of Combinatorial Optimization | 2018-07-20 | Paper |
Deadline TSP
Approximation and Online Algorithms | 2018-06-22 | Paper |
Lower bounds for several online variants of bin packing
Lecture Notes in Computer Science | 2018-06-22 | Paper |
Weighted matching with pair restrictions
Optimization Letters | 2018-05-28 | Paper |
Min-max cover of a graph with a small number of parts
Discrete Optimization | 2018-05-24 | Paper |
Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem
Journal of Combinatorial Optimization | 2018-04-13 | Paper |
Discounted reward TSP
Algorithmica | 2018-04-06 | Paper |
Improved bounds for randomized preemptive online matching
Information and Computation | 2018-03-21 | Paper |
Shifted matroid optimization
Operations Research Letters | 2018-02-06 | Paper |
Maximum coverage problem with group budget constraints
Journal of Combinatorial Optimization | 2017-11-16 | 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 |
On nonlinear multi-covering problems
Journal of Combinatorial Optimization | 2017-02-22 | 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 |
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 |
Nonoblivious 2-opt heuristics for the traveling salesman problem
Networks | 2016-06-10 | 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 |
The minimum generalized vertex cover problem
ACM Transactions on Algorithms | 2015-09-02 | Paper |
The (weighted) metric dimension of graphs: hard and easy cases
Algorithmica | 2015-09-02 | Paper |
Offline black and white bin packing
Theoretical Computer Science | 2015-07-24 | Paper |
Online file caching with rejection penalties
Algorithmica | 2015-05-26 | Paper |
Finding mobile data under delay constraints with searching costs
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees
Journal of Combinatorial Optimization | 2015-01-21 | Paper |
Approximation algorithms for a minimization variant of the order-preserving submatrices and for biclustering problems
ACM Transactions on Algorithms | 2014-12-05 | Paper |
The benefit of adaptivity in stochastic packing problems with probing
Theoretical Computer Science | 2014-12-02 | Paper |
Robust algorithms for preemptive scheduling
Algorithmica | 2014-11-19 | Paper |
Approximating the minimum quadratic assignment problems
ACM Transactions on Algorithms | 2014-11-18 | Paper |
A generalized minimum cost k-clustering
ACM Transactions on Algorithms | 2014-11-18 | Paper |
An efficient polynomial time approximation scheme for load balancing on uniformly related machines
Mathematical Programming. Series A. Series B | 2014-10-17 | Paper |
Bin covering with cardinality constraints
Discrete Applied Mathematics | 2014-04-22 | Paper |
The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature
Discrete Optimization | 2014-04-15 | Paper |
Adaptivity in the stochastic blackjack knapsack problem
Theoretical Computer Science | 2013-12-13 | Paper |
Robust approximation schemes for cube packing
SIAM Journal on Optimization | 2013-09-25 | Paper |
Online clustering with variable sized clusters
Algorithmica | 2013-03-05 | Paper |
On the max coloring problem
Theoretical Computer Science | 2012-11-27 | Paper |
The (weighted) metric dimension of graphs: hard and easy cases
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Universal sequencing on an unreliable machine
SIAM Journal on Computing | 2012-09-12 | Paper |
