Leah Epstein

J. Comb. Optim., May, 2025

Lower Bounds for Several Standard Bin Packing Algorithms in the Random Order Model.

[BibT_eX]

[DOI]

Proceedings of the 19th International Symposium on Algorithms and Data Structures, 2025

An Efficient Polynomial Time Approximation Scheme for Minimizing the Total Weighted Completion Time on Uniformly Related Machines.

[BibT_eX]

[DOI]

Proceedings of the 19th International Symposium on Algorithms and Data Structures, 2025

Efficient Approximation Schemes for Scheduling on a Stochastic Number of Machines.

[BibT_eX]

[DOI]

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

An EPTAS for Minimizing the Total Weighted Completion Time of Jobs with Release Dates on Uniformly Related Machines.

[BibT_eX]

[DOI]

Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

2024

Tighter bounds for the harmonic bin packing algorithm.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2024

2023

More on batched bin packing.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2016

Online scheduling of unit jobs on three machines with rejection: A tight result.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

Bounds for online bin packing with cardinality constraints.

[BibT_eX]

[DOI]

József Békési

Inf. Comput., 2016

An algorithm for the weighted metric dimension of two-dimensional grids.

[BibT_eX]

[DOI]

CoRR, 2016

Vertex Cover Meets Scheduling.

[BibT_eX]

[DOI]

Algorithmica, 2016

Batch Coloring of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

Online Bounded Analysis.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2016

2015

Offline black and white bin packing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Online Results for Black and White Bin Packing.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2015

The weighted 2-metric dimension of trees in the non-landmarks model.

[BibT_eX]

[DOI]

Discret. Optim., 2015

Online File Caching with Rejection Penalties.

[BibT_eX]

[DOI]

Algorithmica, 2015

Selfish Vector Packing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2015, 2015

2014

Virtual Network Embedding with Opportunistic Resource Sharing.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2014

Preemptive online scheduling with rejection of unit jobs on two uniformly related machines.

[BibT_eX]

[DOI]

J. Sched., 2014

An efficient polynomial time approximation scheme for load balancing on uniformly related machines.

[BibT_eX]

[DOI]

Math. Program., 2014

Online scheduling with rejection and reordering: exact algorithms for unit size jobs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2014

The cost of selfishness for maximizing the minimum load on uniformly related machines.

[BibT_eX]

[DOI]

J. Comb. Optim., 2014

Minimum total weighted completion time: Faster approximation schemes.

[BibT_eX]

[DOI]

CoRR, 2014

Online bin packing with cardinality constraints revisited.

[BibT_eX]

[DOI]

CoRR, 2014

Models for the k-metric dimension.

[BibT_eX]

[DOI]

CoRR, 2014

Guest Editorial: Selected Papers of European Symposium of Algorithms.

[BibT_eX]

[DOI]

Paolo Ferragina

Algorithmica, 2014

Colorful Bin Packing.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory - SWAT 2014, 2014

Scheduling selfish jobs on multidimensional parallel machines.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

The Convergence Time for Selfish Bin Packing.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014

2013

Maximizing the minimum load: The cost of selfishness.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Selfish bin packing with cardinality constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Robust Approximation Schemes for Cube Packing.

[BibT_eX]

[DOI]

SIAM J. Optim., 2013

Bin covering with cardinality constraints.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Approximate strong equilibria in job scheduling games with two uniformly related machines.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Improved Bounds for Online Preemptive Matching.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

A unified approach to truthful scheduling on related machines.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Rent or Buy Problems with a Fixed Time Horizon.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Bin Packing Games with Selfish Items.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

2012

Universal Sequencing on an Unreliable Machine.

[BibT_eX]

[DOI]

Alberto Marchetti-Spaccamela

SIAM J. Comput., 2012

Comparing online algorithms for bin packing problems.

[BibT_eX]

[DOI]

Jens S. Kohrt

J. Sched., 2012

Bin packing with general cost structures.

[BibT_eX]

[DOI]

Math. Program., 2012

