| 2013 | ||
|---|---|---|
| c17 | Nicole Megow, Julián Mestre: Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints. ITCS 2013: 495-504 | |
| c16 | Elisabeth Günther, Olaf Maurer, Nicole Megow, Andreas Wiese: A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio. SODA 2013: 118-128 | |
| i4 | Nicole Megow, Andreas Wiese: Competitive-Ratio Approximation Schemes for Minimizing the Makespan in the Online-List Model. CoRR abs/1303.1912 (2013) | |
| 2012 | ||
| j10 | Wiebke Höhn, Tobias Jacobs, Nicole Megow: On Eulerian extensions and their application to no-wait flowshop scheduling. J. Scheduling 15(3): 295-309 (2012) | |
| j9 | 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) | |
| j8 | Vincenzo Bonifaci, Ho-Leung Chan, Alberto Marchetti-Spaccamela, Nicole Megow: Algorithms and complexity for periodic real-time scheduling. ACM Transactions on Algorithms 9(1): 6 (2012) | |
| j7 | 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) | |
| j6 | Ho-Leung Chan, Nicole Megow, René Sitters, Rob van Stee: A note on sorting buffers offline. Theor. Comput. Sci. 423: 11-18 (2012) | |
| j5 | Nicole Megow, Kurt Mehlhorn, Pascal Schweitzer: Online graph exploration: New results on old and new algorithms. Theor. Comput. Sci. 463: 62-72 (2012) | |
| c15 | Nicole Megow, Martin Skutella, José Verschae, Andreas Wiese: The Power of Recourse for Online MST and TSP. ICALP (1) 2012: 689-700 | |
| i3 | 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) | |
| i2 | Nicole Megow, José Verschae: Scheduling on a machine with varying speed: Minimizing cost and energy via dual schedules. CoRR abs/1211.6216 (2012) | |
| 2011 | ||
| j4 | Nicole Megow, Rolf H. Möhring, Jens Schulz: Decision Support and Optimization in Shutdown and Turnaround Scheduling. INFORMS Journal on Computing 23(2): 189-204 (2011) | |
| c14 | S. Anand, Naveen Garg, Nicole Megow: Meeting Deadlines: How Much Speed Suffices? ICALP (1) 2011: 232-243 | |
| c13 | Nicole Megow, Kurt Mehlhorn, Pascal Schweitzer: Online Graph Exploration: New Results on Old and New Algorithms. ICALP (2) 2011: 478-489 | |
| 2010 | ||
| c12 | 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 | |
| c11 | 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 | |
| c10 | Vincenzo Bonifaci, Ho-Leung Chan, Alberto Marchetti-Spaccamela, Nicole Megow: Algorithms and Complexity for Periodic Real-Time Scheduling. SODA 2010: 1350-1359 | |
| i1 | Ho-Leung Chan, Nicole Megow, Rob van Stee, René Sitters: The Sorting Buffer Problem is NP-hard. CoRR abs/1009.4355 (2010) | |
| 2009 | ||
| c9 | J. Correa, Nicole Megow, Rajiv Raman, Karol Suchan: Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs. CTW 2009: 347-350 | |
| c8 | Elisabeth Günther, Felix G. König, Nicole Megow: Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width. WAOA 2009: 170-181 | |
| 2007 | ||
| c7 | 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) | |
| c6 | Nicole Megow, Tjark Vredeveld: Approximation in Preemptive Stochastic Online Scheduling. ESA 2006: 516-527 | |
| 2005 | ||
| c5 | Nicole Megow, Marc Uetz, Tjark Vredeveld: Models and Algorithms for Stochastic Online Scheduling. Algorithms for Optimization with Incomplete Information 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 | |
| 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 | ||
| c1 | Nicole Megow, Andreas S. Schulz: Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms. WAOA 2003: 227-234 | |
Data released under the ODC-BY 1.0 license — See also our legal information page