Leah Epstein

According to our database1, Leah Epstein
  • authored at least 260 papers between 1996 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines.
SIAM J. Discrete Math., 2017

Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times.
J. Scheduling, 2017

An AFPTAS for variable sized bin packing with general activation costs.
J. Comput. Syst. Sci., 2017

The k-metric dimension.
J. Comb. Optim., 2017

Lower bounds for several online variants of bin packing.
CoRR, 2017

A new and improved algorithm for online bin packing.
CoRR, 2017

2016
Selfish Bin Packing Problems.
Encyclopedia of Algorithms, 2016

Online Load Balancing of Temporary Tasks.
Encyclopedia of Algorithms, 2016

Online Interval Coloring.
Encyclopedia of Algorithms, 2016

List Scheduling.
Encyclopedia of Algorithms, 2016

Harmonic Algorithm for Online Bin Packing.
Encyclopedia of Algorithms, 2016

Bin Packing, Variants.
Encyclopedia of Algorithms, 2016

The benefit of preemption for single machine scheduling so as to minimize total weighted completion time.
Oper. Res. Lett., 2016

More on batched bin packing.
Oper. Res. Lett., 2016

A Unified Approach to Truthful Scheduling on Related Machines.
Math. Oper. Res., 2016

Online scheduling of unit jobs on three machines with rejection: A tight result.
Inf. Process. Lett., 2016

Bounds for online bin packing with cardinality constraints.
Inf. Comput., 2016

Batch Coloring of Graphs.
CoRR, 2016

Online Bounded Analysis.
CoRR, 2016

Online bin packing with cardinality constraints resolved.
CoRR, 2016

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

Vertex Cover Meets Scheduling.
Algorithmica, 2016

Parametric Packing of Selfish Items and the Subset Sum Algorithm.
Algorithmica, 2016

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

Batch Coloring of Graphs.
Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

Online Bounded Analysis.
Proceedings of the Computer Science - Theory and Applications, 2016

2015
Offline black and white bin packing.
Theor. Comput. Sci., 2015

Rent or Buy Problems with a Fixed Time Horizon.
Theory Comput. Syst., 2015

Online Results for Black and White Bin Packing.
Theory Comput. Syst., 2015

The weighted 2-metric dimension of trees in the non-landmarks model.
Discrete Optimization, 2015

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

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

Online File Caching with Rejection Penalties.
Algorithmica, 2015

Selfish Vector Packing.
Proceedings of the Algorithms - ESA 2015, 2015

2014
Virtual Network Embedding with Opportunistic Resource Sharing.
IEEE Trans. Parallel Distrib. Syst., 2014

Packing resizable items with application to video delivery over wireless networks.
Theor. Comput. Sci., 2014

Preemptive online scheduling with rejection of unit jobs on two uniformly related machines.
J. Scheduling, 2014

An efficient polynomial time approximation scheme for load balancing on uniformly related machines.
Math. Program., 2014

Online scheduling with rejection and reordering: exact algorithms for unit size jobs.
J. Comb. Optim., 2014

The cost of selfishness for maximizing the minimum load on uniformly related machines.
J. Comb. Optim., 2014

Minimum total weighted completion time: Faster approximation schemes.
CoRR, 2014

Colorful bin packing.
CoRR, 2014

Online bin packing with cardinality constraints revisited.
CoRR, 2014

Models for the k-metric dimension.
CoRR, 2014

Robust Algorithms for Preemptive Scheduling.
Algorithmica, 2014

Guest Editorial: Selected Papers of European Symposium of Algorithms.
Algorithmica, 2014

Colorful Bin Packing.
Proceedings of the Algorithm Theory - SWAT 2014, 2014

Scheduling selfish jobs on multidimensional parallel machines.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

The Convergence Time for Selfish Bin Packing.
Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014

2013
Maximizing the minimum load: The cost of selfishness.
Theor. Comput. Sci., 2013

Selfish bin packing with cardinality constraints.
Theor. Comput. Sci., 2013

Robust Approximation Schemes for Cube Packing.
SIAM Journal on Optimization, 2013

Bin covering with cardinality constraints.
Discrete Applied Mathematics, 2013

Approximate strong equilibria in job scheduling games with two uniformly related machines.
Discrete Applied Mathematics, 2013

Online Clustering with Variable Sized Clusters.
Algorithmica, 2013

Improved Bounds for Online Preemptive Matching.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

A unified approach to truthful scheduling on related machines.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Rent or Buy Problems with a Fixed Time Horizon.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Bin Packing Games with Selfish Items.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

2012
On the max coloring problem.
Theor. Comput. Sci., 2012

Universal Sequencing on an Unreliable Machine.
SIAM J. Comput., 2012

Comparing online algorithms for bin packing problems.
J. Scheduling, 2012

