| Publication | Date of Publication | Type |
|---|
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 |
A survey on makespan minimization in semi-online environments
Journal of Scheduling | 2018-11-07 | Paper |
Online-bounded analysis
Journal of Scheduling | 2018-11-07 | Paper |
More on batched bin packing
Operations Research Letters | 2018-10-01 | Paper |
The convergence time for selfish bin packing
Acta Cybernetica | 2018-09-03 | Paper |
The metric dimension of two-dimensional extended meshes
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 |
Colorful bin packing
Algorithm Theory – SWAT 2014 | 2014-09-02 | Paper |
Preemptive online scheduling with rejection of unit jobs on two uniformly related machines
Journal of Scheduling | 2014-08-18 | Paper |
The cost of selfishness for maximizing the minimum load on uniformly related machines
Journal of Combinatorial Optimization | 2014-06-24 | Paper |
Approximate strong equilibria in job scheduling games with two uniformly related machines
Discrete Applied Mathematics | 2014-04-22 | Paper |
Bin covering with cardinality constraints
Discrete Applied Mathematics | 2014-04-22 | Paper |
Comparing online algorithms for bin packing problems
Journal of Scheduling | 2014-02-05 | Paper |
Selfish bin packing with cardinality constraints
Theoretical Computer Science | 2014-01-10 | Paper |
Maximizing the minimum load: the cost of selfishness
Theoretical Computer Science | 2014-01-09 | Paper |
Robust approximation schemes for cube packing
SIAM Journal on Optimization | 2013-09-25 | Paper |
Rent or buy problems with a fixed time horizon
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Bin packing games with selfish items
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | 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 |
Online scheduling of jobs with fixed start times on related machines
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
Universal sequencing on an unreliable machine
SIAM Journal on Computing | 2012-09-12 | Paper |
On the absolute approximation ratio for first fit and related results
Discrete Applied Mathematics | 2012-08-10 | Paper |
Online variable-sized bin packing with conflicts
Discrete Optimization | 2012-06-20 | Paper |
The price of anarchy on uniformly related machines revisited
Information and Computation | 2012-05-24 | Paper |
Bin packing with general cost structures
Mathematical Programming. Series A. Series B | 2012-04-27 | Paper |
On equilibria for ADM minimization games
Algorithmica | 2012-04-26 | Paper |
Approximation schemes for packing splittable items with cardinality constraints
Algorithmica | 2012-04-26 | Paper |
Selfish bin coloring
Journal of Combinatorial Optimization | 2012-04-04 | Paper |
Improved approximation guarantees for weighted matching in the semi-streaming model
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
Max-min online allocations with a reordering buffer
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
Randomized algorithms for online bounded bidding
Information Processing Letters | 2012-03-12 | Paper |
| IMPROVED APPROXIMATION GUARANTEES FOR WEIGHTED MATCHING IN THE SEMI-STREAMING MODEL * | 2012-01-23 | Paper |
Online scheduling with rejection and withdrawal
Theoretical Computer Science | 2011-12-07 | Paper |
Preemptive online scheduling with reordering
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
Robust algorithms for preemptive scheduling
Algorithms – ESA 2011 | 2011-09-16 | Paper |
On variants of file caching
Automata, Languages and Programming | 2011-07-06 | Paper |
Selfish bin packing
Algorithmica | 2011-05-10 | Paper |
Improved results for a memory allocation problem
Theory of Computing Systems | 2011-04-01 | Paper |
Graph coloring with rejection
Journal of Computer and System Sciences | 2011-03-28 | Paper |
AFPTAS results for common variants of bin packing: a new method for handling the small items
SIAM Journal on Optimization | 2011-03-21 | Paper |
Dynamic multi-dimensional bin packing
Journal of Discrete Algorithms | 2011-01-20 | Paper |
Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
Acta Informatica | 2010-12-13 | Paper |
Online scheduling with a buffer on related machines
Journal of Combinatorial Optimization | 2010-10-26 | Paper |
Max-min online allocations with a reordering buffer
Automata, Languages and Programming | 2010-09-07 | Paper |
Online clustering with variable sized clusters
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
On the sum minimization version of the online bin covering problem
Discrete Applied Mathematics | 2010-08-13 | Paper |
Improved randomized results for the interval selection problem
Theoretical Computer Science | 2010-08-11 | Paper |
Class constrained bin packing revisited
Theoretical Computer Science | 2010-08-11 | Paper |
Two-dimensional online bin packing with rotation
Theoretical Computer Science | 2010-07-07 | Paper |
Universal sequencing on a single machine
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
Asymptotic fully polynomial approximation schemes for variants of open-end bin packing
Information Processing Letters | 2010-06-09 | Paper |
Tight results for next fit and worst fit with resource augmentation
Theoretical Computer Science | 2010-06-07 | Paper |
Online capacitated interval coloring
SIAM Journal on Discrete Mathematics | 2010-06-01 | Paper |
Class constrained bin covering
Theory of Computing Systems | 2010-05-10 | Paper |
Resource augmented semi-online bounded space bin packing
Discrete Applied Mathematics | 2010-04-28 | Paper |
Minimization of SONET ADMs in ring networks revisited
Computing | 2010-04-12 | Paper |
Transactional contention management as a Non-clairvoyant scheduling problem
Algorithmica | 2010-03-04 | Paper |
Bin packing with rejection revisited
Algorithmica | 2010-02-23 | Paper |
On online bin packing with LIB constraints
Naval Research Logistics | 2010-01-08 | Paper |
On equilibria for ADM minimization games
Algorithmic Game Theory | 2009-12-01 | Paper |
Maximizing the minimum load for selfish agents
Theoretical Computer Science | 2009-12-01 | Paper |
Semi-online machine covering for two uniform machines
Theoretical Computer Science | 2009-11-06 | Paper |
Preemptive Online Scheduling with Reordering
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Weighted sum coloring in batch scheduling of conflicting jobs
Algorithmica | 2009-10-23 | Paper |
Optimally competitive list batching
Theoretical Computer Science | 2009-09-10 | Paper |
On Bin Packing with Conflicts
SIAM Journal on Optimization | 2009-08-20 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Paging with request sets
Theory of Computing Systems | 2009-08-06 | Paper |
Variable sized online interval coloring with bandwidth
Algorithmica | 2009-06-17 | Paper |
A robust APTAS for the classical bin packing problem
Mathematical Programming. Series A. Series B | 2009-04-24 | Paper |
An APTAS for Generalized Cost Variable-Sized Bin Packing
SIAM Journal on Computing | 2009-03-16 | Paper |
A Robust APTAS for the Classical Bin Packing Problem
Automata, Languages and Programming | 2009-03-12 | Paper |
Better bounds for minimizing SONET ADMs
Journal of Computer and System Sciences | 2009-03-11 | Paper |
Bin packing with controllable item sizes
Information and Computation | 2009-03-04 | Paper |
Online Capacitated Interval Coloring
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies | 2009-03-03 | Paper |
Improved Results for a Memory Allocation Problem
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Caching Content under Digital Rights Management
Approximation and Online Algorithms | 2009-02-12 | Paper |
| Path layout on tree networks: bounds in different label switching models | 2009-01-15 | Paper |
Improved Randomized Results for That Interval Selection Problem
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Selfish Bin Packing
Algorithms - ESA 2008 | 2008-11-25 | Paper |
More on online bin packing with two item sizes
Discrete Optimization | 2008-11-19 | Paper |
Online interval coloring with packing constraints
Theoretical Computer Science | 2008-11-18 | Paper |
Online unit clustering: Variations on a theme
Theoretical Computer Science | 2008-11-18 | Paper |
Two-dimensional packing with conflicts
Acta Informatica | 2008-06-17 | Paper |
Optimal on-line algorithms to minimize makespan on two machines with resource augmentation
Theory of Computing Systems | 2008-06-06 | Paper |
The hierarchical model for load balancing on two machines
Journal of Combinatorial Optimization | 2008-06-04 | Paper |
Preemptive scheduling on a small number of hierarchical machines
Information and Computation | 2008-05-19 | Paper |
A PTAS for delay minimization in establishing wireless conference calls
Discrete Optimization | 2008-05-16 | Paper |
Online bin packing with resource augmentation
Discrete Optimization | 2008-05-14 | Paper |
The Price of Anarchy on Uniformly Related Machines Revisited
Algorithmic Game Theory | 2008-05-02 | Paper |
Maximizing the Minimum Load for Selfish Agents
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Preemptive Scheduling on Selfish Machines
Combinatorial and Algorithmic Aspects of Networking | 2008-04-15 | Paper |
Graph Coloring with Rejection
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Multi-dimensional Packing with Conflicts
Fundamentals of Computation Theory | 2008-02-26 | Paper |
Bin Packing with Rejection Revisited
Approximation and Online Algorithms | 2008-02-21 | Paper |
| On Bin Packing with Conflicts | 2008-02-21 | Paper |
Minimum Weighted Sum Bin Packing
Approximation and Online Algorithms | 2008-02-20 | Paper |
Approximation Schemes for Packing Splittable Items with Cardinality Constraints
Approximation and Online Algorithms | 2008-02-20 | Paper |
On the Online Unit Clustering Problem
Approximation and Online Algorithms | 2008-02-20 | Paper |
On the Max Coloring Problem
Approximation and Online Algorithms | 2008-02-20 | Paper |
Bounds for online bounded space hypercube packing
Discrete Optimization | 2008-01-18 | Paper |
Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem
Journal of Scheduling | 2007-12-20 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
SONET ADMs minimization with divisible paths
Algorithmica | 2007-11-28 | Paper |
Calculating lower bounds for caching problems
Computing | 2007-11-19 | Paper |
Online Bin Packing with Cardinality Constraints
SIAM Journal on Discrete Mathematics | 2007-11-16 | Paper |
Semi-online scheduling with ``end of sequence information
Journal of Combinatorial Optimization | 2007-11-14 | Paper |
Separating online scheduling algorithms with the relative worst order ratio
Journal of Combinatorial Optimization | 2007-10-12 | Paper |
Variable Sized Online Interval Coloring with Bandwidth
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Paging with Request Sets
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
Paging with connections: FIFO strikes again
Theoretical Computer Science | 2007-06-06 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2007-02-12 | Paper |
On the remote server problem or more about TCP acknowledgments
Theoretical Computer Science | 2007-01-09 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
The maximum resource bin packing problem
Theoretical Computer Science | 2006-10-20 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Load balancing of temporary tasks in the \(\ell _{p}\) norm
Theoretical Computer Science | 2006-09-14 | Paper |
The conference call search problem in wireless networks
Theoretical Computer Science | 2006-09-14 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Optimal Online Algorithms for Multidimensional Packing Problems
SIAM Journal on Computing | 2006-06-01 | Paper |
Vector assignment schemes for asymmetric settings
Acta Informatica | 2006-05-26 | Paper |
Optimal on-line flow time with resource augmentation
Discrete Applied Mathematics | 2006-04-28 | Paper |
The chord version for SONET ADMs minimization
Theoretical Computer Science | 2006-03-20 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Optimal preemptive scheduling for general target functions
Journal of Computer and System Sciences | 2006-01-10 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Optimal non-preemptive semi-online scheduling on two related machines
Journal of Algorithms | 2005-11-16 | Paper |
Online square and cube packing
Acta Informatica | 2005-10-31 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Tight bounds for bandwidth allocation on two links
Discrete Applied Mathematics | 2005-08-17 | Paper |
Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data
Information and Computation | 2005-03-08 | Paper |
On-Line Load Balancing of Temporary Tasks on Identical Machines
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
Minimizing the maximum starting time on-line
Information and Computation | 2005-02-22 | Paper |
Approximation schemes for the min-max starting time problem
Acta Informatica | 2005-02-11 | Paper |
| scientific article; zbMATH DE number 2119652 (Why is no real title available?) | 2004-11-29 | Paper |
Approximation schemes for scheduling on uniformly related and identical parallel machines
Algorithmica | 2004-09-22 | Paper |
All-norm approximation algorithms
Journal of Algorithms | 2004-09-08 | Paper |
All-Norm Approximation Algorithms
Algorithm Theory — SWAT 2002 | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2090002 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2086672 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2086631 (Why is no real title available?) | 2004-08-11 | Paper |
Vector assignment problems: a general framework
Journal of Algorithms | 2004-03-14 | Paper |
More on weighted servers or FIFO is better than LRU.
Theoretical Computer Science | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 2016848 (Why is no real title available?) | 2003-12-14 | Paper |
| scientific article; zbMATH DE number 2016849 (Why is no real title available?) | 2003-12-14 | Paper |
Bin stretching revisited
Acta Informatica | 2003-09-01 | Paper |
Preemptive scheduling in overloaded systems.
Journal of Computer and System Sciences | 2003-08-19 | Paper |
Temporary tasks assignment resolved
Algorithmica | 2003-08-17 | Paper |
Resource augmentation in load balancing.
Journal of Scheduling | 2003-07-27 | Paper |
| scientific article; zbMATH DE number 1947414 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1947413 (Why is no real title available?) | 2003-07-08 | Paper |
New Bounds for Variable-Sized Online Bin Packing
SIAM Journal on Computing | 2003-06-19 | Paper |
| scientific article; zbMATH DE number 1929943 (Why is no real title available?) | 2003-06-18 | Paper |
| scientific article; zbMATH DE number 1929942 (Why is no real title available?) | 2003-06-18 | Paper |
Lower bounds for on-line single-machine scheduling.
Theoretical Computer Science | 2003-05-25 | Paper |
On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
Operations Research Letters | 2003-05-04 | Paper |
Optimal preemptive semi-online scheduling to minimize makespan on two related machines
Operations Research Letters | 2003-04-03 | Paper |
On-line restricted assignment of temporary tasks with unknown durations.
Information Processing Letters | 2003-01-21 | Paper |
Online variable sized covering
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1839473 (Why is no real title available?) | 2002-12-02 | Paper |
| scientific article; zbMATH DE number 1834660 (Why is no real title available?) | 2002-11-25 | Paper |
| scientific article; zbMATH DE number 1798171 (Why is no real title available?) | 2002-11-04 | Paper |
Fair versus unrestricted bin packing
Algorithmica | 2002-09-25 | Paper |
A note on on-line scheduling with precedence constraints on identical machines
Information Processing Letters | 2002-07-25 | Paper |
On-line scheduling with precedence constraints
Discrete Applied Mathematics | 2002-06-24 | Paper |
| scientific article; zbMATH DE number 1688367 (Why is no real title available?) | 2002-01-09 | Paper |
Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
Operations Research Letters | 2001-12-05 | Paper |
Randomized on-line scheduling on two uniform machines
Journal of Scheduling | 2001-07-12 | Paper |
| scientific article; zbMATH DE number 1617258 (Why is no real title available?) | 2001-07-11 | Paper |
| scientific article; zbMATH DE number 1617256 (Why is no real title available?) | 2001-07-11 | Paper |
A lower bound for on-line scheduling on uniformly related machines
Operations Research Letters | 2001-04-18 | Paper |
| scientific article; zbMATH DE number 1305421 (Why is no real title available?) | 2000-09-26 | Paper |
| scientific article; zbMATH DE number 1405790 (Why is no real title available?) | 2000-02-23 | Paper |
| scientific article; zbMATH DE number 1182760 (Why is no real title available?) | 1999-05-05 | Paper |
| scientific article; zbMATH DE number 1182764 (Why is no real title available?) | 1999-03-23 | Paper |
On-line machine covering
Journal of Scheduling | 1998-11-01 | Paper |
On-line and off-line approximation algorithms for vector covering problems
Algorithmica | 1998-10-01 | Paper |
On Two Dimensional Packing
Journal of Algorithms | 1997-12-18 | Paper |
