 | 2012 |
| 22 |  | 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) |
| 21 |  | 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) |
| 20 |  | Ho-Leung Chan,
Nicole Megow,
René Sitters,
Rob van Stee:
A note on sorting buffers offline.
Theor. Comput. Sci. 423: 11-18 (2012) |
| 2011 |
| 19 |  | S. Anand,
Naveen Garg,
Nicole Megow:
Meeting Deadlines: How Much Speed Suffices?
ICALP (1) 2011: 232-243 |
| 18 |  | Nicole Megow,
Kurt Mehlhorn,
Pascal Schweitzer:
Online Graph Exploration: New Results on Old and New Algorithms.
ICALP (2) 2011: 478-489 |
| 17 |  | 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) |
| 2010 |
| 16 |  | 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 |
| 15 |  | 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 |
| 14 |  | Vincenzo Bonifaci,
Ho-Leung Chan,
Alberto Marchetti-Spaccamela,
Nicole Megow:
Algorithms and Complexity for Periodic Real-Time Scheduling.
SODA 2010: 1350-1359 |
| 13 |  | Ho-Leung Chan,
Nicole Megow,
Rob van Stee,
René Sitters:
The Sorting Buffer Problem is NP-hard
CoRR abs/1009.4355: (2010) |
| 2009 |
| 12 |  | J. Correa,
Nicole Megow,
Rajiv Raman,
Karol Suchan:
Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs.
CTW 2009: 347-350 |
| 11 |  | 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 |
| 10 |  | Nicole Megow:
Coping with Incomplete Information in Scheduling - Stochastic and Online Models.
OR 2007: 17-22 |
| 2006 |
| 9 |  | Nicole Megow,
Tjark Vredeveld:
Approximation in Preemptive Stochastic Online Scheduling.
ESA 2006: 516-527 |
| 8 |  | Nicole Megow,
Marc Uetz,
Tjark Vredeveld:
Models and Algorithms for Stochastic Online Scheduling.
Math. Oper. Res. 31(3): 513-525 (2006) |
| 7 |  | Sandra Gutiérrez,
Sven Oliver Krumke,
Nicole Megow,
Tjark Vredeveld:
How to whack moles.
Theor. Comput. Sci. 361(2-3): 329-341 (2006) |
| 2005 |
| 6 |  | Nicole Megow,
Marc Uetz,
Tjark Vredeveld:
Models and Algorithms for Stochastic Online Scheduling.
Algorithms for Optimization with Incomplete Information 2005 |
| 5 |  | 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 |
| 4 |  | Nicole Megow,
Marc Uetz,
Tjark Vredeveld:
Stochastic Online Scheduling on Parallel Machines.
WAOA 2004: 167-180 |
| 3 |  | Nicole Megow,
Andreas S. Schulz:
On-line scheduling to minimize average completion time revisited.
Oper. Res. Lett. 32(5): 485-490 (2004) |
| 2003 |
| 2 |  | Sven Oliver Krumke,
Nicole Megow,
Tjark Vredeveld:
How to Whack Moles.
WAOA 2003: 192-205 |
| 1 |  | Nicole Megow,
Andreas S. Schulz:
Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms.
WAOA 2003: 227-234 |