default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicole Megow
Person information
- affiliation: University of Bremen, Department for Mathematics and Computer Science, Germany
- affiliation: Technical University of Munich, Department of Mathematics, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c54]Evripidis Bampis, Konstantinos Dogeas, Thomas Erlebach, Nicole Megow, Jens Schlöter, Amitabh Trehan:
Competitive Query Minimization for Stable Matching with One-Sided Uncertainty. APPROX/RANDOM 2024: 17:1-17:21- [c53]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: 76:1-76:20 - [c52]Madison Van Dyk, Kim Klause, Jochen Könemann, Nicole Megow:
Fast Combinatorial Algorithms for Efficient Sortation. IPCO 2024: 418-432 - [c51]Étienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlöter:
Santa Claus meets Makespan and Matroids: Algorithms and Reductions. SODA 2024: 2829-2860 - [i42]Franziska Eberle, Felix Hommelsheim, Alexander Lindermayr, Zhenwei Liu, Nicole Megow, Jens Schlöter:
Accelerating Matroid Optimization through Fast Imprecise Oracles. CoRR abs/2402.02774 (2024) - [i41]Evripidis Bampis, Konstantinos Dogeas, Thomas Erlebach, Nicole Megow, Jens Schlöter, Amitabh Trehan:
Competitive Query Minimization for Stable Matching with One-Sided Uncertainty. CoRR abs/2407.10170 (2024) - 2023
- [j34]Franziska Eberle
, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon:
Speed-robust scheduling: sand, bricks, and rocks. Math. Program. 197(2): 1009-1048 (2023) - [j33]Franziska Eberle, Nicole Megow, Kevin Schewior:
Online Throughput Maximization on Unrelated Machines: Commitment is No Burden. ACM Trans. Algorithms 19(1): 10:1-10:25 (2023) - [c50]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: 700-707 - [c49]Mohit Garg, Felix Hommelsheim, Nicole Megow:
Matching Augmentation via Simultaneous Contractions. ICALP 2023: 65:1-65:17 - [c48]Alexandra Anna Lassota, Alexander Lindermayr, Nicole Megow, Jens Schlöter:
Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints. ICML 2023: 18563-18583 - [c47]Alexander Lindermayr, Nicole Megow, Martin Rapp:
Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not Necessary. ICML 2023: 21312-21334 - [c46]Thomas Erlebach, Murilo S. de Lima, Nicole Megow, Jens Schlöter:
Sorting and Hypergraph Orientation under Uncertainty with Predictions. IJCAI 2023: 5577-5585 - [c45]Franziska Eberle, Anupam Gupta, Nicole Megow, Benjamin Moseley, Rudy Zhou:
Configuration Balancing for Stochastic Requests. IPCO 2023: 127-141 - [c44]Nicole Megow, Jens Schlöter:
Set Selection Under Explorable Stochastic Uncertainty via Covering Techniques. IPCO 2023: 319-333 - [e2]Nicole Megow, Adam D. Smith:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA. LIPIcs 275, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-296-9 [contents] - [i40]Alexandra Lassota, Alexander Lindermayr, Nicole Megow, Jens Schlöter:
Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints. CoRR abs/2301.12863 (2023) - [i39]Alexander Lindermayr, Nicole Megow, Martin Rapp:
Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not Necessary. CoRR abs/2302.00985 (2023) - [i38]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 abs/2304.14295 (2023) - [i37]Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter:
Sorting and Hypergraph Orientation under Uncertainty with Predictions. CoRR abs/2305.09245 (2023) - [i36]Felix Hommelsheim, Nicole Megow, Komal Muluk, Britta Peis:
Recoverable Robust Optimization with Commitment. CoRR abs/2306.08546 (2023) - [i35]Étienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlöter:
Santa Claus meets Makespan and Matroids: Algorithms and Reductions. CoRR abs/2307.08453 (2023) - [i34]Madison Van Dyk, Kim Klause, Jochen Könemann, Nicole Megow:
Fast Combinatorial Algorithms for Efficient Sortation. CoRR abs/2311.05094 (2023) - [i33]Mario Grobler, Stephanie Maaz, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Daniel Schmand, Sebastian Siebertz:
Solution discovery via reconfiguration for problems in P. CoRR abs/2311.13478 (2023) - [i32]Nicole Megow, Benjamin Moseley, David B. Shmoys, Ola Svensson, Sergei Vassilvitskii, Jens Schlöter:
Scheduling (Dagstuhl Seminar 23061). Dagstuhl Reports 13(2): 1-19 (2023) - 2022
- [j32]Sebastian Berndt, Franziska Eberle, Nicole Megow:
Online load balancing with general reassignment cost. Oper. Res. Lett. 50(3): 322-328 (2022) - [j31]Martin Böhm, Nicole Megow, Jens Schlöter:
Throughput scheduling with equal additive laxity. Oper. Res. Lett. 50(5): 463-469 (2022) - [j30]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): 1249-1273 (2022) - [c43]Franziska Eberle, Alexander Lindermayr, Nicole Megow, Lukas Nölke, Jens Schlöter:
Robustification of Online Graph Exploration Methods. AAAI 2022: 9732-9740 - [c42]Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter:
Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty. ESA 2022: 49:1-49:18 - [c41]Alexander Lindermayr, Nicole Megow, Bertrand Simon:
Double Coverage with Machine-Learned Advice. ITCS 2022: 99:1-99:18 - [c40]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 - [c39]Alexander Lindermayr, Nicole Megow:
Permutation Predictions for Non-Clairvoyant Scheduling. SPAA 2022: 357-368 - [i31]Alexander Lindermayr, Nicole Megow:
Non-Clairvoyant Scheduling with Predictions Revisited. CoRR abs/2202.10199 (2022) - [i30]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 abs/2205.12850 (2022) - [i29]Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter:
Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty. CoRR abs/2206.15201 (2022) - [i28]Franziska Eberle, Anupam Gupta, Nicole Megow, Benjamin Moseley, Rudy Zhou:
Configuration Balancing for Stochastic Requests. CoRR abs/2208.13702 (2022) - [i27]Nicole Megow, Jens Schlöter:
Set Selection under Explorable Stochastic Uncertainty via Covering Techniques. CoRR abs/2211.01097 (2022) - [i26]Mohit Garg, Felix Hommelsheim, Nicole Megow:
Matching Augmentation via Simultaneous Contractions. CoRR abs/2211.01912 (2022) - 2021
- [j29]Lin Chen, Nicole Megow, Roman Rischke, Leen Stougie, José Verschae:
Optimal algorithms for scheduling under time-of-use tariffs. Ann. Oper. Res. 304(1): 85-107 (2021) - [j28]Evripidis Bampis, Nicole Megow:
Preface. Theory Comput. Syst. 65(6): 901-902 (2021) - [c38]Martin Böhm, Nicole Megow, Jens Schlöter:
Throughput Scheduling with Equal Additive Laxity. CIAC 2021: 130-143 - [c37]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: 10:1-10:18 - [c36]Franziska Eberle, Nicole Megow, Lukas Nölke, Bertrand Simon, Andreas Wiese:
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time. FSTTCS 2021: 18:1-18:17 - [c35]Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon:
Speed-Robust Scheduling - Sand, Bricks, and Rocks. IPCO 2021: 283-296 - [i25]Alexander Lindermayr, Nicole Megow, Bertrand Simon:
Double Coverage with Machine-Learned Advice. CoRR abs/2103.01640 (2021) - [i24]Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo S. de Lima, Nicole Megow, Jens Schlöter:
Orienting (hyper)graphs under explorable stochastic uncertainty. CoRR abs/2107.00572 (2021) - [i23]Franziska Eberle, Alexander Lindermayr, Nicole Megow, Lukas Nölke, Jens Schlöter:
Robustification of Online Graph Exploration Methods. CoRR abs/2112.05422 (2021) - 2020
- [j27]Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner:
An Adversarial Model for Scheduling with Testing. Algorithmica 82(12): 3630-3675 (2020) - [j26]Jacob Focke, Nicole Megow, Julie Meißner:
Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments. ACM J. Exp. Algorithmics 25: 1-20 (2020) - [j25]Lin Chen, Franziska Eberle, Nicole Megow, Kevin Schewior, Clifford Stein:
A general framework for handling commitment in online throughput maximization. Math. Program. 183(1): 215-247 (2020) - [c34]Nicole Megow, Lukas Nölke:
Online Minimum Cost Matching with Recourse on the Line. APPROX-RANDOM 2020: 37:1-37:16 - [c33]Franziska Eberle, Nicole Megow, Kevin Schewior:
Optimally Handling Commitment Issues in Online Throughput Maximization. ESA 2020: 41:1-41:15 - [c32]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: 2:1-2:13 - [c31]Alberto Marchetti-Spaccamela, Nicole Megow, Jens Schlöter, Martin Skutella, Leen Stougie:
On the Complexity of Conditional DAG Scheduling in Multiprocessor Systems. IPDPS 2020: 1061-1070 - [c30]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: 18:1-18:15 - [e1]Evripidis Bampis, Nicole Megow:
Approximation and Online Algorithms - 17th International Workshop, WAOA 2019, Munich, Germany, September 12-13, 2019, Revised Selected Papers. Lecture Notes in Computer Science 11926, Springer 2020, ISBN 978-3-030-39478-3 [contents] - [i22]Nicole Megow, Lukas Nölke:
Online Minimum Cost Matching on the Line with Recourse. CoRR abs/2001.03107 (2020) - [i21]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 abs/2003.05699 (2020) - [i20]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 abs/2007.08415 (2020) - [i19]Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon:
Speed-Robust Scheduling. CoRR abs/2011.05181 (2020) - [i18]Thomas Erlebach, Michael Hoffmann, Murilo S. de Lima, Nicole Megow, Jens Schlöter:
Untrusted Predictions Improve Trustable Query Policies. CoRR abs/2011.07385 (2020) - [i17]Nicole Megow, David B. Shmoys, Ola Svensson:
Scheduling (Dagstuhl Seminar 20081). Dagstuhl Reports 10(2): 50-75 (2020)
2010 – 2019
- 2019
- [j24]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): 06:1-06:3 (2019) - [j23]Franziska Eberle, Felix A. Fischer, Jannik Matuschke, Nicole Megow:
On index policies for stochastic minsum scheduling. Oper. Res. Lett. 47(3): 213-218 (2019) - [j22]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: 107-121 (2019) - [c29]Jian-Jia Chen, Tobias Hahn, Ruben Hoeksma, Nicole Megow, Georg von der Brüggen:
Scheduling Self-Suspending Tasks: New and Old Results. ECRTS 2019: 16:1-16:23 - [c28]Lin Chen, Franziska Eberle, Nicole Megow, Kevin Schewior, Cliff Stein:
A General Framework for Handling Commitment in Online Throughput Maximization. IPCO 2019: 141-154 - [i16]Bertrand Simon, Joachim Falk, Nicole Megow, Jürgen Teich:
Energy Minimization in DAG Scheduling on MPSoCs at Run-Time: Theory and Practice. CoRR abs/1912.09170 (2019) - [i15]Franziska Eberle, Nicole Megow, Kevin Schewior:
Optimally handling commitment issues in online throughput maximization. CoRR abs/1912.10769 (2019) - 2018
- [j21]Lin Chen, Nicole Megow, Kevin Schewior:
An O(log m)-Competitive Algorithm for Online Machine Minimization. SIAM J. Comput. 47(6): 2057-2077 (2018) - [j20]Nicole Megow, José Verschae:
Dual Techniques for Scheduling on a Machine with Varying Speed. SIAM J. Discret. Math. 32(3): 1541-1571 (2018) - [c27]Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner:
Scheduling with Explorable Uncertainty. ITCS 2018: 30:1-30:14 - [i14]Lin Chen, Franziska Eberle, Nicole Megow, Kevin Schewior, Cliff Stein:
A general framework for handling commitment in online throughput maximization. CoRR abs/1811.08238 (2018) - [i13]Lin Chen, Nicole Megow, Roman Rischke, Leen Stougie, José Verschae:
Optimal Algorithms for Scheduling under Time-of-Use Tariffs. CoRR abs/1811.12657 (2018) - [i12]Magnús M. Halldórsson, Nicole Megow, Clifford Stein:
Scheduling (Dagstuhl Seminar 18101). Dagstuhl Reports 8(3): 1-20 (2018) - 2017
- [j19]Nicole Megow, Julie Meißner, Martin Skutella:
Randomization Helps Computing a Minimum Spanning Tree under Uncertainty. SIAM J. Comput. 46(4): 1217-1240 (2017) - [j18]Yann Disser, Max Klimm, Nicole Megow, Sebastian Stiller:
Packing a Knapsack of Unknown Capacity. SIAM J. Discret. Math. 31(3): 1477-1497 (2017) - [c26]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: 19-30 - [c25]Jacob Focke, Nicole Megow, Julie Meißner:
Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments. SEA 2017: 22:1-22:14 - [i11]Fidaa Abed, Lin Chen, Yann Disser, Martin Groß, Nicole Megow, Julie Meißner, Alexander T. Richter, Roman Rischke:
Scheduling Maintenance Jobs in Networks. CoRR abs/1701.08809 (2017) - [i10]Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner:
Scheduling with Explorable Uncertainty. CoRR abs/1709.02592 (2017) - 2016
- [j17]Nicole Megow, Martin Skutella, José Verschae, Andreas Wiese:
The Power of Recourse for Online MST and TSP. SIAM J. Comput. 45(3): 859-880 (2016) - [j16]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): 15:1-15:34 (2016) - [j15]Nicole Megow, Mary Wootters:
Special Issue: APPROX-RANDOM 2015: Guest Editors' Foreword. Theory Comput. 12(1): 1-3 (2016) - [c24]Lin Chen, Nicole Megow, Kevin Schewior:
An O(log m)-Competitive Algorithm for Online Machine Minimization. SODA 2016: 155-163 - [c23]Lin Chen, Nicole Megow, Kevin Schewior:
The Power of Migration in Online Machine Minimization. SPAA 2016: 175-184 - [r1]Julián Mestre, Nicole Megow:
Universal Sequencing on an Unreliable Machine. Encyclopedia of Algorithms 2016: 2304-2308 - [i9]Nikhil Bansal, Nicole Megow, Clifford Stein:
Scheduling (Dagstuhl Seminar 16081). Dagstuhl Reports 6(2): 97-118 (2016) - 2015
- [j14]José R. Correa, Nicole Megow:
Clique partitioning with value-monotone submodular cost. Discret. Optim. 15: 26-36 (2015) - [c22]Lin Chen, Nicole Megow, Roman Rischke, Leen Stougie:
Stochastic and Robust Scheduling in the Cloud. APPROX-RANDOM 2015: 175-186 - [c21]Nicole Megow, Julie Meißner, Martin Skutella:
Randomization Helps Computing a Minimum Spanning Tree under Uncertainty. ESA 2015: 878-890 - [c20]Lin Chen, Nicole Megow, Roman Rischke, Leen Stougie, José Verschae:
Optimal Algorithms and a PTAS for Cost-Aware Scheduling. MFCS (2) 2015: 211-222 - [p1]Nicole Megow:
Robustness and Approximation for Universal Sequencing. Gems of Combinatorial Optimization and Graph Algorithms 2015: 133-141 - [i8]Lin Chen, Nicole Megow, Kevin Schewior:
An O(m^2 log m)-Competitive Algorithm for Online Machine Minimization. CoRR abs/1506.05721 (2015) - 2014
- [j13]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): 164-181 (2014) - [j12]Nicole Megow, Tjark Vredeveld:
A Tight 2-Approximation for Preemptive Stochastic Scheduling. Math. Oper. Res. 39(4): 1297-1310 (2014) - [c19]Yann Disser, Max Klimm, Nicole Megow, Sebastian Stiller:
Packing a Knapsack of Unknown Capacity. STACS 2014: 276-287 - [i7]Lin Chen, Nicole Megow, Kevin Schewior:
New Results on Online Resource Minimization. CoRR abs/1407.7998 (2014) - 2013
- [c18]Nicole Megow, José Verschae:
Dual Techniques for Scheduling on a Machine with Varying Speed. ICALP (1) 2013: 745-756 - [c17]Nicole Megow, Julián Mestre:
Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints. ITCS 2013: 495-504 - [c16]Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Nicole Megow, Andreas Wiese:
Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks. RTSS 2013: 236-245 - [c15]Elisabeth Günther, Olaf Maurer, Nicole Megow, Andreas Wiese:
A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio. SODA 2013: 118-128 - [i6]Nicole Megow, Andreas Wiese:
Competitive-Ratio Approximation Schemes for Minimizing the Makespan in the Online-List Model. CoRR abs/1303.1912 (2013) - [i5]Yann Disser, Max Klimm, Nicole Megow, Sebastian Stiller:
Packing a Knapsack of Unknown Capacity. CoRR abs/1307.2806 (2013) - 2012
- [j11]Wiebke Höhn, Tobias Jacobs, Nicole Megow:
On Eulerian extensions and their application to no-wait flowshop scheduling. J. Sched. 15(3): 295-309 (2012) - [j10]Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julián Mestre, Martin Skutella, Leen Stougie:
Universal Sequencing on an Unreliable Machine. SIAM J. Comput. 41(3): 565-586 (2012) - [j9]Vincenzo Bonifaci, Ho-Leung Chan, Alberto Marchetti-Spaccamela, Nicole Megow:
Algorithms and complexity for periodic real-time scheduling. ACM Trans. Algorithms 9(1): 6:1-6:19 (2012) - [j8]Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Haohan Li, Alberto Marchetti-Spaccamela, Nicole Megow, Leen Stougie:
Scheduling Real-Time Mixed-Criticality Jobs. IEEE Trans. Computers 61(8): 1140-1152 (2012) - [j7]Ho-Leung Chan, Nicole Megow, René Sitters, Rob van Stee:
A note on sorting buffers offline. Theor. Comput. Sci. 423: 11-18 (2012) - [j6]Nicole Megow, Kurt Mehlhorn, Pascal Schweitzer:
Online graph exploration: New results on old and new algorithms. Theor. Comput. Sci. 463: 62-72 (2012) - [c14]Nicole Megow, Martin Skutella, José Verschae, Andreas Wiese:
The Power of Recourse for Online MST and TSP. ICALP (1) 2012: 689-700 - [i4]Elisabeth Günther, Olaf Maurer, Nicole Megow, Andreas Wiese:
A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio. CoRR abs/1204.0897 (2012) - [i3]Nicole Megow, José Verschae:
Scheduling on a machine with varying speed: Minimizing cost and energy via dual schedules. CoRR abs/1211.6216 (2012) - 2011
- [j5]Nicole Megow, Rolf H. Möhring, Jens Schulz:
Decision Support and Optimization in Shutdown and Turnaround Scheduling. INFORMS J. Comput. 23(2): 189-204 (2011) - [c13]S. Anand, Naveen Garg, Nicole Megow:
Meeting Deadlines: How Much Speed Suffices? ICALP (1) 2011: 232-243 - [c12]Nicole Megow, Kurt Mehlhorn, Pascal Schweitzer:
Online Graph Exploration: New Results on Old and New Algorithms. ICALP (2) 2011: 478-489 - 2010
- [c11]Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julián Mestre, Martin Skutella, Leen Stougie:
Universal Sequencing on a Single Machine. IPCO 2010: 230-243 - [c10]Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Haohan Li, Alberto Marchetti-Spaccamela, Nicole Megow, Leen Stougie:
Scheduling Real-Time Mixed-Criticality Jobs. MFCS 2010: 90-101 - [c9]Vincenzo Bonifaci, Ho-Leung Chan, Alberto Marchetti-Spaccamela, Nicole Megow:
Algorithms and Complexity for Periodic Real-Time Scheduling. SODA 2010: 1350-1359 - [i2]Ho-Leung Chan, Nicole Megow, Rob van Stee, René Sitters:
The Sorting Buffer Problem is NP-hard. CoRR abs/1009.4355 (2010)
2000 – 2009
- 2009
- [c8]José R. Correa, Nicole Megow, Rajiv Raman, Karol Suchan:
Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs. CTW 2009: 347-350 - [c7]Elisabeth Günther, Felix G. König, Nicole Megow:
Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width. WAOA 2009: 170-181 - 2008
- [j4]Gary Froyland, Thorsten Koch, Nicole Megow, Emily Duane, Howard Wren:
Optimizing the landside operation of a container terminal. OR Spectr. 30(1): 53-75 (2008) - 2007
- [c6]Nicole Megow:
Coping with Incomplete Information in Scheduling - Stochastic and Online Models. OR 2007: 17-22 - 2006
- [j3]Nicole Megow, Marc Uetz, Tjark Vredeveld:
Models and Algorithms for Stochastic Online Scheduling. Math. Oper. Res. 31(3): 513-525 (2006) - [j2]Sandra Gutiérrez, Sven Oliver Krumke, Nicole Megow, Tjark Vredeveld:
How to whack moles. Theor. Comput. Sci. 361(2-3): 329-341 (2006) - [c5]Nicole Megow, Tjark Vredeveld:
Approximation in Preemptive Stochastic Online Scheduling. ESA 2006: 516-527 - 2005
- [c4]Stefan Heinz, Sven Oliver Krumke, Nicole Megow, Jörg Rambau, Andreas Tuchscherer, Tjark Vredeveld:
The Online Target Date Assignment Problem. WAOA 2005: 230-243 - [i1]Nicole Megow, Marc Uetz, Tjark Vredeveld:
Models and Algorithms for Stochastic Online Scheduling. Algorithms for Optimization with Incomplete Information 2005 - 2004
- [j1]Nicole Megow, Andreas S. Schulz:
On-line scheduling to minimize average completion time revisited. Oper. Res. Lett. 32(5): 485-490 (2004) - [c3]Nicole Megow, Marc Uetz, Tjark Vredeveld:
Stochastic Online Scheduling on Parallel Machines. WAOA 2004: 167-180 - 2003
- [c2]Sven Oliver Krumke, Nicole Megow, Tjark Vredeveld:
How to Whack Moles. WAOA 2003: 192-205 - [c1]Nicole Megow, Andreas S. Schulz:
Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms. WAOA 2003: 227-234
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-17 00:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
