2017 // Journal article
Packing a knapsack of unknown capacity
SIAM Journal on Discrete Mathematics
Disser, Y.; Klimm, M.; Megow, N.; Stiller, S.
2017 // Journal article
Randomization helps computing a minimum spanning tree under uncertainty
SIAM Journal on Computing
Megow, N.; Meißner, J.; Skutella, M.
2017 // Book
Scheduling maintenance jobs in networks
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Abed, F.; Chen, L.; Disser, Y.; Groß, M.; Megow, N.; Meißner, J.; Richter, A.T.; Rischke, R.
2016 // Journal article
A new approach to online scheduling: Approximating the optimal competitive ratio
ACM Transactions on Algorithms
L�bbecke, E.; Maurer, O.; Megow, N.; Wiese, A.
2016 // Conference paper
An O(log n)-competitive algorithm for online machine minimization
Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
Chen, L.; Megow, N.; Schewior, K.
2016 // Journal article
Guest editors’ foreword
Theory of Computing
Megow, N.; Wootters, M.
2016 // Book chapter
Robustness and approximation for universal sequencing
Gems of Combinatorial Optimization and Graph Algorithms
Megow, N.
2016 // Conference paper
The power of migration in online machine minimization
Annual ACM Symposium on Parallelism in Algorithms and Architectures
Chen, L.; Megow, N.; Schewior, K.
2015 // Journal article
Clique partitioning with value-monotone submodular cost
Discrete Optimization
Correa, J.R.; Megow, N.
2015 // Book
Optimal algorithms and a PTAS for cost-aware scheduling
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Chen, L.; Megow, N.; Rischke, R.; Stougie, L.; Verschae, J.
2015 // Book
Randomization helps computing a minimum spanning tree under uncertainty
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Megow, N.; Meißner, J.; Skutella, M.
2015 // Conference paper
Stochastic and robust scheduling in the cloud
Leibniz International Proceedings in Informatics, LIPIcs
Chen, L.; Megow, N.; Rischke, R.; Stougie, L.
2014 // Journal article
A tight 2-approximation for preemptive stochastic scheduling
Mathematics of Operations Research
Megow, N.; Vredeveld, T.
2014 // Book
Packing a knapsack of unknown capacity
Leibniz International Proceedings in Informatics, LIPIcs
Disser, Y.; Klimm, M.; Megow, N.; Stiller, S.
2014 // Journal article
Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
Journal of Combinatorial Optimization
Günther, E.; König, F.G.; Megow, N.
2013 // Conference paper
A new approach to online scheduling: Approximating the optimal competitive ratio
Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
Günther, E.; Maurer, O.; Megow, N.; Wiese, A.
2013 // Book
Dual techniques for scheduling on a machine with varying speed
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Megow, N.; Verschae, J.
2013 // Conference paper
Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints
ITCS 2013 - Proceedings of the 2013 ACM Conference on Innovations in Theoretical Computer Science
Megow, N.; Mestre, J.
2013 // Conference paper
Polynomial-time exact schedulability tests for harmonic real-time tasks
Proceedings - Real-Time Systems Symposium
Bonifaci, V.; Marchetti-Spaccamela, A.; Megow, N.; Wiese, A.
2012 // Journal article
A note on sorting buffers offline
Theoretical Computer Science
Chan, H.-L.; Megow, N.; Sitters, R.; Van Stee, R.
2012 // Journal article
Algorithms and complexity for periodic real-time scheduling
ACM Transactions on Algorithms
Bonifaci, V.; Chan, H.-L.; Marchetti-Spaccamela, A.; Megow, N.
2012 // Journal article
On Eulerian extensions and their application to no-wait flowshop scheduling
Journal of Scheduling
Höhn, W.; Jacobs, T.; Megow, N.
2012 // Journal article
Online graph exploration: New results on old and new algorithms
Theoretical Computer Science
Megow, N.; Mehlhorn, K.; Schweitzer, P.
2012 // Journal article
Scheduling real-time mixed-criticality jobs
IEEE Transactions on Computers
Baruah, S.; Bonifaci, V.; D'Angelo, G.; Li, H.; Marchetti-Spaccamela, A.; Megow, N.; Stougie, L.
2012 // Book
The power of recourse for online MST and TSP
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Megow, N.; Skutella, M.; Verschae, J.; Wiese, A.
