Nicole Megow

ORCID

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 85

Top Venues

Publications

Mario Grobler, Stephanie Maaz, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Daniel Schmand, Sebastian Siebertz
Solution Discovery via Reconfiguration for Problems in P. ICALP (2024)
Étienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlöter
Santa Claus meets Makespan and Matroids: Algorithms and Reductions. SODA (2024)
Franziska Eberle, Felix Hommelsheim, Alexander Lindermayr, Zhenwei Liu, Nicole Megow, Jens Schlöter
Accelerating Matroid Optimization through Fast Imprecise Oracles. CoRR (2024)
Evripidis Bampis, Konstantinos Dogeas, Thomas Erlebach, Nicole Megow, Jens Schlöter, Amitabh Trehan
Competitive Query Minimization for Stable Matching with One-Sided Uncertainty. CoRR (2024)
Madison Van Dyk, Kim Klause, Jochen Könemann, Nicole Megow
Fast Combinatorial Algorithms for Efficient Sortation. IPCO (2024)
Michael R. Fellows, Mario Grobler, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Frances A. Rosamond, Daniel Schmand, Sebastian Siebertz
On Solution Discovery via Reconfiguration. CoRR (2023)
Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter
Sorting and Hypergraph Orientation under Uncertainty with Predictions. CoRR (2023)
Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon
Speed-robust scheduling: sand, bricks, and rocks. Math. Program. 197 (2) (2023)
Mohit Garg, Felix Hommelsheim, Nicole Megow
Matching Augmentation via Simultaneous Contractions. ICALP (2023)
Étienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlöter
Santa Claus meets Makespan and Matroids: Algorithms and Reductions. CoRR (2023)
Michael R. Fellows, Mario Grobler, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Frances A. Rosamond, Daniel Schmand, Sebastian Siebertz
On Solution Discovery via Reconfiguration. ECAI (2023)
Alexandra Anna Lassota, Alexander Lindermayr, Nicole Megow, Jens Schlöter
Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints. ICML (2023)
Nicole Megow, Jens Schlöter
Set Selection Under Explorable Stochastic Uncertainty via Covering Techniques. IPCO (2023)
Mario Grobler, Stephanie Maaz, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Daniel Schmand, Sebastian Siebertz
Solution discovery via reconfiguration for problems in P. CoRR (2023)
Franziska Eberle, Nicole Megow, Kevin Schewior
Online Throughput Maximization on Unrelated Machines: Commitment is No Burden. ACM Trans. Algorithms 19 (1) (2023)
Alexander Lindermayr, Nicole Megow, Martin Rapp
Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not Necessary. CoRR (2023)
Nicole Megow, Benjamin Moseley, David B. Shmoys, Ola Svensson, Sergei Vassilvitskii, Jens Schlöter
Scheduling (Dagstuhl Seminar 23061). Dagstuhl Reports 13 (2) (2023)
Madison Van Dyk, Kim Klause, Jochen Könemann, Nicole Megow
Fast Combinatorial Algorithms for Efficient Sortation. CoRR (2023)
Felix Hommelsheim, Nicole Megow, Komal Muluk, Britta Peis
Recoverable Robust Optimization with Commitment. CoRR (2023)
Thomas Erlebach, Murilo S. de Lima, Nicole Megow, Jens Schlöter
Sorting and Hypergraph Orientation under Uncertainty with Predictions. IJCAI (2023)
Alexandra Lassota, Alexander Lindermayr, Nicole Megow, Jens Schlöter
Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints. CoRR (2023)
Alexander Lindermayr, Nicole Megow, Martin Rapp
Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not Necessary. ICML (2023)
Franziska Eberle, Anupam Gupta, Nicole Megow, Benjamin Moseley, Rudy Zhou
Configuration Balancing for Stochastic Requests. IPCO (2023)
Martin Böhm, Nicole Megow, Jens Schlöter
Throughput scheduling with equal additive laxity. Oper. Res. Lett. 50 (5) (2022)
Alexander Lindermayr, Nicole Megow, Bertrand Simon
Double Coverage with Machine-Learned Advice. ITCS (2022)
Sebastian Berndt, Franziska Eberle, Nicole Megow
Online load balancing with general reassignment cost. Oper. Res. Lett. 50 (3) (2022)
Franziska Eberle, Anupam Gupta, Nicole Megow, Benjamin Moseley, Rudy Zhou
Configuration Balancing for Stochastic Requests. CoRR (2022)
Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon
On Hop-Constrained Steiner Trees in Tree-Like Metrics. SIAM J. Discret. Math. 36 (2) (2022)
Nicole Megow, Jens Schlöter
Set Selection under Explorable Stochastic Uncertainty via Covering Techniques. CoRR (2022)
Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter
Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty. ESA (2022)
Franziska Eberle, Alexander Lindermayr, Nicole Megow, Lukas Nölke, Jens Schlöter
Robustification of Online Graph Exploration Methods. AAAI (2022)
Giulia Bernardini, Alexander Lindermayr, Alberto Marchetti-Spaccamela, Nicole Megow, Leen Stougie, Michelle Sweering
A Universal Error Measure for Input Predictions Applied to Online Graph Problems. NeurIPS (2022)
Alexander Lindermayr, Nicole Megow
Permutation Predictions for Non-Clairvoyant Scheduling. SPAA (2022)
Giulia Bernardini, Alexander Lindermayr, Alberto Marchetti-Spaccamela, Nicole Megow, Leen Stougie, Michelle Sweering
A Universal Error Measure for Input Predictions Applied to Online Graph Problems. CoRR (2022)
Alexander Lindermayr, Nicole Megow
Non-Clairvoyant Scheduling with Predictions Revisited. CoRR (2022)
Mohit Garg, Felix Hommelsheim, Nicole Megow
Matching Augmentation via Simultaneous Contractions. CoRR (2022)
Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter
Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty. CoRR (2022)
Alexander Lindermayr, Nicole Megow, Bertrand Simon
Double Coverage with Machine-Learned Advice. CoRR (2021)
Franziska Eberle, Alexander Lindermayr, Nicole Megow, Lukas Nölke, Jens Schlöter
Robustification of Online Graph Exploration Methods. CoRR (2021)
Martin Böhm, Nicole Megow, Jens Schlöter
Throughput Scheduling with Equal Additive Laxity. CIAC (2021)
Franziska Eberle, Nicole Megow, Lukas Nölke, Bertrand Simon, Andreas Wiese
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time. FSTTCS (2021)
Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo S. de Lima, Nicole Megow, Jens Schlöter
Orienting (hyper)graphs under explorable stochastic uncertainty. CoRR (2021)
Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon
Speed-Robust Scheduling - Sand, Bricks, and Rocks. IPCO (2021)
Evripidis Bampis, Nicole Megow
Preface. Theory Comput. Syst. 65 (6) (2021)
Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter
Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty. ESA (2021)
Lin Chen, Nicole Megow, Roman Rischke, Leen Stougie, José Verschae
Optimal algorithms for scheduling under time-of-use tariffs. Ann. Oper. Res. 304 (1) (2021)
Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon
Computing a Minimum-Cost k-hop Steiner Tree in Tree-Like Metrics. CoRR (2020)
Martin Böhm, Franziska Eberle, Nicole Megow, Lukas Nölke, Jens Schlöter, Bertrand Simon, Andreas Wiese
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time. CoRR (2020)
Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon
Speed-Robust Scheduling. CoRR (2020)
Bertrand Simon, Joachim Falk, Nicole Megow, Jürgen Teich
Energy Minimization in DAG Scheduling on MPSoCs at Run-Time: Theory and Practice. NG-RES@HiPEAC (2020)
Alberto Marchetti-Spaccamela, Nicole Megow, Jens Schlöter, Martin Skutella, Leen Stougie
On the Complexity of Conditional DAG Scheduling in Multiprocessor Systems. IPDPS (2020)
Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner
An Adversarial Model for Scheduling with Testing. Algorithmica 82 (12) (2020)
Thomas Erlebach, Michael Hoffmann, Murilo S. de Lima, Nicole Megow, Jens Schlöter
Untrusted Predictions Improve Trustable Query Policies. CoRR (2020)
Franziska Eberle, Nicole Megow, Kevin Schewior
Optimally Handling Commitment Issues in Online Throughput Maximization. ESA (2020)
Nicole Megow, Lukas Nölke
Online Minimum Cost Matching with Recourse on the Line. APPROX-RANDOM (2020)
Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon
Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics. MFCS (2020)
Lin Chen, Franziska Eberle, Nicole Megow, Kevin Schewior, Clifford Stein
A general framework for handling commitment in online throughput maximization. Math. Program. 183 (1) (2020)
Jacob Focke, Nicole Megow, Julie Meißner
Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments. ACM J. Exp. Algorithmics 25 (2020)
Nicole Megow, Lukas Nölke
Online Minimum Cost Matching on the Line with Recourse. CoRR (2020)
Nicole Megow, David B. Shmoys, Ola Svensson
Scheduling (Dagstuhl Seminar 20081). Dagstuhl Reports 10 (2) (2020)
Fidaa Abed, Lin Chen, Yann Disser, Martin Groß, Nicole Megow, Julie Meißner, Alexander T. Richter, Roman Rischke
Scheduling maintenance jobs in networks. Theor. Comput. Sci. 754 (2019)
Lin Chen, Franziska Eberle, Nicole Megow, Kevin Schewior, Cliff Stein
A General Framework for Handling Commitment in Online Throughput Maximization. IPCO (2019)
Franziska Eberle, Nicole Megow, Kevin Schewior
Optimally handling commitment issues in online throughput maximization. CoRR (2019)
Jian-Jia Chen, Tobias Hahn, Ruben Hoeksma, Nicole Megow, Georg von der Brüggen
Scheduling Self-Suspending Tasks: New and Old Results (Artifact). Dagstuhl Artifacts Ser. 5 (1) (2019)
Bertrand Simon, Joachim Falk, Nicole Megow, Jürgen Teich
Energy Minimization in DAG Scheduling on MPSoCs at Run-Time: Theory and Practice. CoRR (2019)
Franziska Eberle, Felix A. Fischer, Jannik Matuschke, Nicole Megow
On index policies for stochastic minsum scheduling. Oper. Res. Lett. 47 (3) (2019)
Jian-Jia Chen, Tobias Hahn, Ruben Hoeksma, Nicole Megow, Georg von der Brüggen
Scheduling Self-Suspending Tasks: New and Old Results. ECRTS (2019)
Lin Chen, Franziska Eberle, Nicole Megow, Kevin Schewior, Cliff Stein
A general framework for handling commitment in online throughput maximization. CoRR (2018)
Lin Chen, Nicole Megow, Roman Rischke, Leen Stougie, José Verschae
Optimal Algorithms for Scheduling under Time-of-Use Tariffs. CoRR (2018)
Nicole Megow, José Verschae
Dual Techniques for Scheduling on a Machine with Varying Speed. SIAM J. Discret. Math. 32 (3) (2018)
Lin Chen, Nicole Megow, Kevin Schewior
An O(log m)-Competitive Algorithm for Online Machine Minimization. SIAM J. Comput. 47 (6) (2018)
Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner
Scheduling with Explorable Uncertainty. ITCS (2018)
Magnús M. Halldórsson, Nicole Megow, Clifford Stein
Scheduling (Dagstuhl Seminar 18101). Dagstuhl Reports 8 (3) (2018)
Fidaa Abed, Lin Chen, Yann Disser, Martin Groß, Nicole Megow, Julie Meißner, Alexander T. Richter, Roman Rischke
Scheduling Maintenance Jobs in Networks. CIAC (2017)
Yann Disser, Max Klimm, Nicole Megow, Sebastian Stiller
Packing a Knapsack of Unknown Capacity. SIAM J. Discret. Math. 31 (3) (2017)
Fidaa Abed, Lin Chen, Yann Disser, Martin Groß, Nicole Megow, Julie Meißner, Alexander T. Richter, Roman Rischke
Scheduling Maintenance Jobs in Networks. CoRR (2017)
Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner
Scheduling with Explorable Uncertainty. CoRR (2017)
Nicole Megow, Julie Meißner, Martin Skutella
Randomization Helps Computing a Minimum Spanning Tree under Uncertainty. SIAM J. Comput. 46 (4) (2017)
Jacob Focke, Nicole Megow, Julie Meißner
Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments. SEA (2017)
Lin Chen, Nicole Megow, Kevin Schewior
The Power of Migration in Online Machine Minimization. SPAA (2016)
Nicole Megow, Martin Skutella, José Verschae, Andreas Wiese
The Power of Recourse for Online MST and TSP. SIAM J. Comput. 45 (3) (2016)
Lin Chen, Nicole Megow, Kevin Schewior
)-Competitive Algorithm for Online Machine Minimization. SODA (2016)
Nicole Megow, Mary Wootters
Special Issue: APPROX-RANDOM 2015: Guest Editors' Foreword. Theory Comput. 12 (1) (2016)
Elisabeth Lübbecke, Olaf Maurer, Nicole Megow, Andreas Wiese
A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio. ACM Trans. Algorithms 13 (1) (2016)
Nikhil Bansal, Nicole Megow, Clifford Stein
Scheduling (Dagstuhl Seminar 16081). Dagstuhl Reports 6 (2) (2016)
Lin Chen, Nicole Megow, Roman Rischke, Leen Stougie
Stochastic and Robust Scheduling in the Cloud. APPROX-RANDOM (2015)
Lin Chen, Nicole Megow, Kevin Schewior
An O(m^2 log m)-Competitive Algorithm for Online Machine Minimization. CoRR (2015)
José R. Correa, Nicole Megow
Clique partitioning with value-monotone submodular cost. Discret. Optim. 15 (2015)
Lin Chen, Nicole Megow, Roman Rischke, Leen Stougie, José Verschae
Optimal Algorithms and a PTAS for Cost-Aware Scheduling. MFCS (2) (2015)
Nicole Megow, Julie Meißner, Martin Skutella
Randomization Helps Computing a Minimum Spanning Tree under Uncertainty. ESA (2015)
Lin Chen, Nicole Megow, Kevin Schewior
New Results on Online Resource Minimization. CoRR (2014)
Elisabeth Günther, Felix G. König, Nicole Megow
Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width. J. Comb. Optim. 27 (1) (2014)
Yann Disser, Max Klimm, Nicole Megow, Sebastian Stiller
Packing a Knapsack of Unknown Capacity. STACS (2014)
Nicole Megow, Tjark Vredeveld
A Tight 2-Approximation for Preemptive Stochastic Scheduling. Math. Oper. Res. 39 (4) (2014)
Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Nicole Megow, Andreas Wiese
Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks. RTSS (2013)
Nicole Megow, José Verschae
Dual Techniques for Scheduling on a Machine with Varying Speed. ICALP (1) (2013)
Nicole Megow, Andreas Wiese
Competitive-Ratio Approximation Schemes for Minimizing the Makespan in the Online-List Model CoRR (2013)
Nicole Megow, Julián Mestre
Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints. ITCS (2013)
Elisabeth Günther, Olaf Maurer, Nicole Megow, Andreas Wiese
A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio. SODA (2013)
Yann Disser, Max Klimm, Nicole Megow, Sebastian Stiller
Packing a Knapsack of Unknown Capacity. CoRR (2013)

Nicole Megow.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Nicole Megow