| # |  | Year | | Title | AG Editor Comment | Type | |
|---|
| 1 |
 | Ueckerdt, T. |
| |
| 1 |
| |
| 1 |
| Uhrig, C |
| |
| 16 |
| |
| 1 |
| Urrutia, Jorg |
| |
| 1 |
| |
| 1 |
| Uznanski, Przemyslaw |
| |
| 6 |
| Vahdati Daneshmand, Siavash |
| |
| 1 |
| Vainshtein, Alek |
| |
| 1 |
| |
| 1 |
| van der Ster, Suzanne |
| |
| 1 |
| |
| 1 |
| Van Hentenryck, Pascal |
| |
| 1 |
| |
| 3 |
| van Leeuwen, Erik Jan |
| |
| 1 |
| |
| 1 |
| van Loon, Joyce |
| |
| 43 |
| |
| | 2015 | | Dividing Connected Chores Fairly
In: Theoretical Computer Science [593], 51-61 | | Journal Article | |
| | 2013 |  | A truthful constant approximation for maximizing the minimum load on related machines
In: Theoretical Computer Science [489-490], 88-98 | | Journal Article | |
| | 2013 | | A unified approach to truthful scheduling on related machines
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, 1243-1252 | noch nicht erschienen 4.2.13 sm | Proceedings Article | |
| | 2013 | | Dividing connected chores fairly
In: 6th International Symposium on Algorithmic Game Theory, 420-433 | | Proceedings Article | |
| | 2013 | | Maximizing the minimum load: The cost of selfishness
In: Theoretical Computer Science [482], 9-19 | | Journal Article | |
| | 2013 | | Real-time prefetching and caching
In: Journal of Scheduling [16], 47-58 | | Journal Article | |
| | 2013 | | SIGACT News Online Algorithms Column 22
In: SIGACT News [44], 125 | | Journal Article | |
| | 2012 | | A note on sorting buffers offline
In: Theoretical Computer Science [423], 11-18 | | Journal Article | |
| | 2012 | | Absolute Approximation Ratios for Packing Rectangles into Bins
In: Journal of Scheduling [15], 63-75 | | Journal Article | |
| | 2012 | | An improved algorithm for online rectangle filling
In: Theoretical Computer Science [423], 59-74 | | Journal Article | |
| | 2012 | | Approximation Schemes for Packing Splittable Items with Cardinality Constraints
In: Algorithmica [62], 102-129 | | Journal Article | |
| | 2012 | | Online Scheduling of Jobs with Fixed Start Times on Related Machines
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 15th International Workshop, APPROX 2012 and 16th International Workshop, RANDOM 2012, 134-145 | | Proceedings Article | |
| | 2012 | | SIGACT News Online Algorithms Column 20: The Power of Harmony
In: SIGACT News [43], 127-136 | | Journal Article | |
| | 2012 | | SIGACT News Online Algorithms Column 21: APPROX and ALGO
In: SIGACT News [43], 123-129 | | Journal Article | |
| | 2012 | | The Price of Anarchy for Selfish Ring Routing is Two
In: Internet and Network Economics : 8th International Workshop, WINE 2012, 420-433 | | Proceedings Article | |
| | 2012 | | The price of anarchy on uniformly related machines revisited
In: Information and Computation [212], 37-54 | | Journal Article | |
| | 2011 | | A (5/3 + ε)-Approximation for Strip Packing
In: Algorithms and Data Structures : 12th International Symposium, WADS 2011, 475-487 | | Proceedings Article | |
| | 2011 | | An improved algorithm for online rectangle filling
In: Approximation and Online Algorithms : 8th International Workshop, WAOA 2010, 249-260 | | Proceedings Article | |
| | 2011 | | Improved results for a memory allocation problem
In: Theory of Computing Systems [48], 79-92 | | Journal Article | |
| | 2011 | | Max-min online allocations with a reordering buffer
In: SIAM Journal on Discrete Mathematics [25], 1230-1250 | | Journal Article | |
| | 2011 | | On the online unit clustering problem
In: ACM Transactions on Algorithms [7], 7:1-7:1 | | Journal Article | |
| | 2010 | | A truthful constant approximation for maximizing the minimum load on related machines
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 182-193 | | Proceedings Article | |
| | 2010 | | Max-min online allocations with a reordering buffer
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 336-347 | | Proceedings Article | |
| | 2010 | | Maximizing the minimum load for selfish agents
In: Theoretical Computer Science [411], 44-57 | | Journal Article | |
| | 2010 | | On the online unit clustering problem
In: ACM Transactions on Algorithms [7], 1-18 | | Journal Article | |
| | 2010 | | On the price of stability for undirected network design
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 86-97 | | Proceedings Article | |
| | 2009 | | Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 12th International Workshop, APPROX 2009 and 13th International Workshop, RANDOM 2009, 177-189 | | Proceedings Article | |
| | 2009 | | Maximizing the Minimum Load: The Cost of Selfishness
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 232-243 | | Proceedings Article | |
| | 2009 | | Online job admissions
In: Fundamental Problems in Computing : Essays in Honor of Professor Daniel J. Rosenkrantz, 435-454 | | Part of a Book | |
| | 2009 | | Paging with request sets
In: Theory of Computing Systems [44], 67-81 | | Journal Article | |
| | 2008 | | A monotone approximation algorithm for scheduling with precedence constraints
In: Operations Research Letters [36], 247-249 | | Journal Article | |
| | 2008 | | Approximation schemes for packing splittable items with cardinality constraints
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 232-245 | | Proceedings Article | |
| | 2008 | | Combinatorial algorithms for packing and scheduling problems
Universität Karlsruhe | | Thesis - Habilitation thesis | |
| | 2008 | | Maximizing the minimum load for selfish agents
In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, 264-275 | | Proceedings Article | |
| | 2008 | | On the Online Unit Clustering Problem
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 193-206 | | Proceedings Article | |
| | 2008 | | Online unit clustering: Variations on a theme
In: Theoretical Computer Science [407], 85-96 | | Journal Article | |
| | 2008 | | Packet Switching in Single Buffer
In: Encyclopedia of Algorithms, 1-99 | | Part of a Book | |
| | 2008 | | Packing Rectangles into 2 OPT Bins using Rotations
In: 11th Scandinavian Workshop on Algorithm Theory, 306-318 | | Proceedings Article | |
| | 2008 | | Paging
In: Encyclopedia of Algorithms, 1-99 | | Part of a Book | |
| | 2008 | | Speed Scaling of Tasks with Precedence Constraints
In: Theory of Computing Systems [43], 67-80 | | Journal Article | |
| | 2008 | | The price of anarchy on uniformly related machines revisited
In: Algorithmic Game Theory, First International Symposium, SAGT 2008, 46-57 | | Proceedings Article | |
| | 2008 | | Two-dimensional packing with conflicts
In: Acta Informatica [45], 155-175 | | Journal Article | |
| | 2002 | | More on weighted servers or FIFO is better than LRU
In: Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, 257-268 | q | Proceedings Article | |
| 10 |
| |
| 2 |
| Varadarajan, Kasturi |
| |
| 2 |
| |
| 2 |
| Vazirani, Vijay V. |
| |
| 1 |
| |
| 3 |
| Veltkamp, Remco |
| |
| 1 |
| |
| 1 |
| Veni Madhavan, C. E. |
| |
| 1 |
| |
| 3 |
| Verschae, Jose |
| |
| 2 |
| |
| 5 |
| Vidali, Angelina |
| |
| 1 |
| |
| 3 |
| Vilenchik, Dan |
| |
| 2 |
| |
| 5 |
| Vingron, Martin |
| |
| 2 |
| |
| 1 |
| Vishwanathan, S .V. N. |
| |
| 1 |
| |
| 8 |
| Vitter, Jeffrey Scott |
| |
| 25 |
| |
| 1 |
| Voigt, Marco |
| |
| 1 |
| |
| 1 |
| von Braunmühl, Burchard |
| |
| 1 |
| |
| 1 |
| von Zülow, Max Henning |
| |
| 1 |
| |
| 1 |
| Voß, Thomas |
| |
| 1 |
| |
| 1 |
| Vuppuluri, Gayathri |
| |
| 3 |
| |
| 1 |
| Wagner, Dorothea |
| |
| 2 |
| |
| 2 |
| Wagner, Lisa |
| |
| 4 |
| |
| 25 |
| Wahlström, Magnus |
| |
| 2 |
| |
| 2 |
| Wahl, Michaela |
| |
| 1 |
| |
| 2 |
| Wang, Pengming |
| |
| 1 |
| |
| 1 |
| Wanka, Rolf |
| |
| 3 |
| |
| 1 |
| Watson, Richard (ed.) |
| |
| 1 |
| |
| 3 |
| Weber, Dennis |
| |
| 12 |
| |
| 1 |
| Wechner, Ralph |
| |
| 2 |
| |
| 2 |
| Wegener, Ingo |
| |
| 2 |
| |
| 1 |
| Weickert, Joachim |
| |
| 5 |
| |
| 2 |
| Weimann, Oren |
| |
| 1 |
| |
| 8 |
| Wein, Ron |
| |
| 4 |
| |
| 9 |
| Welzl, Emo |
| |
| 4 |
| |
| 1 |
| Werner, Daniel |
| |
| 1 |
| |
| 1 |
| Werth, Kai |
| |
| 1 |
| |
| 1 |
| Wesselink, Wieger |
| |
| 1 |
| |
| 1 |
| Westermann, Matthias |
| |
| 1 |
| |
| 1 |
| Westphal, Stephan |
| |
| 1 |
| |
| 7 |
| Wiese, Andreas |
| |
| 2 |
| |
| 1 |
| Wilhelmi, Harald |
| |
| 3 |
| |
| 3 |
| Williamson, David P. |
| |
| 1 |
| |
| 1 |
| Winter, T. |
| |
| 27 |
| |
| 1 |
| Wissen, Michael |
| |
| 23 |
| |
| 3 |
| Woeginger, Gerhard J. |
| |
| 1 |
| |
| 1 |
| Wojtaszczyk, Jakub Onufry |
| |
| 1 |
| |
| 1 |
| Wolle, Thomas |
| |
| 20 |
| |
| 1 |
| Wong, Ka Chun |
| |
| 1 |
| |
| 1 |
| Wood, Derick |
| |
| 2 |
| |
| 1 |
| Worsch, T. |
| |
| 1 |
| |
| 1 |
| Wu, Xi |
| |
| 1 |
| |
| 7 |
| Xu, Chihao |
| |
| 7 |
| |
| 5 |
| Yap, Chee-Keng |
| |
| 1 |
| |
| 1 |
| Yung, Moti |
| |
| 1 |
| |
| 3 |
| Yvinec, Mariette |
| |
| 2 |
| Zafeirakopoulos, Zafeirakis |
| |
| 1 |
| Zafeirakopoulos,Zafeirakis |
| |
| 2 |
| |
| 28 |
| Zaroliagis, Christos |
| |
| 5 |
| |
| 3 |
| Zelikovsly, Alexander |
| |
| 1 |
| |
| 2 |
| Zhang, Yan |
| |
| 1 |
| |
| 1 |
| Zhao, Jihui |
| |
| 1 |
| |
| 4 |
| Ziegelmann, Mark |
| |
| 1 |
| |
| 2 |
| Ziegler, Joachim |
| |
| 5 |
| |
| 1 |
| Zimmer, Horst G. |
| |
| 2 |
| |
| 1 |
| Ziviani, Nivio |
| |
| 1 |
| |
| 1 |
| Zosin, Leonid |
| |
| 1 |
| |
| 1 |
| Zweifel, Oliver |
| |
| 1 |
| |
| 1 |
| Zwick, Uri |
| |
| 6215 |
| |