On the absolute approximation ratio for First Fit and related results.

[BibT_eX]

[DOI]

Joan Boyar

Discret. Appl. Math., 2012

Generalized selfish bin packing

[BibT_eX]

[DOI]

CoRR, 2012

Approximation Schemes for Packing Splittable Items with Cardinality Constraints.

[BibT_eX]

[DOI]

Algorithmica, 2012

The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

Online Scheduling of Jobs with Fixed Start Times on Related Machines.

[BibT_eX]

[DOI]

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

Packing Resizable Items with Application to Video Delivery over Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2012

2011

Online scheduling with rejection and withdrawal.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Selfish bin coloring.

[BibT_eX]

[DOI]

J. Comb. Optim., 2011

Online variable-sized bin packing with conflicts.

[BibT_eX]

[DOI]

Discret. Optim., 2011

On Variants of File Caching.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Robust Algorithms for Preemptive Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2011, 2011

On the quality and complexity of pareto equilibria in the job scheduling game.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

2010

Improved randomized results for the interval selection problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Class constrained bin packing revisited.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Two-dimensional online bin packing with rotation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Tight results for Next Fit and Worst Fit with resource augmentation.

[BibT_eX]

[DOI]

Joan Boyar

Theor. Comput. Sci., 2010

AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items.

[BibT_eX]

[DOI]

SIAM J. Optim., 2010

Class Constrained Bin Covering.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2010

Dynamic multi-dimensional bin packing.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2010

Online scheduling with a buffer on related machines.

[BibT_eX]

[DOI]

J. Comb. Optim., 2010

Randomized algorithms for online bounded bidding.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

On the sum minimization version of the online bin covering problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

Minimization of SONET ADMs in ring networks revisited.

[BibT_eX]

[DOI]

Betzalel Menahem

Computing, 2010

Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Online Clustering with Variable Sized Clusters.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Universal Sequencing on a Single Machine.

[BibT_eX]

[DOI]

Alberto Marchetti-Spaccamela

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Max-min Online Allocations with a Reordering Buffer.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Scheduling and Load Balancing.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2010 - Parallel Processing, 16th International Euro-Par Conference, Ischia, Italy, August 31, 2010

2009

Semi-online machine covering for two uniform machines.

[BibT_eX]

[DOI]

Xingyu Chen

Zhiyi Tan

Theor. Comput. Sci., 2009

Resource augmented semi-online bounded space bin packing.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

AFPTAS results for common variants of bin packing: A new method to handle the small items

[BibT_eX]

[DOI]

CoRR, 2009

A Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs

[BibT_eX]

[DOI]

CoRR, 2009

Maximizing the Minimum Load: The Cost of Selfishness.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Parametric Packing of Selfish Items and the Subset Sum Algorithm.

[BibT_eX]

[DOI]

Julián Mestre

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

On Equilibria for ADM Minimization Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

Preemptive Online Scheduling with Reordering.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2009

2008

Online Interval Coloring.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Load Balancing.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

List Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Online unit clustering: Variations on a theme.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

An APTAS for Generalized Cost Variable-Sized Bin Packing.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

The hierarchical model for load balancing on two machines.

[BibT_eX]

[DOI]

Orion Chassid

J. Comb. Optim., 2008

Asymptotic fully polynomial approximation schemes for variants of open-end bin packing.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Preemptive scheduling on a small number of hierarchical machines.

[BibT_eX]

[DOI]

Inf. Comput., 2008

Bin packing with controllable item sizes.

[BibT_eX]

[DOI]

José R. Correa

Inf. Comput., 2008

More on online bin packing with two item sizes.

[BibT_eX]

[DOI]

Discret. Optim., 2008

Two-dimensional packing with conflicts.

[BibT_eX]

[DOI]

Acta Informatica, 2008

Caching Content under Digital Rights Management.

[BibT_eX]

[DOI]

Amos Fiat

Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

The Price of Anarchy on Uniformly Related Machines Revisited.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

Maximizing the Minimum Load for Selfish Agents.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Improved Randomized Results for That Interval Selection Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2008