Bin packing with general cost structures.
Math. Program., 2012

The price of anarchy on uniformly related machines revisited.
Inf. Comput., 2012

On the absolute approximation ratio for First Fit and related results.
Discrete Applied Mathematics, 2012

A unified approach to truthful scheduling on related machines
CoRR, 2012

Improved Bounds for Online Preemptive Matching
CoRR, 2012

Generalized selfish bin packing
CoRR, 2012

An efficient polynomial time approximation scheme for load balancing on uniformly related machines
CoRR, 2012

Approximation Schemes for Packing Splittable Items with Cardinality Constraints.
Algorithmica, 2012

On Equilibria for ADM Minimization Games.
Algorithmica, 2012

The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

Online Scheduling of Jobs with Fixed Start Times on Related Machines.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

Packing Resizable Items with Application to Video Delivery over Wireless Networks.
Proceedings of the Algorithms for Sensor Systems, 2012

2011
Online scheduling with rejection and withdrawal.
Theor. Comput. Sci., 2011

Max-min Online Allocations with a Reordering Buffer.
SIAM J. Discrete Math., 2011

Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model.
SIAM J. Discrete Math., 2011

Preemptive Online Scheduling with Reordering.
SIAM J. Discrete Math., 2011

Improved Results for a Memory Allocation Problem.
Theory Comput. Syst., 2011

Graph coloring with rejection.
J. Comput. Syst. Sci., 2011

Selfish bin coloring.
J. Comb. Optim., 2011

Online variable-sized bin packing with conflicts.
Discrete Optimization, 2011

Selfish Bin Packing.
Algorithmica, 2011

On Variants of File Caching.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Robust Algorithms for Preemptive Scheduling.
Proceedings of the Algorithms - ESA 2011, 2011

On the quality and complexity of pareto equilibria in the job scheduling game.
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

2010
Maximizing the minimum load for selfish agents.
Theor. Comput. Sci., 2010

Improved randomized results for the interval selection problem.
Theor. Comput. Sci., 2010

Class constrained bin packing revisited.
Theor. Comput. Sci., 2010

Two-dimensional online bin packing with rotation.
Theor. Comput. Sci., 2010

Tight results for Next Fit and Worst Fit with resource augmentation.
Theor. Comput. Sci., 2010

On the online unit clustering problem.
ACM Trans. Algorithms, 2010

AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items.
SIAM Journal on Optimization, 2010

Class Constrained Bin Covering.
Theory Comput. Syst., 2010

Dynamic multi-dimensional bin packing.
J. Discrete Algorithms, 2010

Online scheduling with a buffer on related machines.
J. Comb. Optim., 2010

Randomized algorithms for online bounded bidding.
Inf. Process. Lett., 2010

On the sum minimization version of the online bin covering problem.
Discrete Applied Mathematics, 2010

Minimization of SONET ADMs in ring networks revisited.
Computing, 2010

Bin Packing with Rejection Revisited.
Algorithmica, 2010

Transactional Contention Management as a Non-Clairvoyant Scheduling Problem.
Algorithmica, 2010

Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy.
Acta Inf., 2010

Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Online Clustering with Variable Sized Clusters.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Universal Sequencing on a Single Machine.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Max-min Online Allocations with a Reordering Buffer.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Scheduling and Load Balancing.
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.
Theor. Comput. Sci., 2009

Optimally competitive list batching.
Theor. Comput. Sci., 2009

Online Capacitated Interval Coloring.
SIAM J. Discrete Math., 2009

Paging with Request Sets.
Theory Comput. Syst., 2009

A robust APTAS for the classical bin packing problem.
Math. Program., 2009

Better bounds for minimizing SONET ADMs.
J. Comput. Syst. Sci., 2009

Resource augmented semi-online bounded space bin packing.
Discrete Applied Mathematics, 2009

Parametric packing of selfish items and the subset sum algorithm
CoRR, 2009

Improved approximation guarantees for weighted matching in the semi-streaming model
CoRR, 2009

Bin packing with general cost structures
CoRR, 2009

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

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

Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs.
Algorithmica, 2009

Variable Sized Online Interval Coloring with Bandwidth.
Algorithmica, 2009

Maximizing the Minimum Load: The Cost of Selfishness.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Parametric Packing of Selfish Items and the Subset Sum Algorithm.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

On Equilibria for ADM Minimization Games.
Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

Preemptive Online Scheduling with Reordering.
Proceedings of the Algorithms, 2009

2008
Online Interval Coloring.
Proceedings of the Encyclopedia of Algorithms, 2008

Load Balancing.
Proceedings of the Encyclopedia of Algorithms, 2008

List Scheduling.
Proceedings of the Encyclopedia of Algorithms, 2008

Online unit clustering: Variations on a theme.
Theor. Comput. Sci., 2008

