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.
DOI: 10.1145/2935764.2935786
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.
DOI: 10.1145/2996800
2015 // journal-article
Clique partitioning with value-monotone submodular cost
Discrete Optimization
Correa, J.R.; Megow, N.
DOI: 10.1016/j.disopt.2014.11.001
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.
DOI: 10.1007/978-3-662-48054-0_18
2015 // conference-paper
Stochastic and robust scheduling in the cloud
Leibniz International Proceedings in Informatics, LIPIcs
Chen, L.; Megow, N.; Rischke, R.; Stougie, L.
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2015.175
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.
DOI: 10.1007/978-3-662-48350-3_73
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.
DOI: 10.1007/s10878-012-9498-3
2014 // book
Packing a knapsack of unknown capacity
Leibniz International Proceedings in Informatics, LIPIcs
Disser, Y.; Klimm, M.; Megow, N.; Stiller, S.
DOI: 10.4230/LIPIcs.STACS.2014.276
2014 // journal-article
A tight 2-approximation for preemptive stochastic scheduling
Mathematics of Operations Research
Megow, N.; Vredeveld, T.
DOI: 10.1287/moor.2014.0653
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.
DOI: 10.1109/RTSS.2013.31
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.
DOI: 10.1007/978-3-642-39206-1_63
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.
DOI: 10.1145/2422436.2422490
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.
DOI:
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.
DOI: 10.1145/2390176.2390182
2012 // journal-article
Universal sequencing on an unreliable machine
SIAM Journal on Computing
Epstein, L.; Levin, A.; Marchetti-Spaccamela, A.; Megow, N.; Mestre, J.; Skutella, M.; Stougie, L.
DOI: 10.1137/110844210
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.
DOI: 10.1109/TC.2011.142
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.
DOI: 10.1007/978-3-642-31594-7_58
2012 // journal-article
On Eulerian extensions and their application to no-wait flowshop scheduling
Journal of Scheduling
Höhn, W.; Jacobs, T.; Megow, N.
DOI: 10.1007/s10951-011-0241-1
2012 // journal-article
A note on sorting buffers offline
Theoretical Computer Science
Chan, H.-L.; Megow, N.; Sitters, R.; Van Stee, R.
DOI: 10.1016/j.tcs.2011.12.077
2012 // journal-article
Online graph exploration: New results on old and new algorithms
Theoretical Computer Science
Megow, N.; Mehlhorn, K.; Schweitzer, P.
DOI: 10.1016/j.tcs.2012.06.034
2011 // journal-article
Decision support and optimization in shutdown and turnaround scheduling
INFORMS Journal on Computing
Megow, N.; Möhring, R.H.; Schulz, J.
DOI: 10.1287/ijoc.1100.0393
2011 // book
Online graph exploration: New results on old and new algorithms
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Megow, N.; Mehlhorn, K.; Schweitzer, P.
DOI: 10.1007/978-3-642-22012-8_38
2011 // book
Meeting deadlines: How much speed is enough?
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Anand, S.; Garg, N.; Megow, N.
DOI: 10.1007/978-3-642-22006-7_20
2010 // book
Universal sequencing on a single machine
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Epstein, L.; Levin, A.; Marchetti-Spaccamela, A.; Megow, N.; Mestre, J.; Skutella, M.; Stougie, L.
DOI: 10.1007/978-3-642-13036-6_18
2010 // book
Scheduling real-time mixed-criticality jobs
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Baruah, S.K.; Bonifaci, V.; D'Angelo, G.; Li, H.; Marchetti-Spaccamela, A.; Megow, N.; Stougie, L.
DOI: 10.1007/978-3-642-15155-2_10