Selfish Bin Packing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2008

2007

Multidimensional Packing Problems.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Paging with connections: FIFO strikes again.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Semi-online scheduling with "end of sequence" information.

[BibT_eX]

[DOI]

Deshi Ye

J. Comb. Optim., 2007

Bounds for online bounded space hypercube packing.

[BibT_eX]

[DOI]

Discret. Optim., 2007

Calculating lower bounds for caching problems.

[BibT_eX]

[DOI]

Computing, 2007

Approximation Schemes for Packing Splittable Items with Cardinality Constraints.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

On the Online Unit Clustering Problem.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

Minimum Weighted Sum Bin Packing.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

On the Max Coloring Problem.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

Improved Results for a Memory Allocation Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Multi-dimensional Packing with Conflicts.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

Online Capacitated Interval Coloring.

[BibT_eX]

[DOI]

Thomas Erlebach

Proceedings of the Combinatorics, 2007

Maximizing the Minimum Load for Selfisch Agents.

[BibT_eX]

[DOI]

Proceedings of the Fair Division, 24.06. - 29.06.2007, 2007

Equilibria for two parallel links: The strong price of anarchy versus the price of anarchy.

[BibT_eX]

[DOI]

Proceedings of the Fair Division, 24.06. - 29.06.2007, 2007

Preemptive Scheduling on Selfish Machines.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, 2007

2006

On the remote server problem or more about TCP acknowledgments.

[BibT_eX]

[DOI]

Alexander Kesselman

Theor. Comput. Sci., 2006

Load balancing of temporary tasks in the lp norm.

[BibT_eX]

[DOI]

Amir Epstein

Theor. Comput. Sci., 2006

Separating online scheduling algorithms with the relative worst order ratio.

[BibT_eX]

[DOI]

Jens S. Kohrt

J. Comb. Optim., 2006

Optimal on-line flow time with resource augmentation.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

Covering selfish machines

[BibT_eX]

[DOI]

CoRR, 2006

Vector assignment schemes for asymmetric settings.

[BibT_eX]

[DOI]

Acta Informatica, 2006

On Bin Packing with Conflicts.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

Bin Packing with Rejection Revisited.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

Paging with Request Sets.

[BibT_eX]

[DOI]

Tami Tamir

Proceedings of the Algorithm Theory, 2006

Variable Sized Online Interval Coloring with Bandwidth.

[BibT_eX]

[DOI]

Thomas Erlebach

Proceedings of the Algorithm Theory, 2006

Transactional contention management as a non-clairvoyant scheduling problem.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

A Robust APTAS for the Classical Bin Packing Problem.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Graph Coloring with Rejection.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2006

Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs.

[BibT_eX]

[DOI]

Magnús M. Halldórsson

Hadas Shachnai

Proceedings of the Approximation, 2006

2005

The chord version for SONET ADMs minimization.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Optimal Online Algorithms for Multidimensional Packing Problems.

[BibT_eX]

[DOI]

SIAM J. Comput., 2005

Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data.

[BibT_eX]

[DOI]

Zhiyi Tan

Yong He

Inf. Comput., 2005

Tight bounds for bandwidth allocation on two links.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

Online square and cube packing.

[BibT_eX]

[DOI]

Acta Informatica, 2005

The Conference Call Search Problem in Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

SONET ADMs Minimization with Divisible Paths.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

Online Interval Coloring with Packing Constraints.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Online Interval Coloring and Variants.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

The Maximum Resource Bin Packing Problem.

[BibT_eX]

[DOI]

Morten Monrad Pedersen

Sanne Wøhlk

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

Online Bin Packing with Cardinality Constraints.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2005

Online scheduling of splittable tasks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

Tracking mobile users.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

2004

This Side Up!

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Online Bin Packing with Resource Augmentation.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Better Bounds for Minimizing SONET ADMs.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

A PTAS for Delay Minimization in Establishing Wireless Conference Calls.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Online Scheduling of Splittable Tasks in Peer-to-Peer Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2004