Online interval coloring with packing constraints.
Theor. Comput. Sci., 2008

On Bin Packing with Conflicts.
SIAM Journal on Optimization, 2008

An APTAS for Generalized Cost Variable-Sized Bin Packing.
SIAM J. Comput., 2008

Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation.
Theory Comput. Syst., 2008

The hierarchical model for load balancing on two machines.
J. Comb. Optim., 2008

Asymptotic fully polynomial approximation schemes for variants of open-end bin packing.
Inf. Process. Lett., 2008

Preemptive scheduling on a small number of hierarchical machines.
Inf. Comput., 2008

Bin packing with controllable item sizes.
Inf. Comput., 2008

More on online bin packing with two item sizes.
Discrete Optimization, 2008

A PTAS for delay minimization in establishing wireless conference calls.
Discrete Optimization, 2008

Two-dimensional packing with conflicts.
Acta Inf., 2008

Caching Content under Digital Rights Management.
Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

The Price of Anarchy on Uniformly Related Machines Revisited.
Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

Maximizing the Minimum Load for Selfish Agents.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Improved Randomized Results for That Interval Selection Problem.
Proceedings of the Algorithms, 2008

Selfish Bin Packing.
Proceedings of the Algorithms, 2008

2007
Multidimensional Packing Problems.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Paging with connections: FIFO strikes again.
Theor. Comput. Sci., 2007

Path layout on tree networks: Bounds in different label switching models.
Nord. J. Comput., 2007

Semi-online scheduling with "end of sequence" information.
J. Comb. Optim., 2007

Online bin packing with resource augmentation.
Discrete Optimization, 2007

Bounds for online bounded space hypercube packing.
Discrete Optimization, 2007

Calculating lower bounds for caching problems.
Computing, 2007

SONET ADMs Minimization with Divisible Paths.
Algorithmica, 2007

Approximation Schemes for Packing Splittable Items with Cardinality Constraints.
Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

On the Online Unit Clustering Problem.
Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

Minimum Weighted Sum Bin Packing.
Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

On the Max Coloring Problem.
Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

Improved Results for a Memory Allocation Problem.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Multi-dimensional Packing with Conflicts.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

Online Capacitated Interval Coloring.
Proceedings of the Combinatorics, 2007

Maximizing the Minimum Load for Selfisch Agents.
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.
Proceedings of the Fair Division, 24.06. - 29.06.2007, 2007

Preemptive Scheduling on Selfish Machines.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, 2007

2006
The conference call search problem in wireless networks.
Theor. Comput. Sci., 2006

On the remote server problem or more about TCP acknowledgments.
Theor. Comput. Sci., 2006

The maximum resource bin packing problem.
Theor. Comput. Sci., 2006

Load balancing of temporary tasks in the lp norm.
Theor. Comput. Sci., 2006

This side up!
ACM Trans. Algorithms, 2006

Online scheduling of splittable tasks.
ACM Trans. Algorithms, 2006

Online Bin Packing with Cardinality Constraints.
SIAM J. Discrete Math., 2006

Optimal preemptive scheduling for general target functions.
J. Comput. Syst. Sci., 2006

Separating online scheduling algorithms with the relative worst order ratio.
J. Comb. Optim., 2006

Optimal on-line flow time with resource augmentation.
Discrete Applied Mathematics, 2006

Improved results for a memory allocation problem
CoRR, 2006

Covering selfish machines
CoRR, 2006

Vector assignment schemes for asymmetric settings.
Acta Inf., 2006

On Bin Packing with Conflicts.
Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

Bin Packing with Rejection Revisited.
Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

Paging with Request Sets.
Proceedings of the Algorithm Theory, 2006

Variable Sized Online Interval Coloring with Bandwidth.
Proceedings of the Algorithm Theory, 2006

Transactional contention management as a non-clairvoyant scheduling problem.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

A Robust APTAS for the Classical Bin Packing Problem.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Graph Coloring with Rejection.
Proceedings of the Algorithms, 2006

Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs.
Proceedings of the Approximation, 2006

2005
The chord version for SONET ADMs minimization.
Theor. Comput. Sci., 2005

Optimal Online Algorithms for Multidimensional Packing Problems.
SIAM J. Comput., 2005

Optimal non-preemptive semi-online scheduling on two related machines.
J. Algorithms, 2005

Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data.
Inf. Comput., 2005

Tight bounds for bandwidth allocation on two links.
Discrete Applied Mathematics, 2005

Online square and cube packing.
Acta Inf., 2005

The Conference Call Search Problem in Wireless Networks.
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

SONET ADMs Minimization with Divisible Paths.
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

Online Interval Coloring with Packing Constraints.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Online Interval Coloring and Variants.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

The Maximum Resource Bin Packing Problem.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

