Sep 2023 // book-chapter
On Solution Discovery via Reconfiguration
Michael R. Fellows; Mario Grobler; Nicole Megow; Amer E. Mouawad; Vijayaragunathan Ramamoorthi; Frances A. Rosamond; Daniel Schmand; Sebastian Siebertz
Feb 2023 // journal-article
Speed-robust scheduling: sand, bricks, and rocks
Mathematical Programming
Franziska Eberle; Ruben Hoeksma; Nicole Megow; Lukas Nölke; Kevin Schewior; Bertrand Simon
Jan 2023 // journal-article
Online Throughput Maximization on Unrelated Machines: Commitment is No Burden
ACM Transactions on Algorithms
Franziska Eberle; Nicole Megow; Kevin Schewior
2023 // book-chapter
Set Selection Under Explorable Stochastic Uncertainty via Covering Techniques
Nicole Megow; Jens Schlöter
Sep 2022 // journal-article
Throughput scheduling with equal additive laxity
Operations Research Letters
Martin Böhm; Nicole Megow; Jens Schlöter
Jun 2022 // journal-article
On Hop-Constrained Steiner Trees in Tree-Like Metrics
SIAM Journal on Discrete Mathematics
Martin Böhm; Ruben Hoeksma; Nicole Megow; Lukas Nölke; Bertrand Simon
May 2022 // journal-article
Online load balancing with general reassignment cost
Operations Research Letters
Sebastian Berndt; Franziska Eberle; Nicole Megow
2021 // book-chapter
Throughput Scheduling with Equal Additive Laxity
Martin Böhm; Nicole Megow; Jens Schlöter
2021 // book-chapter
Explorable Uncertainty Meets Decision-Making in Logistics
Nicole Megow; Jens Schlöter
Dec 2020 // journal-article
An Adversarial Model for Scheduling with Testing
Algorithmica
Christoph Dürr; Thomas Erlebach; Nicole Megow; Julie Meißner
Sep 2020 // journal-article
A general framework for handling commitment in online throughput maximization
Mathematical Programming
Lin Chen; Franziska Eberle; Nicole Megow; Kevin Schewior; Cliff Stein
2019 // conference-paper
Scheduling self-suspending tasks: New and old results
Leibniz International Proceedings in Informatics, LIPIcs
Chen, J.-J.; Hahn, T.; Hoeksma, R.; Megow, N.; Von Der Brüggen, G.
DOI: 10.4230/LIPIcs.ECRTS.2019.16
2019 // journal-article
Scheduling maintenance jobs in networks
Theoretical Computer Science
Abed, F.; Chen, L.; Disser, Y.; Groß, M.; Megow, N.; Meißner, J.; Richter, A.T.; Rischke, R.
DOI: 10.1016/j.tcs.2018.02.020
2019 // journal-article
On index policies for stochastic minsum scheduling
Operations Research Letters
Eberle, F.; Fischer, F.; Matuschke, J.; Megow, N.
DOI: 10.1016/j.orl.2019.03.007
2019 // book
A General Framework for Handling Commitment in Online Throughput Maximization
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Chen, L.; Eberle, F.; Megow, N.; Schewior, K.; Stein, C.
DOI: 10.1007/978-3-030-17953-3_11
Jan 2018 // journal-article
An $\mathcal{O}(\log {m})$-Competitive Algorithm for Online Machine Minimization
SIAM Journal on Computing
Lin Chen; Nicole Megow; Kevin Schewior
Jan 2018 // journal-article
Dual Techniques for Scheduling on a Machine with Varying Speed
SIAM Journal on Discrete Mathematics
Nicole Megow; José Verschae
2018 // conference-paper
Scheduling with explorable uncertainty
Leibniz International Proceedings in Informatics, LIPIcs
Dürr, C.; Erlebach, T.; Megow, N.; Meißner, J.
DOI: 10.4230/LIPIcs.ITCS.2018.30
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.
DOI: 10.1007/978-3-319-57586-5_3
2017 // journal-article
Packing a knapsack of unknown capacity
SIAM Journal on Discrete Mathematics
Disser, Y.; Klimm, M.; Megow, N.; Stiller, S.
DOI: 10.1137/16M1070049
2017 // journal-article
Randomization helps computing a minimum spanning tree under uncertainty
SIAM Journal on Computing
Megow, N.; Meißner, J.; Skutella, M.
DOI: 10.1137/16M1088375
2017 // conference-paper
Minimum spanning tree under explorable uncertainty in theory and experiments
Leibniz International Proceedings in Informatics, LIPIcs
Focke, J.; Megow, N.; Meifiner, J.
DOI: 10.4230/LIPIcs.SEA.2017.22
2016 // journal-article
Guest editors’ foreword
Theory of Computing
Megow, N.; Wootters, M.
DOI: 10.4086/toc.2016.v012a013
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.
DOI:
2016 // book-chapter
Robustness and approximation for universal sequencing
Gems of Combinatorial Optimization and Graph Algorithms
Megow, N.
DOI: 10.1007/978-3-319-24971-1_13
