The SCEAS System
| |||||||

## Search the dblp DataBase
Leah Epstein:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Yossi Azar, Leah Epstein
**Approximation Schemes for Covering and Scheduling on Related Machines.**[Citation Graph (0, 0)][DBLP] APPROX, 1998, pp:39-47 [Conf] - Leah Epstein
**Lower Bounds for On-line Scheduling with Precedence Constraints on Identical Machines.**[Citation Graph (0, 0)][DBLP] APPROX, 1998, pp:89-98 [Conf] - Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai
**Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2006, pp:116-127 [Conf] - Leah Epstein
**On-Line Variable Sized Covering.**[Citation Graph (0, 0)][DBLP] COCOON, 2001, pp:463-472 [Conf] - Leah Epstein, Lene M. Favrholdt
**On-Line Maximizing the Number of Items Packed in Variable-Sized Bins.**[Citation Graph (0, 0)][DBLP] COCOON, 2002, pp:467-475 [Conf] - Leah Epstein, Asaf Levin
**Tracking mobile users.**[Citation Graph (0, 0)][DBLP] Algorithms for Optimization with Incomplete Information, 2005, pp:- [Conf] - Leah Epstein, Rob van Stee
**Online scheduling of splittable tasks.**[Citation Graph (0, 0)][DBLP] Algorithms for Optimization with Incomplete Information, 2005, pp:- [Conf] - Yossi Azar, Leah Epstein
**On-Line Machine Covering.**[Citation Graph (0, 0)][DBLP] ESA, 1997, pp:23-36 [Conf] - Leah Epstein
**Online Bin Packing with Cardinality Constraints.**[Citation Graph (0, 0)][DBLP] ESA, 2005, pp:604-615 [Conf] - Leah Epstein, Asaf Levin, Gerhard J. Woeginger
**Graph Coloring with Rejection.**[Citation Graph (0, 0)][DBLP] ESA, 2006, pp:364-375 [Conf] - Leah Epstein, Rob van Stee
**Minimizing the Maximum Starting Time On-line.**[Citation Graph (0, 0)][DBLP] ESA, 2002, pp:449-460 [Conf] - Leah Epstein, Rob van Stee
**On Variable-Sized Multidimensional Packing.**[Citation Graph (0, 0)][DBLP] ESA, 2004, pp:287-298 [Conf] - Leah Epstein, Jiri Sgall
**Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines.**[Citation Graph (0, 0)][DBLP] ESA, 1999, pp:151-162 [Conf] - Leah Epstein, Tamir Tassa
**Vector Assignment Problems: A General Framework.**[Citation Graph (0, 0)][DBLP] ESA, 2002, pp:461-472 [Conf] - Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk
**The Maximum Resource Bin Packing Problem.**[Citation Graph (0, 0)][DBLP] FCT, 2005, pp:397-408 [Conf] - Leah Epstein, Rob van Stee
**Optimal Online Flow Time with Resource Augmentation.**[Citation Graph (0, 0)][DBLP] FCT, 2001, pp:472-482 [Conf] - Marek Chrobak, Leah Epstein, John Noga, Jiri Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania
**Preemptive Scheduling in Overloaded Systems.**[Citation Graph (0, 0)][DBLP] ICALP, 2002, pp:800-811 [Conf] - Leah Epstein, Meital Levy
**Online Interval Coloring and Variants.**[Citation Graph (0, 0)][DBLP] ICALP, 2005, pp:602-613 [Conf] - Leah Epstein, Asaf Levin
**A Robust APTAS for the Classical Bin Packing Problem.**[Citation Graph (0, 0)][DBLP] ICALP (1), 2006, pp:214-225 [Conf] - Leah Epstein, Steven S. Seiden, Rob van Stee
**New Bounds for Variable-Sized and Resource Augmented Online Bin Packing.**[Citation Graph (0, 0)][DBLP] ICALP, 2002, pp:306-317 [Conf] - Yossi Azar, Leah Epstein
**On-Line Load Balancing of Temporary Tasks on Identical Machines.**[Citation Graph (0, 0)][DBLP] ISTCS, 1997, pp:119-125 [Conf] - Leah Epstein
**Two Dimensional Packing: The Power of Rotation.**[Citation Graph (0, 0)][DBLP] MFCS, 2003, pp:398-407 [Conf] - Leah Epstein, Lene M. Favrholdt
**Optimal Non-preemptive Semi-online Scheduling on Two Related Machines.**[Citation Graph (0, 0)][DBLP] MFCS, 2002, pp:245-256 [Conf] - Leah Epstein, Csanád Imreh, Rob van Stee
**More on Weighted Servers or FIFO is Better than LRU.**[Citation Graph (0, 0)][DBLP] MFCS, 2002, pp:257-268 [Conf] - Leah Epstein, Meital Levy
**Online Interval Coloring with Packing Constraints.**[Citation Graph (0, 0)][DBLP] MFCS, 2005, pp:295-307 [Conf] - Leah Epstein, Rob van Stee
**Lower Bounds for On-Line Single-Machine Scheduling.**[Citation Graph (0, 0)][DBLP] MFCS, 2001, pp:338-350 [Conf] - Leah Epstein, Tamir Tassa
**Approximation Schemes for the Min-Max Starting Time Problem.**[Citation Graph (0, 0)][DBLP] MFCS, 2003, pp:408-418 [Conf] - Leah Epstein, Tamir Tassa
**Optimal Preemptive Scheduling for General Target Functions.**[Citation Graph (0, 0)][DBLP] MFCS, 2004, pp:562-573 [Conf] - Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir
**Transactional contention management as a non-clairvoyant scheduling problem.**[Citation Graph (0, 0)][DBLP] PODC, 2006, pp:308-315 [Conf] - Anat Bremler-Barr, Leah Epstein
**Path Layout on Tree Networks: Bounds in Different Label Switching Models.**[Citation Graph (0, 0)][DBLP] SIROCCO, 2004, pp:35-46 [Conf] - Amitai Armon, Yossi Azar, Leah Epstein, Oded Regev
**Temporary tasks assignment resolved.**[Citation Graph (0, 0)][DBLP] SODA, 2002, pp:116-124 [Conf] - Leah Epstein, John Noga, Steven S. Seiden, Jiri Sgall, Gerhard J. Woeginger
**Randomized Online Scheduling on Two Uniform Machines.**[Citation Graph (0, 0)][DBLP] SODA, 1999, pp:317-326 [Conf] - Leah Epstein, Rob van Stee
**Optimal online bounded space multidimensional packing.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:214-223 [Conf] - Leah Epstein
**Optimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios.**[Citation Graph (0, 0)][DBLP] STACS, 2001, pp:230-237 [Conf] - Yossi Azar, Leah Epstein
**On Two Dimensional Packing.**[Citation Graph (0, 0)][DBLP] SWAT, 1996, pp:321-332 [Conf] - Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger
**All-Norm Approximation Algorithms.**[Citation Graph (0, 0)][DBLP] SWAT, 2002, pp:288-297 [Conf] - Yossi Azar, Leah Epstein, Rob van Stee
**Resource Augmentation in Load Balancing.**[Citation Graph (0, 0)][DBLP] SWAT, 2000, pp:189-199 [Conf] - Yossi Azar, Leah Epstein
**On-Line Scheduling with Precedence Constraints.**[Citation Graph (0, 0)][DBLP] SWAT, 2000, pp:164-174 [Conf] - Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga
**Optimally Competitive List Batching.**[Citation Graph (0, 0)][DBLP] SWAT, 2004, pp:77-89 [Conf] - Leah Epstein, Thomas Erlebach, Asaf Levin
**Variable Sized Online Interval Coloring with Bandwidth.**[Citation Graph (0, 0)][DBLP] SWAT, 2006, pp:29-40 [Conf] - Leah Epstein, Rob van Stee
**Online Scheduling of Splittable Tasks in Peer-to-Peer Networks.**[Citation Graph (0, 0)][DBLP] SWAT, 2004, pp:408-419 [Conf] - Leah Epstein, Rob van Stee, Tami Tamir
**Paging with Request Sets.**[Citation Graph (0, 0)][DBLP] SWAT, 2006, pp:124-135 [Conf] - Leah Epstein, Asaf Levin
**On Bin Packing with Conflicts.**[Citation Graph (0, 0)][DBLP] WAOA, 2006, pp:160-173 [Conf] - Yossi Azar, Amir Epstein, Leah Epstein
**Load Balancing of Temporary Tasks in the l**[Citation Graph (0, 0)][DBLP]_{p}Norm. WAOA, 2003, pp:53-66 [Conf] - Leah Epstein
**Bin Packing with Rejection Revisited.**[Citation Graph (0, 0)][DBLP] WAOA, 2006, pp:146-159 [Conf] - Leah Epstein, Arik Ganot
**Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation.**[Citation Graph (0, 0)][DBLP] WAOA, 2003, pp:109-122 [Conf] - Leah Epstein, Asaf Levin
**A PTAS for Delay Minimization in Establishing Wireless Conference Calls.**[Citation Graph (0, 0)][DBLP] WAOA, 2004, pp:36-47 [Conf] - Leah Epstein, Asaf Levin
**Better Bounds for Minimizing SONET ADMs.**[Citation Graph (0, 0)][DBLP] WAOA, 2004, pp:281-294 [Conf] - Leah Epstein, Asaf Levin
**SONET ADMs Minimization with Divisible Paths.**[Citation Graph (0, 0)][DBLP] WAOA, 2005, pp:119-132 [Conf] - Leah Epstein, Asaf Levin
**The Conference Call Search Problem in Wireless Networks.**[Citation Graph (0, 0)][DBLP] WAOA, 2005, pp:133-146 [Conf] - Leah Epstein, Rob van Stee
**Online Bin Packing with Resource Augmentation.**[Citation Graph (0, 0)][DBLP] WAOA, 2004, pp:23-35 [Conf] - Leah Epstein, Rob van Stee
**This Side Up!**[Citation Graph (0, 0)][DBLP] WAOA, 2004, pp:48-60 [Conf] - Leah Epstein
**Bin stretching revisited.**[Citation Graph (0, 0)][DBLP] Acta Inf., 2003, v:39, n:2, pp:97-117 [Journal] - Leah Epstein, Rob van Stee
**Online square and cube packing.**[Citation Graph (0, 0)][DBLP] Acta Inf., 2005, v:41, n:9, pp:595-606 [Journal] - Leah Epstein, Tamir Tassa
**Approximation schemes for the Min-Max Starting Time Problem.**[Citation Graph (0, 0)][DBLP] Acta Inf., 2004, v:40, n:9, pp:657-674 [Journal] - Leah Epstein, Tamir Tassa
**Vector assignment schemes for asymmetric settings.**[Citation Graph (0, 0)][DBLP] Acta Inf., 2006, v:42, n:6-7, pp:501-514 [Journal] - Leah Epstein
**On variable sized vector packing.**[Citation Graph (0, 0)][DBLP] Acta Cybern., 2003, v:16, n:1, pp:47-56 [Journal] - Leah Epstein, Lene M. Favrholdt
**On-Line Maximizing the Number of Items Packed in Variable-Sized Bins.**[Citation Graph (0, 0)][DBLP] Acta Cybern., 2003, v:16, n:1, pp:57-66 [Journal] - Amitai Armon, Yossi Azar, Leah Epstein
**Temporary Tasks Assignment Resolved.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2003, v:36, n:3, pp:295-314 [Journal] - Noga Alon, Yossi Azar, János Csirik, Leah Epstein, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger
**On-Line and Off-Line Approximation Algorithms for Vector Covering Problems.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1998, v:21, n:1, pp:104-118 [Journal] - Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen, Leah Epstein
**Fair versus Unrestricted Bin Packing.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2002, v:34, n:2, pp:181-196 [Journal] - Leah Epstein, Jiri Sgall
**Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2004, v:39, n:1, pp:43-57 [Journal] - Yossi Azar, Leah Epstein
**On-line scheduling with precedence constraints.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2002, v:119, n:1-2, pp:169-180 [Journal] - Leah Epstein
**Tight bounds for bandwidth allocation on two links.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2005, v:148, n:2, pp:181-188 [Journal] - Leah Epstein, Rob van Stee
**Optimal on-line flow time with resource augmentation.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2006, v:154, n:4, pp:611-621 [Journal] - Leah Epstein
**Online Variable Sized Covering.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2001, v:171, n:2, pp:294-305 [Journal] - Leah Epstein, Rob van Stee
**Minimizing the maximum starting time on-line.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2004, v:195, n:1-2, pp:53-65 [Journal] - Zhiyi Tan, Yong He, Leah Epstein
**Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2005, v:196, n:1, pp:57-70 [Journal] - Amitai Armon, Yossi Azar, Leah Epstein, Oded Regev
**On-line restricted assignment of temporary tasks with unknown durations.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:85, n:2, pp:67-72 [Journal] - Leah Epstein
**A note on on-line scheduling with precedence constraints on identical machines.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:76, n:4-6, pp:149-153 [Journal] - Yossi Azar, Leah Epstein
**On Two Dimensional Packing.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1997, v:25, n:2, pp:290-310 [Journal] - Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger
**All-norm approximation algorithms.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2004, v:52, n:2, pp:120-133 [Journal] - Leah Epstein, Lene M. Favrholdt
**Optimal non-preemptive semi-online scheduling on two related machines.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2005, v:57, n:1, pp:49-73 [Journal] - Leah Epstein, Tamir Tassa
**Vector assignment problems: a general framework.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2003, v:48, n:2, pp:360-384 [Journal] - Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt
**Separating online scheduling algorithms with the relative worst order ratio.**[Citation Graph (0, 0)][DBLP] J. Comb. Optim., 2006, v:12, n:4, pp:363-386 [Journal] - Marek Chrobak, Leah Epstein, John Noga, Jiri Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania
**Preemptive scheduling in overloaded systems.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2003, v:67, n:1, pp:183-197 [Journal] - Leah Epstein, Tamir Tassa
**Optimal preemptive scheduling for general target functions.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2006, v:72, n:1, pp:132-162 [Journal] - Leah Epstein
**Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2001, v:29, n:2, pp:93-98 [Journal] - Leah Epstein, Lene M. Favrholdt
**Optimal preemptive semi-online scheduling to minimize makespan on two related machines.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2002, v:30, n:4, pp:269-275 [Journal] - Leah Epstein, John Noga, Gerhard J. Woeginger
**On-line scheduling of unit time jobs with rejection: minimizing the total completion time.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2002, v:30, n:6, pp:415-420 [Journal] - Leah Epstein, Jiri Sgall
**A lower bound for on-line scheduling on uniformly related machines.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2000, v:26, n:1, pp:17-22 [Journal] - Eric Bach, Joan Boyar, Leah Epstein, Lene M. Favrholdt, Tao Jiang, Kim S. Larsen, Guo-Hui Lin, Rob van Stee
**Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem.**[Citation Graph (0, 0)][DBLP] J. Scheduling, 2003, v:6, n:2, pp:131-147 [Journal] - Leah Epstein, Rob van Stee
**Optimal Online Algorithms for Multidimensional Packing Problems.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2005, v:35, n:2, pp:431-448 [Journal] - Steven S. Seiden, Rob van Stee, Leah Epstein
**New Bounds for Variable-Sized Online Bin Packing.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2003, v:32, n:2, pp:455-469 [Journal] - Yossi Azar, Leah Epstein
**On-Line Load Balancing of Temporary Tasks on Identical Machines.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2004, v:18, n:2, pp:347-352 [Journal] - Leah Epstein, Rob van Stee
**This side up!**[Citation Graph (0, 0)][DBLP] ACM Transactions on Algorithms, 2006, v:2, n:2, pp:228-243 [Journal] - Leah Epstein, Rob van Stee
**Online scheduling of splittable tasks.**[Citation Graph (0, 0)][DBLP] ACM Transactions on Algorithms, 2006, v:2, n:1, pp:79-94 [Journal] - Yossi Azar, Amir Epstein, Leah Epstein
**Load balancing of temporary tasks in the**[Citation Graph (0, 0)][DBLP]*l*_{p}norm. Theor. Comput. Sci., 2006, v:361, n:2-3, pp:314-328 [Journal] - Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk
**The maximum resource bin packing problem.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:362, n:1-3, pp:127-139 [Journal] - Leah Epstein, Csanád Imreh, Rob van Stee
**More on weighted servers or FIFO is better than LRU.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2003, v:306, n:1-3, pp:305-317 [Journal] - Leah Epstein, Asaf Levin
**The chord version for SONET ADMs minimization.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:349, n:3, pp:337-346 [Journal] - Leah Epstein, Asaf Levin
**The conference call search problem in wireless networks.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:359, n:1-3, pp:418-429 [Journal] - Leah Epstein, Rob van Stee
**Lower bounds for on-line single-machine scheduling.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2003, v:1, n:299, pp:439-450 [Journal] - Leah Epstein, Alexander Kesselman
**On the remote server problem or more about TCP acknowledgments.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:369, n:1-3, pp:285-299 [Journal] - Leah Epstein, Yanir Kleiman, Jiri Sgall, Rob van Stee
**Paging with connections: FIFO strikes again.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:377, n:1-3, pp:55-64 [Journal] - Leah Epstein, Asaf Levin, Rob van Stee
**Multi-dimensional Packing with Conflicts.**[Citation Graph (0, 0)][DBLP] FCT, 2007, pp:288-299 [Conf] - Leah Epstein, Rob van Stee
**Improved Results for a Memory Allocation Problem.**[Citation Graph (0, 0)][DBLP] WADS, 2007, pp:362-373 [Conf] - Leah Epstein, Thomas Erlebach, Asaf Levin
**Online Capacitated Interval Coloring.**[Citation Graph (0, 0)][DBLP] ESCAPE, 2007, pp:243-254 [Conf] - Leah Epstein, Rob van Stee
**Calculating lower bounds for caching problems.**[Citation Graph (0, 0)][DBLP] Computing, 2007, v:80, n:3, pp:275-285 [Journal] - Leah Epstein, Rob van Stee
**Improved results for a memory allocation problem**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - Leah Epstein, Rob van Stee
**Covering selfish machines**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - Leah Epstein, Deshi Ye
**Semi-online scheduling with "end of sequence" information.**[Citation Graph (0, 0)][DBLP] J. Comb. Optim., 2007, v:14, n:1, pp:45-61 [Journal] **Preemptive Scheduling on Selfish Machines.**[Citation Graph (, )][DBLP]**Maximizing the Minimum Load for Selfisch Agents.**[Citation Graph (, )][DBLP]**Equilibria for two parallel links: The strong price of anarchy versus the price of anarchy.**[Citation Graph (, )][DBLP]**Improved Randomized Results for That Interval Selection Problem.**[Citation Graph (, )][DBLP]**Selfish Bin Packing.**[Citation Graph (, )][DBLP]**Preemptive Online Scheduling with Reordering.**[Citation Graph (, )][DBLP]**Scheduling and Load Balancing.**[Citation Graph (, )][DBLP]**Max-min Online Allocations with a Reordering Buffer.**[Citation Graph (, )][DBLP]**Universal Sequencing on a Single Machine.**[Citation Graph (, )][DBLP]**Maximizing the Minimum Load for Selfish Agents.**[Citation Graph (, )][DBLP]**Online Clustering with Variable Sized Clusters.**[Citation Graph (, )][DBLP]**Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model.**[Citation Graph (, )][DBLP]**Minimum Weighted Sum Bin Packing.**[Citation Graph (, )][DBLP]**On the Online Unit Clustering Problem.**[Citation Graph (, )][DBLP]**Approximation Schemes for Packing Splittable Items with Cardinality Constraints.**[Citation Graph (, )][DBLP]**On the Max Coloring Problem.**[Citation Graph (, )][DBLP]**Caching Content under Digital Rights Management.**[Citation Graph (, )][DBLP]**Parametric Packing of Selfish Items and the Subset Sum Algorithm.**[Citation Graph (, )][DBLP]**Maximizing the Minimum Load: The Cost of Selfishness.**[Citation Graph (, )][DBLP]**The Price of Anarchy on Uniformly Related Machines Revisited.**[Citation Graph (, )][DBLP]**On Equilibria for ADM Minimization Games.**[Citation Graph (, )][DBLP]**Two-dimensional packing with conflicts.**[Citation Graph (, )][DBLP]**SONET ADMs Minimization with Divisible Paths.**[Citation Graph (, )][DBLP]**Variable Sized Online Interval Coloring with Bandwidth.**[Citation Graph (, )][DBLP]**Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs.**[Citation Graph (, )][DBLP]**Bin Packing with Rejection Revisited.**[Citation Graph (, )][DBLP]**Transactional Contention Management as a Non-Clairvoyant Scheduling Problem.**[Citation Graph (, )][DBLP]**A Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs**[Citation Graph (, )][DBLP]**AFPTAS results for common variants of bin packing: A new method to handle the small items**[Citation Graph (, )][DBLP]**Bin packing with general cost structures**[Citation Graph (, )][DBLP]**Improved approximation guarantees for weighted matching in the semi-streaming model**[Citation Graph (, )][DBLP]**Parametric packing of selfish items and the subset sum algorithm**[Citation Graph (, )][DBLP]**Resource augmented semi-online bounded space bin packing.**[Citation Graph (, )][DBLP]**On the sum minimization version of the online bin covering problem.**[Citation Graph (, )][DBLP]
Search in 0.146secs, Finished in 0.150secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |