default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRob van Stee
Person information
- affiliation: University of Siegen, Department of Mathematics, Germany
- affiliation (former): University of Leicester, Department of Computer Science, UK
- affiliation (former): Max Planck Institute for Informatics, Saarbrücken, Germany
Other persons with a similar name
- R. M. van Steenbergen (aka: Robert van Steenbergen)
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j76]Rob van Stee:
SIGACT News Online Algorithms Column 42. SIGACT News 55(3): 52-82 (2024)- [c49]Martin Böhm, Matej Lieskovský, Sören Schmitt, Jirí Sgall, Rob van Stee:
Improved Online Load Balancing with Known Makespan. APPROX/RANDOM 2024: 10:1-10:21 - [i14]Martin Böhm, Matej Lieskovský, Sören Schmitt, Jirí Sgall, Rob van Stee:
Improved online load balancing with known makespan. CoRR abs/2407.08376 (2024) - 2023
- [j75]Aflatoun Amouzandeh
, Sören Schmitt, Rob van Stee:
SIGACT News Online Algorithms Column 40: 2022 in review. SIGACT News 54(1): 90-104 (2023) - [j74]Aflatoun Amouzandeh, Sören Schmitt, Rob van Stee:
SIGACT News Online Algorithms Column 41: 2023 in review. SIGACT News 54(4): 108-125 (2023) - [c48]Felix Höhne, Rob van Stee:
A 10/7-Approximation for Discrete Bamboo Garden Trimming and Continuous Trimming on Star Graphs. APPROX/RANDOM 2023: 16:1-16:19 - 2022
- [j73]Rob van Stee:
SIGACT News Online Algorithms Column 39. SIGACT News 53(2): 83 (2022) - 2021
- [j72]Felix Höhne, Rob van Stee:
Allocating contiguous blocks of indivisible chores fairly. Inf. Comput. 281: 104739 (2021) - [j71]Rob van Stee:
SIGACT News Online Algorithms Column 37. SIGACT News 52(2): 71 (2021) - [j70]Felix Höhne, Sören Schmitt, Rob van Stee:
SIGACT News Online Algorithms Column 38: 2021 in review. SIGACT News 52(4): 80-96 (2021) - [j69]Felix Höhne, Rob van Stee:
Buffer minimization with conflicts on a line. Theor. Comput. Sci. 876: 25-33 (2021) - 2020
- [j68]Felix Höhne, Sören Schmitt, Rob van Stee:
SIGACT News Online Algorithms Column 36: 2020 in review. SIGACT News 51(4): 89-107 (2020) - [c47]Felix Höhne, Rob van Stee:
Buffer Minimization with Conflicts on a Line. FAW 2020: 62-73
2010 – 2019
- 2019
- [j67]János Balogh, József Békési, György Dósa, Jirí Sgall, Rob van Stee:
The optimal absolute ratio for online bin packing. J. Comput. Syst. Sci. 102: 1-17 (2019) - [j66]Felix Höhne, Sören Schmitt, Rob van Stee:
SIGACT News Online Algorithms Column 35: 2019 in review. SIGACT News 50(4): 77-92 (2019) - [c46]Yossi Azar, Yuval Emek, Rob van Stee, Danny Vainstein:
The Price of Clustering in Bin-Packing with Applications to Bin-Packingwith Delays. SPAA 2019: 1-10 - 2018
- [j65]Rob van Stee:
SIGACT News Online Algorithms Column 33. SIGACT News 49(1): 66 (2018) - [j64]Rob van Stee:
SIGACT News Online Algorithms Column 34: 2018 in review. SIGACT News 49(4): 36-45 (2018) - [p1]Leah Epstein, Rob van Stee:
Multidimensional Packing Problems. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 553-570 - 2017
- [j63]Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý:
A two-phase algorithm for bin stretching with stretching factor 1.5. J. Comb. Optim. 34(3): 810-828 (2017) - [j62]Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý:
Erratum to: A two-phase algorithm for bin stretching with stretching factor 1.5. J. Comb. Optim. 34(3): 829 (2017) - [j61]Anna Adamaszek, Marc P. Renault, Adi Rosén, Rob van Stee:
Reordering buffer management with advice. J. Sched. 20(5): 423-442 (2017) - [j60]Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý:
Online bin stretching with three bins. J. Sched. 20(6): 601-621 (2017) - [j59]Rob van Stee:
SIGACT News Online Algorithms Column 30: 2016 in review. SIGACT News 48(1): 46-53 (2017) - [j58]Rob van Stee:
SIGACT News Online Algorithms Column 32: 2017 in review. SIGACT News 48(4): 100-109 (2017) - 2016
- [j57]Leah Epstein, Lukasz Jez, Jirí Sgall, Rob van Stee:
Online Scheduling of Jobs with Fixed Start Times on Related Machines. Algorithmica 74(1): 156-176 (2016) - [j56]Leah Epstein, Asaf Levin, Rob van Stee:
A Unified Approach to Truthful Scheduling on Related Machines. Math. Oper. Res. 41(1): 332-351 (2016) - [j55]Rob van Stee:
SIGACT News Online Algorithms Column 27: Online Matching on the Line, Part 1. SIGACT News 47(1): 99-110 (2016) - [j54]Rob van Stee:
SIGACT News Online Algorithms Column 28: Online Matching on the Line, Part 2. SIGACT News 47(2): 40-51 (2016) - [j53]Rob van Stee:
SIGACT News Online Algorithms Column 29. SIGACT News 47(3): 92 (2016) - [c45]Sandy Heydrich, Rob van Stee:
Beating the Harmonic Lower Bound for Online Bin Packing. ICALP 2016: 41:1-41:14 - [r6]Rob van Stee:
Current Champion for Online Bin Packing. Encyclopedia of Algorithms 2016: 481-482 - [r5]Rob van Stee:
Lower Bounds for Online Bin Packing. Encyclopedia of Algorithms 2016: 1167-1169 - [r4]Rob van Stee:
Packet Switching in Single Buffer. Encyclopedia of Algorithms 2016: 1506-1509 - [i13]Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý:
The Best Two-Phase Algorithm for Bin Stretching. CoRR abs/1601.08111 (2016) - [i12]Sandy Heydrich, Rob van Stee:
Improved Lower Bounds for Online Hypercube Packing. CoRR abs/1607.01229 (2016) - 2015
- [j52]Rob van Stee:
SIGACT News Online Algorithms Column 26: Bin packing in multiple dimensions. SIGACT News 46(2): 105-112 (2015) - [j51]Sandy Heydrich, Rob van Stee:
Dividing connected chores fairly. Theor. Comput. Sci. 593: 51-61 (2015) - [j50]Marc P. Renault, Adi Rosén, Rob van Stee:
Online algorithms with advice for bin packing and scheduling problems. Theor. Comput. Sci. 600: 155-170 (2015) - [c44]János Balogh, József Békési, György Dósa, Jirí Sgall, Rob van Stee:
The optimal absolute ratio for online bin packing. SODA 2015: 1425-1438 - [i11]Sandy Heydrich, Rob van Stee:
Beating the Harmonic lower bound for online bin packing. CoRR abs/1511.00876 (2015) - 2014
- [j49]Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee:
A (5/3 + ε)-approximation for strip packing. Comput. Geom. 47(2): 248-267 (2014) - [j48]Leah Epstein, Elena Kleiman, Rob van Stee:
The cost of selfishness for maximizing the minimum load on uniformly related machines. J. Comb. Optim. 27(4): 767-777 (2014) - [j47]Rob van Stee:
SIGACT news online algorithms column 23. SIGACT News 45(1): 90 (2014) - [j46]Rob van Stee:
SIGACT news online algorithms column 24: 2014 so far. SIGACT News 45(3): 105-111 (2014) - [j45]Xujin Chen, Benjamin Doerr, Carola Doerr, Xiaodong Hu, Weidong Ma, Rob van Stee:
The Price of Anarchy for Selfish Ring Routing is Two. ACM Trans. Economics and Comput. 2(2): 8:1-8:24 (2014) - [c43]Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý:
Better Algorithms for Online Bin Stretching. WAOA 2014: 23-34 - [i10]Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý:
Better Algorithms for Online Bin Stretching. CoRR abs/1404.5569 (2014) - 2013
- [j44]Rolf Harren, Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Rob van Stee:
Two for One: Tight Approximation of 2D Bin Packing. Int. J. Found. Comput. Sci. 24(8): 1299-1328 (2013) - [j43]Peter Sanders, Johannes Singler, Rob van Stee:
Real-time integrated prefetching and caching. J. Sched. 16(1): 47-58 (2013) - [j42]Rob van Stee:
SIGACT news online algorithms column 22. SIGACT News 44(2): 125 (2013) - [j41]Xujin Chen, Leah Epstein, Elena Kleiman, Rob van Stee:
Maximizing the minimum load: The cost of selfishness. Theor. Comput. Sci. 482: 9-19 (2013) - [j40]George Christodoulou, Annamária Kovács, Rob van Stee:
A truthful constant approximation for maximizing the minimum load on related machines. Theor. Comput. Sci. 489-490: 88-98 (2013) - [c42]Sven O. Krumke, Rob van Stee, Stephan Westphal:
Online Job Admission. Fundamental Problems in Computing 2013: 435-454 - [c41]Sandy Heydrich, Rob van Stee:
Dividing Connected Chores Fairly. SAGT 2013: 171-182 - [c40]Leah Epstein, Asaf Levin, Rob van Stee:
A unified approach to truthful scheduling on related machines. SODA 2013: 1243-1252 - [c39]Anna Adamaszek, Marc P. Renault, Adi Rosén, Rob van Stee:
Reordering Buffer Management with Advice. WAOA 2013: 132-143 - [i9]Marc P. Renault, Adi Rosén, Rob van Stee:
Online Algorithms with Advice for Bin Packing and Scheduling Problems. CoRR abs/1311.7589 (2013) - 2012
- [j39]Leah Epstein, Asaf Levin, Rob van Stee:
Approximation Schemes for Packing Splittable Items with Cardinality Constraints. Algorithmica 62(1-2): 102-129 (2012) - [j38]Leah Epstein, Rob van Stee:
The price of anarchy on uniformly related machines revisited. Inf. Comput. 212: 37-54 (2012) - [j37]Rolf Harren, Rob van Stee:
Absolute approximation ratios for packing rectangles into bins. J. Sched. 15(1): 63-75 (2012) - [j36]Rob van Stee:
SIGACT news online algorithms column 20: the power of harmony. SIGACT News 43(2): 127-136 (2012) - [j35]Rob van Stee:
SIGACT news online algorithms column 21: APPROX and ALGO. SIGACT News 43(4): 123-129 (2012) - [j34]Ho-Leung Chan, Nicole Megow, René Sitters, Rob van Stee:
A note on sorting buffers offline. Theor. Comput. Sci. 423: 11-18 (2012) - [j33]Rob van Stee:
An improved algorithm for online rectangle filling. Theor. Comput. Sci. 423: 59-74 (2012) - [c38]Leah Epstein, Lukasz Jez, Jirí Sgall, Rob van Stee:
Online Scheduling of Jobs with Fixed Start Times on Related Machines. APPROX-RANDOM 2012: 134-145 - [c37]Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee:
A (5/3 + eps)-Approximation for 2D Strip Packing. CTW 2012: 139-142 - [c36]Xujin Chen, Benjamin Doerr, Xiaodong Hu, Weidong Ma, Rob van Stee, Carola Winzen:
The Price of Anarchy for Selfish Ring Routing Is Two. WINE 2012: 420-433 - [i8]Leah Epstein, Asaf Levin, Rob van Stee:
A unified approach to truthful scheduling on related machines. CoRR abs/1207.3523 (2012) - [i7]Xujin Chen, Benjamin Doerr, Xiaodong Hu, Weidong Ma, Rob van Stee, Carola Winzen:
The Price of Anarchy for Selfish Ring Routing is Two. CoRR abs/1210.0230 (2012) - 2011
- [j32]Leah Epstein, Rob van Stee:
Improved Results for a Memory Allocation Problem. Theory Comput. Syst. 48(1): 79-92 (2011) - [j31]Leah Epstein, Asaf Levin, Rob van Stee:
Max-min Online Allocations with a Reordering Buffer. SIAM J. Discret. Math. 25(3): 1230-1250 (2011) - [c35]Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee:
A (5/3 + ε)-Approximation for Strip Packing. WADS 2011: 475-487 - 2010
- [j30]Leah Epstein, Rob van Stee:
On the online unit clustering problem. ACM Trans. Algorithms 7(1): 7:1-7:18 (2010) - [j29]Leah Epstein, Rob van Stee:
Maximizing the minimum load for selfish agents. Theor. Comput. Sci. 411(1): 44-57 (2010) - [c34]Leah Epstein, Asaf Levin, Rob van Stee:
Max-min Online Allocations with a Reordering Buffer. ICALP (1) 2010: 336-347 - [c33]Rob van Stee:
An Improved Algorithm for Online Rectangle Filling. WAOA 2010: 249-260 - [c32]George Christodoulou, Annamária Kovács, Rob van Stee:
A Truthful Constant Approximation for Maximizing the Minimum Load on Related Machines. WINE 2010: 182-193 - [i6]Ho-Leung Chan, Nicole Megow, Rob van Stee, René Sitters:
The Sorting Buffer Problem is NP-hard. CoRR abs/1009.4355 (2010)
2000 – 2009
- 2009
- [j28]Leah Epstein, Rob van Stee, Tami Tamir:
Paging with Request Sets. Theory Comput. Syst. 44(1): 67-81 (2009) - [c31]Rolf Harren, Rob van Stee:
Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems. APPROX-RANDOM 2009: 177-189 - [c30]George Christodoulou, Christine Chung, Katrina Ligett, Evangelia Pyrga, Rob van Stee:
On the Price of Stability for Undirected Network Design. WAOA 2009: 86-97 - [c29]Leah Epstein, Elena Kleiman, Rob van Stee:
Maximizing the Minimum Load: The Cost of Selfishness. WINE 2009: 232-243 - [i5]Rolf Harren, Rob van Stee:
An Absolute 2-Approximation Algorithm for Two-Dimensional Bin Packing. CoRR abs/0903.2265 (2009) - 2008
- [b1]Rob van Stee:
Combinatorial algorithms for packing and scheduling problems. Karlsruhe University, Germany, 2008 - [j27]Leah Epstein, Asaf Levin, Rob van Stee:
Two-dimensional packing with conflicts. Acta Informatica 45(3): 155-175 (2008) - [j26]Kirk Pruhs, Rob van Stee, Patchrawat Uthaisombut:
Speed Scaling of Tasks with Precedence Constraints. Theory Comput. Syst. 43(1): 67-80 (2008) - [j25]Sven Oliver Krumke, Anne Schwahn, Rob van Stee, Stephan Westphal:
A monotone approximation algorithm for scheduling with precedence constraints. Oper. Res. Lett. 36(2): 247-249 (2008) - [j24]Leah Epstein, Asaf Levin, Rob van Stee:
Online unit clustering: Variations on a theme. Theor. Comput. Sci. 407(1-3): 85-96 (2008) - [c28]Leah Epstein, Rob van Stee:
Maximizing the Minimum Load for Selfish Agents. LATIN 2008: 264-275 - [c27]Leah Epstein, Rob van Stee:
The Price of Anarchy on Uniformly Related Machines Revisited. SAGT 2008: 46-57 - [c26]Rolf Harren, Rob van Stee:
Packing Rectangles into 2OPT Bins Using Rotations. SWAT 2008: 306-318 - [r3]Rob van Stee:
Packet Switching in Single Buffer. Encyclopedia of Algorithms 2008 - [r2]Rob van Stee:
Paging. Encyclopedia of Algorithms 2008 - 2007
- [j23]Susanne Albers, Rob van Stee:
A Study of Integrated Document and Connection Caching in the WWW. Algorithmica 47(3): 239-252 (2007) - [j22]Leah Epstein, Rob van Stee:
Calculating lower bounds for caching problems. Computing 80(3): 275-285 (2007) - [j21]Leah Epstein, Rob van Stee:
Bounds for online bounded space hypercube packing. Discret. Optim. 4(2): 185-197 (2007) - [j20]Leah Epstein, Rob van Stee:
Online bin packing with resource augmentation. Discret. Optim. 4(3-4): 322-333 (2007) - [j19]Leah Epstein, Yanir Kleiman, Jirí Sgall, Rob van Stee:
Paging with connections: FIFO strikes again. Theor. Comput. Sci. 377(1-3): 55-64 (2007) - [c25]Leah Epstein, Rob van Stee:
Preemptive Scheduling on Selfish Machines. CAAN 2007: 57-70 - [c24]Leah Epstein, Asaf Levin, Rob van Stee:
Multi-dimensional Packing with Conflicts. FCT 2007: 288-299 - [c23]Leah Epstein, Rob van Stee:
Improved Results for a Memory Allocation Problem. WADS 2007: 362-373 - [c22]Leah Epstein, Rob van Stee:
On the Online Unit Clustering Problem. WAOA 2007: 193-206 - [c21]Leah Epstein, Rob van Stee:
Approximation Schemes for Packing Splittable Items with Cardinality Constraints. WAOA 2007: 232-245 - [r1]Leah Epstein, Rob van Stee:
Multidimensional Packing Problems. Handbook of Approximation Algorithms and Metaheuristics 2007 - [i4]Leah Epstein, Rob van Stee:
Maximizing the Minimum Load for Selfisch Agents. Fair Division 2007 - 2006
- [j18]Leah Epstein, Rob van Stee:
Optimal on-line flow time with resource augmentation. Discret. Appl. Math. 154(4): 611-621 (2006) - [j17]Stephan Westphal, Sven Oliver Krumke, Rob van Stee:
Competitive Algorithms for Cottage Rental. Electron. Notes Discret. Math. 25: 187-188 (2006) - [j16]Leah Epstein, Rob van Stee:
Online scheduling of splittable tasks. ACM Trans. Algorithms 2(1): 79-94 (2006) - [j15]Leah Epstein, Rob van Stee:
This side up! ACM Trans. Algorithms 2(2): 228-243 (2006) - [c20]Leah Epstein, Rob van Stee, Tami Tamir:
Paging with Request Sets. SWAT 2006: 124-135 - [i3]Leah Epstein, Rob van Stee:
Covering selfish machines. CoRR abs/cs/0610026 (2006) - [i2]Leah Epstein, Rob van Stee:
Improved results for a memory allocation problem. CoRR abs/cs/0612100 (2006) - 2005
- [j14]Leah Epstein, Rob van Stee:
Online square and cube packing. Acta Informatica 41(9): 595-606 (2005) - [j13]Alexander Kesselman, Yishay Mansour, Rob van Stee:
Improved Competitive Guarantees for QoS Buffering. Algorithmica 43(1-2): 63-80 (2005) - [j12]Rob van Stee, Johannes A. La Poutré:
Minimizing the total completion time on-line on a single machine, using restarts. J. Algorithms 57(2): 95-129 (2005) - [j11]Leah Epstein, Rob van Stee:
Optimal Online Algorithms for Multidimensional Packing Problems. SIAM J. Comput. 35(2): 431-448 (2005) - [c19]Klaus Jansen, Rob van Stee:
On strip packing With rotations. STOC 2005: 755-761 - [c18]Kirk Pruhs, Rob van Stee, Patchrawat Uthaisombut:
Speed Scaling of Tasks with Precedence Constraints. WAOA 2005: 307-319 - [i1]Leah Epstein, Rob van Stee:
Online scheduling of splittable tasks. Algorithms for Optimization with Incomplete Information 2005 - 2004
- [j10]Leah Epstein, Rob van Stee:
Minimizing the maximum starting time on-line. Inf. Comput. 195(1-2): 53-65 (2004) - [j9]Rob van Stee:
An approximation algorithm for square packing. Oper. Res. Lett. 32(6): 535-539 (2004) - [j8]Tomás Feder, Rajeev Motwani, Rina Panigrahy, Steven S. Seiden, Rob van Stee, An Zhu:
Combining request scheduling with web caching. Theor. Comput. Sci. 324(2-3): 201-218 (2004) - [c17]Leah Epstein, Rob van Stee:
On Variable-Sized Multidimensional Packing. ESA 2004: 287-298 - [c16]Leah Epstein, Rob van Stee:
Optimal online bounded space multidimensional packing. SODA 2004: 214-223 - [c15]Leah Epstein, Rob van Stee:
Online Scheduling of Splittable Tasks in Peer-to-Peer Networks. SWAT 2004: 408-419 - [c14]Leah Epstein, Rob van Stee:
Online Bin Packing with Resource Augmentation. WAOA 2004: 23-35 - [c13]Leah Epstein, Rob van Stee:
This Side Up! WAOA 2004: 48-60 - 2003
- [j7]Steven S. Seiden, Rob van Stee:
New Bounds for Multidimensional Packing. Algorithmica 36(3): 261-293 (2003) - [j6]Marek Chrobak, Leah Epstein, John Noga, Jirí Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania:
Preemptive scheduling in overloaded systems. J. Comput. Syst. Sci. 67(1): 183-197 (2003) - [j5]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. J. Sched. 6(2): 131-147 (2003) - [j4]Steven S. Seiden, Rob van Stee, Leah Epstein:
New Bounds for Variable-Sized Online Bin Packing. SIAM J. Comput. 32(2): 455-469 (2003) - [j3]Leah Epstein, Rob van Stee:
Lower bounds for on-line single-machine scheduling. Theor. Comput. Sci. 299(1-3): 439-450 (2003) - [j2]Leah Epstein, Csanád Imreh, Rob van Stee:
More on weighted servers or FIFO is better than LRU. Theor. Comput. Sci. 306(1-3): 305-317 (2003) - [c12]Alexander Kesselman, Yishay Mansour, Rob van Stee:
Improved Competitive Guarantees for QoS Buffering. ESA 2003: 361-372 - [c11]Susanne Albers, Rob van Stee:
A Study of Integrated Document and Connection Caching. ICALP 2003: 653-667 - 2002
- [c10]Leah Epstein, Rob van Stee:
Minimizing the Maximum Starting Time On-line. ESA 2002: 449-460 - [c9]Rob van Stee, Johannes A. La Poutré:
Minimizing the Total Completion Time On-line on a Single Machine, Using Restarts. ESA 2002: 872-883 - [c8]Leah Epstein, Steven S. Seiden, Rob van Stee:
New Bounds for Variable-Sized and Resource Augmented Online Bin Packing. ICALP 2002: 306-317 - [c7]Marek Chrobak, Leah Epstein, John Noga, Jirí Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania:
Preemptive Scheduling in Overloaded Systems. ICALP 2002: 800-811 - [c6]Leah Epstein, Csanád Imreh, Rob van Stee:
More on Weighted Servers or FIFO is Better than LRU. MFCS 2002: 257-268 - [c5]Steven S. Seiden, Rob van Stee:
New bounds for multi-dimensional packing. SODA 2002: 486-495 - 2001
- [j1]Rob van Stee, Johannes A. La Poutré:
Running a job on a collection of partly available machines, with on-line restarts. Acta Informatica 37(10): 727-742 (2001) - [c4]Leah Epstein, Rob van Stee:
Optimal Online Flow Time with Resource Augmentation. FCT 2001: 472-482 - [c3]Leah Epstein, Rob van Stee:
Lower Bounds for On-Line Single-Machine Scheduling. MFCS 2001: 338-350 - 2000
- [c2]Rob van Stee, Johannes A. La Poutré:
Partial servicing of on-line jobs. APPROX 2000: 250-261 - [c1]Yossi Azar, Leah Epstein, Rob van Stee:
Resource Augmentation in Load Balancing. SWAT 2000: 189-199
Coauthor Index
[p1] [j57] [j56] [j48] [j41] [c40] [j39] [j38] [c38] [i8] [j32] [j31] [j30] [j29] [c34] [j28] [c29] [j27] [j24] [c28] [c27] [j22] [j21] [j20] [j19] [c25] [c24] [c23] [c22] [c21] [r1] [i4] [j18] [j16] [j15] [c20] [i3] [i2] [j14] [j11] [i1] [j10] [c17] [c16] [c15] [c14] [c13] [j6] [j5] [j4] [j3] [j2] [c10] [c8] [c7] [c6] [c4] [c3] [c1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-25 20:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