Online Bin Packing with Cardinality Constraints.
Proceedings of the Algorithms, 2005

Online scheduling of splittable tasks.
Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

Tracking mobile users.
Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

2004
On-Line Load Balancing of Temporary Tasks on Identical Machines.
SIAM J. Discrete Math., 2004

All-norm approximation algorithms.
J. Algorithms, 2004

Minimizing the maximum starting time on-line.
Inf. Comput., 2004

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

Approximation schemes for the Min-Max Starting Time Problem.
Acta Inf., 2004

This Side Up!
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Online Bin Packing with Resource Augmentation.
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Better Bounds for Minimizing SONET ADMs.
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

A PTAS for Delay Minimization in Establishing Wireless Conference Calls.
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Online Scheduling of Splittable Tasks in Peer-to-Peer Networks.
Proceedings of the Algorithm Theory, 2004

Optimally Competitive List Batching.
Proceedings of the Algorithm Theory, 2004

Optimal online bounded space multidimensional packing.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Path Layout on Tree Networks: Bounds in Different Label Switching Models.
Proceedings of the Structural Information and Communication Complexity, 2004

Optimal Preemptive Scheduling for General Target Functions.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

On Variable-Sized Multidimensional Packing.
Proceedings of the Algorithms, 2004

2003
Lower bounds for on-line single-machine scheduling.
Theor. Comput. Sci., 2003

More on weighted servers or FIFO is better than LRU.
Theor. Comput. Sci., 2003

New Bounds for Variable-Sized Online Bin Packing.
SIAM J. Comput., 2003

Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem.
J. Scheduling, 2003

Preemptive scheduling in overloaded systems.
J. Comput. Syst. Sci., 2003

Vector assignment problems: a general framework.
J. Algorithms, 2003

On-line restricted assignment of temporary tasks with unknown durations.
Inf. Process. Lett., 2003

Temporary Tasks Assignment Resolved.
Algorithmica, 2003

On-Line Maximizing the Number of Items Packed in Variable-Sized Bins.
Acta Cybern., 2003

On variable sized vector packing.
Acta Cybern., 2003

Bin stretching revisited.
Acta Inf., 2003

Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation.
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

Load Balancing of Temporary Tasks in the lp Norm.
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

Approximation Schemes for the Min-Max Starting Time Problem.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Two Dimensional Packing: The Power of Rotation.
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.
Oper. Res. Lett., 2002

Optimal preemptive semi-online scheduling to minimize makespan on two related machines.
Oper. Res. Lett., 2002

On-line scheduling with precedence constraints.
Discrete Applied Mathematics, 2002

Fair versus Unrestricted Bin Packing.
Algorithmica, 2002

All-Norm Approximation Algorithms.
Proceedings of the Algorithm Theory, 2002

Temporary tasks assignment resolved.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

More on Weighted Servers or FIFO is Better than LRU.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

Optimal Non-preemptive Semi-online Scheduling on Two Related Machines.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

New Bounds for Variable-Sized and Resource Augmented Online Bin Packing.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Preemptive Scheduling in Overloaded Systems.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Vector Assignment Problems: A General Framework.
Proceedings of the Algorithms, 2002

Minimizing the Maximum Starting Time On-line.
Proceedings of the Algorithms, 2002

On-Line Maximizing the Number of Items Packed in Variable-Sized Bins.
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.
Oper. Res. Lett., 2001

Online Variable Sized Covering.
Inf. Comput., 2001

Optimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios.
Proceedings of the STACS 2001, 2001

Lower Bounds for On-Line Single-Machine Scheduling.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

Optimal Online Flow Time with Resource Augmentation.
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

On-Line Variable Sized Covering.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000
A lower bound for on-line scheduling on uniformly related machines.
Oper. Res. Lett., 2000

A note on on-line scheduling with precedence constraints on identical machines.
Inf. Process. Lett., 2000

Resource Augmentation in Load Balancing.
Proceedings of the Algorithm Theory, 2000

On-Line Scheduling with Precedence Constraints.
Proceedings of the Algorithm Theory, 2000

1999
Randomized Online Scheduling on Two Uniform Machines.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines.
Proceedings of the Algorithms, 1999

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

Lower Bounds for On-line Scheduling with Precedence Constraints on Identical Machines.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 1998

Approximation Schemes for Covering and Scheduling on Related Machines.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 1998

1997
On Two Dimensional Packing.
J. Algorithms, 1997

On-Line Load Balancing of Temporary Tasks on Identical Machines.
Proceedings of the Fifth Israel Symposium on Theory of Computing and Systems, 1997

On-Line Machine Covering.
Proceedings of the Algorithms, 1997

1996
On Two Dimensional Packing.
Proceedings of the Algorithm Theory, 1996


  Loading...