Nicole Megow - RankMe

152 papers A* 13A 16B 19C 3Misc 1Journal 86Unranked 11

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	On solution discovery via reconfiguration. J. Comput. Syst. Sci. Michael R. Fellows, Mario Grobler, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Frances A. Rosamond, Daniel Schmand, Sebastian Siebertz
2026	A	`conf`	Optimal Verification of a Minimum-Weight Basis in an Uncertainty Matroid. STACS Haya Diwan, Lisa Hellerstein, Nicole Megow, Jens Schlöter
2026	J	`jnl`	The Power of Proportional Fairness for Nonclairvoyant Polytope Scheduling. SIAM J. Comput. Sven Jäger, Alexander Lindermayr, Nicole Megow
2025	J	`jnl`	Boosting Double Coverage for k-Server via Imperfect Predictions. Algorithmica Alexander Lindermayr, Nicole Megow, Bertrand Simon
2025	J	`jnl`	Configuration balancing for stochastic requests. Math. Program. Franziska Eberle, Anupam Gupta, Nicole Megow, Benjamin Moseley, Rudy Zhou
2025	B	`ed.`	Integer Programming and Combinatorial Optimization - 26th International Conference, IPCO 2025, Baltimore, MD, USA, June 11-13, 2025, Proceedings IPCO Nicole Megow, Amitabh Basu
2025	J	`jnl`	Online Metric Matching on the Line with Recourse. Algorithmica Nicole Megow, Lukas Nölke
2025	J	`jnl`	Optimal Verification of a Minimum-Weight Basis in an Uncertainty Matroid. CoRR Haya Diwan, Lisa Hellerstein, Nicole Megow, Jens Schlöter
2025	J	`jnl`	Permutation Predictions for Non-Clairvoyant Scheduling. ACM Trans. Parallel Comput. Alexander Lindermayr, Nicole Megow
2025	A	`conf`	Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures. STACS Felix Hommelsheim, Zhenwei Liu, Nicole Megow, Guochuan Zhang
2025	J	`jnl`	Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures. CoRR Felix Hommelsheim, Zhenwei Liu, Nicole Megow, Guochuan Zhang
2025	J	`jnl`	Scheduling (Dagstuhl Seminar 25121). Dagstuhl Reports Claire Mathieu, Nicole Megow, Benjamin Moseley, Frits C. R. Spieksma, Alexander Lindermayr
2025	A*	`conf`	The Power of Proportional Fairness for Non-Clairvoyant Scheduling under Polyhedral Constraints. SODA Sven Jäger, Alexander Lindermayr, Nicole Megow
2025	J	`jnl`	Unifying Scheduling Algorithms for Group Completion Time. CoRR Alexander Lindermayr, Zhenwei Liu, Nicole Megow
2024	A*	`conf`	Accelerating Matroid Optimization through Fast Imprecise Oracles. NeurIPS Franziska Eberle, Felix Hommelsheim, Alexander Lindermayr, Zhenwei Liu, Nicole Megow, Jens Schlöter
2024	J	`jnl`	Accelerating Matroid Optimization through Fast Imprecise Oracles. CoRR Franziska Eberle, Felix Hommelsheim, Alexander Lindermayr, Zhenwei Liu, Nicole Megow, Jens Schlöter
2024	A	`conf`	Competitive Query Minimization for Stable Matching with One-Sided Uncertainty. APPROX/RANDOM Evripidis Bampis, Konstantinos Dogeas, Thomas Erlebach, Nicole Megow, Jens Schlöter, Amitabh Trehan
2024	J	`jnl`	Competitive Query Minimization for Stable Matching with One-Sided Uncertainty. CoRR Evripidis Bampis, Konstantinos Dogeas, Thomas Erlebach, Nicole Megow, Jens Schlöter, Amitabh Trehan
2024	—	`ed.`	Dynamics in Logistics - Proceedings of the 9th International Conference LDIC 2024, Bremen, Germany LDIC Michael Freitag, Aseem Kinra, Herbert Kotzab, Nicole Megow
2024	B	`conf`	Fast Combinatorial Algorithms for Efficient Sortation. IPCO Madison Van Dyk, Kim Klause, Jochen Könemann, Nicole Megow
2024	A*	`conf`	Santa Claus meets Makespan and Matroids: Algorithms and Reductions. SODA Étienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlöter
2024	A*	`conf`	Solution Discovery via Reconfiguration for Problems in P. ICALP Mario Grobler, Stephanie Maaz, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Daniel Schmand, Sebastian Siebertz
2024	J	`jnl`	The Power of Proportional Fairness for Non-Clairvoyant Scheduling under Polyhedral Constraints. CoRR Sven Jäger, Alexander Lindermayr, Nicole Megow
2024	Misc	`conf`	The Safe and Effective Use of Optimistic Period Predictions. RTNS Sanjoy K. Baruah, Pontus Ekberg, Alexander Lindermayr, Alberto Marchetti-Spaccamela, Nicole Megow, Leen Stougie
2023	A	`ed.`	Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, Atlanta, Georgia, USA, September 11-13, 2023 APPROX/RANDOM Nicole Megow, Adam D. Smith
2023	B	`conf`	Configuration Balancing for Stochastic Requests. IPCO Franziska Eberle, Anupam Gupta, Nicole Megow, Benjamin Moseley, Rudy Zhou
2023	J	`jnl`	Fast Combinatorial Algorithms for Efficient Sortation. CoRR Madison Van Dyk, Kim Klause, Jochen Könemann, Nicole Megow
2023	A*	`conf`	Matching Augmentation via Simultaneous Contractions. ICALP Mohit Garg, Felix Hommelsheim, Nicole Megow
2023	A*	`conf`	Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints. ICML Alexandra Anna Lassota, Alexander Lindermayr, Nicole Megow, Jens Schlöter
2023	J	`jnl`	Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints. CoRR Alexandra Lassota, Alexander Lindermayr, Nicole Megow, Jens Schlöter
2023	A	`conf`	On Solution Discovery via Reconfiguration. ECAI Michael R. Fellows, Mario Grobler, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Frances A. Rosamond, Daniel Schmand, Sebastian Siebertz
2023	J	`jnl`	On Solution Discovery via Reconfiguration. CoRR Michael R. Fellows, Mario Grobler, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Frances A. Rosamond, Daniel Schmand, Sebastian Siebertz
2023	J	`jnl`	Online Throughput Maximization on Unrelated Machines: Commitment is No Burden. ACM Trans. Algorithms Franziska Eberle, Nicole Megow, Kevin Schewior
2023	J	`jnl`	Recoverable Robust Optimization with Commitment. CoRR Felix Hommelsheim, Nicole Megow, Komal Muluk, Britta Peis
2023	J	`jnl`	Santa Claus meets Makespan and Matroids: Algorithms and Reductions. CoRR Étienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlöter
2023	J	`jnl`	Scheduling (Dagstuhl Seminar 23061). Dagstuhl Reports Nicole Megow, Benjamin Moseley, David B. Shmoys, Ola Svensson, Sergei Vassilvitskii, Jens Schlöter
2023	B	`conf`	Set Selection Under Explorable Stochastic Uncertainty via Covering Techniques. IPCO Nicole Megow, Jens Schlöter
2023	J	`jnl`	Solution discovery via reconfiguration for problems in P. CoRR Mario Grobler, Stephanie Maaz, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Daniel Schmand, Sebastian Siebertz
2023	A*	`conf`	Sorting and Hypergraph Orientation under Uncertainty with Predictions. IJCAI Thomas Erlebach, Murilo S. de Lima, Nicole Megow, Jens Schlöter
2023	J	`jnl`	Sorting and Hypergraph Orientation under Uncertainty with Predictions. CoRR Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter
2023	A*	`conf`	Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not Necessary. ICML Alexander Lindermayr, Nicole Megow, Martin Rapp
2023	J	`jnl`	Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not Necessary. CoRR Alexander Lindermayr, Nicole Megow, Martin Rapp
2023	J	`jnl`	Speed-robust scheduling: sand, bricks, and rocks. Math. Program. Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon
2022	A*	`conf`	A Universal Error Measure for Input Predictions Applied to Online Graph Problems. NeurIPS Giulia Bernardini, Alexander Lindermayr, Alberto Marchetti-Spaccamela, Nicole Megow, Leen Stougie, Michelle Sweering
2022	J	`jnl`	A Universal Error Measure for Input Predictions Applied to Online Graph Problems. CoRR Giulia Bernardini, Alexander Lindermayr, Alberto Marchetti-Spaccamela, Nicole Megow, Leen Stougie, Michelle Sweering
2022	J	`jnl`	Configuration Balancing for Stochastic Requests. CoRR Franziska Eberle, Anupam Gupta, Nicole Megow, Benjamin Moseley, Rudy Zhou
2022	A	`conf`	Double Coverage with Machine-Learned Advice. ITCS Alexander Lindermayr, Nicole Megow, Bertrand Simon
2022	A	`conf`	Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty. ESA Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter
2022	J	`jnl`	Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty. CoRR Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter
2022	J	`jnl`	Matching Augmentation via Simultaneous Contractions. CoRR Mohit Garg, Felix Hommelsheim, Nicole Megow
2022	J	`jnl`	Non-Clairvoyant Scheduling with Predictions Revisited. CoRR Alexander Lindermayr, Nicole Megow
2022	J	`jnl`	On Hop-Constrained Steiner Trees in Tree-Like Metrics. SIAM J. Discret. Math. Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon
2022	J	`jnl`	Online load balancing with general reassignment cost. Oper. Res. Lett. Sebastian Berndt, Franziska Eberle, Nicole Megow
2022	B	`conf`	Permutation Predictions for Non-Clairvoyant Scheduling. SPAA Alexander Lindermayr, Nicole Megow
2022	A*	`conf`	Robustification of Online Graph Exploration Methods. AAAI Franziska Eberle, Alexander Lindermayr, Nicole Megow, Lukas Nölke, Jens Schlöter
2022	J	`jnl`	Set Selection under Explorable Stochastic Uncertainty via Covering Techniques. CoRR Nicole Megow, Jens Schlöter
2022	J	`jnl`	Throughput scheduling with equal additive laxity. Oper. Res. Lett. Martin Böhm, Nicole Megow, Jens Schlöter
2021	J	`jnl`	Double Coverage with Machine-Learned Advice. CoRR Alexander Lindermayr, Nicole Megow, Bertrand Simon
2021	—	`conf`	Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time. FSTTCS Franziska Eberle, Nicole Megow, Lukas Nölke, Bertrand Simon, Andreas Wiese
2021	J	`jnl`	Optimal algorithms for scheduling under time-of-use tariffs. Ann. Oper. Res. Lin Chen, Nicole Megow, Roman Rischke, Leen Stougie, José Verschae
2021	A	`conf`	Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty. ESA Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter
2021	J	`jnl`	Orienting (hyper)graphs under explorable stochastic uncertainty. CoRR Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo S. de Lima, Nicole Megow, Jens Schlöter
2021	J	`jnl`	Preface. Theory Comput. Syst. Evripidis Bampis, Nicole Megow
2021	J	`jnl`	Robustification of Online Graph Exploration Methods. CoRR Franziska Eberle, Alexander Lindermayr, Nicole Megow, Lukas Nölke, Jens Schlöter
2021	B	`conf`	Speed-Robust Scheduling - Sand, Bricks, and Rocks. IPCO Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon
2021	C	`conf`	Throughput Scheduling with Equal Additive Laxity. CIAC Martin Böhm, Nicole Megow, Jens Schlöter
2020	J	`jnl`	A general framework for handling commitment in online throughput maximization. Math. Program. Lin Chen, Franziska Eberle, Nicole Megow, Kevin Schewior, Clifford Stein
2020	J	`jnl`	An Adversarial Model for Scheduling with Testing. Algorithmica Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner
2020	B	`ed.`	Approximation and Online Algorithms - 17th International Workshop, WAOA 2019, Munich, Germany, September 12-13, 2019, Revised Selected Papers WAOA Evripidis Bampis, Nicole Megow
2020	B	`conf`	Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics. MFCS Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon
2020	J	`jnl`	Computing a Minimum-Cost k-hop Steiner Tree in Tree-Like Metrics. CoRR Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon
2020	—	`conf`	Energy Minimization in DAG Scheduling on MPSoCs at Run-Time: Theory and Practice. NG-RES@HiPEAC Bertrand Simon, Joachim Falk, Nicole Megow, Jürgen Teich
2020	J	`jnl`	Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time. CoRR Martin Böhm, Franziska Eberle, Nicole Megow, Lukas Nölke, Jens Schlöter, Bertrand Simon, Andreas Wiese
2020	J	`jnl`	Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments. ACM J. Exp. Algorithmics Jacob Focke, Nicole Megow, Julie Meißner
2020	A	`conf`	On the Complexity of Conditional DAG Scheduling in Multiprocessor Systems. IPDPS Alberto Marchetti-Spaccamela, Nicole Megow, Jens Schlöter, Martin Skutella, Leen Stougie
2020	J	`jnl`	Online Minimum Cost Matching on the Line with Recourse. CoRR Nicole Megow, Lukas Nölke
2020	—	`conf`	Online Minimum Cost Matching with Recourse on the Line. APPROX-RANDOM Nicole Megow, Lukas Nölke
2020	A	`conf`	Optimally Handling Commitment Issues in Online Throughput Maximization. ESA Franziska Eberle, Nicole Megow, Kevin Schewior
2020	J	`jnl`	Scheduling (Dagstuhl Seminar 20081). Dagstuhl Reports Nicole Megow, David B. Shmoys, Ola Svensson
2020	J	`jnl`	Speed-Robust Scheduling. CoRR Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon
2020	J	`jnl`	Untrusted Predictions Improve Trustable Query Policies. CoRR Thomas Erlebach, Michael Hoffmann, Murilo S. de Lima, Nicole Megow, Jens Schlöter
2019	B	`conf`	A General Framework for Handling Commitment in Online Throughput Maximization. IPCO Lin Chen, Franziska Eberle, Nicole Megow, Kevin Schewior, Cliff Stein
2019	J	`jnl`	Energy Minimization in DAG Scheduling on MPSoCs at Run-Time: Theory and Practice. CoRR Bertrand Simon, Joachim Falk, Nicole Megow, Jürgen Teich
2019	J	`jnl`	On index policies for stochastic minsum scheduling. Oper. Res. Lett. Franziska Eberle, Felix A. Fischer, Jannik Matuschke, Nicole Megow
2019	J	`jnl`	Optimally handling commitment issues in online throughput maximization. CoRR Franziska Eberle, Nicole Megow, Kevin Schewior
2019	J	`jnl`	Scheduling Self-Suspending Tasks: New and Old Results (Artifact). Dagstuhl Artifacts Ser. Jian-Jia Chen, Tobias Hahn, Ruben Hoeksma, Nicole Megow, Georg von der Brüggen
2019	B	`conf`	Scheduling Self-Suspending Tasks: New and Old Results. ECRTS Jian-Jia Chen, Tobias Hahn, Ruben Hoeksma, Nicole Megow, Georg von der Brüggen
2019	J	`jnl`	Scheduling maintenance jobs in networks. Theor. Comput. Sci. Fidaa Abed, Lin Chen, Yann Disser, Martin Groß, Nicole Megow, Julie Meißner, Alexander T. Richter, Roman Rischke
2018	J	`jnl`	A general framework for handling commitment in online throughput maximization. CoRR Lin Chen, Franziska Eberle, Nicole Megow, Kevin Schewior, Cliff Stein
2018	J	`jnl`	An O(log m)-Competitive Algorithm for Online Machine Minimization. SIAM J. Comput. Lin Chen, Nicole Megow, Kevin Schewior
2018	J	`jnl`	Dual Techniques for Scheduling on a Machine with Varying Speed. SIAM J. Discret. Math. Nicole Megow, José Verschae
2018	J	`jnl`	Optimal Algorithms for Scheduling under Time-of-Use Tariffs. CoRR Lin Chen, Nicole Megow, Roman Rischke, Leen Stougie, José Verschae
2018	J	`jnl`	Scheduling (Dagstuhl Seminar 18101). Dagstuhl Reports Magnús M. Halldórsson, Nicole Megow, Clifford Stein
2018	A	`conf`	Scheduling with Explorable Uncertainty. ITCS Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner
2017	B	`conf`	Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments. SEA Jacob Focke, Nicole Megow, Julie Meißner
2017	J	`jnl`	Packing a Knapsack of Unknown Capacity. SIAM J. Discret. Math. Yann Disser, Max Klimm, Nicole Megow, Sebastian Stiller
2017	J	`jnl`	Randomization Helps Computing a Minimum Spanning Tree under Uncertainty. SIAM J. Comput. Nicole Megow, Julie Meißner, Martin Skutella
2017	C	`conf`	Scheduling Maintenance Jobs in Networks. CIAC Fidaa Abed, Lin Chen, Yann Disser, Martin Groß, Nicole Megow, Julie Meißner, Alexander T. Richter, Roman Rischke
2017	J	`jnl`	Scheduling Maintenance Jobs in Networks. CoRR Fidaa Abed, Lin Chen, Yann Disser, Martin Groß, Nicole Megow, Julie Meißner, Alexander T. Richter, Roman Rischke
2017	J	`jnl`	Scheduling with Explorable Uncertainty. CoRR Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner
2016	J	`jnl`	A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio. ACM Trans. Algorithms Elisabeth Lübbecke, Olaf Maurer, Nicole Megow, Andreas Wiese
2016	A*	`conf`	An O(log SODA Lin Chen, Nicole Megow, Kevin Schewior
2016	J	`jnl`	Scheduling (Dagstuhl Seminar 16081). Dagstuhl Reports Nikhil Bansal, Nicole Megow, Clifford Stein
2016	J	`jnl`	Special Issue: APPROX-RANDOM 2015: Guest Editors' Foreword. Theory Comput. Nicole Megow, Mary Wootters
2016	B	`conf`	The Power of Migration in Online Machine Minimization. SPAA Lin Chen, Nicole Megow, Kevin Schewior
2016	J	`jnl`	The Power of Recourse for Online MST and TSP. SIAM J. Comput. Nicole Megow, Martin Skutella, José Verschae, Andreas Wiese
2016	—	`ch.`	Universal Sequencing on an Unreliable Machine. Encyclopedia of Algorithms Julián Mestre, Nicole Megow
2015	J	`jnl`	An O(m^2 log m)-Competitive Algorithm for Online Machine Minimization. CoRR Lin Chen, Nicole Megow, Kevin Schewior
2015	J	`jnl`	Clique partitioning with value-monotone submodular cost. Discret. Optim. José R. Correa, Nicole Megow
2015	—	`conf`	Optimal Algorithms and a PTAS for Cost-Aware Scheduling. MFCS (2) Lin Chen, Nicole Megow, Roman Rischke, Leen Stougie, José Verschae
2015	A	`conf`	Randomization Helps Computing a Minimum Spanning Tree under Uncertainty. ESA Nicole Megow, Julie Meißner, Martin Skutella
2015	—	`ch.`	Robustness and Approximation for Universal Sequencing. Gems of Combinatorial Optimization and Graph Algorithms Nicole Megow
2015	—	`conf`	Stochastic and Robust Scheduling in the Cloud. APPROX-RANDOM Lin Chen, Nicole Megow, Roman Rischke, Leen Stougie
2014	J	`jnl`	A Tight 2-Approximation for Preemptive Stochastic Scheduling. Math. Oper. Res. Nicole Megow, Tjark Vredeveld
2014	J	`jnl`	New Results on Online Resource Minimization. CoRR Lin Chen, Nicole Megow, Kevin Schewior
2014	A	`conf`	Packing a Knapsack of Unknown Capacity. STACS Yann Disser, Max Klimm, Nicole Megow, Sebastian Stiller
2014	J	`jnl`	Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width. J. Comb. Optim. Elisabeth Günther, Felix G. König, Nicole Megow
2013	A*	`conf`	A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio. SODA Elisabeth Günther, Olaf Maurer, Nicole Megow, Andreas Wiese
2013	J	`jnl`	Competitive-Ratio Approximation Schemes for Minimizing the Makespan in the Online-List Model CoRR Nicole Megow, Andreas Wiese
2013	—	`conf`	Dual Techniques for Scheduling on a Machine with Varying Speed. ICALP (1) Nicole Megow, José Verschae
2013	A	`conf`	Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints. ITCS Nicole Megow, Julián Mestre
2013	J	`jnl`	Packing a Knapsack of Unknown Capacity. CoRR Yann Disser, Max Klimm, Nicole Megow, Sebastian Stiller
2013	A	`conf`	Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks. RTSS Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Nicole Megow, Andreas Wiese
2012	J	`jnl`	A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio CoRR Elisabeth Günther, Olaf Maurer, Nicole Megow, Andreas Wiese
2012	J	`jnl`	A note on sorting buffers offline. Theor. Comput. Sci. Ho-Leung Chan, Nicole Megow, René Sitters, Rob van Stee
2012	J	`jnl`	Algorithms and complexity for periodic real-time scheduling. ACM Trans. Algorithms Vincenzo Bonifaci, Ho-Leung Chan, Alberto Marchetti-Spaccamela, Nicole Megow
2012	J	`jnl`	On Eulerian extensions and their application to no-wait flowshop scheduling. J. Sched. Wiebke Höhn, Tobias Jacobs, Nicole Megow
2012	J	`jnl`	Online graph exploration: New results on old and new algorithms. Theor. Comput. Sci. Nicole Megow, Kurt Mehlhorn, Pascal Schweitzer
2012	J	`jnl`	Scheduling Real-Time Mixed-Criticality Jobs. IEEE Trans. Computers Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Haohan Li, Alberto Marchetti-Spaccamela, Nicole Megow, Leen Stougie
2012	J	`jnl`	Scheduling on a machine with varying speed: Minimizing cost and energy via dual schedules CoRR Nicole Megow, José Verschae
2012	—	`conf`	The Power of Recourse for Online MST and TSP. ICALP (1) Nicole Megow, Martin Skutella, José Verschae, Andreas Wiese
2012	J	`jnl`	Universal Sequencing on an Unreliable Machine. SIAM J. Comput. Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julián Mestre, Martin Skutella, Leen Stougie
2011	J	`jnl`	Decision Support and Optimization in Shutdown and Turnaround Scheduling. INFORMS J. Comput. Nicole Megow, Rolf H. Möhring, Jens Schulz
2011	—	`conf`	Meeting Deadlines: How Much Speed Suffices? ICALP (1) S. Anand, Naveen Garg, Nicole Megow
2011	—	`conf`	Online Graph Exploration: New Results on Old and New Algorithms. ICALP (2) Nicole Megow, Kurt Mehlhorn, Pascal Schweitzer
2010	A*	`conf`	Algorithms and Complexity for Periodic Real-Time Scheduling. SODA Vincenzo Bonifaci, Ho-Leung Chan, Alberto Marchetti-Spaccamela, Nicole Megow
2010	B	`conf`	Scheduling Real-Time Mixed-Criticality Jobs. MFCS Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Haohan Li, Alberto Marchetti-Spaccamela, Nicole Megow, Leen Stougie
2010	J	`jnl`	The Sorting Buffer Problem is NP-hard CoRR Ho-Leung Chan, Nicole Megow, Rob van Stee, René Sitters
2010	B	`conf`	Universal Sequencing on a Single Machine. IPCO Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julián Mestre, Martin Skutella, Leen Stougie
2009	C	`conf`	Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs. CTW José R. Correa, Nicole Megow, Rajiv Raman, Karol Suchan
2009	B	`conf`	Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width. WAOA Elisabeth Günther, Felix G. König, Nicole Megow
2008	J	`jnl`	Optimizing the landside operation of a container terminal. OR Spectr. Gary Froyland, Thorsten Koch, Nicole Megow, Emily Duane, Howard Wren
2007	—	`conf`	Coping with Incomplete Information in Scheduling - Stochastic and Online Models. OR Nicole Megow
2006	A	`conf`	Approximation in Preemptive Stochastic Online Scheduling. ESA Nicole Megow, Tjark Vredeveld
2006	J	`jnl`	How to whack moles. Theor. Comput. Sci. Sandra Gutiérrez, Sven Oliver Krumke, Nicole Megow, Tjark Vredeveld
2006	J	`jnl`	Models and Algorithms for Stochastic Online Scheduling. Math. Oper. Res. Nicole Megow, Marc Uetz, Tjark Vredeveld
2005	—	`conf`	Models and Algorithms for Stochastic Online Scheduling. Algorithms for Optimization with Incomplete Information Nicole Megow, Marc Uetz, Tjark Vredeveld
2005	B	`conf`	The Online Target Date Assignment Problem. WAOA Stefan Heinz, Sven Oliver Krumke, Nicole Megow, Jörg Rambau, Andreas Tuchscherer, Tjark Vredeveld
2004	J	`jnl`	On-line scheduling to minimize average completion time revisited. Oper. Res. Lett. Nicole Megow, Andreas S. Schulz
2004	B	`conf`	Stochastic Online Scheduling on Parallel Machines. WAOA Nicole Megow, Marc Uetz, Tjark Vredeveld
2003	B	`conf`	How to Whack Moles. WAOA Sven Oliver Krumke, Nicole Megow, Tjark Vredeveld
2003	B	`conf`	Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms. WAOA Nicole Megow, Andreas S. Schulz