Optimally Competitive List Batching.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2004

Optimal online bounded space multidimensional packing.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Path Layout on Tree Networks: Bounds in Different Label Switching Models.

[BibT_eX]

[DOI]

Anat Bremler-Barr

Proceedings of the Structural Information and Communication Complexity, 2004

Optimal Preemptive Scheduling for General Target Functions.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

On Variable-Sized Multidimensional Packing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2004

2003

New Bounds for Variable-Sized Online Bin Packing.

[BibT_eX]

[DOI]

Steven S. Seiden

SIAM J. Comput., 2003

Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem.

[BibT_eX]

[DOI]

J. Sched., 2003

On-line restricted assignment of temporary tasks with unknown durations.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Temporary Tasks Assignment Resolved.

[BibT_eX]

[DOI]

Amitai Armon

Algorithmica, 2003

On variable sized vector packing.

[BibT_eX]

[DOI]

Acta Cybern., 2003

Bin stretching revisited.

[BibT_eX]

[DOI]

Acta Informatica, 2003

Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation.

[BibT_eX]

[DOI]

Arik Ganot

Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

Load Balancing of Temporary Tasks in the lp Norm.

[BibT_eX]

[DOI]

Amir Epstein

Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

Approximation Schemes for the Min-Max Starting Time Problem.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Two Dimensional Packing: The Power of Rotation.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

2002

On-line scheduling of unit time jobs with rejection: minimizing the total completion time.

[BibT_eX]

[DOI]

John Noga

Oper. Res. Lett., 2002

Optimal preemptive semi-online scheduling to minimize makespan on two related machines.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2002

Fair versus Unrestricted Bin Packing.

[BibT_eX]

[DOI]

Algorithmica, 2002

All-Norm Approximation Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2002

Temporary tasks assignment resolved.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

More on Weighted Servers or FIFO is Better than LRU.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

Optimal Non-preemptive Semi-online Scheduling on Two Related Machines.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

New Bounds for Variable-Sized and Resource Augmented Online Bin Packing.

[BibT_eX]

[DOI]

Steven S. Seiden

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Preemptive Scheduling in Overloaded Systems.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Vector Assignment Problems: A General Framework.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2002

Minimizing the Maximum Starting Time On-line.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2002

On-Line Maximizing the Number of Items Packed in Variable-Sized Bins.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001

Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2001

Online Variable Sized Covering.

[BibT_eX]

[DOI]

Inf. Comput., 2001

Optimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios.

[BibT_eX]

[DOI]

Proceedings of the STACS 2001, 2001

Lower Bounds for On-Line Single-Machine Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

Optimal Online Flow Time with Resource Augmentation.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

On-Line Variable Sized Covering.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000

A lower bound for on-line scheduling on uniformly related machines.

[BibT_eX]

[DOI]

Jirí Sgall

Oper. Res. Lett., 2000

A note on on-line scheduling with precedence constraints on identical machines.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

Resource Augmentation in Load Balancing.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2000

On-Line Scheduling with Precedence Constraints.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2000

1999

Randomized Online Scheduling on Two Uniform Machines.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines.

[BibT_eX]

[DOI]

Jirí Sgall

Proceedings of the Algorithms, 1999

1998

On-Line and Off-Line Approximation Algorithms for Vector Covering Problems.

[BibT_eX]

[DOI]

Sergey V. Sevastianov

Arjen P. A. Vestjens

Algorithmica, 1998

Lower Bounds for On-line Scheduling with Precedence Constraints on Identical Machines.

[BibT_eX]

[DOI]

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 1998

Approximation Schemes for Covering and Scheduling on Related Machines.

[BibT_eX]

[DOI]

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 1998

1997

On-Line Load Balancing of Temporary Tasks on Identical Machines.

[BibT_eX]

[DOI]

Proceedings of the Fifth Israel Symposium on Theory of Computing and Systems, 1997

On-Line Machine Covering.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1997

1996

On Two Dimensional Packing.

[BibT_eX]

[DOI]