Scheduling real-time mixed-criticality jobs S Baruah, V Bonifaci, G d'Angelo, H Li, A Marchetti-Spaccamela, ... IEEE Transactions on Computers 61 (8), 1140-1152, 2011 | 288 | 2011 |
Models and algorithms for stochastic online scheduling N Megow, M Uetz, T Vredeveld Mathematics of Operations Research 31 (3), 513-525, 2006 | 143 | 2006 |
Optimizing the landside operation of a container terminal G Froyland, T Koch, N Megow, E Duane, H Wren OR Spectrum 30 (1), 53-75, 2008 | 119 | 2008 |
On-line scheduling to minimize average completion time revisited N Megow, AS Schulz Operations Research Letters 32 (5), 485-490, 2004 | 112 | 2004 |
Online graph exploration: New results on old and new algorithms N Megow, K Mehlhorn, P Schweitzer Theoretical Computer Science 463, 62-72, 2012 | 93 | 2012 |
Universal sequencing on an unreliable machine L Epstein, A Levin, A Marchetti-Spaccamela, N Megow, J Mestre, ... SIAM Journal on Computing 41 (3), 565-586, 2012 | 67* | 2012 |
Decision Support and Optimization in Shutdown and Turnaround Scheduling N Megow, RH Möhring, J Schulz INFORMS Journal on Computing 23 (2), 189-204, 2011 | 65 | 2011 |
An adversarial model for scheduling with testing C Dürr, T Erlebach, N Megow, J Meißner Algorithmica 82 (12), 3630-3675, 2020 | 60* | 2020 |
Dual techniques for scheduling on a machine with varying speed N Megow, J Verschae SIAM Journal on Discrete Mathematics 32 (3), 1541-1571, 2018 | 59 | 2018 |
The power of recourse for online MST and TSP N Megow, M Skutella, J Verschae, A Wiese SIAM Journal on Computing 45 (3), 859-880, 2016 | 59* | 2016 |
Polynomial-time exact schedulability tests for harmonic real-time tasks V Bonifaci, A Marchetti-Spaccamela, N Megow, A Wiese 2013 IEEE 34th Real-Time Systems Symposium, 236-245, 2013 | 47 | 2013 |
Randomization helps computing a minimum spanning tree under uncertainty N Megow, J Meißner, M Skutella SIAM Journal on Computing 46 (4), 1217-1240, 2017 | 45 | 2017 |
A Tight 2-Approximation for Preemptive Stochastic Scheduling N Megow, T Vredeveld Mathematics of Operations Research 39, 1297-1310, 2014 | 45* | 2014 |
On Eulerian extensions and their application to no-wait flowshop scheduling W Höhn, T Jacobs, N Megow Journal of Scheduling 15 (3), 295-309, 2012 | 38* | 2012 |
Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width E Günther, FG König, N Megow Journal of Combinatorial Optimization 27, 164-181, 2014 | 36* | 2014 |
A new approach to online scheduling: approximating the optimal competitive ratio E Lübbecke, O Maurer, N Megow, A Wiese ACM Transactions on Algorithms (TALG) 13 (1), 1-34, 2016 | 32* | 2016 |
Permutation predictions for non-clairvoyant scheduling A Lindermayr, N Megow Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and …, 2022 | 30* | 2022 |
A note on sorting buffers offline HL Chan, N Megow, R Sitters, R Van Stee Theoretical Computer Science 423, 11-18, 2012 | 30* | 2012 |
An -Competitive Algorithm for Online Machine Minimization L Chen, N Megow, K Schewior SIAM Journal on Computing 47 (6), 2057-2077, 2018 | 28 | 2018 |
Packing a knapsack of unknown capacity Y Disser, M Klimm, N Megow, S Stiller SIAM Journal on Discrete Mathematics 31 (3), 1477-1497, 2017 | 26 | 2017 |